- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 31 for ends (0.15 sec)
-
guava-tests/test/com/google/common/primitives/BooleansTest.java
testRotate(new boolean[] {true}, 1, 0, 1, new boolean[] {true}); testRotate(new boolean[] {true}, 1, 1, 1, new boolean[] {true}); // Rotate the central 5 elements, leaving the ends as-is testRotate( new boolean[] {false, true, false, true, false, true, false}, -6, 1, 6, new boolean[] {false, false, true, false, true, true, false});
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 15:43:29 GMT 2024 - 23.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/BooleansTest.java
testRotate(new boolean[] {true}, 1, 0, 1, new boolean[] {true}); testRotate(new boolean[] {true}, 1, 1, 1, new boolean[] {true}); // Rotate the central 5 elements, leaving the ends as-is testRotate( new boolean[] {false, true, false, true, false, true, false}, -6, 1, 6, new boolean[] {false, false, true, false, true, true, false});
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 04 15:43:29 GMT 2024 - 23.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
} @SuppressWarnings("CatchingUnchecked") // sneaky checked exception private void addPendingString(StringBuilder builder) { // Capture current builder length so it can be truncated if this future ends up completing while // the toString is being calculated int truncateLength = builder.length(); builder.append("PENDING"); Object localValue = value;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MapsTest.java
assertWithMessage("table size after adding " + size + " elements") .that(bucketsOf(map1)) .isEqualTo(initialBuckets); // Ensure that referenceMap, which doesn't use WithExpectedSize, ends up with the same table // size as the other two maps. If it ended up with a smaller size that would imply that we // computed the wrong initial capacity. for (int i = 0; i < size; i++) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 16:06:01 GMT 2024 - 67.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MapsTest.java
assertWithMessage("table size after adding " + size + " elements") .that(bucketsOf(map1)) .isEqualTo(initialBuckets); // Ensure that referenceMap, which doesn't use WithExpectedSize, ends up with the same table // size as the other two maps. If it ended up with a smaller size that would imply that we // computed the wrong initial capacity. for (int i = 0; i < size; i++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 04 16:06:01 GMT 2024 - 64.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
return result; } /* * For discussion of the safety of the following methods for operating on predecessors and * successors, see the comments near the end of CompactHashMap, noting that the methods here call * link(), which is defined at the end of this file. */ private int getPredecessor(int entry) { return ((int) (link(entry) >>> 32)) - 1; } @Override int getSuccessor(int entry) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Preconditions.java
private static String badPositionIndexes(int start, int end, int size) { if (start < 0 || start > size) { return badPositionIndex(start, size, "start index"); } if (end < 0 || end > size) { return badPositionIndex(end, size, "end index"); } // end < start return lenientFormat("end index (%s) must not be less than start index (%s)", end, start); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 11 11:52:14 GMT 2024 - 52.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
private Comparators() {} /** * Returns a new comparator which sorts iterables by comparing corresponding elements pairwise * until a nonzero result is found; imposes "dictionary order." If the end of one iterable is * reached, but not the other, the shorter iterable is considered to be less than the longer one. * For example, a lexicographical natural ordering over integers considers {@code [] < [1] < [1,
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 10.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
// * Everything with (to <= index < from) should be removed. // * The element with (index == from) should be kept. // * Everything with (index > from) has not been checked yet. // Check from the end of the list backwards (minimize expected cost of // moving elements when remove() is called). Stop before 'from' because // we already know that should be kept. for (int n = list.size() - 1; n > from; n--) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 42.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ExecutionList.java
if (!executed) { runnables = new RunnableExecutorPair(runnable, executor, runnables); return; } } // Execute the runnable immediately. Because of scheduling this may end up getting called before // some of the previously added runnables, but we're OK with that. If we want to change the // contract to guarantee ordering among runnables we'd have to modify the logic here to allow // it.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 6.9K bytes - Viewed (0)