- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 397 for We (0.14 sec)
-
android/guava/src/com/google/common/hash/LittleEndianByteArray.java
* @return a long of a concatenated 8 bytes */ static long load64Safely(byte[] input, int offset, int length) { long result = 0; // Due to the way we shift, we can stop iterating once we've run out of data, the rest // of the result already being filled with zeros. // This loop is critical to performance, so please check HashBenchmark if altering it. int limit = Math.min(length, 8);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Platform.java
WeakReference<? extends Enum<?>> ref = Enums.getEnumConstants(enumClass).get(value); /* * We use `fromNullable` instead of `of` because `WeakReference.get()` has a nullable return * type. * * In practice, we are very unlikely to see `null`: The `WeakReference` to the enum constant
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 3.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Platform.java
* @param length the length of the new array */ /* * The new array contains nulls, even if the old array did not. If we wanted to be accurate, we * would declare a return type of `@Nullable T[]`. However, we've decided not to think too hard * about arrays for now, as they're a mess. (We previously discussed this in the review of * ObjectArrays, which is the main caller of this method.) */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 4.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableMapEntry.java
return true; } static class NonTerminalImmutableMapEntry<K, V> extends ImmutableMapEntry<K, V> { /* * Yes, we sometimes set nextInKeyBucket to null, even for this "non-terminal" entry. We don't * do that with a plain NonTerminalImmutableMapEntry, but we do it with the BiMap-specific * subclass below. That's because the Entry might be non-terminal in the key bucket but terminal
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 4.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeRangeMap.java
if (mapEntryAboveToTruncate != null) { // we know ( ] RangeMapEntry<K, V> rangeMapEntry = mapEntryAboveToTruncate.getValue(); if (rangeMapEntry.getUpperBound().compareTo(rangeToRemove.upperBound) > 0) { // we know ( ] ), and since we dealt with truncating below already, // we know [ ( ] ) putRangeMapEntry( rangeToRemove.upperBound,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 21.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
// in all. // (3) "Successive". We can consider that we are exchanging a block of size d (a[0..d-1]) with a // block of size n-d (a[d..n-1]), where in general these blocks have different sizes. If we // imagine a line separating the first block from the second, we can proceed by exchanging
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0) -
maven-compat/src/test/java/org/apache/maven/project/inheritance/t09/ProjectInheritanceTest.java
} /** * Setup exactly the same as the above test, except that the child project * now depends upon d, which has a transitive dependency on c. Even though * we did list an exclusion on c, it was only from within the context of * project b. We will pick up project c in this case because no * restrictions were placed on d. This demonstrates that a, b, c, & d will * all be collected. *
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Thu Apr 25 05:46:50 GMT 2024 - 5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
} @CheckForNull private MoveDesc<E> fillHole(int index, E toTrickle) { Heap heap = heapForIndex(index); // We consider elementData(index) a "hole", and we want to fill it // with the last element of the heap, toTrickle. // Since the last element of the heap is from the bottom level, we // optimistically fill index position with elements from lower levels,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
guava/src/com/google/common/collect/ConcurrentHashMultiset.java
* creation and removal (including automatic removal of zeroes). If the modification of an * AtomicInteger results in zero, we compareAndSet the value to zero; if that succeeds, we remove * the entry from the Map. If another operation sees a zero in the map, it knows that the entry is * about to be removed, so this operation may remove it (often by replacing it with a new
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 20.9K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/DefaultModelNormalizer.java
* unique within a single POM. Upon multiple declarations, 2.x just kept the last one but retained the order of * the first occurrence. So when we're in lenient/compat mode, we have to deal with such broken POMs and mimic * the way 2.x works. When we're in strict mode, the removal of duplicates just saves other merging steps from * aftereffects and bogus error messages. */
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 5.3K bytes - Viewed (0)