Home
last modified time | relevance | path

Searched full:queue (Results 1 – 25 of 2490) sorted by relevance

12345678910>>...100

/external/antlr/antlr-3.4/runtime/ObjC/Framework/test/runtime/misc/
DANTLRFastQueueTest.m18 ANTLRFastQueue *queue = [[ANTLRFastQueue newANTLRFastQueue] retain];
19 STAssertNotNil(queue, @"Queue was not created and was nil");
20 [queue release];
25 ANTLRFastQueue *queue = [[ANTLRFastQueue newANTLRFastQueue] retain];
26 STAssertNotNil(queue, @"Queue was not created and was nil");
27 [queue addObject:@"My String"];
28 …STAssertTrue([[queue objectAtIndex:0] isKindOfClass:[NSString class]], @"First object is not a NSS…
29 STAssertEquals([queue objectAtIndex:0], @"My String", @"Object at index zero is invalid");
30 STAssertTrue([queue size] == 1, @"Queue is the wrong size: %d", [queue size]);
31 [queue release];
[all …]
/external/chromium_org/media/base/
Ddecoder_buffer_queue_unittest.cc36 DecoderBufferQueue queue; in TEST() local
37 EXPECT_TRUE(queue.IsEmpty()); in TEST()
39 queue.Push(CreateBuffer(0)); in TEST()
40 EXPECT_FALSE(queue.IsEmpty()); in TEST()
44 DecoderBufferQueue queue; in TEST() local
45 queue.Push(CreateBuffer(0)); in TEST()
46 queue.Push(CreateBuffer(1)); in TEST()
47 EXPECT_FALSE(queue.IsEmpty()); in TEST()
48 EXPECT_EQ(1, queue.Duration().InSeconds()); in TEST()
50 queue.Clear(); in TEST()
[all …]
/external/chromium_org/media/midi/
Dmidi_message_queue_unittest.cc31 void Add(MidiMessageQueue* queue, const T(&array)[N]) { in Add() argument
32 queue->Add(array, N); in Add()
58 MidiMessageQueue queue(false); in TEST() local
60 queue.Get(&message); in TEST()
65 MidiMessageQueue queue(false); in TEST() local
66 Add(&queue, kGMOn); in TEST()
67 Add(&queue, kBrokenData1); in TEST()
68 Add(&queue, kNoteOnWithRunningStatus); in TEST()
69 Add(&queue, kBrokenData2); in TEST()
70 Add(&queue, kChannelPressureWithRunningStatus); in TEST()
[all …]
/external/bluetooth/bluedroid/osi/src/
Dfixed_queue.c69 void fixed_queue_free(fixed_queue_t *queue, fixed_queue_free_cb free_cb) { in fixed_queue_free() argument
70 if (!queue) in fixed_queue_free()
74 …for (const list_node_t *node = list_begin(queue->list); node != list_end(queue->list); node = list… in fixed_queue_free()
77 list_free(queue->list); in fixed_queue_free()
78 semaphore_free(queue->enqueue_sem); in fixed_queue_free()
79 semaphore_free(queue->dequeue_sem); in fixed_queue_free()
80 pthread_mutex_destroy(&queue->lock); in fixed_queue_free()
81 free(queue); in fixed_queue_free()
84 void fixed_queue_enqueue(fixed_queue_t *queue, void *data) { in fixed_queue_enqueue() argument
85 assert(queue != NULL); in fixed_queue_enqueue()
[all …]
/external/chromium_org/chrome/browser/chromeos/drive/
Djob_queue_unittest.cc16 // Create a queue. Number of jobs are initially zero. in TEST()
17 JobQueue queue(kNumMaxConcurrentJobs, kNumPriorityLevels); in TEST() local
18 EXPECT_EQ(0U, queue.GetNumberOfJobs()); in TEST()
21 queue.Push(101, LOW_PRIORITY); in TEST()
22 queue.Push(102, HIGH_PRIORITY); in TEST()
23 queue.Push(103, LOW_PRIORITY); in TEST()
24 queue.Push(104, HIGH_PRIORITY); in TEST()
28 EXPECT_TRUE(queue.PopForRun(LOW_PRIORITY, &id)); in TEST()
30 EXPECT_TRUE(queue.PopForRun(LOW_PRIORITY, &id)); in TEST()
34 EXPECT_TRUE(queue.PopForRun(LOW_PRIORITY, &id)); in TEST()
[all …]
/external/libnl/lib/netfilter/
Dqueue_obj.c2 * lib/netfilter/queue_obj.c Netfilter Queue
14 * @defgroup queue Queue
21 #include <netlink/netfilter/queue.h>
33 struct nfnl_queue *queue = (struct nfnl_queue *) a; in nfnl_queue_dump() local
38 if (queue->ce_mask & QUEUE_ATTR_GROUP) in nfnl_queue_dump()
39 nl_dump(p, "group=%u ", queue->queue_group); in nfnl_queue_dump()
41 if (queue->ce_mask & QUEUE_ATTR_MAXLEN) in nfnl_queue_dump()
42 nl_dump(p, "maxlen=%u ", queue->queue_maxlen); in nfnl_queue_dump()
44 if (queue->ce_mask & QUEUE_ATTR_COPY_MODE) in nfnl_queue_dump()
46 nfnl_queue_copy_mode2str(queue->queue_copy_mode, in nfnl_queue_dump()
[all …]
Dqueue.c2 * lib/netfilter/queue.c Netfilter Queue
14 * @defgroup queue Queue
25 #include <netlink/netfilter/queue.h>
50 * @name Queue Commands
111 static int nfnl_queue_build_request(const struct nfnl_queue *queue, in nfnl_queue_build_request() argument
116 if (!nfnl_queue_test_group(queue)) in nfnl_queue_build_request()
120 0, nfnl_queue_get_group(queue)); in nfnl_queue_build_request()
124 if (nfnl_queue_test_maxlen(queue) && in nfnl_queue_build_request()
126 htonl(nfnl_queue_get_maxlen(queue))) < 0) in nfnl_queue_build_request()
132 if (nfnl_queue_test_copy_mode(queue)) { in nfnl_queue_build_request()
[all …]
/external/chromium_org/third_party/webrtc/base/
Datomicops_unittest.cc30 rtc::FixedSizeLockFreeQueue<int> queue; in TEST() local
31 EXPECT_EQ(0u, queue.capacity()); in TEST()
32 EXPECT_EQ(0u, queue.Size()); in TEST()
33 EXPECT_FALSE(queue.PushBack(1)); in TEST()
35 EXPECT_FALSE(queue.PopFront(&val)); in TEST()
39 rtc::FixedSizeLockFreeQueue<int> queue(5); in TEST() local
40 EXPECT_EQ(5u, queue.capacity()); in TEST()
41 EXPECT_EQ(0u, queue.Size()); in TEST()
43 EXPECT_FALSE(queue.PopFront(&val)); in TEST()
47 rtc::FixedSizeLockFreeQueue<int> queue(2); in TEST() local
[all …]
/external/libcxx/test/containers/container.adaptors/queue/queue.defn/
DAndroid.mk17 test_makefile := external/libcxx/test/containers/container.adaptors/queue/queue.defn/Android.mk
19 test_name := containers/container.adaptors/queue/queue.defn/push
23 test_name := containers/container.adaptors/queue/queue.defn/front
27 test_name := containers/container.adaptors/queue/queue.defn/push_rv
31 test_name := containers/container.adaptors/queue/queue.defn/swap
35 test_name := containers/container.adaptors/queue/queue.defn/front_const
39 test_name := containers/container.adaptors/queue/queue.defn/pop
43 test_name := containers/container.adaptors/queue/queue.defn/assign_copy
47 test_name := containers/container.adaptors/queue/queue.defn/back
51 test_name := containers/container.adaptors/queue/queue.defn/size
[all …]
/external/chromium_org/chrome/browser/extensions/api/identity/
Didentity_mint_queue_unittest.cc34 IdentityMintRequestQueue queue; in TEST() local
40 queue.RequestStart(type, *key, &request1); in TEST()
41 queue.RequestComplete(type, *key, &request1); in TEST()
44 queue.RequestStart(type, *key, &request2); in TEST()
45 queue.RequestComplete(type, *key, &request2); in TEST()
51 IdentityMintRequestQueue queue; in TEST() local
56 queue.RequestStart(type, *key, &request1); in TEST()
57 queue.RequestComplete(type, *key, &request1); in TEST()
63 IdentityMintRequestQueue queue; in TEST() local
70 queue.RequestStart(type, *key, &request1); in TEST()
[all …]
/external/openfst/src/include/fst/script/
Dshortest-path.h71 typedef AutoQueue<StateId> Queue; in ShortestPath() typedef
72 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath() local
74 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts( in ShortestPath()
75 queue, ArcFilter(), opts.nshortest, opts.unique, in ShortestPath()
79 delete queue; in ShortestPath() local
83 typedef FifoQueue<StateId> Queue; in ShortestPath() typedef
84 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath() local
86 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts( in ShortestPath()
87 queue, ArcFilter(), opts.nshortest, opts.unique, in ShortestPath()
91 delete queue; in ShortestPath() local
[all …]
/external/chromium_org/base/synchronization/
Dcondition_variable_unittest.cc254 WorkQueue queue(kThreadCount); // Start the threads. in TEST_F() local
261 base::AutoLock auto_lock(*queue.lock()); in TEST_F()
262 while (!queue.EveryIdWasAllocated()) in TEST_F()
263 queue.all_threads_have_ids()->Wait(); in TEST_F()
268 queue.SpinUntilAllThreadsAreWaiting(); in TEST_F()
272 base::AutoLock auto_lock(*queue.lock()); in TEST_F()
273 EXPECT_EQ(0, queue.GetNumThreadsTakingAssignments()); in TEST_F()
274 EXPECT_EQ(0, queue.GetNumThreadsCompletingTasks()); in TEST_F()
275 EXPECT_EQ(0, queue.task_count()); in TEST_F()
276 EXPECT_EQ(0, queue.GetMaxCompletionsByWorkerThread()); in TEST_F()
[all …]
/external/protobuf/gtest/samples/
Dsample3-inl.h40 // Queue is a simple queue implemented as a singled-linked list.
44 class Queue; variable
46 // QueueNode is a node in a Queue, which consists of an element of
50 friend class Queue<E>; variable
56 // Gets the next node in the queue.
74 class Queue {
77 // Creates an empty queue.
78 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue() function
80 // D'tor. Clears the queue.
81 ~Queue() { Clear(); } in ~Queue()
[all …]
/external/chromium_org/testing/gtest/samples/
Dsample3-inl.h40 // Queue is a simple queue implemented as a singled-linked list.
44 class Queue; variable
46 // QueueNode is a node in a Queue, which consists of an element of
50 friend class Queue<E>; variable
56 // Gets the next node in the queue.
74 class Queue {
76 // Creates an empty queue.
77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue() function
79 // D'tor. Clears the queue.
80 ~Queue() { Clear(); } in ~Queue()
[all …]
/external/bluetooth/bluedroid/osi/include/
Dfixed_queue.h28 // Creates a new fixed queue with the given |capacity|. If more elements than
29 // |capacity| are added to the queue, the caller is blocked until space is
30 // made available in the queue. Returns NULL on failure. The caller must free
31 // the returned queue with |fixed_queue_free|.
34 // Freeing a queue that is currently in use (i.e. has waiters
36 void fixed_queue_free(fixed_queue_t *queue, fixed_queue_free_cb free_cb);
38 // Enqueues the given |data| into the |queue|. The caller will be blocked
39 // if nore more space is available in the queue. Neither |queue| nor |data|
41 void fixed_queue_enqueue(fixed_queue_t *queue, void *data);
43 // Dequeues the next element from |queue|. If the queue is currently empty,
[all …]
/external/smack/src/org/jivesoftware/smackx/workgroup/agent/
DQueueUsersListener.java30 * The status of the queue was updated.
32 * @param queue the workgroup queue.
33 * @param status the status of queue.
35 public void statusUpdated(WorkgroupQueue queue, WorkgroupQueue.Status status); in statusUpdated() argument
38 * The average wait time of the queue was updated.
40 * @param queue the workgroup queue.
41 * @param averageWaitTime the average wait time of the queue.
43 public void averageWaitTimeUpdated(WorkgroupQueue queue, int averageWaitTime); in averageWaitTimeUpdated() argument
46 * The date of oldest entry waiting in the queue was updated.
48 * @param queue the workgroup queue.
[all …]
/external/chromium_org/third_party/WebKit/Source/wtf/
DDoubleBufferedDequeTest.cpp16 DoubleBufferedDeque<int> queue; in TEST() local
18 EXPECT_TRUE(queue.isEmpty()); in TEST()
19 queue.append(1); in TEST()
20 EXPECT_FALSE(queue.isEmpty()); in TEST()
25 DoubleBufferedDeque<int> queue; in TEST() local
26 queue.append(1); in TEST()
28 queue.swapBuffers(); in TEST()
29 EXPECT_TRUE(queue.isEmpty()); in TEST()
34 DoubleBufferedDeque<int> queue; in TEST() local
35 queue.append(1); in TEST()
[all …]
/external/libcxx/test/containers/container.adaptors/queue/queue.cons/
DAndroid.mk17 test_makefile := external/libcxx/test/containers/container.adaptors/queue/queue.cons/Android.mk
19 test_name := containers/container.adaptors/queue/queue.cons/move_noexcept
23 test_name := containers/container.adaptors/queue/queue.cons/ctor_copy
27 test_name := containers/container.adaptors/queue/queue.cons/ctor_container
31 test_name := containers/container.adaptors/queue/queue.cons/default_noexcept
35 test_name := containers/container.adaptors/queue/queue.cons/move_assign_noexcept
39 test_name := containers/container.adaptors/queue/queue.cons/ctor_rcontainer
43 test_name := containers/container.adaptors/queue/queue.cons/ctor_move
47 test_name := containers/container.adaptors/queue/queue.cons/dtor_noexcept
51 test_name := containers/container.adaptors/queue/queue.cons/ctor_default
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/
Dv8-richards.js46 var queue = new Packet(null, ID_WORKER, KIND_WORK);
47 queue = new Packet(queue, ID_WORKER, KIND_WORK);
48 scheduler.addWorkerTask(ID_WORKER, 1000, queue);
50 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
51 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
52 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
53 scheduler.addHandlerTask(ID_HANDLER_A, 2000, queue);
55 queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
56 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
57 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
[all …]
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/
Dv8-richards.js46 var queue = new Packet(null, ID_WORKER, KIND_WORK);
47 queue = new Packet(queue, ID_WORKER, KIND_WORK);
48 scheduler.addWorkerTask(ID_WORKER, 1000, queue);
50 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
51 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
52 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
53 scheduler.addHandlerTask(ID_HANDLER_A, 2000, queue);
55 queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
56 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
57 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
[all …]
/external/chromium_org/v8/benchmarks/
Drichards.js51 var queue = new Packet(null, ID_WORKER, KIND_WORK);
52 queue = new Packet(queue, ID_WORKER, KIND_WORK);
53 scheduler.addWorkerTask(ID_WORKER, 1000, queue);
55 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
56 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
57 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
58 scheduler.addHandlerTask(ID_HANDLER_A, 2000, queue);
60 queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
61 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
62 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
[all …]
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/
Dv8-richards.js46 var queue = new Packet(null, ID_WORKER, KIND_WORK);
47 queue = new Packet(queue, ID_WORKER, KIND_WORK);
48 scheduler.addWorkerTask(ID_WORKER, 1000, queue);
50 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
51 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
52 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
53 scheduler.addHandlerTask(ID_HANDLER_A, 2000, queue);
55 queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
56 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
57 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
[all …]
/external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/tests/
Dv8-richards.html57 var queue = new Packet(null, ID_WORKER, KIND_WORK);
58 queue = new Packet(queue, ID_WORKER, KIND_WORK);
59 scheduler.addWorkerTask(ID_WORKER, 1000, queue);
61 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
62 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
63 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
64 scheduler.addHandlerTask(ID_HANDLER_A, 2000, queue);
66 queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
67 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
68 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
[all …]
/external/libcxx/include/
Dqueue2 //===--------------------------- queue ------------------------------------===//
15 queue synopsis
21 class queue
34 queue() = default;
35 ~queue() = default;
37 queue(const queue& q) = default;
38 queue(queue&& q) = default;
40 queue& operator=(const queue& q) = default;
41 queue& operator=(queue&& q) = default;
43 explicit queue(const container_type& c);
[all …]
/external/smack/src/org/jivesoftware/smackx/workgroup/user/
DWorkgroup.java46 * Provides workgroup services for users. Users can join the workgroup queue, depart the
47 * queue, find status information about their placement in the queue, and register to
89 // Register as a queue listener for internal usage by this instance. in Workgroup()
111 … * Internal handling of an invitation.Recieving an invitation removes the user from the queue. in Workgroup()
143 * Returns true if the user is currently waiting in the workgroup queue.
145 * @return true if currently waiting in the queue.
183 * Returns the users current position in the workgroup queue. A value of 0 means
184 * the user is next in line to be routed; therefore, if the queue position
187 * waiting in the workgroup, or no queue position information is available, -1
190 * @return the user's current position in the workgroup queue, or -1 if the
[all …]

12345678910>>...100