/dports/misc/molequeue/molequeue-0.9.0/molequeue/app/testing/ |
H A D | queueremotetest.cpp | 39 DummyQueueRemote *m_queue; member in QueueRemoteTest 73 m_queue->addProgram(program); in initTestCase() 93 m_queue->setHostName(testString); in sanityCheck() 96 m_queue->setUserName(testString); in sanityCheck() 98 m_queue->setSshPort(6887); in sanityCheck() 132 m_queue->killJob(Job()); in testKillJob() 136 m_queue->killJob(job); in testKillJob() 141 m_queue->killJob(job); in testKillJob() 162 m_queue->submitPendingJobs(); in testSubmissionPipeline() 174 m_queue->submitJob(job); in testSubmissionPipeline() [all …]
|
H A D | sgetest.cpp | 26 MoleQueue::QueueSge m_queue; member in QueueSgeTest 63 m_queue.setHostName(testString); in sanityCheck() 64 QCOMPARE(m_queue.hostName(), testString); in sanityCheck() 66 m_queue.setUserName(testString); in sanityCheck() 67 QCOMPARE(m_queue.userName(), testString); in sanityCheck() 68 m_queue.setSshPort(6887); in sanityCheck() 69 QCOMPARE(m_queue.sshPort(), 6887); in sanityCheck() 71 m_queue.setWorkingDirectoryBase(testString); in sanityCheck() 74 m_queue.setSubmissionCommand(testString); in sanityCheck() 75 QCOMPARE(m_queue.submissionCommand(), testString); in sanityCheck() [all …]
|
H A D | pbstest.cpp | 26 MoleQueue::QueuePbs m_queue; member in QueuePbsTest 63 m_queue.setHostName(testString); in sanityCheck() 64 QCOMPARE(m_queue.hostName(), testString); in sanityCheck() 66 m_queue.setUserName(testString); in sanityCheck() 67 QCOMPARE(m_queue.userName(), testString); in sanityCheck() 68 m_queue.setSshPort(6887); in sanityCheck() 69 QCOMPARE(m_queue.sshPort(), 6887); in sanityCheck() 71 m_queue.setWorkingDirectoryBase(testString); in sanityCheck() 74 m_queue.setSubmissionCommand(testString); in sanityCheck() 75 QCOMPARE(m_queue.submissionCommand(), testString); in sanityCheck() [all …]
|
/dports/misc/py-molequeue/molequeue-0.9.0/molequeue/app/testing/ |
H A D | queueremotetest.cpp | 39 DummyQueueRemote *m_queue; member in QueueRemoteTest 73 m_queue->addProgram(program); in initTestCase() 93 m_queue->setHostName(testString); in sanityCheck() 96 m_queue->setUserName(testString); in sanityCheck() 98 m_queue->setSshPort(6887); in sanityCheck() 132 m_queue->killJob(Job()); in testKillJob() 136 m_queue->killJob(job); in testKillJob() 141 m_queue->killJob(job); in testKillJob() 162 m_queue->submitPendingJobs(); in testSubmissionPipeline() 174 m_queue->submitJob(job); in testSubmissionPipeline() [all …]
|
H A D | sgetest.cpp | 26 MoleQueue::QueueSge m_queue; member in QueueSgeTest 63 m_queue.setHostName(testString); in sanityCheck() 64 QCOMPARE(m_queue.hostName(), testString); in sanityCheck() 66 m_queue.setUserName(testString); in sanityCheck() 67 QCOMPARE(m_queue.userName(), testString); in sanityCheck() 68 m_queue.setSshPort(6887); in sanityCheck() 69 QCOMPARE(m_queue.sshPort(), 6887); in sanityCheck() 71 m_queue.setWorkingDirectoryBase(testString); in sanityCheck() 74 m_queue.setSubmissionCommand(testString); in sanityCheck() 75 QCOMPARE(m_queue.submissionCommand(), testString); in sanityCheck() [all …]
|
H A D | pbstest.cpp | 26 MoleQueue::QueuePbs m_queue; member in QueuePbsTest 63 m_queue.setHostName(testString); in sanityCheck() 64 QCOMPARE(m_queue.hostName(), testString); in sanityCheck() 66 m_queue.setUserName(testString); in sanityCheck() 67 QCOMPARE(m_queue.userName(), testString); in sanityCheck() 68 m_queue.setSshPort(6887); in sanityCheck() 69 QCOMPARE(m_queue.sshPort(), 6887); in sanityCheck() 71 m_queue.setWorkingDirectoryBase(testString); in sanityCheck() 74 m_queue.setSubmissionCommand(testString); in sanityCheck() 75 QCOMPARE(m_queue.submissionCommand(), testString); in sanityCheck() [all …]
|
/dports/biology/avida/avida-2.12.4-src/avida-core/source/analyze/ |
H A D | cAnalyzeJobWorker.cc | 36 m_queue->m_mutex.Lock(); in Run() 37 while (m_queue->m_jobs == 0) { in Run() 38 m_queue->m_cond.Wait(m_queue->m_mutex); in Run() 40 job = m_queue->m_queue.Pop(); in Run() 41 m_queue->m_jobs--; in Run() 42 m_queue->m_pending++; in Run() 43 m_queue->m_mutex.Unlock(); in Run() 50 m_queue->m_mutex.Lock(); in Run() 52 m_queue->m_mutex.Unlock(); in Run() 56 m_queue->m_mutex.Lock(); in Run() [all …]
|
/dports/graphics/electricsheep/electricsheep-37ba0fd692d6581f8fe009ed11c9650cd8174123/client_generic/Common/ |
H A D | BlockingQueue.h | 63 el = m_queue.front(); 68 el = m_queue.back(); 75 if (m_queue.empty()) 85 el = m_queue[n]; in peekn() 102 if (m_queue.empty()) 114 m_queue.pop_front(); 118 el = m_queue.back(); 119 m_queue.pop_back(); 125 if (m_queue.empty()) 149 m_queue.clear(); in clear() [all …]
|
/dports/net/ns3/ns-allinone-3.35/ns-3.35/src/aodv/model/ |
H A D | aodv-rqueue.cc | 44 return m_queue.size (); in GetSize() 52 != m_queue.end (); ++i) in Enqueue() 65 m_queue.erase (m_queue.begin ()); in Enqueue() 67 m_queue.push_back (entry); in Enqueue() 77 != m_queue.end (); ++i) in DropPacketWithDst() 84 auto new_end = std::remove_if (m_queue.begin (), m_queue.end (), in DropPacketWithDst() 86 m_queue.erase (new_end, m_queue.end ()); in DropPacketWithDst() 93 for (std::vector<QueueEntry>::iterator i = m_queue.begin (); i != m_queue.end (); ++i) in Dequeue() 98 m_queue.erase (i); in Dequeue() 109 != m_queue.end (); ++i) in Find() [all …]
|
/dports/lang/mono/mono-5.10.1.57/mcs/class/RabbitMQ.Client/src/util/ |
H A D | SharedQueue.cs | 85 lock (m_queue) { in Close() 87 Monitor.PulseAll(m_queue); in Close() 107 lock (m_queue) { in Enqueue() 109 m_queue.Enqueue(o); in Enqueue() 110 Monitor.Pulse(m_queue); in Enqueue() 122 lock (m_queue) { in Dequeue() 127 return m_queue.Dequeue(); in Dequeue() 153 lock (m_queue) { in DequeueNoWait() 206 lock (m_queue) { in Dequeue() 237 protected SharedQueue m_queue; field in RabbitMQ.Util.SharedQueueEnumerator [all …]
|
/dports/net/ns3/ns-allinone-3.35/ns-3.35/src/dsdv/model/ |
H A D | dsdv-packet-queue.cc | 47 return m_queue.size (); in GetSize() 57 != m_queue.end (); ++i) in Enqueue() 89 != m_queue.end (); ++i) in DropPacketWithDst() 96 auto new_end = std::remove_if (m_queue.begin (), m_queue.end (), [&](const QueueEntry& en) in DropPacketWithDst() 98 m_queue.erase (new_end, m_queue.end ()); in DropPacketWithDst() 106 for (std::vector<QueueEntry>::iterator i = m_queue.begin (); i != m_queue.end (); ++i) in Dequeue() 111 m_queue.erase (i); in Dequeue() 122 != m_queue.end (); ++i) in Find() 138 != m_queue.end (); ++i) in GetCountForPacketsWithDst() 172 != m_queue.end (); ++i) in Purge() [all …]
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/sat/ |
H A D | sat_var_queue.h | 32 heap<lt> m_queue; variable 37 if (m_queue.contains(v)) in activity_increased_eh() 38 m_queue.decreased(v); in activity_increased_eh() 42 if (m_queue.contains(v)) { in activity_changed_eh() 51 m_queue.reserve(v+1); in mk_var_eh() 52 m_queue.insert(v); in mk_var_eh() 56 if (m_queue.contains(v)) in del_var_eh() 57 m_queue.erase(v); in del_var_eh() 61 if (!m_queue.contains(v)) in unassign_var_eh() 62 m_queue.insert(v); in unassign_var_eh() [all …]
|
/dports/math/z3/z3-z3-4.8.13/src/util/ |
H A D | var_queue.h | 33 heap<lt> m_queue; variable 40 if (m_queue.contains(v)) in activity_increased_eh() 41 m_queue.decreased(v); in activity_increased_eh() 45 if (m_queue.contains(v)) { in activity_changed_eh() 54 m_queue.reserve(v+1); in mk_var_eh() 55 m_queue.insert(v); in mk_var_eh() 59 if (m_queue.contains(v)) in del_var_eh() 60 m_queue.erase(v); in del_var_eh() 64 if (!m_queue.contains(v)) in unassign_var_eh() 65 m_queue.insert(v); in unassign_var_eh() [all …]
|
/dports/devel/libassa/libassa-3.5.1/assa/ |
H A D | PriorityQueue_Heap.h | 98 ::memcpy (m_queue, h_.m_queue, sizeof(T)*m_curr); in PriorityQueue_Heap() 112 ::memcpy (m_queue, h_.m_queue, sizeof(T)*m_curr); 143 m_queue[0] = 0; in upheap() 146 m_queue[k_] = m_queue[k_/2]; in upheap() 149 m_queue[k_] = v; in upheap() 157 T v = m_queue[1]; in pop() 158 m_queue[1] = m_queue[--m_curr]; in pop() 185 if (j < m_curr && m_comp (m_queue[j+1], m_queue[j])) in downheap() 189 m_queue[k_] = m_queue[j]; in downheap() 192 m_queue[k_] = v; in downheap() [all …]
|
H A D | TimerQueue.cpp | 24 while (m_queue.size ()) { in ~TimerQueue() 25 delete m_queue.pop (); in ~TimerQueue() 55 tmr = m_queue[i]; in remove() 56 m_queue.remove (tmr); in remove() 77 Timer* tmr = m_queue[i]; in remove() 96 while (m_queue.size () && (tp = m_queue.top ()) != (Timer*) NULL) { in expire() 107 m_queue.pop (); in expire() 120 m_queue.insert (tp); in expire() 146 m_queue.insert (t); in insert() 156 if (m_queue.size() == 0) { in dump() [all …]
|
/dports/games/minetest/minetest-5.4.1/src/util/ |
H A D | container.h | 51 m_queue.push(value); in push_back() 60 m_queue.pop(); in pop_front() 70 return m_queue.size(); in size() 142 m_queue.push_back(t); in push_back() 155 m_queue.pop_front(); in pop_frontNoEx() 168 m_queue.pop_front(); in pop_front() 182 m_queue.pop_front(); in pop_frontNoEx() 192 m_queue.pop_back(); 208 m_queue.pop_back(); in pop_backNoEx() 222 m_queue.pop_back(); in pop_backNoEx() [all …]
|
/dports/misc/py-molequeue/molequeue-0.9.0/molequeue/app/ |
H A D | remotequeuewidget.cpp | 43 m_queue(queue), in RemoteQueueWidget() 113 m_queue->setSshPort(ui->spinSshPort->value()); in save() 118 m_queue->setLaunchTemplate(text); in save() 134 int walltime = m_queue->defaultMaxWallTime(); in reset() 142 ui->spinSshPort->setValue(m_queue->sshPort()); in reset() 258 if (m_queue->hostName().isEmpty()) in sleepTest() 260 else if (m_queue->userName().isEmpty()) in sleepTest() 264 else if (m_queue->killCommand().isEmpty()) in sleepTest() 282 sleepProgram = new Program (m_queue); in sleepTest() 288 m_queue->addProgram(sleepProgram); in sleepTest() [all …]
|
/dports/misc/molequeue/molequeue-0.9.0/molequeue/app/ |
H A D | remotequeuewidget.cpp | 43 m_queue(queue), in RemoteQueueWidget() 113 m_queue->setSshPort(ui->spinSshPort->value()); in save() 118 m_queue->setLaunchTemplate(text); in save() 134 int walltime = m_queue->defaultMaxWallTime(); in reset() 142 ui->spinSshPort->setValue(m_queue->sshPort()); in reset() 258 if (m_queue->hostName().isEmpty()) in sleepTest() 260 else if (m_queue->userName().isEmpty()) in sleepTest() 264 else if (m_queue->killCommand().isEmpty()) in sleepTest() 282 sleepProgram = new Program (m_queue); in sleepTest() 288 m_queue->addProgram(sleepProgram); in sleepTest() [all …]
|
/dports/games/springlobby/springlobby-0.180/src/lsl/src/lslutils/ |
H A D | thread.cpp | 22 return m_queue->Remove( this ); in Cancel() 29 m_queue.push_back( item ); in Push() 30 std::push_heap( m_queue.begin(), m_queue.end(), WorkItemCompare() ); in Push() 31 item->m_queue = this; in Push() 40 std::pop_heap( m_queue.begin(), m_queue.end(), WorkItemCompare() ); in Pop() 41 m_queue.pop_back(); in Pop() 42 item->m_queue = NULL; in Pop() 52 std::remove( m_queue.begin(), m_queue.end(), item ); in Remove() 55 m_queue.erase( new_end, m_queue.end() ); in Remove() 57 std::make_heap( m_queue.begin(), m_queue.end(), WorkItemCompare() ); in Remove() [all …]
|
/dports/databases/percona57-server/percona-server-5.7.36-39/unittest/gunit/ |
H A D | bounded_queue_c.h | 58 memset(&m_queue, 0, sizeof(m_queue)); in Bounded_QUEUE() 63 delete_queue(&m_queue); in ~Bounded_QUEUE() 123 if (queue_is_full((&m_queue))) in pop() 124 queue_remove(&m_queue, 0); in pop() 125 assert(m_queue.elements > 0); in pop() 126 if (m_queue.elements == 0) in pop() 145 st_queue m_queue; variable 174 return init_queue(&m_queue, (uint) max_elements + 1, in init() 186 if (queue_is_full((&m_queue))) in push() 191 queue_replaced(&m_queue); in push() [all …]
|
/dports/databases/xtrabackup/percona-xtrabackup-2.4.21/unittest/gunit/ |
H A D | bounded_queue_c.h | 58 memset(&m_queue, 0, sizeof(m_queue)); in Bounded_QUEUE() 63 delete_queue(&m_queue); in ~Bounded_QUEUE() 123 if (queue_is_full((&m_queue))) in pop() 124 queue_remove(&m_queue, 0); in pop() 125 DBUG_ASSERT(m_queue.elements > 0); in pop() 126 if (m_queue.elements == 0) in pop() 145 st_queue m_queue; variable 174 return init_queue(&m_queue, (uint) max_elements + 1, in init() 186 if (queue_is_full((&m_queue))) in push() 191 queue_replaced(&m_queue); in push() [all …]
|
/dports/databases/percona57-client/percona-server-5.7.36-39/unittest/gunit/ |
H A D | bounded_queue_c.h | 58 memset(&m_queue, 0, sizeof(m_queue)); in Bounded_QUEUE() 63 delete_queue(&m_queue); in ~Bounded_QUEUE() 123 if (queue_is_full((&m_queue))) in pop() 124 queue_remove(&m_queue, 0); in pop() 125 assert(m_queue.elements > 0); in pop() 126 if (m_queue.elements == 0) in pop() 145 st_queue m_queue; variable 174 return init_queue(&m_queue, (uint) max_elements + 1, in init() 186 if (queue_is_full((&m_queue))) in push() 191 queue_replaced(&m_queue); in push() [all …]
|
/dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/unittest/gunit/ |
H A D | bounded_queue_c.h | 58 memset(&m_queue, 0, sizeof(m_queue)); in Bounded_QUEUE() 63 delete_queue(&m_queue); in ~Bounded_QUEUE() 123 if (queue_is_full((&m_queue))) in pop() 124 queue_remove(&m_queue, 0); in pop() 125 assert(m_queue.elements > 0); in pop() 126 if (m_queue.elements == 0) in pop() 145 st_queue m_queue; variable 174 return init_queue(&m_queue, (uint) max_elements + 1, in init() 186 if (queue_is_full((&m_queue))) in push() 191 queue_replaced(&m_queue); in push() [all …]
|
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/unittest/gunit/ |
H A D | bounded_queue_c.h | 58 memset(&m_queue, 0, sizeof(m_queue)); in Bounded_QUEUE() 63 delete_queue(&m_queue); in ~Bounded_QUEUE() 123 if (queue_is_full((&m_queue))) in pop() 124 queue_remove(&m_queue, 0); in pop() 125 assert(m_queue.elements > 0); in pop() 126 if (m_queue.elements == 0) in pop() 145 st_queue m_queue; variable 174 return init_queue(&m_queue, (uint) max_elements + 1, in init() 186 if (queue_is_full((&m_queue))) in push() 191 queue_replaced(&m_queue); in push() [all …]
|
/dports/audio/amarok/amarok-3e11ccdd1417e70486eaaa84d8475182eec44c20/src/playlist/navigators/ |
H A D | TrackNavigator.cpp | 49 if( !m_queue.contains( id ) ) in queueIds() 50 m_queue.enqueue( id ); in queueIds() 57 m_queue.removeAll( id ); in dequeueId() 66 quint64 temp = m_queue[ idx - 1 ]; in queueMoveUp() 67 m_queue[ idx - 1 ] = m_queue[ idx ]; in queueMoveUp() 68 m_queue[ idx ] = temp; in queueMoveUp() 79 m_queue[ idx + 1 ] = m_queue[ idx ]; in queueMoveDown() 80 m_queue[ idx ] = temp; in queueMoveDown() 87 return m_queue.indexOf( id ); in queuePosition() 92 return m_queue; in queue() [all …]
|