- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 1,043 for entries (0.24 sec)
-
cmd/os_other.go
if fi.IsDir() { // Append SlashSeparator instead of "\" so that sorting is achieved as expected. entries = append(entries, fi.Name()+SlashSeparator) } else if fi.Mode().IsRegular() { entries = append(entries, fi.Name()) } if opts.count > 0 { remaining-- } } } return entries, nil } func globalSync() { // no-op not sure about plan9/solaris support for syscall support
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Wed Sep 13 15:14:36 GMT 2023 - 4K 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 May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 15 18:00:07 GMT 2021 - 3.5K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/testers/NavigableMapNavigationTester.java
Collections.sort(entries, Helpers.<K, V>entryComparator(navigableMap.comparator())); // some tests assume SEVERAL == 3 if (entries.size() >= 1) { a = entries.get(0); if (entries.size() >= 3) { b = entries.get(1); c = entries.get(2); } } } /** Resets the contents of navigableMap to have entries a, c, for the navigation tests. */
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 8.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
entryIndex = next - 1; entry = entries[entryIndex]; next = CompactHashing.getNext(entry, mask); } while (next != srcNext); // here, entries[entryIndex] points to the old entry location; update it entries[entryIndex] = CompactHashing.maskCombine(entry, dstIndex + 1, mask); } } else { elements[dstIndex] = null; entries[dstIndex] = 0; } }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
cmd/metacache-walk.go
// Process in sort order. sort.Strings(entries) dirStack := make([]string, 0, 5) prefix = "" // Remove prefix after first level as we have already filtered the list. if len(forward) > 0 { // Conservative forwarding. Entries may be either objects or prefixes. for i, entry := range entries { if entry >= forward || strings.HasPrefix(forward, entry) { entries = entries[i:] break } } }
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Mon Apr 15 08:25:46 GMT 2024 - 12.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/cache/PopulatedCachesTest.java
Set<Entry<Object, Object>> entries = cache.asMap().entrySet(); List<Entry<Object, Object>> warmed = warmUp(cache, WARMUP_MIN, WARMUP_MAX); Set<?> expected = Maps.newHashMap(cache.asMap()).entrySet(); assertThat(entries).containsExactlyElementsIn(expected); assertThat(entries.toArray()).asList().containsExactlyElementsIn(expected);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 15K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/google/MultimapForEachTester.java
public void testForEach() { List<Entry<K, V>> entries = new ArrayList<>(); multimap().forEach((k, v) -> entries.add(mapEntry(k, v))); assertEqualIgnoringOrder(getSampleElements(), multimap().entries()); } @CollectionFeature.Require(KNOWN_ORDER) public void testForEachOrder() { List<Entry<K, V>> entries = new ArrayList<>(); multimap().forEach((k, v) -> entries.add(mapEntry(k, v)));
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Jan 09 20:10:38 GMT 2018 - 1.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
entryIndex = next - 1; entry = entries[entryIndex]; next = CompactHashing.getNext(entry, mask); } while (next != srcNext); // here, entries[entryIndex] points to the old entry location; update it entries[entryIndex] = CompactHashing.maskCombine(entry, dstIndex + 1, mask); } } else { elements[dstIndex] = null; entries[dstIndex] = 0; } }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/CompactLinkedHashMapTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 21 14:41:51 GMT 2020 - 6.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashMap.java
// If the `next` bits in `entries[i]` are 0 that means there are no further entries for the given // short hash. But 0 is also a valid index in `entries`, so we add 1 to these indices before // putting them in `table` or in `next` bits, and subtract 1 again when we need an index value. // // The elements of `keys`, `values`, and `entries` are added sequentially, so that elements 0 to
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 39.8K bytes - Viewed (0)