- Sort Score
- Result 10 results
- Languages All
Results 671 - 680 of 7,014 for _return (0.06 sec)
-
guava/src/com/google/common/collect/AbstractMultimap.java
return entryIterator(); } @Override public Spliterator<Entry<K, V>> spliterator() { return entrySpliterator(); } } @WeakOuter class EntrySet extends Entries implements Set<Entry<K, V>> { @Override public int hashCode() { return Sets.hashCodeImpl(this); } @Override public boolean equals(@CheckForNull Object obj) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Jun 15 21:08:00 UTC 2021 - 7.1K bytes - Viewed (0) -
cmd/last-minute_gen.go
err = msgp.WrapError(err, "Size") return } case "N": z.N, err = dc.ReadInt64() if err != nil { err = msgp.WrapError(err, "N") return } default: err = dc.Skip() if err != nil { err = msgp.WrapError(err) return } } } return } // EncodeMsg implements msgp.Encodable func (z AccElem) EncodeMsg(en *msgp.Writer) (err error) { // map header, size 3
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Jul 05 21:45:49 UTC 2022 - 17.2K bytes - Viewed (0) -
api/maven-api-cli/src/main/java/org/apache/maven/api/cli/mvnenc/EncryptOptions.java
* * @return an {@link Optional} containing the boolean value {@code true} if specified, or empty */ Optional<Boolean> force(); /** * Should imply "yes" to all questions. * * @return an {@link Optional} containing the boolean value {@code true} if specified, or empty */ Optional<Boolean> yes(); /** * Returns the list of encryption goals to be executed.
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Mon Oct 14 19:57:22 UTC 2024 - 2.4K bytes - Viewed (0) -
tensorflow/c/eager/parallel_device/parallel_device_lib.h
size_t num_tensors() const { return tensors_.size(); } TFE_TensorHandle* tensor(size_t index) const { return tensors_[index].get(); } // If the `shape` argument to `FromTensorHandles` is specified, returns that. // // Otherwise if all of the tensors have the same shape, returns that via the // `shape` output argument. This blocks waiting for async tensors, may return
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Mon Oct 21 04:14:14 UTC 2024 - 13.1K bytes - Viewed (0) -
cmd/batch-handlers.go
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Oct 18 15:32:09 UTC 2024 - 62.2K bytes - Viewed (0) -
api/maven-api-core/src/main/java/org/apache/maven/api/Dependency.java
/** * {@return the type of the dependency} * A dependency can be a <abbr>JAR</abbr> file, * a modular-<abbr>JAR</abbr> if it is intended to be placed on the module-path, * a <abbr>JAR</abbr> containing test classes, <i>etc.</i> * * @see DependencyCoordinates#getType() */ @Nonnull Type getType(); /** * {@return the time at which the dependency will be used}
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Sat Sep 28 09:03:24 UTC 2024 - 2.8K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/idn/Punycode.kt
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Wed Apr 03 03:04:50 UTC 2024 - 8.5K bytes - Viewed (0) -
cmd/erasure-server-pool.go
if err != nil { return err } } } } } if found == 0 { return errFileNotFound } return nil } // Return the disks belonging to the poolIdx, and setIdx. func (z *erasureServerPools) GetDisks(poolIdx, setIdx int) ([]StorageAPI, error) { if poolIdx < len(z.serverPools) && setIdx < len(z.serverPools[poolIdx].sets) {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Sun Sep 29 22:40:36 UTC 2024 - 89.8K bytes - Viewed (0) -
internal/mountinfo/mountinfo_others.go
package mountinfo // CheckCrossDevice - check if any input path has multiple sub-mounts. // this is a dummy function and returns nil for now. func CheckCrossDevice(paths []string) error { return nil } // IsLikelyMountPoint determines if a directory is a mountpoint. func IsLikelyMountPoint(file string) bool { return false
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Aug 19 01:35:22 UTC 2021 - 1.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractBaseGraph.java
if (isDirected()) { return IntMath.saturatedAdd(predecessors(node).size(), successors(node).size()); } else { Set<N> neighbors = adjacentNodes(node); int selfLoopCount = (allowsSelfLoops() && neighbors.contains(node)) ? 1 : 0; return IntMath.saturatedAdd(neighbors.size(), selfLoopCount); } } @Override public int inDegree(N node) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 7.2K bytes - Viewed (0)