- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 3,643 for orderID (0.1 sec)
-
guava/src/com/google/common/graph/ValueGraphBuilder.java
* * <p>A {@code ValueGraph} built by this class has the following default properties: * * <ul> * <li>does not allow self-loops * <li>orders {@link ValueGraph#nodes()} in the order in which the elements were added (insertion * order) * </ul> * * <p>{@code ValueGraph}s built by this class also guarantee that each collection-returning accessor * returns a <b>(live) unmodifiable view</b>; see <a
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 03 01:21:31 UTC 2022 - 8K bytes - Viewed (0) -
src/cmd/compile/internal/syntax/testdata/map2.go
// This file is like map.go, but instead of importing chans, it contains // the necessary functionality at the end of the file. // Package orderedmap provides an ordered map, implemented as a binary tree. package orderedmap // Map is an ordered map. type Map[K, V any] struct { root *node[K, V] compare func(K, K) int } // node is the type of a node in the binary tree. type node[K, V any] struct {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 01 12:49:49 UTC 2023 - 3.4K bytes - Viewed (0) -
src/internal/types/testdata/check/map1.go
// This file is like map.go2, but instead if importing chans, it contains // the necessary functionality at the end of the file. // Package orderedmap provides an ordered map, implemented as a binary tree. package orderedmap // Map is an ordered map. type Map[K, V any] struct { root *node[K, V] compare func(K, K) int } // node is the type of a node in the binary tree. type node[K, V any] struct {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 02 02:58:32 UTC 2022 - 3.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
/** * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the * first node in insertion order; all values at indices ≥ {@link #size()} are UNSET. */ @CheckForNull private transient int[] predecessor; /** * Pointer to the successor of an entry in insertion order. ENDPOINT indicates a node is the last * node in insertion order; all values at indices ≥ {@link #size()} are UNSET. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 05 21:38:59 UTC 2024 - 9.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/GraphBuilder.java
* user-defined properties. * * <p>A {@code Graph} built by this class has the following default properties: * * <ul> * <li>does not allow self-loops * <li>orders {@link Graph#nodes()} in the order in which the elements were added (insertion * order) * </ul> * * <p>{@code Graph}s built by this class also guarantee that each collection-returning accessor * returns a <b>(live) unmodifiable view</b>; see <a
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 03 01:21:31 UTC 2022 - 7.3K bytes - Viewed (0) -
src/cmd/compile/internal/types/sym.go
} if sym.Linkname != "" { return base.Linkname(sym.Linkname, abi) } return base.PkgLinksym(sym.Pkg.Prefix, sym.Name, abi) } // Less reports whether symbol a is ordered before symbol b. // // Symbols are ordered exported before non-exported, then by name, and // finally (for non-exported symbols) by package path. func (a *Sym) Less(b *Sym) bool { if a == b { return false }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jan 26 21:56:56 UTC 2023 - 4.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/NetworkBuilder.java
* * <ul> * <li>does not allow parallel edges * <li>does not allow self-loops * <li>orders {@link Network#nodes()} and {@link Network#edges()} in the order in which the * elements were added (insertion order) * </ul> * * <p>{@code Network}s built by this class also guarantee that each collection-returning accessor * returns a <b>(live) unmodifiable view</b>; see <a
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 03 01:21:31 UTC 2022 - 7.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedMultiset.java
import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * A {@link Multiset} which maintains the ordering of its elements, according to either their * natural order or an explicit {@link Comparator}. This order is reflected when iterating over the * sorted multiset, either directly, or through its {@code elementSet} or {@code entrySet} views. In
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 5.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/SortedMultiset.java
import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * A {@link Multiset} which maintains the ordering of its elements, according to either their * natural order or an explicit {@link Comparator}. This order is reflected when iterating over the * sorted multiset, either directly, or through its {@code elementSet} or {@code entrySet} views. In
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 5.5K bytes - Viewed (0) -
src/cmd/nm/nm.go
for compatibility with other nm commands -size print symbol size in decimal between address and type -sort {address,name,none,size} sort output in the given order (default name) size orders from largest to smallest -type print symbol type after name ` func usage() { fmt.Fprint(os.Stderr, helpText) os.Exit(2) } var (
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 19:41:17 UTC 2024 - 3.1K bytes - Viewed (0)