- Sort Score
- Num 10 results
- Language All
Results 111 - 120 of 172 for relocate (0.06 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
tensorflow/c/c_api_experimental.cc
// Update the vector with information from `input_tensors` if provided. if (input_tensors != nullptr) { // Note that we take the address of the elements in `all_input_tensors` // below. Allocate enough space so that no reallocation happens, which will // make the pointers invalid. all_input_tensors.reserve(num_inputs); for (int i = 0; i < num_inputs; ++i) {
Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Sat Oct 04 05:55:32 GMT 2025 - 29.4K bytes - Click Count (0) -
build-tools-internal/src/main/java/org/elasticsearch/gradle/internal/info/GlobalBuildInfoPlugin.java
return getAvailableJavaInstallationLocationSteam().filter(installationLocation -> isSameFile(javaHome, installationLocation)) .findFirst() .orElseThrow(() -> new GradleException("Could not locate available Java installation in Gradle registry at: " + javaHome)); } private boolean isSameFile(File javaHome, InstallationLocation installationLocation) { try {
Created: Wed Apr 08 16:19:15 GMT 2026 - Last Modified: Tue Aug 17 10:02:58 GMT 2021 - 18.1K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/exception/DataStoreCrawlingExceptionTest.java
// Test Error with abort flag String url = "http://example.com/critical-resource"; String message = "Critical memory error during crawling"; OutOfMemoryError error = new OutOfMemoryError("Cannot allocate memory"); DataStoreCrawlingException exception = new DataStoreCrawlingException(url, message, error, true); assertEquals(url, exception.getUrl()); assertEquals(message, exception.getMessage());Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Jan 11 08:43:05 GMT 2026 - 16.6K bytes - Click Count (0) -
docs/site-replication/run-replication-with-checksum-header.sh
echo -n "Preparing test data ..." mkdir -p /tmp/data echo "Hello World" >/tmp/data/obj touch /tmp/data/mpartobj shred -s 500M /tmp/data/mpartobj echo "done" # Add replication site ./mc admin replicate add minio1 minio2 --insecure # sleep for replication to complete sleep 30 # Create bucket in source cluster echo "Create bucket in source MinIO instance" ./mc mb minio1/test-bucket --insecure
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Mon Jan 20 14:49:07 GMT 2025 - 11.5K bytes - Click Count (0) -
guava-testlib/test/com/google/common/testing/ArbitraryInstancesTest.java
assertEquals(-1, ArbitraryInstances.get(InputStream.class).read()); assertEquals(-1, ArbitraryInstances.get(ByteArrayInputStream.class).read()); assertEquals(-1, ArbitraryInstances.get(Readable.class).read(CharBuffer.allocate(1))); assertEquals(-1, ArbitraryInstances.get(Reader.class).read()); assertEquals(-1, ArbitraryInstances.get(StringReader.class).read()); assertEquals(0, ArbitraryInstances.get(Buffer.class).capacity());
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 22.8K bytes - Click Count (0) -
android/guava/src/com/google/common/math/PairedStats.java
* * <p><b>Note:</b> No guarantees are made regarding stability of the representation between * versions. */ public byte[] toByteArray() { ByteBuffer buffer = ByteBuffer.allocate(BYTES).order(ByteOrder.LITTLE_ENDIAN); xStats.writeTo(buffer); yStats.writeTo(buffer); buffer.putDouble(sumOfProductsOfDeltas); return buffer.array(); } /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 12.6K bytes - Click Count (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
// If the factorial is small enough, just use LongMath to do it. if (n < LongMath.factorials.length) { return BigInteger.valueOf(LongMath.factorials[n]); } // Pre-allocate space for our list of intermediate BigIntegers. int approxSize = IntMath.divide(n * IntMath.log2(n, CEILING), Long.SIZE, CEILING); ArrayList<BigInteger> bignums = new ArrayList<>(approxSize);Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 18.8K bytes - Click Count (0) -
src/bufio/bufio.go
// delim. // For simple uses, a Scanner may be more convenient. func (b *Reader) ReadBytes(delim byte) ([]byte, error) { full, frag, n, err := b.collectFragments(delim) // Allocate new buffer to hold the full pieces and the fragment. buf := make([]byte, n) n = 0 // Copy full pieces and fragment in. for i := range full { n += copy(buf[n:], full[i]) } copy(buf[n:], frag)
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Fri Feb 06 17:28:40 GMT 2026 - 22K bytes - Click Count (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
* in no particular order. * * <p>The returned array will be "safe" in that no references to it are maintained by this queue. * (In other words, this method must allocate a new array). The caller is thus free to modify the * returned array. * * <p>This method acts as bridge between array-based and collection-based APIs. *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 23 21:06:42 GMT 2026 - 19K bytes - Click Count (0) -
guava/src/com/google/common/base/Joiner.java
} return join(parts.iterator()); } /* * TODO: b/381289911 - Make the Iterator overload use StringJoiner (including Android or not)—or * some other optimization, given that StringJoiner can over-allocate: * https://bugs.openjdk.org/browse/JDK-8305774 */ // TODO: b/381289911 - Optimize MapJoiner similarly to Joiner (including Android or not). /**Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Apr 14 15:16:19 GMT 2025 - 21K bytes - Click Count (0)