Lines Matching refs:Queue

4 …ntainers: **ArrayList**, **Vector**, **List**, **LinkedList**, **Deque**, **Queue**, and **Stack**.
17 …Queue | A queue is used to insert elements from the tail of a container and pop elements from the …
103 Compared with [Queue](../reference/apis-arkts/js-apis-queue.md), Deque allows you to add or delete …
125 ## Queue  section
127 [Queue](../reference/apis-arkts/js-apis-queue.md) can be used to construct a queue that follows the…
129 **Queue** uses generics and must be stored in a contiguous memory space. Its initial capacity is 8,…
131 The bottom layer of **Queue** is implemented by cyclic queues, delivering a high efficiency in enqu…
133 …-apis-deque.md), which supports insertion and removal at both the ends, **Queue** supports inserti…
135 You are advised to use **Queue** in FIFO scenarios.
137 **Queue** provides the following CRUD APIs.
144 | Read| forEach(callbackFn: (value: T, index?: number, queue?: Queue<T>) => void,thisArg?:…
146 | Update| forEach(callbackFn: (value: T, index?: number, queue?: Queue<T>) => void,thisArg…
155 Unlike [Queue](../reference/apis-arkts/js-apis-queue.md), which supports insertion at one end and r…