/*
 * Copyright (c) 2021-2022, Idan Horowitz <idan.horowitz@serenityos.org>
 *
 * SPDX-License-Identifier: BSD-2-Clause
 */

#include <AK/TypeCasts.h>
#include <LibJS/Runtime/AbstractOperations.h>
#include <LibJS/Runtime/WeakMapPrototype.h>

namespace JS {

GC_DEFINE_ALLOCATOR(WeakMapPrototype);

WeakMapPrototype::WeakMapPrototype(Realm& realm)
    : PrototypeObject(realm.intrinsics().object_prototype())
{
}

void WeakMapPrototype::initialize(Realm& realm)
{
    auto& vm = this->vm();
    Base::initialize(realm);
    u8 attr = Attribute::Writable | Attribute::Configurable;

    define_native_function(realm, vm.names.delete_, delete_, 1, attr);
    define_native_function(realm, vm.names.get, get, 1, attr);
    define_native_function(realm, vm.names.getOrInsert, get_or_insert, 2, attr);
    define_native_function(realm, vm.names.getOrInsertComputed, get_or_insert_computed, 2, attr);
    define_native_function(realm, vm.names.has, has, 1, attr);
    define_native_function(realm, vm.names.set, set, 2, attr);

    // 24.3.3.6 WeakMap.prototype [ @@toStringTag ], https://tc39.es/ecma262/#sec-weakmap.prototype-@@tostringtag
    define_direct_property(vm.well_known_symbol_to_string_tag(), PrimitiveString::create(vm, vm.names.WeakMap.as_string()), Attribute::Configurable);
}

// 24.3.3.2 WeakMap.prototype.delete ( key ), https://tc39.es/ecma262/#sec-weakmap.prototype.delete
JS_DEFINE_NATIVE_FUNCTION(WeakMapPrototype::delete_)
{
    auto key = vm.argument(0);

    // 1. Let M be the this value.
    // 2. Perform ? RequireInternalSlot(M, [[WeakMapData]]).
    auto weak_map = TRY(typed_this_object(vm));

    // 3. If CanBeHeldWeakly(key) is false, return false.
    if (!can_be_held_weakly(key))
        return Value(false);

    // 4. For each Record { [[Key]], [[Value]] } p of M.[[WeakMapData]], do
    //     a. If p.[[Key]] is not empty and SameValue(p.[[Key]], key) is true, then
    //         i. Set p.[[Key]] to empty.
    //         ii. Set p.[[Value]] to empty.
    //         iii. Return true.
    // 5. Return false.
    return Value(weak_map->weak_map_remove(&key.as_cell()));
}

// 24.3.3.3 WeakMap.prototype.get ( key ), https://tc39.es/ecma262/#sec-weakmap.prototype.get
JS_DEFINE_NATIVE_FUNCTION(WeakMapPrototype::get)
{
    auto key = vm.argument(0);

    // 1. Let M be the this value.
    // 2. Perform ? RequireInternalSlot(M, [[WeakMapData]]).
    auto weak_map = TRY(typed_this_object(vm));

    // 3. If CanBeHeldWeakly(key) is false, return undefined.
    if (!can_be_held_weakly(key))
        return js_undefined();

    // 4. For each Record { [[Key]], [[Value]] } p of M.[[WeakMapData]], do
    //     a. If p.[[Key]] is not empty and SameValue(p.[[Key]], key) is true, return p.[[Value]].
    if (auto result = weak_map->weak_map_get(&key.as_cell()); result.has_value())
        return *result;

    // 5. Return undefined.
    return js_undefined();
}

// 3 WeakMap.prototype.getOrInsert ( key, value ), https://tc39.es/proposal-upsert/#sec-weakmap.prototype.getOrInsert
JS_DEFINE_NATIVE_FUNCTION(WeakMapPrototype::get_or_insert)
{
    auto key = vm.argument(0);
    auto value = vm.argument(1);

    // 1. Let M be the this value.
    // 2. Perform ? RequireInternalSlot(M, [[WeakMapData]]).
    auto weak_map = TRY(typed_this_object(vm));

    // 3. If CanBeHeldWeakly(key) is false, throw a TypeError exception.
    if (!can_be_held_weakly(key))
        return vm.throw_completion<TypeError>(ErrorType::CannotBeHeldWeakly, key);

    // 4. For each Record { [[Key]], [[Value]] } p of M.[[WeakMapData]], do
    if (auto result = weak_map->weak_map_get(&key.as_cell()); result.has_value()) {
        // a. If p.[[Key]] is not empty and SameValue(p.[[Key]], key) is true, return p.[[Value]].
        return *result;
    }

    // 5. Let p be the Record { [[Key]]: key, [[Value]]: value }.
    // 6. Append p to M.[[WeakMapData]].
    weak_map->weak_map_set(&key.as_cell(), value);

    // 7. Return value.
    return value;
}

// 4 WeakMap.prototype.getOrInsertComputed ( key, callback ), https://tc39.es/proposal-upsert/#sec-weakmap.prototype.getOrInsertComputed
JS_DEFINE_NATIVE_FUNCTION(WeakMapPrototype::get_or_insert_computed)
{
    auto key = vm.argument(0);
    auto callback = vm.argument(1);

    // 1. Let M be the this value.
    // 2. Perform ? RequireInternalSlot(M, [[WeakMapData]]).
    auto weak_map = TRY(typed_this_object(vm));

    // 3. If CanBeHeldWeakly(key) is false, throw a TypeError exception.
    if (!can_be_held_weakly(key))
        return vm.throw_completion<TypeError>(ErrorType::CannotBeHeldWeakly, key);

    // 4. If IsCallable(callback) is false, throw a TypeError exception.
    if (!callback.is_function())
        return vm.throw_completion<TypeError>(ErrorType::NotAFunction, callback);

    // 5. For each Record { [[Key]], [[Value]] } p of M.[[WeakMapData]], do
    if (auto result = weak_map->weak_map_get(&key.as_cell()); result.has_value()) {
        // a. If p.[[Key]] is not empty and SameValue(p.[[Key]], key) is true, return p.[[Value]].
        return *result;
    }

    // 6. Let value be ? Call(callback, undefined, « key »).
    auto value = TRY(call(vm, callback.as_function(), js_undefined(), key));

    // 7. NOTE: The WeakMap may have been modified during execution of callback.

    // 8. For each Record { [[Key]], [[Value]] } p of M.[[WeakMapData]], do
    //     a. If p.[[Key]] is not empty and SameValue(p.[[Key]], key) is true, then
    //         i. Set p.[[Value]] to value.
    //         ii. Return value.
    // 9. Let p be the Record { [[Key]]: key, [[Value]]: value }.
    // 10. Append p to M.[[WeakMapData]].
    weak_map->weak_map_set(&key.as_cell(), value);

    // 11. Return value.
    return value;
}

// 24.3.3.4 WeakMap.prototype.has ( key ), https://tc39.es/ecma262/#sec-weakmap.prototype.has
JS_DEFINE_NATIVE_FUNCTION(WeakMapPrototype::has)
{
    auto key = vm.argument(0);

    // 1. Let M be the this value.
    // 2. Perform ? RequireInternalSlot(M, [[WeakMapData]]).
    auto weak_map = TRY(typed_this_object(vm));

    // 3. If CanBeHeldWeakly(key) is false, return false.
    if (!can_be_held_weakly(key))
        return Value(false);

    // 4. For each Record { [[Key]], [[Value]] } p of M.[[WeakMapData]], do
    //     a. If p.[[Key]] is not empty and SameValue(p.[[Key]], key) is true, return true.
    if (weak_map->weak_map_has(&key.as_cell()))
        return Value(true);

    // 5. Return false.
    return Value(false);
}

// 24.3.3.5 WeakMap.prototype.set ( key, value ), https://tc39.es/ecma262/#sec-weakmap.prototype.set
JS_DEFINE_NATIVE_FUNCTION(WeakMapPrototype::set)
{
    auto key = vm.argument(0);
    auto value = vm.argument(1);

    // 1. Let M be the this value.
    // 2. Perform ? RequireInternalSlot(M, [[WeakMapData]]).
    auto weak_map = TRY(typed_this_object(vm));

    // 3. If CanBeHeldWeakly(key) is false, throw a TypeError exception.
    if (!can_be_held_weakly(key))
        return vm.throw_completion<TypeError>(ErrorType::CannotBeHeldWeakly, key);

    // 4. For each Record { [[Key]], [[Value]] } p of M.[[WeakMapData]], do
    //    a. If p.[[Key]] is not empty and SameValue(p.[[Key]], key) is true, then
    //        i. Set p.[[Value]] to value.
    //        ii. Return M.
    // 5. Let p be the Record { [[Key]]: key, [[Value]]: value }.
    // 6. Append p to M.[[WeakMapData]].
    weak_map->weak_map_set(&key.as_cell(), value);

    // 7. Return M.
    return weak_map;
}

}