/*
 * Copyright (C) 2015 Canon Inc.
 * Copyright (C) 2015 Igalia.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL APPLE INC. OR
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

// @internal

export function markPromiseAsHandled(promise: Promise<unknown>) {
  $assert($isPromise(promise));
  $putPromiseInternalField(
    promise,
    $promiseFieldFlags,
    $getPromiseInternalField(promise, $promiseFieldFlags) | $promiseFlagsIsHandled,
  );
}

export function shieldingPromiseResolve(result) {
  const promise = Promise.$resolve(result);
  if (promise.$then === undefined) promise.$then = Promise.prototype.$then;
  return promise;
}

export function promiseInvokeOrNoopMethodNoCatch(object, method, args) {
  if (method === undefined) return Promise.$resolve();
  return $shieldingPromiseResolve(method.$apply(object, args));
}

export function promiseInvokeOrNoopNoCatch(object, key, args) {
  return $promiseInvokeOrNoopMethodNoCatch(object, object[key], args);
}

export function promiseInvokeOrNoopMethod(object, method, args) {
  try {
    return $promiseInvokeOrNoopMethodNoCatch(object, method, args);
  } catch (error) {
    return Promise.$reject(error);
  }
}

export function promiseInvokeOrNoop(object, key, args) {
  try {
    return $promiseInvokeOrNoopNoCatch(object, key, args);
  } catch (error) {
    return Promise.$reject(error);
  }
}

export function promiseInvokeOrFallbackOrNoop(object, key1, args1, key2, args2) {
  try {
    const method = object[key1];
    if (method === undefined) return $promiseInvokeOrNoopNoCatch(object, key2, args2);
    return $shieldingPromiseResolve(method.$apply(object, args1));
  } catch (error) {
    return Promise.$reject(error);
  }
}

export function validateAndNormalizeQueuingStrategy(size, highWaterMark) {
  if (size !== undefined && typeof size !== "function") throw new TypeError("size parameter must be a function");

  const newHighWaterMark = $toNumber(highWaterMark);

  if (isNaN(newHighWaterMark) || newHighWaterMark < 0)
    throw new RangeError("highWaterMark value is negative or not a number");

  return { size: size, highWaterMark: newHighWaterMark };
}

$linkTimeConstant;
export function createFIFO() {
  var slice = Array.prototype.slice;

  class Denqueue {
    constructor() {
      this._head = 0;
      this._tail = 0;
      // this._capacity = 0;
      this._capacityMask = 0x3;
      this._list = $newArrayWithSize(4);
    }

    _head;
    _tail;
    _capacityMask;
    _list;

    size() {
      if (this._head === this._tail) return 0;
      if (this._head < this._tail) return this._tail - this._head;
      else return this._capacityMask + 1 - (this._head - this._tail);
    }

    isEmpty() {
      return this.size() == 0;
    }

    isNotEmpty() {
      return this.size() > 0;
    }

    shift() {
      var { _head: head, _tail, _list, _capacityMask } = this;
      if (head === _tail) return undefined;
      var item = _list[head];
      $putByValDirect(_list, head, undefined);
      head = this._head = (head + 1) & _capacityMask;
      if (head < 2 && _tail > 10000 && _tail <= _list.length >>> 2) this._shrinkArray();
      return item;
    }

    peek() {
      if (this._head === this._tail) return undefined;
      return this._list[this._head];
    }

    push(item) {
      var tail = this._tail;
      $putByValDirect(this._list, tail, item);
      this._tail = (tail + 1) & this._capacityMask;
      if (this._tail === this._head) {
        this._growArray();
      }
      // if (this._capacity && this.size() > this._capacity) {
      // this.shift();
      // }
    }

    toArray(fullCopy) {
      var list = this._list;
      var len = $toLength(list.length);

      if (fullCopy || this._head > this._tail) {
        var _head = $toLength(this._head);
        var _tail = $toLength(this._tail);
        var total = $toLength(len - _head + _tail);
        var array = $newArrayWithSize(total);
        var j = 0;
        for (var i = _head; i < len; i++) $putByValDirect(array, j++, list[i]);
        for (var i = 0; i < _tail; i++) $putByValDirect(array, j++, list[i]);
        return array;
      } else {
        return slice.$call(list, this._head, this._tail);
      }
    }

    clear() {
      this._head = 0;
      this._tail = 0;
      this._list.fill(undefined);
    }

    _growArray() {
      if (this._head) {
        // copy existing data, head to end, then beginning to tail.
        this._list = this.toArray(true);
        this._head = 0;
      }

      // head is at 0 and array is now full, safe to extend
      this._tail = $toLength(this._list.length);

      this._list.length <<= 1;
      this._capacityMask = (this._capacityMask << 1) | 1;
    }

    _shrinkArray() {
      this._list.length >>>= 1;
      this._capacityMask >>>= 1;
    }
  }

  return new Denqueue();
}

export function newQueue() {
  return { content: $createFIFO(), size: 0 };
}

export function dequeueValue(queue) {
  const record = queue.content.shift();
  queue.size -= record.size;
  // As described by spec, below case may occur due to rounding errors.
  if (queue.size < 0) queue.size = 0;
  return record.value;
}

export function enqueueValueWithSize(queue, value, size) {
  size = $toNumber(size);
  if (!isFinite(size) || size < 0) throw new RangeError("size has an incorrect value");

  queue.content.push({ value, size });
  queue.size += size;
}

export function peekQueueValue(queue) {
  return queue.content.peek()?.value;
}

export function resetQueue(queue) {
  $assert("content" in queue);
  $assert("size" in queue);
  queue.content.clear();
  queue.size = 0;
}

export function extractSizeAlgorithm(strategy) {
  const sizeAlgorithm = strategy.size;

  if (sizeAlgorithm === undefined) return () => 1;

  if (typeof sizeAlgorithm !== "function") throw new TypeError("strategy.size must be a function");

  return chunk => {
    return sizeAlgorithm(chunk);
  };
}

export function extractHighWaterMark(strategy, defaultHWM) {
  const highWaterMark = strategy.highWaterMark;

  if (highWaterMark === undefined) return defaultHWM;

  if (isNaN(highWaterMark) || highWaterMark < 0)
    throw new RangeError("highWaterMark value is negative or not a number");

  return $toNumber(highWaterMark);
}

export function extractHighWaterMarkFromQueuingStrategyInit(init: { highWaterMark?: number }) {
  if (!$isObject(init)) throw new TypeError("QueuingStrategyInit argument must be an object.");
  const { highWaterMark } = init;
  if (highWaterMark === undefined) throw new TypeError("QueuingStrategyInit.highWaterMark member is required.");

  return $toNumber(highWaterMark);
}

export function createFulfilledPromise(value) {
  const promise = $newPromise();
  $fulfillPromise(promise, value);
  return promise;
}

export function toDictionary(value, defaultValue, errorMessage) {
  if (value === undefined || value === null) return defaultValue;
  if (!$isObject(value)) throw new TypeError(errorMessage);
  return value;
}