- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 189 for aquele (0.23 sec)
-
internal/event/config_test.go
</S3Key> </Filter> <Queue>arn:minio:sqs:us-east-1:1:webhook</Queue> <Event>s3:ObjectCreated:Put</Event> </QueueConfiguration>`) queue2 := &Queue{} if err := xml.Unmarshal(data, queue2); err != nil { panic(err) } data = []byte(` <QueueConfiguration> <Id>1</Id> <Filter></Filter> <Queue>arn:minio:sqs:eu-west-2:1:webhook</Queue> <Event>s3:ObjectAccessed:*</Event>
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Tue Dec 05 10:16:33 GMT 2023 - 29K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SequentialExecutor.java
private final Executor executor; @GuardedBy("queue") private final Deque<Runnable> queue = new ArrayDeque<>(); /** see {@link WorkerRunningState} */ @LazyInit @GuardedBy("queue") private WorkerRunningState workerRunningState = IDLE; /** * This counter prevents an ABA issue where a thread may successfully schedule the worker, the * worker runs and exhausts the queue, another thread enqueues a task and fails to schedule the
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 10.6K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
* formally, removes an element {@code e} such that {@code o.equals(e)}, if this queue contains * one or more such elements. Returns {@code true} if and only if this queue contained the * specified element (or equivalently, if this queue changed as a result of the call). * * @param o element to be removed from this queue, if present
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 19.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
assertEquals(6, queue.size()); assertEquals(8, queue.capacity()); checkUnbounded(queue); checkNatural(queue); } public void testCreation_maximumSize_withContents() { MinMaxPriorityQueue<Integer> queue = rawtypeToWildcard(MinMaxPriorityQueue.maximumSize(42)).create(NUMBERS); assertEquals(6, queue.size()); assertEquals(11, queue.capacity()); assertEquals(42, queue.maximumSize);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/MinMaxPriorityQueueBenchmark.java
@Param({"100", "10000"}) private int size; @Param private HeapType heap; private Queue<Integer> queue; private final Random random = new Random(); @BeforeExperiment void setUp() { queue = heap.create(comparator.get()); for (int i = 0; i < size; i++) { queue.add(random.nextInt()); } } @Benchmark void pollAndAdd(int reps) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 4.3K bytes - Viewed (0) -
android/guava/src/com/google/common/eventbus/Dispatcher.java
// This dispatcher matches the original dispatch behavior of EventBus. /** Per-thread queue of events to dispatch. */ private final ThreadLocal<Queue<Event>> queue = new ThreadLocal<Queue<Event>>() { @Override protected Queue<Event> initialValue() { return Queues.newArrayDeque(); } };
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 7.3K bytes - Viewed (0) -
docs/bucket/notifications/README.md
result = channel.queue_declare(exclusive=False) queue_name = result.method.queue channel.queue_bind(exchange='bucketevents', queue=queue_name) print(' [*] Waiting for logs. To exit press CTRL+C') def callback(ch, method, properties, body): print(" [x] %r" % body) channel.basic_consume(callback, queue=queue_name, no_ack=False)
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Jan 18 07:03:17 GMT 2024 - 84K bytes - Viewed (2) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
/** * A bounded {@linkplain BlockingQueue blocking queue} backed by an array. This queue orders * elements FIFO (first-in-first-out). The head of the queue is that element that has been * on the queue the longest time. The tail of the queue is that element that has been on * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue * retrieval operations obtain elements at the head of the queue.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Queues.java
* * @param queue the queue to be wrapped in a synchronized view * @return a synchronized view of the specified queue * @since 14.0 */ public static <E extends @Nullable Object> Queue<E> synchronizedQueue(Queue<E> queue) { return Synchronized.queue(queue, null); } /** * Returns a synchronized (thread-safe) deque backed by the specified deque. In order to guarantee
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 16K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/concurrent/TaskLogger.kt
startNs = queue.taskRunner.backend.nanoTime() log(task, queue, "starting") } var completedNormally = false try { val result = block() completedNormally = true return result } finally { if (loggingEnabled) { val elapsedNs = queue.taskRunner.backend.nanoTime() - startNs if (completedNormally) { log(task, queue, "finished run in ${formatDuration(elapsedNs)}")
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 2.6K bytes - Viewed (0)