Home
last modified time | relevance | path

Searched refs:Queue (Results 1 – 25 of 81) sorted by relevance

1234

/ohos5.0/docs/zh-cn/application-dev/reference/apis-arkts/
H A Djs-apis-queue.md1 # @ohos.util.Queue (线性容器Queue)
5 Queue和[Deque](js-apis-deque.md)相比，Queue只能在一端删除一端增加，Deque可以两端增删。
24 ## Queue section
41 Queue的构造函数。
58 let queue : Queue<number | string | Object> = new Queue();
99 let queue : Queue<number | string | C1 | number[]> = new Queue();
135 let queue : Queue<number> = new Queue();
171 let queue : Queue<number> = new Queue();
203 | Queue | Queue&lt;T&gt; | 否 | 当前调用forEach方法的实例对象，默认值为当前实例对象。 |
217 let queue : Queue<number> = new Queue();
[all …]
/ohos5.0/foundation/communication/bluetooth_service/services/bluetooth/stack/platform/include/
H A Dqueue.h26 typedef struct Queue Queue; typedef
36 Queue *QueueCreate(uint32_t capacity);
45 void QueueDelete(Queue *queue, NodeDataFreeCb cb);
54 void QueueEnqueue(Queue *queue, void *data);
64 bool QueueTryEnqueue(Queue *queue, void *data);
72 void *QueueDequeue(Queue *queue);
81 void *QueueTryDequeue(Queue *queue);
90 int32_t QueueGetEnqueueFd(const Queue *queue);
99 int32_t QueueGetDequeueFd(const Queue *queue);
117 bool QueueIsEmpty(Queue *queue);
[all …]
/ohos5.0/commonlibrary/ets_utils/js_util_module/container/queue/
H A Djs_queue.ts16 Queue: number;
29 fastQueue = arkPritvate.Load(arkPritvate.Queue);
43 get(obj: Queue<T>, prop: string): T {
50 set(obj: Queue<T>, prop: any, value: T): boolean {
63 ownKeys(obj: Queue<T>): Array<string> {
91 class Queue<T> {
106 errorUtil.checkBindError('add', Queue, this);
122 errorUtil.checkBindError('pop', Queue, this);
133 errorUtil.checkBindError('forEach', Queue, this);
177 Object.freeze(Queue);
[all …]
/ohos5.0/foundation/communication/bluetooth_service/services/bluetooth/stack/platform/src/
H A Dqueue.c24 typedef struct Queue { struct
32 Queue *QueueCreate(uint32_t capacity) in QueueCreate() argument
38 Queue *queue = (Queue *)calloc(1, (sizeof(Queue))); in QueueCreate()
92 void QueueEnqueue(Queue *queue, void *data) in QueueEnqueue()
105 bool QueueTryEnqueue(Queue *queue, void *data) in QueueTryEnqueue()
123 void *QueueDequeue(Queue *queue) in QueueDequeue()
141 void *QueueTryDequeue(Queue *queue) in QueueTryDequeue()
162 int32_t QueueGetEnqueueFd(const Queue *queue) in QueueGetEnqueueFd()
168 int32_t QueueGetDequeueFd(const Queue *queue) in QueueGetDequeueFd()
186 bool QueueIsEmpty(Queue* queue) in QueueIsEmpty()
[all …]
/ohos5.0/docs/en/application-dev/reference/apis-arkts/
H A Djs-apis-queue.md1 # @ohos.util.Queue (Linear Container Queue)
20 import { Queue } from '@kit.ArkTS';
24 ## Queue section
58 let queue : Queue<number | string | Object> = new Queue();
99 let queue : Queue<number | string | C1 | number[]> = new Queue();
135 let queue : Queue<number> = new Queue();
171 let queue : Queue<number> = new Queue();
181 forEach(callbackFn: (value: T, index?: number, Queue?: Queue&lt;T&gt;) => void,
203 | Queue | Queue&lt;T&gt; | No| Instance that calls the **forEach** API. The default value is this i…
217 let queue : Queue<number> = new Queue();
[all …]
/ohos5.0/foundation/ai/ai_engine/services/common/platform/queuepool/
H A Dqueue.inl19 Queue<TYPE>::Queue(size_t maxQueueSize) function in OHOS::AI::Queue
26 Queue<TYPE>::~Queue() {
31 bool Queue<TYPE>::IsEmpty() const {
36 bool Queue<TYPE>::IsFull() const {
41 int Queue<TYPE>::PushBack(TYPE &msgBlock) {
56 int Queue<TYPE>::PopFront(TYPE &msgBlock) {
78 size_t Queue<TYPE>::Count() const {
83 void Queue<TYPE>::Reset() {
H A Dqueue.h27 class Queue {
28 FORBID_COPY_AND_ASSIGN(Queue);
30 explicit Queue(size_t maxQueueSize);
32 virtual ~Queue();
H A Dqueue_pool.inl56 std::shared_ptr<Queue<TYPE>> QueuePool<TYPE>::Pop() {
57 std::shared_ptr <Queue<TYPE>> queue = nullptr;
66 Queue<TYPE> *ptr = nullptr;
67 AIE_NEW(ptr, Queue<TYPE>(singleQueueCapacity_));
82 void QueuePool<TYPE>::Push(std::shared_ptr<Queue<TYPE>> &queue) {
H A Dqueue_pool.h36 typedef std::list<std::shared_ptr<Queue<TYPE>>> Queues;
56 std::shared_ptr<Queue<TYPE>> Pop();
63 void Push(std::shared_ptr<Queue<TYPE>> &queue);
/ohos5.0/foundation/ai/ai_engine/test/common/queuepool/
H A Dqueuepool_test.cpp70 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
102 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
120 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
156 std::shared_ptr<Queue<int>> queue;
179 std::shared_ptr<Queue<int>> queue;
197 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
215 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
236 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
257 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
274 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
[all …]
/ohos5.0/docs/zh-cn/application-dev/arkts-utils/
H A Dlinear-container.md17 | Queue | 队列，从容器尾部插入元素，从容器头部弹出元素，占用一片连续的内存空间。一般符合先进先出的场景可以使用。 |
103 Deque和[Queue](../reference/apis-arkts/js-apis-queue.md)相比，Deque允许在两端执行增删元素的操作，Queue只能在头部删除元素，尾部增加元素。
125 ## Queue section
129 Queue依据泛型定义，要求存储位置是一片连续的内存空间，初始容量大小为8，并支持动态扩容，每次扩容大小为原始容量的2倍。
131 Queue底层采用循环队列实现，入队及出队操作效率都比较高。
133 Queue和[Deque](../reference/apis-arkts/js-apis-deque.md)相比，Queue只能在一端删除一端增加，Deque可以两端增删。
135 一般符合先进先出的场景可以使用Queue。
137 Queue进行增、删、改、查操作的常用API如下：
144 …callbackFn: (value: T, index?: number, queue?: Queue&lt;T&gt;) =&gt; void,thisArg?: Object) | 遍历访问…
146 …allbackFn: (value: T, index?: number, queue?: Queue&lt;T&gt;) =&gt; void,thisArg?: Object) | 通过遍历修…
[all …]
H A Dmulti-thread-concurrency-overview.md33 class Queue {
60 queue: Queue = new Queue()
/ohos5.0/commonlibrary/rust/ylong_runtime/ylong_runtime/src/sync/mpsc/unbounded/
H A Dmod.rs22 use crate::sync::mpsc::unbounded::queue::Queue;
50 channel: Tx<Queue<T>>,
80 channel: Rx<Queue<T>>,
99 let queue = Queue::new(); in unbounded_channel()
105 fn new(channel: Tx<Queue<T>>) -> UnboundedSender<T> { in new()
197 fn new(channel: Rx<Queue<T>>) -> UnboundedReceiver<T> { in new()
H A Dqueue.rs99 pub(crate) struct Queue<T> { struct
105 unsafe impl<T: Send> Send for Queue<T> {} argument
106 unsafe impl<T: Send> Sync for Queue<T> {} implementation
108 impl<T> Queue<T> { impl
109 pub(crate) fn new() -> Queue<T> { in new()
112 Queue { in new()
236 impl<T> Container for Queue<T> { implementation
258 impl<T> Drop for Queue<T> { implementation
/ohos5.0/foundation/communication/bluetooth_service/services/bluetooth/stack/src/btm/
H A Dbtm_thread.c36 Queue *queue;
61 BtmTask *task = QueueTryDequeue((Queue *)context); in RunTask()
84 Queue *queue;
106 static void RunAllTaskInQueue(Queue *queue) in RunAllTaskInQueue()
207 Queue *taskQueue = NULL; in BTM_DeleteProcessingQueue()
/ohos5.0/docs/zh-cn/device-dev/kernel/
H A Dkernel-small-debug-shell-cmd-sysinfo.md39 Queue 13 1024 YES
53 | Queue | 队列。 |
/ohos5.0/foundation/ai/ai_engine/services/server/server_executor/include/
H A Dengine_worker.h33 explicit EngineWorker(Queue<Task> &queue);
56 Queue<Task> &queue_;
H A Dasync_msg_handler.h32 AsyncMsgHandler(Queue<Task> &queue, IPlugin *pluginAlgorithm);
68 Queue<Task> &queue_;
H A Dsync_msg_handler.h33 SyncMsgHandler(Queue<Task> &queue, IPlugin *pluginAlgorithm);
72 Queue<Task> &queue_;
H A Dengine.h37 …Engine(std::shared_ptr<Plugin> &plugin, std::shared_ptr<Thread> &thread, std::shared_ptr<Queue<Tas…
90 std::shared_ptr<Queue<Task>> queue_;
/ohos5.0/foundation/ai/ai_engine/services/server/server_executor/source/
H A Dengine_worker.cpp28 EngineWorker::EngineWorker(Queue<Task> &queue) : queue_(queue) in EngineWorker()
32 static void ClearQueue(Queue<Task> &queue) in ClearQueue()
/ohos5.0/docs/en/device-dev/kernel/
H A Dkernel-small-debug-shell-cmd-sysinfo.md39 Queue 13 1024 YES
53 | Queue | Using queues. |
/ohos5.0/docs/zh-cn/release-notes/api-diff/v3.1-Release/
H A Djs-apidiff-compiler-and-runtime.md125 | ohos.util.Queue | Queue | \[Symbol.iterator](): IterableIterator\<T>; | 新增 |
126 | ohos.util.Queue | Queue | forEach(callbackfn: (value: T, index?: number, Queue?: Queue\<T>) => vo…
127 | ohos.util.Queue | Queue | pop(): T; | 新增 |
128 | ohos.util.Queue | Queue | getFirst(): T; | 新增 |
129 | ohos.util.Queue | Queue | add(element: T): boolean; | 新增 |
130 | ohos.util.Queue | Queue | length: number; | 新增 |
131 | ohos.util.Queue | Queue | constructor(); | 新增 |
/ohos5.0/docs/en/application-dev/arkts-utils/
H A Dlinear-container.md17 …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&lt;T&gt;) =&gt; void,thisArg?:…
[all …]
/ohos5.0/docs/en/release-notes/api-diff/v3.1-Release/
H A Djs-apidiff-compiler-and-runtime.md125 | ohos.util.Queue | Queue | \[Symbol.iterator](): IterableIterator\<T>; | Added|
126 | ohos.util.Queue | Queue | forEach(callbackfn: (value: T, index?: number, Queue?: Queue\<T>) => vo…
127 | ohos.util.Queue | Queue | pop(): T; | Added|
128 | ohos.util.Queue | Queue | getFirst(): T; | Added|
129 | ohos.util.Queue | Queue | add(element: T): boolean; | Added|
130 | ohos.util.Queue | Queue | length: number; | Added|
131 | ohos.util.Queue | Queue | constructor(); | Added|

1234