�PNG  IHDR��;���IDATx��ܻn�0���K�� �)(�pA��� ���7�LeG{�� �§㻢|��ذaÆ 6lذaÆ 6lذaÆ 6lom��$^�y���ذag�5bÆ 6lذaÆ 6lذa{���� 6lذaÆ �`����}H�Fkm�,�m����Ӫ���ô�ô!� �x�|'ܢ˟;�E:���9�&ᶒ�}�{�v]�n&�6� �h��_��t�ڠ͵-ҫ���Z;��Z$�.�P���k�ž)�!��o���>}l�eQfJ�T��u і���چ��\��X=8��Rن4`Vw�l�>����n�G�^��i�s��"ms�$�u��i��?w�bs[m�6�K4���O���.�4��%����/����b�C%��t ��M�ז� �-l�G6�mrz2���s�%�9��s@���-�k�9�=���)������k�B5����\��+͂�Zsٲ ��Rn��~G���R���C����� �wIcI��n7jJ���hۛNCS|���j0��8y�iHKֶۛ�k�Ɉ+;Sz������L/��F�*\��Ԕ�#"5��m�2��[S��������=�g��n�a�P�e�ғ�L�� lذaÆ 6l�^k��̱aÆ 6lذaÆ 6lذa;���� �_��ذaÆ 6lذaÆ 6lذaÆ ���R���IEND�B` /** * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. */ import type { QueueChildMessage, TaskQueue } from './types'; export declare type ComputeTaskPriorityCallback = (method: string, ...args: Array) => number; declare type QueueItem = { task: QueueChildMessage; priority: number; }; /** * Priority queue that processes tasks in natural ordering (lower priority first) * accoridng to the priority computed by the function passed in the constructor. * * FIFO ordering isn't guaranteed for tasks with the same priority. * * Worker specific tasks with the same priority as a non-worker specific task * are always processed first. */ export default class PriorityQueue implements TaskQueue { private _computePriority; private _queue; private _sharedQueue; constructor(_computePriority: ComputeTaskPriorityCallback); enqueue(task: QueueChildMessage, workerId?: number): void; _enqueue(task: QueueChildMessage, queue: MinHeap): void; dequeue(workerId: number): QueueChildMessage | null; _getWorkerQueue(workerId: number): MinHeap; } declare type HeapItem = { priority: number; }; declare class MinHeap { private _heap; peek(): TItem | null; add(item: TItem): void; poll(): TItem | null; } export {};