Home
last modified time | relevance | path

Searched refs:Queue (Results 251 – 275 of 23870) sorted by relevance

1...<<11121314151617181920>>...955

/dports/lang/fpc-source/fpc-3.2.2/packages/rtl-generics/tests/
H A Dtests.generics.queue.pas132 Queue.Dequeue;
138 Queue.OwnsObjects:=False;
141 Queue.DeQueue;
193 aOffset:=Queue.Count;
195 Queue.EnQueue(IntToStr(i));
211 Queue.Clear;
224 A:=Queue.DeQueue;
314 Queue.Enqueue('A new 2');
340 A:=Queue.ToArray;
360 For A in Queue do
[all …]
/dports/lang/fpc-rtl-generics/fpc-3.2.2/packages/rtl-generics/tests/
H A Dtests.generics.queue.pas132 Queue.Dequeue;
138 Queue.OwnsObjects:=False;
141 Queue.DeQueue;
193 aOffset:=Queue.Count;
195 Queue.EnQueue(IntToStr(i));
211 Queue.Clear;
224 A:=Queue.DeQueue;
314 Queue.Enqueue('A new 2');
340 A:=Queue.ToArray;
360 For A in Queue do
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/lib/Support/
H A DOptimizedStructLayout.cpp278 LastQueueAlignment = Queue.Alignment; in performOptimizedStructLayout()
281 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
283 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
295 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
306 Queue->MinSize = Last->Size; in performOptimizedStructLayout()
310 if (auto NewHead = Queue->getNext(Cur)) in performOptimizedStructLayout()
311 Queue->Head = NewHead; in performOptimizedStructLayout()
315 FlexibleFieldsByAlignment.erase(Queue); in performOptimizedStructLayout()
334 spliceFromQueue(Queue, Last, Cur); in performOptimizedStructLayout()
351 assert(Queue->Head); in performOptimizedStructLayout()
[all …]
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/lib/Support/
H A DOptimizedStructLayout.cpp278 LastQueueAlignment = Queue.Alignment; in performOptimizedStructLayout()
281 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
283 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
295 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
306 Queue->MinSize = Last->Size; in performOptimizedStructLayout()
310 if (auto NewHead = Queue->getNext(Cur)) in performOptimizedStructLayout()
311 Queue->Head = NewHead; in performOptimizedStructLayout()
315 FlexibleFieldsByAlignment.erase(Queue); in performOptimizedStructLayout()
334 spliceFromQueue(Queue, Last, Cur); in performOptimizedStructLayout()
351 assert(Queue->Head); in performOptimizedStructLayout()
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/lib/Support/
H A DOptimizedStructLayout.cpp278 LastQueueAlignment = Queue.Alignment; in performOptimizedStructLayout()
281 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
283 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
295 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
306 Queue->MinSize = Last->Size; in performOptimizedStructLayout()
310 if (auto NewHead = Queue->getNext(Cur)) in performOptimizedStructLayout()
311 Queue->Head = NewHead; in performOptimizedStructLayout()
315 FlexibleFieldsByAlignment.erase(Queue); in performOptimizedStructLayout()
334 spliceFromQueue(Queue, Last, Cur); in performOptimizedStructLayout()
351 assert(Queue->Head); in performOptimizedStructLayout()
[all …]
/dports/graphics/llvm-mesa/llvm-13.0.1.src/lib/Support/
H A DOptimizedStructLayout.cpp278 LastQueueAlignment = Queue.Alignment; in performOptimizedStructLayout()
281 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
283 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
295 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
306 Queue->MinSize = Last->Size; in performOptimizedStructLayout()
310 if (auto NewHead = Queue->getNext(Cur)) in performOptimizedStructLayout()
311 Queue->Head = NewHead; in performOptimizedStructLayout()
315 FlexibleFieldsByAlignment.erase(Queue); in performOptimizedStructLayout()
334 spliceFromQueue(Queue, Last, Cur); in performOptimizedStructLayout()
351 assert(Queue->Head); in performOptimizedStructLayout()
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/lib/Support/
H A DOptimizedStructLayout.cpp278 LastQueueAlignment = Queue.Alignment; in performOptimizedStructLayout()
281 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
283 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
295 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
306 Queue->MinSize = Last->Size; in performOptimizedStructLayout()
310 if (auto NewHead = Queue->getNext(Cur)) in performOptimizedStructLayout()
311 Queue->Head = NewHead; in performOptimizedStructLayout()
315 FlexibleFieldsByAlignment.erase(Queue); in performOptimizedStructLayout()
334 spliceFromQueue(Queue, Last, Cur); in performOptimizedStructLayout()
351 assert(Queue->Head); in performOptimizedStructLayout()
[all …]
/dports/devel/llvm11/llvm-11.0.1.src/lib/Support/
H A DOptimizedStructLayout.cpp278 LastQueueAlignment = Queue.Alignment; in performOptimizedStructLayout()
281 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
283 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
295 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
306 Queue->MinSize = Last->Size; in performOptimizedStructLayout()
310 if (auto NewHead = Queue->getNext(Cur)) in performOptimizedStructLayout()
311 Queue->Head = NewHead; in performOptimizedStructLayout()
315 FlexibleFieldsByAlignment.erase(Queue); in performOptimizedStructLayout()
334 spliceFromQueue(Queue, Last, Cur); in performOptimizedStructLayout()
351 assert(Queue->Head); in performOptimizedStructLayout()
[all …]
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/lib/Support/
H A DOptimizedStructLayout.cpp278 LastQueueAlignment = Queue.Alignment; in performOptimizedStructLayout()
281 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
283 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
295 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
306 Queue->MinSize = Last->Size; in performOptimizedStructLayout()
310 if (auto NewHead = Queue->getNext(Cur)) in performOptimizedStructLayout()
311 Queue->Head = NewHead; in performOptimizedStructLayout()
315 FlexibleFieldsByAlignment.erase(Queue); in performOptimizedStructLayout()
334 spliceFromQueue(Queue, Last, Cur); in performOptimizedStructLayout()
351 assert(Queue->Head); in performOptimizedStructLayout()
[all …]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/lib/Support/
H A DOptimizedStructLayout.cpp278 LastQueueAlignment = Queue.Alignment; in performOptimizedStructLayout()
281 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
283 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
295 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
306 Queue->MinSize = Last->Size; in performOptimizedStructLayout()
310 if (auto NewHead = Queue->getNext(Cur)) in performOptimizedStructLayout()
311 Queue->Head = NewHead; in performOptimizedStructLayout()
315 FlexibleFieldsByAlignment.erase(Queue); in performOptimizedStructLayout()
334 spliceFromQueue(Queue, Last, Cur); in performOptimizedStructLayout()
351 assert(Queue->Head); in performOptimizedStructLayout()
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/lib/Support/
H A DOptimizedStructLayout.cpp278 LastQueueAlignment = Queue.Alignment; in performOptimizedStructLayout()
281 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
283 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
295 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
306 Queue->MinSize = Last->Size; in performOptimizedStructLayout()
310 if (auto NewHead = Queue->getNext(Cur)) in performOptimizedStructLayout()
311 Queue->Head = NewHead; in performOptimizedStructLayout()
315 FlexibleFieldsByAlignment.erase(Queue); in performOptimizedStructLayout()
334 spliceFromQueue(Queue, Last, Cur); in performOptimizedStructLayout()
351 assert(Queue->Head); in performOptimizedStructLayout()
[all …]
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/lib/Support/
H A DOptimizedStructLayout.cpp278 LastQueueAlignment = Queue.Alignment; in performOptimizedStructLayout()
281 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
283 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
295 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
306 Queue->MinSize = Last->Size; in performOptimizedStructLayout()
310 if (auto NewHead = Queue->getNext(Cur)) in performOptimizedStructLayout()
311 Queue->Head = NewHead; in performOptimizedStructLayout()
315 FlexibleFieldsByAlignment.erase(Queue); in performOptimizedStructLayout()
334 spliceFromQueue(Queue, Last, Cur); in performOptimizedStructLayout()
351 assert(Queue->Head); in performOptimizedStructLayout()
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/lib/Support/
H A DOptimizedStructLayout.cpp278 LastQueueAlignment = Queue.Alignment; in performOptimizedStructLayout()
281 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
283 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
295 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
306 Queue->MinSize = Last->Size; in performOptimizedStructLayout()
310 if (auto NewHead = Queue->getNext(Cur)) in performOptimizedStructLayout()
311 Queue->Head = NewHead; in performOptimizedStructLayout()
315 FlexibleFieldsByAlignment.erase(Queue); in performOptimizedStructLayout()
334 spliceFromQueue(Queue, Last, Cur); in performOptimizedStructLayout()
351 assert(Queue->Head); in performOptimizedStructLayout()
[all …]
/dports/math/eprover/eprover-E-2.0/BASICS/
H A Dclb_pqueue.h68 #define PQueueGetNextInt(Queue) (PQueueGetNext(Queue).i_val) argument
69 #define PQueueGetNextP(Queue) (PQueueGetNext(Queue).p_val) argument
72 #define PQueueGetLastInt(Queue) (PQueueGetLast(Queue).i_val) argument
73 #define PQueueGetLastP(Queue) (PQueueGetLast(Queue).p_val) argument
76 #define PQueueLookInt(Queue) (PQueueLook(Queue).i_val) argument
77 #define PQueueLookP(Queue) (PQueueLook(Queue).p_val) argument
79 #define PQueueLookLastInt(Queue) (PQueueLookLast(Queue).i_val) argument
80 #define PQueueLookLastP(Queue) (PQueueLookLast(Queue).p_val) argument
84 #define PQueueElementInt(Queue, index) (PQueueElement(Queue,index).i_val) argument
85 #define PQueueElementP(Queue, index) (PQueueElement(Queue,index).p_val) argument
/dports/devel/pecl-ds/ds-1.3.0/src/php/classes/
H A Dphp_queue_ce.c13 #define METHOD(name) PHP_METHOD(Queue, name)
128 PHP_DS_ME(Queue, __construct) in php_ds_register_queue()
129 PHP_DS_ME(Queue, allocate) in php_ds_register_queue()
130 PHP_DS_ME(Queue, capacity) in php_ds_register_queue()
131 PHP_DS_ME(Queue, peek) in php_ds_register_queue()
132 PHP_DS_ME(Queue, pop) in php_ds_register_queue()
133 PHP_DS_ME(Queue, push) in php_ds_register_queue()
134 PHP_DS_ME(Queue, getIterator) in php_ds_register_queue()
137 PHP_DS_ME(Queue, offsetGet) in php_ds_register_queue()
138 PHP_DS_ME(Queue, offsetSet) in php_ds_register_queue()
[all …]
/dports/net/drawterm/drawterm/kern/
H A Dfns.h250 int qcanread(Queue*);
251 void qclose(Queue*);
255 void qflush(Queue*);
256 void qfree(Queue*);
257 int qfull(Queue*);
258 Block* qget(Queue*);
260 int qisclosed(Queue*);
263 int qlen(Queue*);
271 Block* qremove(Queue*);
272 void qreopen(Queue*);
[all …]
/dports/lang/cython-devel/cython-2b1e743/docs/examples/tutorial/clibraries/
H A Dcqueue.pxd2 ctypedef struct Queue:
6 Queue* queue_new()
7 void queue_free(Queue* queue)
9 int queue_push_head(Queue* queue, QueueValue data)
10 QueueValue queue_pop_head(Queue* queue)
11 QueueValue queue_peek_head(Queue* queue)
13 int queue_push_tail(Queue* queue, QueueValue data)
14 QueueValue queue_pop_tail(Queue* queue)
15 QueueValue queue_peek_tail(Queue* queue)
17 bint queue_is_empty(Queue* queue)
/dports/net/py-kombu/kombu-4.6.11/t/unit/
H A Dtest_entity.py228 queue = Queue(name='queue_name')
232 assert hash(Queue('a')) == hash(Queue('a'))
233 assert hash(Queue('a')) != hash(Queue('b'))
279 q = Queue('a')
284 q = Queue('a')
294 q = Queue('a', no_declare=True)
305 q = Queue('a')
311 q = Queue('a')(chan)
317 q = Queue('mul', [
336 assert not Queue(
[all …]
/dports/devel/boost-docs/boost_1_72_0/boost/thread/concurrent_queues/
H A Dqueue_adaptor.hpp28 template <typename Queue>
30 public boost::queue_base<typename Queue::value_type, typename Queue::size_type>
32 Queue queue;
64 template <typename Queue>
66 public boost::queue_base<typename Queue::value_type, typename Queue::size_type>
68 Queue queue;
103 template <typename Queue>
105 public boost::queue_base<typename Queue::value_type, typename Queue::size_type>
107 Queue queue;
192 template <typename Queue>
[all …]
H A Ddeque_adaptor.hpp28 template <typename Queue>
30 public boost::deque_base<typename Queue::value_type, typename Queue::size_type>
32 Queue queue;
64 template <typename Queue>
66 public boost::deque_base<typename Queue::value_type, typename Queue::size_type>
68 Queue queue;
103 template <typename Queue>
105 public boost::deque_base<typename Queue::value_type, typename Queue::size_type>
107 Queue queue;
192 template <typename Queue>
[all …]
/dports/devel/boost-python-libs/boost_1_72_0/boost/thread/concurrent_queues/
H A Ddeque_adaptor.hpp28 template <typename Queue>
30 public boost::deque_base<typename Queue::value_type, typename Queue::size_type>
32 Queue queue;
64 template <typename Queue>
66 public boost::deque_base<typename Queue::value_type, typename Queue::size_type>
68 Queue queue;
103 template <typename Queue>
105 public boost::deque_base<typename Queue::value_type, typename Queue::size_type>
107 Queue queue;
192 template <typename Queue>
[all …]
H A Dqueue_adaptor.hpp28 template <typename Queue>
30 public boost::queue_base<typename Queue::value_type, typename Queue::size_type>
32 Queue queue;
64 template <typename Queue>
66 public boost::queue_base<typename Queue::value_type, typename Queue::size_type>
68 Queue queue;
103 template <typename Queue>
105 public boost::queue_base<typename Queue::value_type, typename Queue::size_type>
107 Queue queue;
192 template <typename Queue>
[all …]
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/thread/concurrent_queues/
H A Dqueue_adaptor.hpp28 template <typename Queue>
30 public boost::queue_base<typename Queue::value_type, typename Queue::size_type>
32 Queue queue;
64 template <typename Queue>
66 public boost::queue_base<typename Queue::value_type, typename Queue::size_type>
68 Queue queue;
103 template <typename Queue>
105 public boost::queue_base<typename Queue::value_type, typename Queue::size_type>
107 Queue queue;
192 template <typename Queue>
[all …]
H A Ddeque_adaptor.hpp28 template <typename Queue>
30 public boost::deque_base<typename Queue::value_type, typename Queue::size_type>
32 Queue queue;
64 template <typename Queue>
66 public boost::deque_base<typename Queue::value_type, typename Queue::size_type>
68 Queue queue;
103 template <typename Queue>
105 public boost::deque_base<typename Queue::value_type, typename Queue::size_type>
107 Queue queue;
192 template <typename Queue>
[all …]
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/thread/concurrent_queues/
H A Dqueue_adaptor.hpp28 template <typename Queue>
30 public boost::queue_base<typename Queue::value_type, typename Queue::size_type>
32 Queue queue;
64 template <typename Queue>
66 public boost::queue_base<typename Queue::value_type, typename Queue::size_type>
68 Queue queue;
103 template <typename Queue>
105 public boost::queue_base<typename Queue::value_type, typename Queue::size_type>
107 Queue queue;
192 template <typename Queue>
[all …]

1...<<11121314151617181920>>...955