- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 16 for FIFO (0.3 sec)
-
cmd/bucket-quota.go
} if !quotaCfg.IsValid() { if quotaCfg.Type == "fifo" { internalLogIf(GlobalContext, errors.New("Detected older 'fifo' quota config, 'fifo' feature is removed and not supported anymore. Please clear your quota configs using 'mc admin bucket quota alias/bucket --clear' and use 'mc ilm add' for expiration of objects"), logger.WarningKind) return quotaCfg, fmt.Errorf("invalid quota type 'fifo'") }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 4.3K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
import java.util.concurrent.TimeUnit; import org.checkerframework.checker.nullness.qual.Nullable; /** * 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
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SequentialExecutor.java
* Executor, and sequentially such that no two will ever be running at the same time. * * <p>Tasks submitted to {@link #execute(Runnable)} are executed in FIFO order. * * <p>The execution of tasks is done by one thread as long as there are tasks left in the queue. * When a task is {@linkplain Thread#interrupt interrupted}, execution of subsequent tasks
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/MonitorBasedArrayBlockingQueue.java
import java.util.concurrent.TimeUnit; import org.checkerframework.checker.nullness.qual.Nullable; /** * 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
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) -
tensorflow/c/c_api_experimental.h
size_t* len); // On success, dequeues a tensor from a TF-managed FifoQueue given by // `tensor_id`, associated with `session`. There must be a graph node named // "fifo_queue_dequeue_<tensor_id>", to be executed by this API call. // Caller must call TF_DeleteTensor() over the returned tensor. If the queue is // empty, this call is blocked. //
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Thu Apr 27 21:07:00 GMT 2023 - 15.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/EvictingQueue.java
import java.util.Queue; /** * A non-blocking queue which automatically evicts elements from the head of the queue when * attempting to add new elements onto the queue and it is full. This queue orders elements FIFO * (first-in-first-out). This data structure is logically equivalent to a circular buffer (i.e., * cyclic buffer or ring buffer). *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri May 12 17:52:55 GMT 2023 - 4.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/EvictingQueue.java
import java.util.Queue; /** * A non-blocking queue which automatically evicts elements from the head of the queue when * attempting to add new elements onto the queue and it is full. This queue orders elements FIFO * (first-in-first-out). This data structure is logically equivalent to a circular buffer (i.e., * cyclic buffer or ring buffer). *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri May 12 17:52:55 GMT 2023 - 4.6K bytes - Viewed (0) -
tensorflow/c/c_api_experimental.cc
<< session->graph->graph.ToGraphDefDebug().DebugString(); } TF_Operation* dequeue_op = TF_GraphOperationByName( session->graph, tensorflow::strings::StrCat("fifo_queue_dequeue_", tensor_id).c_str()); if (dequeue_op == nullptr) { status->status = tensorflow::errors::Internal( "Unable to find the dequeue node in the TF graph."); return nullptr; }
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 29.4K bytes - Viewed (0) -
src/archive/tar/common.go
TypeLink = '1' // Hard link TypeSymlink = '2' // Symbolic link TypeChar = '3' // Character device node TypeBlock = '4' // Block device node TypeDir = '5' // Directory TypeFifo = '6' // FIFO node // Type '7' is reserved. TypeCont = '7' // Type 'x' is used by the PAX format to store key-value records that // are only relevant to the next file. // This package transparently handles these types.
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Mar 15 16:01:50 GMT 2024 - 24.7K bytes - Viewed (2) -
src/archive/tar/tar_test.go
// directory. h: &Header{ Name: "dir/", Mode: 0755, Size: 0, ModTime: time.Unix(1360601116, 0), Typeflag: TypeDir, }, fm: 0755 | fs.ModeDir, }, { // fifo node. h: &Header{ Name: "dev/initctl", Mode: 0600, Size: 0, ModTime: time.Unix(1360578949, 0), Typeflag: TypeFifo, }, fm: 0600 | fs.ModeNamedPipe, }, {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Mar 15 16:01:50 GMT 2024 - 24K bytes - Viewed (0)