- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 83 for linkedin (0.27 sec)
-
android/guava-tests/benchmark/com/google/common/collect/MapBenchmark.java
* implementations. Forked from {@link SetContainsBenchmark}. * * @author Nicholaus Shupe */ public class MapBenchmark { @Param({"Hash", "LinkedHM", "MapMaker1", "Immutable"}) private Impl impl; public enum Impl { Hash { @Override Map<Element, Element> create(Collection<Element> keys) { Map<Element, Element> map = Maps.newHashMap();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 26 20:07:17 GMT 2023 - 7.6K bytes - Viewed (0) -
guava/src/com/google/common/cache/ReferenceEntry.java
int getHash(); /** Returns the key for this entry. */ @CheckForNull K getKey(); /* * Used by entries that use access order. Access entries are maintained in a doubly-linked list. * New entries are added at the tail of the list at write time; stale entries are expired from * the head of the list. */ /** Returns the time that this entry was last accessed, in ns. */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jun 15 18:00:07 GMT 2021 - 3.5K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/ClasspathTransformation.java
* * @param dirtyGraph - dependency graph * @param scope - which classpath to extract * @param resolve - whether to resolve artifacts. * @return Collection of metadata objects in the linked subgraph of the graph which * contains the graph.getEntry() vertice */ ClasspathContainer transform(MetadataGraph dirtyGraph, ArtifactScopeEnum scope, boolean resolve)
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 1.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
*/ @CheckForNull private transient int[] successor; /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */ private transient int firstEntry; /** Pointer to the last node in the linked list, or {@code ENDPOINT} if there are no entries. */ private transient int lastEntry; CompactLinkedHashSet() { super(); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are * all "null" (UNSET). * * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list, * and a node with "next" pointer equal to {@code ENDPOINT} is the last node. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/StreamsBenchmark.java
* * @author Louis Wasserman */ public class StreamsBenchmark { @Param({"1", "10", "100", "1000", "10000"}) private int size; enum CollectionType { ARRAY_LIST(ArrayList::new), LINKED_LIST(LinkedList::new); final Supplier<Collection<Object>> supplier; private CollectionType(Supplier<Collection<Object>> supplier) { this.supplier = supplier; } }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 03 19:39:41 GMT 2016 - 2.8K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/ReferenceEntry.java
int getHash(); /** Returns the key for this entry. */ @CheckForNull K getKey(); /* * Used by entries that use access order. Access entries are maintained in a doubly-linked list. * New entries are added at the tail of the list at write time; stale entries are expired from * the head of the list. */ /** Returns the time that this entry was last accessed, in ns. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Jun 15 18:00:07 GMT 2021 - 3.5K bytes - Viewed (0) -
src/cmd/asm/internal/flags/flags.go
Shared = flag.Bool("shared", false, "generate code that can be linked into a shared library") Dynlink = flag.Bool("dynlink", false, "support references to Go symbols defined in other shared libraries") Linkshared = flag.Bool("linkshared", false, "generate code that will be linked against Go shared libraries") AllErrors = flag.Bool("e", false, "no limit on number of errors reported")
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Aug 22 19:18:23 GMT 2023 - 2.8K bytes - Viewed (0) -
LICENSE
is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary
Plain Text - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Mon Jan 18 20:25:38 GMT 2016 - 25.8K bytes - Viewed (0) -
.github/PULL_REQUEST_TEMPLATE.md
/kind api-change /kind deprecation /kind failing-test /kind flake /kind regression --> #### What this PR does / why we need it: #### Which issue(s) this PR fixes: <!-- *Automatically closes linked issue when PR is merged. Usage: `Fixes #<issue number>`, or `Fixes (paste link of issue)`. _If PR is about `failing-tests or flakes`, please post the related issues/tests in a comment and do not use `Fixes`_* --> Fixes #
Plain Text - Registered: Fri May 03 09:05:14 GMT 2024 - Last Modified: Sun Aug 01 08:59:21 GMT 2021 - 2.8K bytes - Viewed (0)