Home
last modified time | relevance | path

Searched refs:Queue (Results 101 – 125 of 18110) sorted by relevance

12345678910>>...725

/dports/devel/adabooch/bc-20160321/src/
H A Dbc-indefinite_containers-queues-unbounded.ads34 type Queue is new Abstract_Queue with private; type
38 function Null_Container return Queue;
40 procedure Clear (Q : in out Queue);
43 procedure Append (Q : in out Queue; Elem : Item);
47 procedure Pop (Q : in out Queue);
50 procedure Remove (Q : in out Queue; From : Positive);
53 function Length (Q : in Queue) return Natural;
56 function Is_Empty (Q : in Queue) return Boolean;
59 function Front (Q : in Queue) return Item;
66 function "=" (Left, Right : in Queue) return Boolean;
[all …]
H A Dbc-containers-queues-ordered-unbounded.ads32 type Queue is new Abstract_Ordered_Queue with private; type
36 function Null_Container return Queue;
38 procedure Clear (Q : in out Queue);
41 procedure Append (Q : in out Queue; Elem : Item);
44 procedure Pop (Q : in out Queue);
47 procedure Remove (Q : in out Queue; From : Positive);
50 function Length (Q : in Queue) return Natural;
53 function Is_Empty (Q : in Queue) return Boolean;
56 function Front (Q : in Queue) return Item;
63 function "=" (Left, Right : in Queue) return Boolean;
[all …]
H A Dbc-indefinite_containers-queues-ordered-unbounded.ads33 type Queue is new Abstract_Ordered_Queue with private; type
37 function Null_Container return Queue;
39 procedure Clear (Q : in out Queue);
42 procedure Append (Q : in out Queue; Elem : Item);
45 procedure Pop (Q : in out Queue);
48 procedure Remove (Q : in out Queue; From : Positive);
51 function Length (Q : in Queue) return Natural;
54 function Is_Empty (Q : in Queue) return Boolean;
57 function Front (Q : in Queue) return Item;
64 function "=" (Left, Right : in Queue) return Boolean;
[all …]
H A Dbc-containers-queues-dynamic.adb28 function "=" (Left, Right : Queue) return Boolean is
34 procedure Clear (Q : in out Queue) is
39 procedure Append (Q : in out Queue; Elem : Item) is
44 procedure Pop (Q : in out Queue) is
54 function Length (Q : Queue) return Natural is
59 function Is_Empty (Q : Queue) return Boolean is
64 function Front (Q : Queue) return Item is
84 function Chunk_Size (Q : Queue) return Natural is
93 (For_The_Queue : Queue) return Iterator'Class is
107 function Null_Container return Queue is
[all …]
H A Dbc-containers-queues-ordered-dynamic.adb27 procedure Clear (Q : in out Queue) is
32 procedure Append (Q : in out Queue; Elem : Item) is
44 procedure Pop (Q : in out Queue) is
54 function Length (Q : Queue) return Natural is
59 function Is_Empty (Q : Queue) return Boolean is
64 function Front (Q : Queue) return Item is
74 function "=" (Left, Right : Queue) return Boolean is
90 function Chunk_Size (Q : Queue) return Natural is
96 is new System.Address_To_Access_Conversions (Queue);
112 function Null_Container return Queue is
[all …]
/dports/net/ns3/ns-allinone-3.35/ns-3.35/src/network/utils/
H A Dqueue.h222 friend class Queue; variable
262 Queue ();
263 virtual ~Queue ();
457 Queue<Item>::GetTypeId (void) in GetTypeId()
483 Queue<Item>::Queue () in Queue() function
489 Queue<Item>::~Queue () in ~Queue()
592 Queue<Item>::Flush (void) in Flush()
626 typename Queue<Item>::ConstIterator Queue<Item>::begin (void) const in begin()
632 typename Queue<Item>::Iterator Queue<Item>::begin (void) in begin()
638 typename Queue<Item>::ConstIterator Queue<Item>::end (void) const in end()
[all …]
/dports/emulators/qemu60/qemu-6.0.0/roms/edk2/EmulatorPkg/Win/Host/
H A DWinGopInput.c44 Queue->Front = 0; in GopPrivateCreateQ()
45 Queue->Rear = 0; in GopPrivateCreateQ()
64 Queue->Front = 0; in GopPrivateDestroyQ()
65 Queue->Rear = 0; in GopPrivateDestroyQ()
90 if ((Queue->Rear + 1) % MAX_Q == Queue->Front) { in GopPrivateAddQ()
95 CopyMem (&Queue->Q[Queue->Rear], KeyData, sizeof (EFI_KEY_DATA)); in GopPrivateAddQ()
96 Queue->Rear = (Queue->Rear + 1) % MAX_Q; in GopPrivateAddQ()
122 if (Queue->Front == Queue->Rear) { in GopPrivateDeleteQ()
127 CopyMem (Key, &Queue->Q[Queue->Front], sizeof (EFI_KEY_DATA)); in GopPrivateDeleteQ()
128 Queue->Front = (Queue->Front + 1) % MAX_Q; in GopPrivateDeleteQ()
[all …]
/dports/emulators/qemu/qemu-6.2.0/roms/edk2/EmulatorPkg/Win/Host/
H A DWinGopInput.c44 Queue->Front = 0; in GopPrivateCreateQ()
45 Queue->Rear = 0; in GopPrivateCreateQ()
64 Queue->Front = 0; in GopPrivateDestroyQ()
65 Queue->Rear = 0; in GopPrivateDestroyQ()
90 if ((Queue->Rear + 1) % MAX_Q == Queue->Front) { in GopPrivateAddQ()
95 CopyMem (&Queue->Q[Queue->Rear], KeyData, sizeof (EFI_KEY_DATA)); in GopPrivateAddQ()
96 Queue->Rear = (Queue->Rear + 1) % MAX_Q; in GopPrivateAddQ()
122 if (Queue->Front == Queue->Rear) { in GopPrivateDeleteQ()
127 CopyMem (Key, &Queue->Q[Queue->Front], sizeof (EFI_KEY_DATA)); in GopPrivateDeleteQ()
128 Queue->Front = (Queue->Front + 1) % MAX_Q; in GopPrivateDeleteQ()
[all …]
/dports/emulators/qemu5/qemu-5.2.0/roms/edk2/EmulatorPkg/Win/Host/
H A DWinGopInput.c44 Queue->Front = 0; in GopPrivateCreateQ()
45 Queue->Rear = 0; in GopPrivateCreateQ()
64 Queue->Front = 0; in GopPrivateDestroyQ()
65 Queue->Rear = 0; in GopPrivateDestroyQ()
90 if ((Queue->Rear + 1) % MAX_Q == Queue->Front) { in GopPrivateAddQ()
95 CopyMem (&Queue->Q[Queue->Rear], KeyData, sizeof (EFI_KEY_DATA)); in GopPrivateAddQ()
96 Queue->Rear = (Queue->Rear + 1) % MAX_Q; in GopPrivateAddQ()
122 if (Queue->Front == Queue->Rear) { in GopPrivateDeleteQ()
127 CopyMem (Key, &Queue->Q[Queue->Front], sizeof (EFI_KEY_DATA)); in GopPrivateDeleteQ()
128 Queue->Front = (Queue->Front + 1) % MAX_Q; in GopPrivateDeleteQ()
[all …]
/dports/sysutils/uefi-edk2-qemu/edk2-edk2-stable201911/EmulatorPkg/Win/Host/
H A DWinGopInput.c44 Queue->Front = 0; in GopPrivateCreateQ()
45 Queue->Rear = 0; in GopPrivateCreateQ()
64 Queue->Front = 0; in GopPrivateDestroyQ()
65 Queue->Rear = 0; in GopPrivateDestroyQ()
90 if ((Queue->Rear + 1) % MAX_Q == Queue->Front) { in GopPrivateAddQ()
95 CopyMem (&Queue->Q[Queue->Rear], KeyData, sizeof (EFI_KEY_DATA)); in GopPrivateAddQ()
96 Queue->Rear = (Queue->Rear + 1) % MAX_Q; in GopPrivateAddQ()
122 if (Queue->Front == Queue->Rear) { in GopPrivateDeleteQ()
127 CopyMem (Key, &Queue->Q[Queue->Front], sizeof (EFI_KEY_DATA)); in GopPrivateDeleteQ()
128 Queue->Front = (Queue->Front + 1) % MAX_Q; in GopPrivateDeleteQ()
[all …]
/dports/sysutils/uefi-edk2-bhyve/edk2-edk2-stable202102/EmulatorPkg/Win/Host/
H A DWinGopInput.c44 Queue->Front = 0; in GopPrivateCreateQ()
45 Queue->Rear = 0; in GopPrivateCreateQ()
64 Queue->Front = 0; in GopPrivateDestroyQ()
65 Queue->Rear = 0; in GopPrivateDestroyQ()
90 if ((Queue->Rear + 1) % MAX_Q == Queue->Front) { in GopPrivateAddQ()
95 CopyMem (&Queue->Q[Queue->Rear], KeyData, sizeof (EFI_KEY_DATA)); in GopPrivateAddQ()
96 Queue->Rear = (Queue->Rear + 1) % MAX_Q; in GopPrivateAddQ()
122 if (Queue->Front == Queue->Rear) { in GopPrivateDeleteQ()
127 CopyMem (Key, &Queue->Q[Queue->Front], sizeof (EFI_KEY_DATA)); in GopPrivateDeleteQ()
128 Queue->Front = (Queue->Front + 1) % MAX_Q; in GopPrivateDeleteQ()
[all …]
/dports/sysutils/edk2/edk2-edk2-stable202102/EmulatorPkg/Win/Host/
H A DWinGopInput.c44 Queue->Front = 0; in GopPrivateCreateQ()
45 Queue->Rear = 0; in GopPrivateCreateQ()
64 Queue->Front = 0; in GopPrivateDestroyQ()
65 Queue->Rear = 0; in GopPrivateDestroyQ()
90 if ((Queue->Rear + 1) % MAX_Q == Queue->Front) { in GopPrivateAddQ()
95 CopyMem (&Queue->Q[Queue->Rear], KeyData, sizeof (EFI_KEY_DATA)); in GopPrivateAddQ()
96 Queue->Rear = (Queue->Rear + 1) % MAX_Q; in GopPrivateAddQ()
122 if (Queue->Front == Queue->Rear) { in GopPrivateDeleteQ()
127 CopyMem (Key, &Queue->Q[Queue->Front], sizeof (EFI_KEY_DATA)); in GopPrivateDeleteQ()
128 Queue->Front = (Queue->Front + 1) % MAX_Q; in GopPrivateDeleteQ()
[all …]
/dports/devel/aws-sdk-cpp/aws-sdk-cpp-1.9.129/aws-cpp-sdk-connect/include/aws/connect/model/
H A DQueue.h34 class AWS_CONNECT_API Queue
37 Queue();
38 Queue(Aws::Utils::Json::JsonView jsonValue);
39 Queue& operator=(Aws::Utils::Json::JsonView jsonValue);
71 inline Queue& WithName(const Aws::String& value) { SetName(value); return *this;} in WithName()
76 inline Queue& WithName(Aws::String&& value) { SetName(std::move(value)); return *this;} in WithName()
81 inline Queue& WithName(const char* value) { SetName(value); return *this;} in WithName()
122 inline Queue& WithQueueArn(const char* value) { SetQueueArn(value); return *this;} in WithQueueArn()
153 inline Queue& WithQueueId(const Aws::String& value) { SetQueueId(value); return *this;} in WithQueueId()
163 inline Queue& WithQueueId(const char* value) { SetQueueId(value); return *this;} in WithQueueId()
[all …]
/dports/misc/libsolv/libsolv-0.7.19/src/
H A Dselection.h63 extern int selection_make(Pool *pool, Queue *selection, const char *name, int flags);
64 extern int selection_make_matchdeps(Pool *pool, Queue *selection, const char *name, int flags, int…
65 extern int selection_make_matchdepid(Pool *pool, Queue *selection, Id dep, int flags, int keyname,…
66 extern int selection_make_matchsolvable(Pool *pool, Queue *selection, Id solvid, int flags, int key…
67 extern int selection_make_matchsolvablelist(Pool *pool, Queue *selection, Queue *solvidq, int flags…
69 extern void selection_filter(Pool *pool, Queue *sel1, Queue *sel2);
70 extern void selection_add(Pool *pool, Queue *sel1, Queue *sel2);
71 extern void selection_subtract(Pool *pool, Queue *sel1, Queue *sel2);
73 extern void selection_solvables(Pool *pool, Queue *selection, Queue *pkgs);
75 extern const char *pool_selection2str(Pool *pool, Queue *selection, Id flagmask);
/dports/net/py-kombu/kombu-4.6.11/t/unit/
H A Dtest_simple.py7 from kombu import Connection, Exchange, Queue
12 def Queue(self, name, *args, **kwargs): member in SimpleBase
14 if not isinstance(q, Queue):
26 self.q = self.Queue(None, no_ack=True)
64 q = self.Queue('test_enter_exit')
92 q = self.Queue(queue)
97 q = self.Queue('test_nonzero')
107 q = self.Queue('test_is_no_ack')
115 q = self.Queue('test_queue_args')
140 def Queue(self, *args, **kwargs): member in test_SimpleBuffer
[all …]
/dports/lang/mono/mono-5.10.1.57/mcs/class/corlib/Test/System.Collections/
H A DQueueTest.cs44 Queue q = new Queue(-1, 2); in TestConstructorException1()
56 Queue q = new Queue(10, 0); in TestConstructorException2()
70 Queue q = new Queue(10, 11); in TestConstructorException3()
84 Queue q = new Queue(null); in TestConstructorException4()
144 Queue q1sync = Queue.Synchronized(q1); in TestSyncRoot()
321 Queue q3 = (Queue) q2.Clone (); in TestClone()
386 Queue queue = new Queue(); in TestDequeue()
406 Queue q= new Queue(); in TestDequeueEmpty()
455 Queue queue = new Queue (new Queue()); in TestAlwaysGrows()
479 Queue s = new Queue (x); in TestICollectionCtorUsesEnum()
[all …]
/dports/www/otrs/otrs-rel-6_0_29/Kernel/Modules/
H A DAgentTicketQueue.pm583 my @Queue = split /::/, $Queue{Queue};
587 $UsedQueue{ $Queue{Queue} } = 1;
637 if ( $Queue{Queue} eq 'CustomQueue' ) {
639 $Totals{$CustomQueue} = $Totals{ $Queue{Queue} };
640 $Queue{Queue} = $CustomQueue;
642 my @QueueName = split /::/, $Queue{Queue};
644 $Queue{MaxAge} = $Queue{MaxAge} / 60;
645 $Queue{QueueID} = 0 if ( !$Queue{QueueID} );
653 && $Counter{ $Queue{Queue} } < 1
717 $Param{SelectedQueue} = $Queue{Queue};
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Collections/tests/Generic/Queue/
H A DQueue.Generic.Tests.cs16 #region Queue<T> Helper Methods
18 protected Queue<T> GenericQueueFactory() in GenericQueueFactory()
20 return new Queue<T>(); in GenericQueueFactory()
23 protected Queue<T> GenericQueueFactory(int count) in GenericQueueFactory()
25 Queue<T> queue = new Queue<T>(count); in GenericQueueFactory()
65 Queue<T> queue = new Queue<T>(enumerable); in Queue_Generic_Constructor_IEnumerable()
83 Queue<T> queue = new Queue<T>(count); in Queue_Generic_Constructor_int()
104 Queue<T> queue = GenericQueueFactory(count); in Queue_Generic_Dequeue_AllElements()
123 var q = new Queue<T>(capacity); in Queue_Generic_EnqueueAndDequeue()
160 Queue<T> queue = GenericQueueFactory(count); in Queue_Generic_ToArray()
[all …]
/dports/science/elmerfem/elmerfem-release-9.0/elmerice/Solvers/MeshAdaptation_2D/
H A DGetConnectedAreas.F9051 TYPE(Queue_t) :: Queue local
225 DEALLOCATE(Queue%items)
232 TYPE(Queue_t) :: Queue local
235 Queue%top=0
236 Queue%maxsize=n
241 TYPE(Queue_t) :: Queue local
243 IF (Queue%top.EQ.Queue%maxsize) &
246 Queue%top=Queue%top+1
247 Queue%items(Queue%top)=x
258 x=Queue%items(Queue%top)
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/chrome/browser/chromeos/file_system_provider/
H A Dqueue.cc16 Queue::Task::Task() : token(0) { in Task()
19 Queue::Task::Task(size_t token, AbortableCallback callback) in Task()
22 Queue::Task::Task(Task&& other) = default;
23 Queue::Task& Queue::Task::operator=(Task&& other) = default;
25 Queue::Task::~Task() { in ~Task()
28 Queue::Queue(size_t max_in_parallel) in Queue() function in chromeos::file_system_provider::Queue
33 Queue::~Queue() { in ~Queue()
36 size_t Queue::NewToken() { in NewToken()
53 void Queue::Complete(size_t token) { in Complete()
62 void Queue::MaybeRun() { in MaybeRun()
[all …]
/dports/ports-mgmt/parfetch-overlay/parfetch-0.1.0/libias/
H A Dqueue.h30 struct Queue;
32 struct Queue *queue_new(void);
33 void queue_free(struct Queue *);
34 size_t queue_len(struct Queue *);
35 int queue_contains(struct Queue *, const void *);
36 void *queue_peek(struct Queue *);
37 void *queue_pop(struct Queue *);
38 void *queue_dequeue(struct Queue *);
39 void queue_push(struct Queue *, const void *);
40 void queue_truncate(struct Queue *);
[all …]
/dports/ports-mgmt/portfmt/portfmt-1.1.0/libias/
H A Dqueue.h30 struct Queue;
32 struct Queue *queue_new(void);
33 void queue_free(struct Queue *);
34 size_t queue_len(struct Queue *);
35 int queue_contains(struct Queue *, const void *);
36 void *queue_peek(struct Queue *);
37 void *queue_pop(struct Queue *);
38 void *queue_dequeue(struct Queue *);
39 void queue_push(struct Queue *, const void *);
40 void queue_truncate(struct Queue *);
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Collections.NonGeneric/tests/
H A DQueueTests.cs20 var queue = new Queue(); in Ctor_Empty()
168 Queue clone = (Queue)queue2.Clone(); in Clone()
186 Queue clone = (Queue)queue2.Clone(); in Clone_IsShallowCopy()
202 Queue clone = (Queue)queue2.Clone(); in Clone_Empty()
219 Queue clone = (Queue)queue2.Clone(); in Clone_Clear()
239 Queue clone = (Queue)queue2.Clone(); in Clone_DequeueUntilEmpty()
268 Queue queClone = (Queue)queue2.Clone(); in Clone_DequeueThenEnqueue()
898 public Queue _queue;
908 Queue syncQueue = Queue.Synchronized(queue); in Synchronized()
922 _queue = Queue.Synchronized(new Queue()); in SynchronizedEnqueue()
[all …]
/dports/games/corsix-th/CorsixTH-0.65.1/CorsixTH/Lua/
H A Dqueue.lua34 local Queue = _G["Queue"]
37 function Queue:Queue() function
97 function Queue:size()
108 function Queue:isFull()
114 function Queue:reportedSize()
120 function Queue:expectedSize()
137 function Queue:patientSize()
200 function Queue:front()
206 function Queue:back()
213 function Queue:pop()
[all …]
/dports/security/vault/vault-1.8.2/vendor/go.etcd.io/etcd/etcdserver/api/v2store/
H A Devent_history.go27 Queue eventQueue member
35 Queue: eventQueue{
47 eh.Queue.insert(e)
51 eh.StartIndex = eh.Queue.Events[eh.Queue.Front].Index()
76 i := (eh.Queue.Front + int(offset)) % eh.Queue.Capacity
79 e := eh.Queue.Events[i]
105 if i == eh.Queue.Back {
117 Size: eh.Queue.Size,
118 Front: eh.Queue.Front,
119 Back: eh.Queue.Back,
[all …]

12345678910>>...725