Home
last modified time | relevance | path

Searched refs:Queue (Results 226 – 250 of 22846) sorted by relevance

12345678910>>...914

/dports/sysutils/rsfetch/rsfetch-2.0.0/cargo-crates/crossbeam-epoch-0.8.2/src/sync/
H A Dqueue.rs254 let q: Queue<i64> = Queue::new(); in push_try_pop_1()
264 let q: Queue<i64> = Queue::new(); in push_try_pop_2()
276 let q: Queue<i64> = Queue::new(); in push_try_pop_many_seq()
290 let q: Queue<i64> = Queue::new(); in push_pop_1()
300 let q: Queue<i64> = Queue::new(); in push_pop_2()
309 let q: Queue<i64> = Queue::new(); in push_pop_many_seq()
323 let q: Queue<i64> = Queue::new(); in push_try_pop_many_spsc()
361 let q: Queue<i64> = Queue::new(); in push_try_pop_many_spmc()
385 let q: Queue<LR> = Queue::new(); in push_try_pop_many_mpmc()
426 let q: Queue<i64> = Queue::new(); in push_pop_many_spsc()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/media/base/
H A Dserial_runner.h35 class MEDIA_EXPORT Queue {
37 Queue();
38 Queue(Queue&& other);
39 ~Queue();
46 Queue(const Queue&) = delete;
47 Queue& operator=(const Queue&) = delete;
71 static std::unique_ptr<SerialRunner> Run(Queue&& bound_fns,
77 SerialRunner(Queue&& bound_fns, PipelineStatusCallback done_cb);
83 Queue bound_fns_;
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/media/base/
H A Dserial_runner.h35 class MEDIA_EXPORT Queue {
37 Queue();
38 Queue(Queue&& other);
39 ~Queue();
46 Queue(const Queue&) = delete;
47 Queue& operator=(const Queue&) = delete;
71 static std::unique_ptr<SerialRunner> Run(Queue&& bound_fns,
77 SerialRunner(Queue&& bound_fns, PipelineStatusCallback done_cb);
83 Queue bound_fns_;
/dports/devel/adabooch/bc-20160321/src/
H A Dbc-containers-queues-ordered-unmanaged.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
49 procedure Remove (Q : in out Queue; From : Positive) 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
81 is new System.Address_To_Access_Conversions (Queue);
97 function Null_Container return Queue is
[all …]
H A Dbc-indefinite_containers-queues-ordered-unbounded.adb28 procedure Clear (Q : in out Queue) is
33 procedure Append (Q : in out Queue; Elem : Item) is
45 procedure Pop (Q : in out Queue) is
50 procedure Remove (Q : in out Queue; From : Positive) is
55 function Length (Q : Queue) return Natural is
60 function Is_Empty (Q : Queue) return Boolean is
65 function Front (Q : Queue) return Item is
75 function "=" (Left, Right : Queue) return Boolean is
82 is new System.Address_To_Access_Conversions (Queue);
98 function Null_Container return Queue is
[all …]
H A Dbc-containers-queues-ordered-unbounded.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
49 procedure Remove (Q : in out Queue; From : Positive) 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
81 is new System.Address_To_Access_Conversions (Queue);
97 function Null_Container return Queue is
[all …]
/dports/www/rt50/rt-5.0.2/t/data/initialdata/
H A Dinitialdata5 Name => 'Test Queue',
19 Queue => 'General',
20 Description => 'Test Without Stage and One Queue',
26 Queue => ['General', 'Test Queue'],
52 LookupType => 'RT::Queue-RT::Ticket',
53 Queue => 'Test Queue',
64 Description => 'Stalled Tickets in Test Queue',
66 Query => "Status = 'stalled' AND Queue = 'Test Queue'",
79 Queue => 'Test Queue',
86 Description => 'New Tickets in Test Queue',
[all …]
/dports/www/rt44/rt-4.4.5/t/data/initialdata/
H A Dinitialdata5 Name => 'Test Queue',
19 Queue => 'General',
20 Description => 'Test Without Stage and One Queue',
26 Queue => ['General', 'Test Queue'],
52 LookupType => 'RT::Queue-RT::Ticket',
53 Queue => 'Test Queue',
64 Description => 'Stalled Tickets in Test Queue',
66 Query => "Status = 'stalled' AND Queue = 'Test Queue'",
79 Queue => 'Test Queue',
86 Description => 'New Tickets in Test Queue',
[all …]
/dports/www/rt44/rt-4.4.5/t/charts/
H A Dcompound-sql-function.t15 { Queue => $q1->id, Resolved => 3*60 },
16 { Queue => $q1->id, Resolved => 3*60*60 },
17 { Queue => $q1->id, Resolved => 3*24*60*60 },
18 { Queue => $q1->id, Resolved => 3*30*24*60*60 },
19 { Queue => $q1->id, Resolved => 9*30*24*60*60 },
20 { Queue => $q2->id, Resolved => 7*60 },
21 { Queue => $q2->id, Resolved => 7*60*60 },
22 { Queue => $q2->id, Resolved => 7*24*60*60 },
23 { Queue => $q2->id, Resolved => 7*30*24*60*60 },
24 { Queue => $q2->id, Resolved => 24*30*24*60*60 },
[all …]
/dports/www/rt50/rt-5.0.2/t/charts/
H A Dcompound-sql-function.t15 { Queue => $q1->id, Resolved => 3*60 },
16 { Queue => $q1->id, Resolved => 3*60*60 },
17 { Queue => $q1->id, Resolved => 3*24*60*60 },
18 { Queue => $q1->id, Resolved => 3*30*24*60*60 },
19 { Queue => $q1->id, Resolved => 9*30*24*60*60 },
20 { Queue => $q2->id, Resolved => 7*60 },
21 { Queue => $q2->id, Resolved => 7*60*60 },
22 { Queue => $q2->id, Resolved => 7*24*60*60 },
23 { Queue => $q2->id, Resolved => 7*30*24*60*60 },
24 { Queue => $q2->id, Resolved => 24*30*24*60*60 },
[all …]
/dports/www/rt44/rt-4.4.5/t/api/
H A Drights_show_ticket.t56 "Queue = $qa_id OR Queue = $qb_id",
57 "Queue = $qb_id OR Queue = $qa_id",
86 "Queue = $qa_id OR Queue = $qb_id",
87 "Queue = $qb_id OR Queue = $qa_id",
113 # Queue Cc has right, Users are Queue Ccs
131 "Queue = $qa_id OR Queue = $qb_id",
132 "Queue = $qb_id OR Queue = $qa_id",
164 "Queue = $qa_id OR Queue = $qb_id",
165 "Queue = $qb_id OR Queue = $qa_id",
191 "Queue = $qa_id OR Queue = $qb_id",
[all …]
H A Dqueue.t24 use RT::Queue;
31 my $q = RT::Queue->new(RT->SystemUser);
40 my $q = RT::Queue->new(RT->SystemUser);
50 my $q = RT::Queue->new(RT->SystemUser);
60 my $queue = RT::Queue->new(RT->SystemUser);
72 my $Queue = RT::Queue->new(RT->SystemUser);
73 my ($id, $msg) = $Queue->Create(Name => "Foo");
75 ok(my $group = $Queue->RoleGroup('Requestor'));
95 $group = $Queue->RoleGroup('Cc');
97 $group = $Queue->RoleGroup('AdminCc');
[all …]
/dports/www/rt50/rt-5.0.2/t/api/
H A Drights_show_ticket.t56 "Queue = $qa_id OR Queue = $qb_id",
57 "Queue = $qb_id OR Queue = $qa_id",
86 "Queue = $qa_id OR Queue = $qb_id",
87 "Queue = $qb_id OR Queue = $qa_id",
113 # Queue Cc has right, Users are Queue Ccs
131 "Queue = $qa_id OR Queue = $qb_id",
132 "Queue = $qb_id OR Queue = $qa_id",
164 "Queue = $qa_id OR Queue = $qb_id",
165 "Queue = $qb_id OR Queue = $qa_id",
191 "Queue = $qa_id OR Queue = $qb_id",
[all …]
H A Dqueue.t24 use RT::Queue;
31 my $q = RT::Queue->new(RT->SystemUser);
40 my $q = RT::Queue->new(RT->SystemUser);
50 my $q = RT::Queue->new(RT->SystemUser);
60 my $queue = RT::Queue->new(RT->SystemUser);
72 my $Queue = RT::Queue->new(RT->SystemUser);
73 my ($id, $msg) = $Queue->Create(Name => "Foo");
75 ok(my $group = $Queue->RoleGroup('Requestor'));
95 $group = $Queue->RoleGroup('Cc');
97 $group = $Queue->RoleGroup('AdminCc');
[all …]
/dports/emulators/citra/citra-ac98458e0/src/common/
H A Dthread_queue_list.h34 const Queue& cur = queues[i]; in contains()
44 const Queue* cur = first; in get_first()
56 Queue* cur = first; in pop_first()
70 Queue* cur = first; in pop_first_better()
85 Queue* cur = &queues[priority]; in push_front()
90 Queue* cur = &queues[priority]; in push_back()
116 queues.fill(Queue()); in clear()
132 struct Queue { struct
140 static Queue* UnlinkedTag() { in UnlinkedTag()
160 Queue* first;
[all …]
/dports/emulators/citra-qt5/citra-ac98458e0/src/common/
H A Dthread_queue_list.h34 const Queue& cur = queues[i]; in contains()
44 const Queue* cur = first; in get_first()
56 Queue* cur = first; in pop_first()
70 Queue* cur = first; in pop_first_better()
85 Queue* cur = &queues[priority]; in push_front()
90 Queue* cur = &queues[priority]; in push_back()
116 queues.fill(Queue()); in clear()
132 struct Queue { struct
140 static Queue* UnlinkedTag() { in UnlinkedTag()
160 Queue* first;
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/clang-tools-extra/clangd/index/
H A DBackgroundQueue.cpp25 CV.wait(Lock, [&] { return ShouldStop || !Queue.empty(); }); in work()
27 Queue.clear(); in work()
32 std::pop_heap(Queue.begin(), Queue.end()); in work()
33 Task = std::move(Queue.back()); in work()
34 Queue.pop_back(); in work()
46 if (NumActiveTasks == 1 && Queue.empty() && OnIdle) { in work()
71 Queue.push_back(std::move(T)); in push()
72 std::push_heap(Queue.begin(), Queue.end()); in push()
83 std::make_heap(Queue.begin(), Queue.end()); in append()
97 for (Task &T : Queue) in boost()
[all …]
/dports/devel/llvm90/llvm-9.0.1.src/tools/clang/tools/extra/clangd/index/
H A DBackgroundQueue.cpp25 CV.wait(Lock, [&] { return ShouldStop || !Queue.empty(); }); in work()
27 Queue.clear(); in work()
32 std::pop_heap(Queue.begin(), Queue.end()); in work()
33 Task = std::move(Queue.back()); in work()
34 Queue.pop_back(); in work()
46 if (NumActiveTasks == 1 && Queue.empty() && OnIdle) { in work()
71 Queue.push_back(std::move(T)); in push()
72 std::push_heap(Queue.begin(), Queue.end()); in push()
83 std::make_heap(Queue.begin(), Queue.end()); in append()
97 for (Task &T : Queue) in boost()
[all …]
/dports/devel/llvm10/llvm-10.0.1.src/tools/clang/tools/extra/clangd/index/
H A DBackgroundQueue.cpp25 CV.wait(Lock, [&] { return ShouldStop || !Queue.empty(); }); in work()
27 Queue.clear(); in work()
32 std::pop_heap(Queue.begin(), Queue.end()); in work()
33 Task = std::move(Queue.back()); in work()
34 Queue.pop_back(); in work()
46 if (NumActiveTasks == 1 && Queue.empty() && OnIdle) { in work()
71 Queue.push_back(std::move(T)); in push()
72 std::push_heap(Queue.begin(), Queue.end()); in push()
83 std::make_heap(Queue.begin(), Queue.end()); in append()
97 for (Task &T : Queue) in boost()
[all …]
/dports/devel/pragmarcs/PragmARC-1378e7a/
H A Dpragmarc-queue_bounded_blocking.adb19 Implementation.Clear (Queue => Queue);
22 entry Put (Item : in Element) when not Implementation.Is_Full (Queue) is
25 Implementation.Put (Into => Queue, Item => Item);
28 entry Get (Item : out Element) when not Implementation.Is_Empty (Queue) is
31 Implementation.Get (From => Queue, Item => Item);
37 return Implementation.Is_Full (Queue);
43 return Implementation.Is_Empty (Queue);
49 return Implementation.Length (Queue);
55 return Implementation.Peek (Queue);
61 Local (Over => Queue);
/dports/lang/cython/Cython-0.29.24/docs/examples/tutorial/clibraries/c-algorithms/src/
H A Dqueue.h3 typedef struct _Queue Queue; typedef
6 Queue *queue_new(void);
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 int queue_is_empty(Queue *queue);
/dports/lang/cython-devel/cython-2b1e743/docs/examples/tutorial/clibraries/c-algorithms/src/
H A Dqueue.h3 typedef struct _Queue Queue; typedef
6 Queue *queue_new(void);
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 int queue_is_empty(Queue *queue);
/dports/textproc/regex2dfa/regex2dfa-0.1.6/third_party/openfst/src/include/fst/script/
H A Dshortest-path.h71 typedef AutoQueue<StateId> Queue; in ShortestPath() typedef
72 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
83 typedef FifoQueue<StateId> Queue; in ShortestPath() typedef
84 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
95 typedef LifoQueue<StateId> Queue; in ShortestPath() typedef
96 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
108 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
119 typedef StateOrderQueue<StateId> Queue; in ShortestPath() typedef
120 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
131 typedef TopOrderQueue<StateId> Queue; in ShortestPath() typedef
[all …]
/dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/third_party/openfst/src/include/fst/script/
H A Dshortest-path.h71 typedef AutoQueue<StateId> Queue; in ShortestPath() typedef
72 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
83 typedef FifoQueue<StateId> Queue; in ShortestPath() typedef
84 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
95 typedef LifoQueue<StateId> Queue; in ShortestPath() typedef
96 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
108 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
119 typedef StateOrderQueue<StateId> Queue; in ShortestPath() typedef
120 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
131 typedef TopOrderQueue<StateId> Queue; in ShortestPath() typedef
[all …]
/dports/net/ooni-mini/probe-engine-0.23.0/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/third_party/openfst/src/include/fst/script/
H A Dshortest-path.h71 typedef AutoQueue<StateId> Queue; in ShortestPath() typedef
72 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
83 typedef FifoQueue<StateId> Queue; in ShortestPath() typedef
84 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
95 typedef LifoQueue<StateId> Queue; in ShortestPath() typedef
96 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
108 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
119 typedef StateOrderQueue<StateId> Queue; in ShortestPath() typedef
120 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
131 typedef TopOrderQueue<StateId> Queue; in ShortestPath() typedef
[all …]

12345678910>>...914