- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 50 for Arantes (0.21 sec)
-
guava-tests/test/com/google/common/collect/TreeRangeSetTest.java
for (Range<Integer> range : QUERY_RANGES) { TreeRangeSet<Integer> rangeSet = TreeRangeSet.create(); rangeSet.add(range); testIntersects(rangeSet); testIntersects(rangeSet.complement()); } } public void testAllTwoRangesIntersecting() { for (Range<Integer> range1 : QUERY_RANGES) { for (Range<Integer> range2 : QUERY_RANGES) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Dec 16 19:54:45 GMT 2020 - 24.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeRangeSet.java
* element will be contained in this {@code RangeSet} if and only if it is contained in at least * one {@code Range} in {@code ranges}. * * @since 21.0 */ public static <C extends Comparable<?>> TreeRangeSet<C> create(Iterable<Range<C>> ranges) { TreeRangeSet<C> result = create(); result.addAll(ranges); return result; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 32.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
* we change the rate. */ public void testWeNeverGetABurstMoreThanOneSec() { RateLimiter limiter = RateLimiter.create(1.0, stopwatch); int[] rates = {1000, 1, 10, 1000000, 10, 1}; for (int rate : rates) { int oneSecWorthOfWork = rate; stopwatch.sleepMillis(rate * 1000); limiter.setRate(rate); long burst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random());
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeRangeMap.java
} } @Override public void putCoalescing(Range<K> range, V value) { // don't short-circuit if the range is empty - it may be between two ranges we can coalesce. if (entriesByLowerBound.isEmpty()) { put(range, value); return; } Range<K> coalescedRange = coalescedRange(range, checkNotNull(value)); put(coalescedRange, value);
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) -
guava-tests/test/com/google/common/collect/ImmutableRangeSetTest.java
} } ImmutableList<Range<Integer>> ranges = rangesBuilder.build(); for (int i = -2; i <= 2; i++) { rangesBuilder.add(Range.closedOpen(i, i)); rangesBuilder.add(Range.openClosed(i, i)); } ImmutableList<Range<Integer>> subRanges = rangesBuilder.build(); for (Range<Integer> range1 : ranges) { for (Range<Integer> range2 : ranges) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/GeneralRange.java
return cmp > 0 | (cmp == 0 & getUpperBoundType() == OPEN); } boolean contains(@ParametricNullness T t) { return !tooLow(t) && !tooHigh(t); } /** * Returns the intersection of the two ranges, or an empty range if their intersection is empty. */ @SuppressWarnings("nullness") // TODO(cpovirk): Add casts as needed. Will be noisy and annoying... GeneralRange<T> intersect(GeneralRange<T> other) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/LongMathTest.java
@GwtIncompatible // java.math.BigInteger public void testMean() { // Odd-sized ranges have an obvious mean assertMean(2, 1, 3); assertMean(-2, -3, -1); assertMean(0, -1, 1); assertMean(1, -1, 3); assertMean((1L << 62) - 1, -1, Long.MAX_VALUE); // Even-sized ranges should prefer the lower mean assertMean(2, 1, 4); assertMean(-3, -4, -1); assertMean(0, -1, 2);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0) -
src/main/java/jcifs/http/NetworkExplorer.java
resp.setContentType("text/plain"); resp.setContentType(URLConnection.guessContentTypeFromName(url)); resp.setHeader("Content-Length", file.length() + ""); resp.setHeader("Accept-Ranges", "Bytes"); while ( ( n = in.read(buf) ) != -1 ) { out.write(buf, 0, n); } } }
Java - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 21.3K bytes - Viewed (0) -
src/main/java/jcifs/smb1/http/NetworkExplorer.java
resp.setContentType( mimeMap.getMimeType( type )); } resp.setHeader( "Content-Length", file.length() + "" ); resp.setHeader( "Accept-Ranges", "Bytes" ); while(( n = in.read( buf )) != -1 ) { out.write( buf, 0, n ); } } // TODO catch IOException }
Java - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Wed Jan 22 03:57:31 GMT 2020 - 19.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ContiguousSet.java
/** * A sorted set of contiguous values in a given {@link DiscreteDomain}. Example: * * <pre>{@code * ContiguousSet.create(Range.closed(5, 42), DiscreteDomain.integers()) * }</pre> * * <p>Note that because bounded ranges over {@code int} and {@code long} values are so common, this * particular example can be written as just: * * <pre>{@code * ContiguousSet.closed(5, 42) * }</pre> *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 9.9K bytes - Viewed (0)