Home
last modified time | relevance | path

Searched refs:Queue (Results 51 – 75 of 13374) sorted by relevance

12345678910>>...535

/dports/devel/hs-git-annex/git-annex-8.20210903/Annex/
H A DQueue.hs10 module Annex.Queue (
24 import qualified Git.Queue
48 flushWhenFull :: Git.Queue.Queue Annex -> Annex (Git.Queue.Queue Annex)
50 | Git.Queue.full q = flush' q
67 flush' :: Git.Queue.Queue Annex -> Annex (Git.Queue.Queue Annex)
70 Git.Queue.flush q =<< gitRepo
74 size = Git.Queue.size <$> get
76 get :: Annex (Git.Queue.Queue Annex)
79 new :: Annex (Git.Queue.Queue Annex)
85 store :: Git.Queue.Queue Annex -> Annex ()
[all …]
/dports/net/rabbitmq/rabbitmq-server-3.9.11/deps/rabbit/src/
H A Drabbit_queue_master_location_misc.erl26 {ok, Queue} when ?amqqueue_has_valid_pid(Queue) ->
27 Pid = amqqueue:get_pid(Queue),
36 Reply = {ok, Queue} when ?is_amqqueue(Queue) ->
42 get_location(Queue) when ?is_amqqueue(Queue) ->
61 get_location_mod_by_args(Queue) when ?is_amqqueue(Queue) ->
62 Args = amqqueue:get_arguments(Queue),
72 get_location_mod_by_policy(Queue) when ?is_amqqueue(Queue) ->
82 get_location_mod_by_config(Queue) when ?is_amqqueue(Queue) ->
92 all_nodes(Queue) when ?is_amqqueue(Queue) ->
93 handle_is_mirrored_ha_nodes(rabbit_mirror_queue_misc:is_mirrored_ha_nodes(Queue), Queue).
[all …]
/dports/chinese/bitchx/bitchx-1.2.1/source/
H A Dqueue.c41 static Queue *lookup_queue (Queue *, char *);
45 static Queue *make_new_queue (Queue *, char *);
50 static Queue *remove_a_queue (Queue *);
51 static Queue *do_queue (Queue *, int);
55 Queue *tmp; in BUILT_IN_COMMAND()
159 static Queue * lookup_queue (Queue *queue, char *what) in lookup_queue()
194 static Queue *make_new_queue (Queue *afterqueue, char *name) in make_new_queue()
196 Queue *tmp = (Queue *)new_malloc(sizeof(Queue)); in make_new_queue()
268 static Queue *remove_a_queue (Queue *queue) in remove_a_queue()
270 Queue *tmp; in remove_a_queue()
[all …]
/dports/irc/bitchx/bitchx-1.2.1/source/
H A Dqueue.c41 static Queue *lookup_queue (Queue *, char *);
45 static Queue *make_new_queue (Queue *, char *);
50 static Queue *remove_a_queue (Queue *);
51 static Queue *do_queue (Queue *, int);
55 Queue *tmp; in BUILT_IN_COMMAND()
159 static Queue * lookup_queue (Queue *queue, char *what) in lookup_queue()
194 static Queue *make_new_queue (Queue *afterqueue, char *name) in make_new_queue()
196 Queue *tmp = (Queue *)new_malloc(sizeof(Queue)); in make_new_queue()
268 static Queue *remove_a_queue (Queue *queue) in remove_a_queue()
270 Queue *tmp; in remove_a_queue()
[all …]
/dports/comms/libsdr/libsdr-0.1.0/src/
H A Dqueue.cc12 Queue *Queue::_instance = 0;
14 Queue &
15 Queue::get() { in get()
17 Queue::_instance = new Queue(); in get()
22 Queue::Queue() in Queue() function in Queue
30 Queue::~Queue() { in ~Queue()
57 Queue::start() { in start()
64 Queue::stop() { in stop()
70 Queue::wait() { in wait()
84 Queue::_main() in _main()
[all …]
/dports/www/gitea/gitea-1.16.5/modules/setting/
H A Dqueue.go38 var Queue = QueueSettings{} var
49 q.QueueName = name + Queue.QueueName
60 if len(q.SetName) == 0 && len(Queue.SetName) > 0 {
61 q.SetName = q.QueueName + Queue.SetName
72 q.Type = sec.Key("TYPE").MustString(Queue.Type)
76 q.Workers = sec.Key("WORKERS").MustInt(Queue.Workers)
90 if !filepath.IsAbs(Queue.DataDir) {
91 Queue.DataDir = filepath.ToSlash(filepath.Join(AppDataPath, Queue.DataDir))
93 Queue.QueueLength = sec.Key("LENGTH").MustInt(20)
101 Queue.Workers = sec.Key("WORKERS").MustInt(0)
[all …]
/dports/misc/libsolv/libsolv-0.7.19/src/
H A Dqueue.h27 } Queue; typedef
35 queue_empty(Queue *q) in queue_empty()
48 queue_shift(Queue *q) in queue_shift()
57 queue_pop(Queue *q) in queue_pop()
66 queue_unshift(Queue *q, Id id) in queue_unshift()
75 queue_push(Queue *q, Id id) in queue_push()
84 queue_pushunique(Queue *q, Id id) in queue_pushunique()
101 queue_truncate(Queue *q, int n) in queue_truncate()
110 extern void queue_init(Queue *q);
112 extern void queue_init_clone(Queue *target, const Queue *source);
[all …]
H A Dsolver.h31 Queue job; /* copy of the job we're solving */
127 Queue learnt_why;
128 Queue learnt_pool;
130 Queue branches;
144 Queue *recommendscplxq;
145 Queue *suggestscplxq;
196 Queue *cleandeps_mistakes; /* mistakes we made */
340 extern int solver_solve(Solver *solv, Queue *job);
351 extern void solver_get_recommendations(Solver *solv, Queue *recommendationsq, Queue *suggestionsq, …
354 extern void pool_add_userinstalled_jobs(Pool *pool, Queue *q, Queue *job, int flags);
[all …]
/dports/devel/adabooch/bc-20160321/src/
H A Dbc-containers-queues-ordered-dynamic.ads33 type Queue is new Abstract_Ordered_Queue with private; type
39 function Null_Container return Queue;
41 procedure Clear (Q : in out Queue);
44 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;
77 function Chunk_Size (Q : Queue) return Natural;
[all …]
H A Dbc-containers-queues-dynamic.ads34 type Queue is new Abstract_Queue with private; type
41 function Null_Container return Queue;
43 procedure Clear (Q : in out Queue);
46 procedure Append (Q : in out Queue; Elem : Item);
50 procedure Pop (Q : in out Queue);
56 function Length (Q : in Queue) return Natural;
59 function Is_Empty (Q : in Queue) return Boolean;
62 function Front (Q : in Queue) return Item;
69 function "=" (Left, Right : Queue) return Boolean;
80 function Chunk_Size (Q : Queue) return Natural;
[all …]
H A Dbc-indefinite_containers-queues-ordered-bounded.ads32 type Queue is new Abstract_Ordered_Queue with private; type
34 function Null_Container return Queue;
36 procedure Clear (Q : in out Queue);
39 procedure Append (Q : in out Queue; Elem : Item);
42 procedure Pop (Q : in out Queue);
45 procedure Remove (Q : in out Queue; From : Positive);
48 function Available (Q : in Queue) return Natural;
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;
[all …]
H A Dbc-indefinite_containers-queues-bounded.ads33 type Queue is new Abstract_Queue with private; type
35 function Null_Container return Queue;
37 procedure Clear (Q : in out Queue);
40 procedure Append (Q : in out Queue; Elem : Item);
44 procedure Pop (Q : in out Queue);
47 procedure Remove (Q : in out Queue; From : Positive);
51 function Available (Q : in Queue) return Natural;
54 function Length (Q : in Queue) return Natural;
57 function Is_Empty (Q : in Queue) return Boolean;
60 function Front (Q : in Queue) return Item;
[all …]
/dports/lang/yap/yap-6.2.2/packages/ProbLog/simplecudd_lfi/
H A Dpqueue.c57 Queue q; in QueueApply()
78 Queue q; in QueueApply1()
100 Queue q; in QueueApply2()
123 Queue q; in QueueApply3()
147 Queue q; in QueueCAR()
162 Queue QueueCDR(Queue q) in QueueCDR()
165 Queue q; in QueueCDR()
188 Queue q; in QueueDispose()
230 Queue q; in QueueFind()
254 Queue q; in QueueFindAndRemove()
[all …]
/dports/www/otrs/otrs-rel-6_0_29/scripts/test/GenericInterface/Event/
H A DConditionCheck.t131 Queue => {
341 Queue => {
473 Queue => ['Raw'],
529 Queue => ['Raw'],
570 Queue => ['Raw'],
689 Queue => {
724 Queue => ['Raw'],
767 Queue => ['Raw'],
810 Queue => ['Raw'],
845 Queue => {
[all …]
/dports/irc/ircII/ircii-20210314/source/
H A Dqueue.c60 } Queue; typedef
62 static Queue *lookup_queue(Queue *, u_char *);
64 static Queue *make_new_queue(Queue *, u_char *);
67 static Queue *remove_a_queue(Queue *);
69 static Queue *do_queue(Queue *, int);
77 Queue *tmp; in queuecmd()
191 static Queue *
232 static Queue *
235 Queue *tmp; in make_new_queue()
334 Queue *tmp; in remove_a_queue()
[all …]
/dports/irc/epic5/epic5-2.1.6/source/
H A Dqueue.c57 } Queue; typedef
205 Queue *q; in lookup_queue()
249 Queue * q; in display_all_queues()
263 Queue *q; in list_queue()
276 Queue *q; in list_all_queues()
298 newq = (Queue *)new_malloc(sizeof(Queue)); in add_queue()
314 Queue *q, *p; in delete_queue()
344 Queue *q; in run_one_queue()
363 Queue *q; in run_queue()
379 Queue *q; in add_to_queue()
[all …]
/dports/audio/strawberry/strawberry-1.0.0/src/queue/
H A Dqueue.cpp50 …signal_item_count_changed_ = QObject::connect(this, &Queue::ItemCountChanged, this, &Queue::Update… in Queue()
51 QObject::connect(this, &Queue::TotalLengthChanged, this, &Queue::UpdateSummaryText); in Queue()
116 void Queue::SourceLayoutChanged() { in SourceLayoutChanged()
231 void Queue::UpdateTotalLength() { in UpdateTotalLength()
250 void Queue::UpdateSummaryText() { in UpdateSummaryText()
266 void Queue::Clear() { in Clear()
318 void Queue::MoveUp(int row) { in MoveUp()
322 void Queue::MoveDown(int row) { in MoveDown()
326 QStringList Queue::mimeTypes() const { in mimeTypes()
424 int Queue::PeekNext() const { in PeekNext()
[all …]
/dports/net/jgroups/jgroups-2.12.0/tests/junit-functional/org/jgroups/tests/
H A DQueueTest.java26 final Queue queue=new Queue(); in testQueue()
58 final Queue queue=new Queue(); in testCloseWithoutFlush()
66 final Queue queue=new Queue(); in testCloseWithFlush()
74 final Queue queue=new Queue(); in testCloseWithFlush2()
90 final Queue queue=new Queue(); in testValues()
107 final Queue queue=new Queue(); in testLargeInsertion()
127 final Queue queue=new Queue(); in testEmptyQueue()
134 final Queue queue=new Queue(); in testAddAll()
152 final Queue queue=new Queue(); in testInsertionAndRemoval()
183 final Queue queue=new Queue(); in testWaitUntilClosed()
[all …]
/dports/irc/epic4/epic4-2.10.9/source/
H A Dqueue.c58 } Queue; typedef
198 static Queue * lookup_queue (Queue **list, const char *name) in lookup_queue()
200 Queue *q; in lookup_queue()
244 Queue * q; in display_all_queues()
258 Queue *q; in list_queue()
271 Queue *q; in list_all_queues()
293 newq = (Queue *)new_malloc(sizeof(Queue)); in add_queue()
309 Queue *q, *p; in delete_queue()
339 Queue *q; in run_queue()
357 Queue *q; in add_to_queue()
[all …]
/dports/www/otrs/otrs-rel-6_0_29/scripts/test/Ticket/TicketACL/
H A DAction.t110 Queue => {
139 Queue => {
165 Queue => {
189 Queue => {
218 Queue => {
247 Queue => {
276 Queue => {
305 Queue => {
336 Queue => {
346 Queue => {
[all …]
/dports/devel/kf5-threadweaver/threadweaver-5.89.0/autotests/
H A DJobTests.cpp53 Queue weaver; in WeaverLazyThreadCreationTest()
68 Queue weaver; in ReduceWorkerCountTest()
100 Queue::instance()->finish(); in SimpleJobTest()
115 Queue::instance()->finish(); in SimpleJobCollectionTest()
130 Queue::instance()->finish(); in EmptyJobCollectionTest()
143 Queue weaver; in CollectionQueueingTest()
193 Queue::instance()->finish(); in GeneratingCollectionTest()
209 Queue::instance()->finish(); in ShortJobSequenceTest()
219 Queue queue(logger); in ShortDecoratedJobSequenceTest()
898 Queue weaver; in DequeueSuspendedSequenceTest()
[all …]
/dports/devel/hadoop2/hadoop-2.7.2-src/hadoop-mapreduce-project/hadoop-mapreduce-client/hadoop-mapreduce-client-core/src/main/java/org/apache/hadoop/mapred/
H A DQueue.java37 class Queue implements Comparable<Queue>{ class
56 private Set<Queue> children;
64 Queue() { in Queue() method in Queue
176 void addChild(Queue child) { in addChild()
188 Set<Queue> getChildren() { in getChildren()
220 Map<String,Queue> l = new HashMap<String,Queue>(); in getInnerQueues()
229 for(Queue child:children) { in getInnerQueues()
251 Map<String,Queue> l = new HashMap<String,Queue>(); in getLeafQueues()
257 for(Queue child:children) { in getLeafQueues()
274 if(! (o instanceof Queue)) { in equals()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/lldb/source/Target/
H A DQueue.cpp18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
30 Queue::~Queue() = default;
32 queue_id_t Queue::GetID() { return m_queue_id; } in GetID()
34 const char *Queue::GetName() { in GetName()
38 uint32_t Queue::GetIndexID() { return m_queue_id; } in GetIndexID()
40 std::vector<lldb::ThreadSP> Queue::GetThreads() { in GetThreads()
53 void Queue::SetNumRunningWorkItems(uint32_t count) { in SetNumRunningWorkItems()
57 uint32_t Queue::GetNumRunningWorkItems() const { in GetNumRunningWorkItems()
65 uint32_t Queue::GetNumPendingWorkItems() const { in GetNumPendingWorkItems()
73 addr_t Queue::GetLibdispatchQueueAddress() const { in GetLibdispatchQueueAddress()
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/lldb/source/Target/
H A DQueue.cpp18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
30 Queue::~Queue() = default;
32 queue_id_t Queue::GetID() { return m_queue_id; } in GetID()
34 const char *Queue::GetName() { in GetName()
38 uint32_t Queue::GetIndexID() { return m_queue_id; } in GetIndexID()
40 std::vector<lldb::ThreadSP> Queue::GetThreads() { in GetThreads()
53 void Queue::SetNumRunningWorkItems(uint32_t count) { in SetNumRunningWorkItems()
57 uint32_t Queue::GetNumRunningWorkItems() const { in GetNumRunningWorkItems()
65 uint32_t Queue::GetNumPendingWorkItems() const { in GetNumPendingWorkItems()
73 addr_t Queue::GetLibdispatchQueueAddress() const { in GetLibdispatchQueueAddress()
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/lldb/source/Target/
H A DQueue.cpp18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
30 Queue::~Queue() = default;
32 queue_id_t Queue::GetID() { return m_queue_id; } in GetID()
34 const char *Queue::GetName() { in GetName()
38 uint32_t Queue::GetIndexID() { return m_queue_id; } in GetIndexID()
40 std::vector<lldb::ThreadSP> Queue::GetThreads() { in GetThreads()
53 void Queue::SetNumRunningWorkItems(uint32_t count) { in SetNumRunningWorkItems()
57 uint32_t Queue::GetNumRunningWorkItems() const { in GetNumRunningWorkItems()
65 uint32_t Queue::GetNumPendingWorkItems() const { in GetNumPendingWorkItems()
73 addr_t Queue::GetLibdispatchQueueAddress() const { in GetLibdispatchQueueAddress()
[all …]

12345678910>>...535