- Sort Score
- Result 10 results
- Languages All
Results 241 - 250 of 348 for atual (0.06 sec)
-
android/guava/src/com/google/common/collect/CompactHashSet.java
* amortized since some operations can trigger a hash table resize. * * <p>Unlike {@code java.util.HashSet}, iteration is only proportional to the actual {@code size()}, * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger * than {@code size()}. Furthermore, this structure only depends on a fixed number of arrays; {@code
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 24K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableLongArray.java
} /** * Returns a new immutable array containing the values in the specified range. * * <p><b>Performance note:</b> The returned array has the same full memory footprint as this one * does (no actual copying is performed). To reduce memory usage, use {@code subArray(start, * end).trimmed()}. */ public ImmutableLongArray subArray(int startIndex, int endIndex) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 25 18:05:56 UTC 2024 - 22.3K bytes - Viewed (0) -
guava/src/com/google/common/primitives/ImmutableIntArray.java
} /** * Returns a new immutable array containing the values in the specified range. * * <p><b>Performance note:</b> The returned array has the same full memory footprint as this one * does (no actual copying is performed). To reduce memory usage, use {@code subArray(start, * end).trimmed()}. */ public ImmutableIntArray subArray(int startIndex, int endIndex) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 25 18:05:56 UTC 2024 - 21.4K bytes - Viewed (0) -
tensorflow/c/c_api_experimental.cc
int rank = shape.dims(); if (num_dims != rank) { status->status = InvalidArgument("Expected rank is ", num_dims, " but actual rank is ", rank); return; } for (int i = 0; i < num_dims; i++) { dims[i] = shape.dim_size(i); } } int TF_CheckpointReaderGetVariableNumDims(TF_CheckpointReader* reader,
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Sat Oct 12 16:27:48 UTC 2024 - 29.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/PairedStats.java
* * <p>This fit minimizes the root-mean-square error in {@code y} as a function of {@code x}. This * error is defined as the square root of the mean of the squares of the differences between the * actual {@code y} values of the data and the values predicted by the fit for the {@code x} * values (i.e. it is the square root of the mean of the squares of the vertical distances between
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 12.6K bytes - Viewed (0) -
src/main/java/jcifs/smb/SmbResourceLocatorImpl.java
// first remaining path element would be share if ( nameParts.length > pos ) { this.share = nameParts[ pos++ ]; } // all other remaining path elements are actual path if ( nameParts.length > pos ) { String[] remainParts = new String[nameParts.length - pos]; System.arraycopy(nameParts, pos, remainParts, 0, nameParts.length - pos);
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Sat Jul 20 08:24:53 UTC 2019 - 23.9K bytes - Viewed (0) -
src/bufio/scan.go
) const ( // MaxScanTokenSize is the maximum size used to buffer a token // unless the user provides an explicit buffer with [Scanner.Buffer]. // The actual maximum token size may be smaller as the buffer // may need to include, for instance, a newline. MaxScanTokenSize = 64 * 1024 startBufSize = 4096 // Size of initial allocation for buffer. )
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Mon Oct 23 09:06:30 UTC 2023 - 14.2K bytes - Viewed (0) -
cmd/object-api-multipart_test.go
CalculatedSHA256: "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855", }, }, // Test case - 14. // Input with size more than the size of actual data inside the reader. { bucketName: bucket, objName: object, uploadID: uploadID, PartID: 1, inputReaderData: "abcd", inputMd5: "e2fc714c4727ee9395f324cd2e7f3335", inputDataSize: int64(len("abcd") + 1),
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Sep 06 09:42:21 UTC 2024 - 88.8K bytes - Viewed (0) -
cmd/erasure-healing.go
// the diskWithAllParts needs to reach the drive to ensure // validity of the metadata content, we should make sure that // we pass in disks as is for it to be verified. Once verified // the disksWithAllParts() returns the actual disks that can be // used here for reconstruction. This is done to ensure that // we do not skip drives that have inconsistent metadata to be // skipped from purging when they are stale.
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Wed Oct 02 17:50:41 UTC 2024 - 34.4K bytes - Viewed (0) -
tensorflow/c/c_api_function_test.cc
const std::unordered_set<string>& nodes) { ASSERT_EQ(nodes.size(), fdef.node_def_size()) << "Got unexpected number of nodes. Expected: [" << absl::StrJoin(nodes, ", ") << "] Actual nodes in fdef: " << fdef.DebugString(); for (const NodeDef& node_def : fdef.node_def()) { ASSERT_TRUE(nodes.find(node_def.name()) != nodes.end()) << "Got unexpected node: " << node_def.name()
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Thu Jul 20 22:08:54 UTC 2023 - 63.6K bytes - Viewed (0)