- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 71 for end (0.12 sec)
-
android/guava-tests/test/com/google/common/io/LineBufferTest.java
bufferHelper("no newlines at all", "no newlines at all"); bufferHelper("two lines\nbut no newline at end", "two lines\n", "but no newline at end"); bufferHelper( "\nempty first line\nno newline at end", "\n", "empty first line\n", "no newline at end"); bufferHelper("three\rlines\rno newline at end", "three\r", "lines\r", "no newline at end"); bufferHelper("mixed\nline\rendings\r\n", "mixed\n", "line\r", "endings\r\n"); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.7K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Utf8.java
int end = off + len; checkPositionIndexes(off, end, bytes.length); // Look for the first non-ASCII character. for (int i = off; i < end; i++) { if (bytes[i] < 0) { return isWellFormedSlowPath(bytes, i, end); } } return true; } private static boolean isWellFormedSlowPath(byte[] bytes, int off, int end) { int index = off;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 10 14:11:51 GMT 2023 - 7K 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-tests/benchmark/com/google/common/base/JoinerBenchmark.java
append = true; } dummy ^= sb.toString().length(); } return dummy; } /** * Starts with an empty delimiter and changes to the desired value at the end of the iteration. */ @Benchmark int assignDelimiter(int reps) { int dummy = 0; for (int i = 0; i < reps; i++) { StringBuilder sb = new StringBuilder(); String delim = "";
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
} /* * 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 * requirePredecessors() and requireSuccessors(), which are defined at the end of this file. */ private int getPredecessor(int entry) { return requirePredecessors()[entry] - 1; } @Override
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/testers/ListAddAllAtIndexTester.java
expectAdded(getNumElements() / 2, createDisjointCollection()); } @ListFeature.Require(SUPPORTS_ADD_WITH_INDEX) @CollectionSize.Require(absent = ZERO) public void testAddAllAtIndex_end() { assertTrue( "addAll(end, disjoint) should return true", getList().addAll(getNumElements(), createDisjointCollection())); expectAdded(getNumElements(), createDisjointCollection()); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 6.5K bytes - Viewed (1) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
static double getMinValue(double[] array, int from) { // This is basically a copy of com.google.math.Rank#getMinValue, with a small change in the // method signature: we always search to the end of the array. int min = from; for (int i = from + 1; i < array.length; i++) { if (array[min] > array[i]) { min = i; } } return array[min]; }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
static double getMinValue(double[] array, int from) { // This is basically a copy of com.google.math.Rank#getMinValue, with a small change in the // method signature: we always search to the end of the array. int min = from; for (int i = from + 1; i < array.length; i++) { if (array[min] > array[i]) { min = i; } } return array[min]; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/escape/ArrayBasedUnicodeEscaper.java
return null; } return escapeUnsafe(cp); } /* Overridden for performance. */ @Override protected final int nextEscapeIndex(CharSequence csq, int index, int end) { while (index < end) { char c = csq.charAt(index); if ((c < replacementsLength && replacements[c] != null) || c > safeMaxChar || c < safeMinChar) { break; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/io/PatternFilenameFilter.java
* class to begin with but rather something returned from a static factory method whose declared * return type is plain FilenameFilter. If we made such a change, then the annotation we choose * here would have no significance to end users, who would be forced to conform to the signature * used in FilenameFilter.) */ @Override public boolean accept(File dir, String fileName) { return pattern.matcher(fileName).matches(); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed May 17 14:35:11 GMT 2023 - 2.8K bytes - Viewed (0)