- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 3,203 for Jill (0.26 sec)
-
cmd/erasure-decode.go
readerToBuf: r2b, stashBuffer: b, } } // Done will release any resources used by the parallelReader. func (p *parallelReader) Done() { if p.stashBuffer != nil { globalBytePoolCap.Load().Put(p.stashBuffer) p.stashBuffer = nil } } // preferReaders can mark readers as preferred. // These will be chosen before others. func (p *parallelReader) preferReaders(prefer []bool) {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 19 16:44:59 GMT 2024 - 9.4K bytes - Viewed (0) -
src/cmd/cgo/internal/test/issue18146.go
if err := syscall.Exec(os.Args[0], argv, os.Environ()); err != nil { t.Fatal(err) } } var cmds []*exec.Cmd defer func() { for _, cmd := range cmds { cmd.Process.Kill() } }() args := append(append([]string(nil), os.Args[1:]...), "-test.run=^Test18146$") for n := attempts; n > 0; n-- { cmd := exec.Command(os.Args[0], args...) cmd.Env = append(os.Environ(), "test18146=exec")
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Tue Sep 05 23:35:32 GMT 2023 - 2.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/Collections2.java
* Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order. * * <p>Duplicate elements are considered equal. For example, the list [1, 1] will have only one * permutation, instead of two. This is why the elements have to implement {@link Comparable}. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
src/main/java/jcifs/pac/PacMac.java
* License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. *
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountHashMap.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 15K bytes - Viewed (0) -
tensorflow/c/eager/immediate_execution_context.h
enum ContextDevicePlacementPolicy { // Running operations with input tensors on the wrong device will fail. DEVICE_PLACEMENT_EXPLICIT = 0, // Copy the tensor to the right device but log a warning. DEVICE_PLACEMENT_WARN = 1, // Silently copy the tensor, which has a performance cost since the operation // will be blocked till the copy completes. This is the default policy. DEVICE_PLACEMENT_SILENT = 2,
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Thu Jul 06 08:34:00 GMT 2023 - 12.3K bytes - Viewed (0) -
tensorflow/c/eager/c_api_unified_experimental.h
TF_Status*); // TF_ExecuteOperation will, if in eager mode, execute, if in graph mode, maybe // capture some inputs and then add a node in the graph. The output tensors are // returned through the provided TF_OutputList. // Any active tape will observe the effects of this execution. void TF_ExecuteOperation(TF_AbstractOp* op, int num_inputs,
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Sun Oct 24 11:27:00 GMT 2021 - 7K bytes - Viewed (0) -
tensorflow/c/eager/c_api_experimental.h
TF_Status* status); // This function will block till the operation that produces `h` has // completed. This is only valid on local TFE_TensorHandles. The pointer // returned will be on the device in which the TFE_TensorHandle resides (so e.g. // for a GPU tensor this will return a pointer to GPU memory). The pointer is
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Wed Feb 21 22:37:46 GMT 2024 - 39.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java
LoadingCache<Integer, Integer> cache; int max; static AtomicLong requests = new AtomicLong(0); static AtomicLong misses = new AtomicLong(0); @BeforeExperiment void setUp() { // random integers will be generated in this range, then raised to the // power of (1/concentration) and floor()ed max = Ints.checkedCast((long) Math.pow(distinctKeys, concentration)); cache = CacheBuilder.newBuilder()
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.4K bytes - Viewed (0) -
tensorflow/c/experimental/filesystem/plugins/gcs/ram_file_block_cache_test.cc
TF_EXPECT_OK(ReadCache(&cache, "", 0, block_size, &out)); EXPECT_TRUE(first_block); EXPECT_EQ(out.size(), block_size); // Reading at offset file_size + 4 will read the second block (since the read // at file_size + 4 = 28 will be aligned to an offset of 16) but will return // OutOfRange because the offset is past the end of the 24-byte file. Status status = ReadCache(&cache, "", file_size + 4, 4, &out);
C++ - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Fri Oct 15 03:16:57 GMT 2021 - 23.2K bytes - Viewed (0)