Home
last modified time | relevance | path

Searched refs:Range (Results 1 – 25 of 1666) sorted by relevance

12345678910>>...67

/external/guava/guava-tests/test/com/google/common/collect/
DRangeTest.java44 Range<Integer> range = Range.open(4, 8); in testOpen()
59 Range.open(4, 3); in testOpen_invalid()
64 Range.open(3, 3); in testOpen_invalid()
71 Range<Integer> range = Range.closed(5, 7); in testClosed()
86 Range.closed(4, 3); in testClosed_invalid()
93 Range<Integer> range = Range.openClosed(4, 7); in testOpenClosed()
107 Range<Integer> range = Range.closedOpen(5, 8); in testClosedOpen()
121 assertTrue(Range.closed(3, 5).isConnected(Range.open(5, 6))); in testIsConnected()
122 assertTrue(Range.closed(3, 5).isConnected(Range.closed(5, 6))); in testIsConnected()
123 assertTrue(Range.closed(5, 6).isConnected(Range.closed(3, 5))); in testIsConnected()
[all …]
DTreeRangeMapTest.java48 new TestMapGenerator<Range<Integer>, String>() { in suite()
50 public SampleElements<Entry<Range<Integer>, String>> samples() { in suite()
52 mapEntry(Range.singleton(0), "banana"), in suite()
53 mapEntry(Range.closedOpen(3, 5), "frisbee"), in suite()
54 mapEntry(Range.atMost(-1), "fruitcake"), in suite()
55 mapEntry(Range.open(10, 15), "elephant"), in suite()
56 mapEntry(Range.closed(20, 22), "umbrella")); in suite()
60 public Map<Range<Integer>, String> create(Object... elements) { in suite()
64 Entry<Range<Integer>, String> entry = (Entry<Range<Integer>, String>) o; in suite()
72 public Entry<Range<Integer>, String>[] createArray(int length) { in suite()
[all …]
DImmutableRangeSetTest.java62 builder.add(Range.singleton(i)); in create()
95 builder.add(Range.closedOpen(i, i.add(BigInteger.ONE))); in create()
136 assertFalse(rangeSet.intersects(Range.singleton(0))); in testEmpty()
137 assertFalse(rangeSet.encloses(Range.singleton(0))); in testEmpty()
145 assertThat(rangeSet.asRanges()).contains(Range.<Integer>all()); in testAll()
147 assertTrue(rangeSet.intersects(Range.singleton(0))); in testAll()
148 assertTrue(rangeSet.intersects(Range.<Integer>all())); in testAll()
149 assertTrue(rangeSet.encloses(Range.<Integer>all())); in testAll()
155 ImmutableRangeSet<Integer> rangeSet = ImmutableRangeSet.of(Range.closedOpen(1, 5)); in testSingleBoundedRange()
157 assertThat(rangeSet.asRanges()).contains(Range.closedOpen(1, 5)); in testSingleBoundedRange()
[all …]
DTreeRangeSetTest.java18 import static com.google.common.collect.Range.range;
37 private static final ImmutableList<Range<Integer>> QUERY_RANGES;
43 ImmutableList.Builder<Range<Integer>> queryBuilder = ImmutableList.builder();
45 queryBuilder.add(Range.<Integer>all()); in all()
49 queryBuilder.add(Range.upTo(i, boundType)); in Range.upTo()
50 queryBuilder.add(Range.downTo(i, boundType)); in Range.downTo()
52 queryBuilder.add(Range.singleton(i)); in Range.singleton()
53 queryBuilder.add(Range.openClosed(i, i)); in Range.openClosed()
54 queryBuilder.add(Range.closedOpen(i, i)); in Range.closedOpen()
59 queryBuilder.add(Range.range(i, lowerBoundType, j, upperBoundType)); in Range.range()
[all …]
DContiguousSetTest.java107 ContiguousSet.create(Range.closed(1, 3), integers()), in testEquals()
109 ContiguousSet.create(Range.closedOpen(1, 4), integers()), in testEquals()
111 ContiguousSet.create(Range.openClosed(0, 3), integers()), in testEquals()
112 ContiguousSet.create(Range.open(0, 4), integers()), in testEquals()
113 ContiguousSet.create(Range.closed(1, 3), NOT_EQUAL_TO_INTEGERS), in testEquals()
114 ContiguousSet.create(Range.closedOpen(1, 4), NOT_EQUAL_TO_INTEGERS), in testEquals()
115 ContiguousSet.create(Range.openClosed(0, 3), NOT_EQUAL_TO_INTEGERS), in testEquals()
116 ContiguousSet.create(Range.open(0, 4), NOT_EQUAL_TO_INTEGERS), in testEquals()
119 ContiguousSet.create(Range.closedOpen(1, 1), integers()), in testEquals()
128 ContiguousSet.create(Range.<Integer>all(), integers())); in testEquals()
[all …]
/external/guava/android/guava-tests/test/com/google/common/collect/
DRangeTest.java44 Range<Integer> range = Range.open(4, 8); in testOpen()
59 Range.open(4, 3); in testOpen_invalid()
64 Range.open(3, 3); in testOpen_invalid()
71 Range<Integer> range = Range.closed(5, 7); in testClosed()
86 Range.closed(4, 3); in testClosed_invalid()
93 Range<Integer> range = Range.openClosed(4, 7); in testOpenClosed()
107 Range<Integer> range = Range.closedOpen(5, 8); in testClosedOpen()
121 assertTrue(Range.closed(3, 5).isConnected(Range.open(5, 6))); in testIsConnected()
122 assertTrue(Range.closed(3, 5).isConnected(Range.closed(5, 6))); in testIsConnected()
123 assertTrue(Range.closed(5, 6).isConnected(Range.closed(3, 5))); in testIsConnected()
[all …]
DTreeRangeMapTest.java47 new TestMapGenerator<Range<Integer>, String>() { in suite()
49 public SampleElements<Entry<Range<Integer>, String>> samples() { in suite()
51 mapEntry(Range.singleton(0), "banana"), in suite()
52 mapEntry(Range.closedOpen(3, 5), "frisbee"), in suite()
53 mapEntry(Range.atMost(-1), "fruitcake"), in suite()
54 mapEntry(Range.open(10, 15), "elephant"), in suite()
55 mapEntry(Range.closed(20, 22), "umbrella")); in suite()
59 public Map<Range<Integer>, String> create(Object... elements) { in suite()
63 Entry<Range<Integer>, String> entry = (Entry<Range<Integer>, String>) o; in suite()
71 public Entry<Range<Integer>, String>[] createArray(int length) { in suite()
[all …]
DImmutableRangeSetTest.java61 builder.add(Range.singleton(i)); in create()
94 builder.add(Range.closedOpen(i, i.add(BigInteger.ONE))); in create()
135 assertFalse(rangeSet.intersects(Range.singleton(0))); in testEmpty()
136 assertFalse(rangeSet.encloses(Range.singleton(0))); in testEmpty()
144 assertThat(rangeSet.asRanges()).contains(Range.<Integer>all()); in testAll()
146 assertTrue(rangeSet.intersects(Range.singleton(0))); in testAll()
147 assertTrue(rangeSet.intersects(Range.<Integer>all())); in testAll()
148 assertTrue(rangeSet.encloses(Range.<Integer>all())); in testAll()
154 ImmutableRangeSet<Integer> rangeSet = ImmutableRangeSet.of(Range.closedOpen(1, 5)); in testSingleBoundedRange()
156 assertThat(rangeSet.asRanges()).contains(Range.closedOpen(1, 5)); in testSingleBoundedRange()
[all …]
DTreeRangeSetTest.java18 import static com.google.common.collect.Range.range;
37 private static final ImmutableList<Range<Integer>> QUERY_RANGES;
43 ImmutableList.Builder<Range<Integer>> queryBuilder = ImmutableList.builder();
45 queryBuilder.add(Range.<Integer>all()); in all()
49 queryBuilder.add(Range.upTo(i, boundType)); in Range.upTo()
50 queryBuilder.add(Range.downTo(i, boundType)); in Range.downTo()
52 queryBuilder.add(Range.singleton(i)); in Range.singleton()
53 queryBuilder.add(Range.openClosed(i, i)); in Range.openClosed()
54 queryBuilder.add(Range.closedOpen(i, i)); in Range.closedOpen()
59 queryBuilder.add(Range.range(i, lowerBoundType, j, upperBoundType)); in Range.range()
[all …]
DContiguousSetTest.java107 ContiguousSet.create(Range.closed(1, 3), integers()), in testEquals()
109 ContiguousSet.create(Range.closedOpen(1, 4), integers()), in testEquals()
111 ContiguousSet.create(Range.openClosed(0, 3), integers()), in testEquals()
112 ContiguousSet.create(Range.open(0, 4), integers()), in testEquals()
113 ContiguousSet.create(Range.closed(1, 3), NOT_EQUAL_TO_INTEGERS), in testEquals()
114 ContiguousSet.create(Range.closedOpen(1, 4), NOT_EQUAL_TO_INTEGERS), in testEquals()
115 ContiguousSet.create(Range.openClosed(0, 3), NOT_EQUAL_TO_INTEGERS), in testEquals()
116 ContiguousSet.create(Range.open(0, 4), NOT_EQUAL_TO_INTEGERS), in testEquals()
119 ContiguousSet.create(Range.closedOpen(1, 1), integers()), in testEquals()
128 ContiguousSet.create(Range.<Integer>all(), integers())); in testEquals()
[all …]
/external/javaparser/javaparser-core-testing/src/test/java/com/github/javaparser/
DRangeTest.java32 Range r = Range.range(1, 1, 3, 10); in aRangeContainsItself()
38 Range r = Range.range(1, 1, 3, 10); in aRangeDoesNotStrictlyContainsItself()
44 Range r1 = Range.range(1, 1, 3, 10); in overlappingButNotContainedRangesAreNotOnContains()
45 Range r2 = Range.range(2, 1, 7, 10); in overlappingButNotContainedRangesAreNotOnContains()
52 Range r1 = Range.range(1, 1, 3, 10); in overlappingButNotContainedRangesAreNotOnStrictlyContains()
53 Range r2 = Range.range(2, 1, 7, 10); in overlappingButNotContainedRangesAreNotOnStrictlyContains()
60 Range r1 = Range.range(1, 1, 3, 10); in unrelatedRangesAreNotOnContains()
61 Range r2 = Range.range(5, 1, 7, 10); in unrelatedRangesAreNotOnContains()
68 Range r1 = Range.range(1, 1, 3, 10); in unrelatedRangesAreNotOnStrictlyContains()
69 Range r2 = Range.range(5, 1, 7, 10); in unrelatedRangesAreNotOnStrictlyContains()
[all …]
/external/guava/android/guava/src/com/google/common/collect/
DTreeRangeSet.java47 @VisibleForTesting final NavigableMap<Cut<C>, Range<C>> rangesByLowerBound;
51 return new TreeRangeSet<C>(new TreeMap<Cut<C>, Range<C>>()); in create()
70 public static <C extends Comparable<?>> TreeRangeSet<C> create(Iterable<Range<C>> ranges) { in create()
76 private TreeRangeSet(NavigableMap<Cut<C>, Range<C>> rangesByLowerCut) { in TreeRangeSet()
80 @CheckForNull private transient Set<Range<C>> asRanges;
81 @CheckForNull private transient Set<Range<C>> asDescendingSetOfRanges;
84 public Set<Range<C>> asRanges() { in asRanges()
85 Set<Range<C>> result = asRanges; in asRanges()
90 public Set<Range<C>> asDescendingSetOfRanges() { in asDescendingSetOfRanges()
91 Set<Range<C>> result = asDescendingSetOfRanges; in asDescendingSetOfRanges()
[all …]
DTreeRangeMap.java68 extends AbstractMapEntry<Range<K>, V> {
69 private final Range<K> range;
73 this(Range.create(lowerBound, upperBound), value); in RangeMapEntry()
76 RangeMapEntry(Range<K> range, V value) { in RangeMapEntry()
82 public Range<K> getKey() { in getKey()
107 Entry<Range<K>, V> entry = getEntry(key); in get()
113 public Entry<Range<K>, V> getEntry(K key) { in getEntry()
124 public void put(Range<K> range, V value) { in put()
133 public void putCoalescing(Range<K> range, V value) { in putCoalescing()
140 Range<K> coalescedRange = coalescedRange(range, checkNotNull(value)); in putCoalescing()
[all …]
/external/guava/guava/src/com/google/common/collect/
DTreeRangeSet.java47 @VisibleForTesting final NavigableMap<Cut<C>, Range<C>> rangesByLowerBound;
51 return new TreeRangeSet<C>(new TreeMap<Cut<C>, Range<C>>()); in create()
70 public static <C extends Comparable<?>> TreeRangeSet<C> create(Iterable<Range<C>> ranges) { in create()
76 private TreeRangeSet(NavigableMap<Cut<C>, Range<C>> rangesByLowerCut) { in TreeRangeSet()
80 @CheckForNull private transient Set<Range<C>> asRanges;
81 @CheckForNull private transient Set<Range<C>> asDescendingSetOfRanges;
84 public Set<Range<C>> asRanges() { in asRanges()
85 Set<Range<C>> result = asRanges; in asRanges()
90 public Set<Range<C>> asDescendingSetOfRanges() { in asDescendingSetOfRanges()
91 Set<Range<C>> result = asDescendingSetOfRanges; in asDescendingSetOfRanges()
[all …]
DImmutableRangeSet.java56 new ImmutableRangeSet<>(ImmutableList.<Range<Comparable<?>>>of());
59 new ImmutableRangeSet<>(ImmutableList.of(Range.<Comparable<?>>all()));
69 Collector<Range<E>, ?, ImmutableRangeSet<E>> toImmutableRangeSet() { in toImmutableRangeSet()
87 public static <C extends Comparable> ImmutableRangeSet<C> of(Range<C> range) { in of()
91 } else if (range.equals(Range.all())) { in of()
109 } else if (rangeSet.encloses(Range.<C>all())) { in copyOf()
130 public static <C extends Comparable<?>> ImmutableRangeSet<C> copyOf(Iterable<Range<C>> ranges) { in copyOf()
142 public static <C extends Comparable<?>> ImmutableRangeSet<C> unionOf(Iterable<Range<C>> ranges) { in unionOf()
146 ImmutableRangeSet(ImmutableList<Range<C>> ranges) { in ImmutableRangeSet()
150 private ImmutableRangeSet(ImmutableList<Range<C>> ranges, ImmutableRangeSet<C> complement) { in ImmutableRangeSet()
[all …]
/external/clang/unittests/Tooling/
DRefactoringTest.cpp439 TEST(Range, overlaps) { in TEST() argument
440 EXPECT_TRUE(Range(10, 10).overlapsWith(Range(0, 11))); in TEST()
441 EXPECT_TRUE(Range(0, 11).overlapsWith(Range(10, 10))); in TEST()
442 EXPECT_FALSE(Range(10, 10).overlapsWith(Range(0, 10))); in TEST()
443 EXPECT_FALSE(Range(0, 10).overlapsWith(Range(10, 10))); in TEST()
444 EXPECT_TRUE(Range(0, 10).overlapsWith(Range(2, 6))); in TEST()
445 EXPECT_TRUE(Range(2, 6).overlapsWith(Range(0, 10))); in TEST()
448 TEST(Range, contains) { in TEST() argument
449 EXPECT_TRUE(Range(0, 10).contains(Range(0, 10))); in TEST()
450 EXPECT_TRUE(Range(0, 10).contains(Range(2, 6))); in TEST()
[all …]
/external/lzma/CS/7zip/Compress/RangeCoder/
DRangeCoder.cs12 public uint Range; field in SevenZip.Compression.RangeCoder.Encoder
33 Range = 0xFFFFFFFF; in Init()
56 Low += start * (Range /= total); in Encode()
57 Range *= size; in Encode()
58 while (Range < kTopValue) in Encode()
60 Range <<= 8; in Encode()
86 Range >>= 1; in EncodeDirectBits()
88 Low += Range; in EncodeDirectBits()
89 if (Range < kTopValue) in EncodeDirectBits()
91 Range <<= 8; in EncodeDirectBits()
[all …]
/external/openscreen/third_party/abseil/src/absl/container/
Dfixed_array_benchmark.cc44 ->Range(0, 1 << 16);
45 BENCHMARK_TEMPLATE(BM_FixedArray, char, 0)->Range(0, 1 << 16);
46 BENCHMARK_TEMPLATE(BM_FixedArray, char, 1)->Range(0, 1 << 16);
47 BENCHMARK_TEMPLATE(BM_FixedArray, char, 16)->Range(0, 1 << 16);
48 BENCHMARK_TEMPLATE(BM_FixedArray, char, 256)->Range(0, 1 << 16);
49 BENCHMARK_TEMPLATE(BM_FixedArray, char, 65536)->Range(0, 1 << 16);
52 ->Range(0, 1 << 16);
53 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 0)->Range(0, 1 << 16);
54 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 1)->Range(0, 1 << 16);
55 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 16)->Range(0, 1 << 16);
[all …]
/external/angle/third_party/abseil-cpp/absl/container/
Dfixed_array_benchmark.cc44 ->Range(0, 1 << 16);
45 BENCHMARK_TEMPLATE(BM_FixedArray, char, 0)->Range(0, 1 << 16);
46 BENCHMARK_TEMPLATE(BM_FixedArray, char, 1)->Range(0, 1 << 16);
47 BENCHMARK_TEMPLATE(BM_FixedArray, char, 16)->Range(0, 1 << 16);
48 BENCHMARK_TEMPLATE(BM_FixedArray, char, 256)->Range(0, 1 << 16);
49 BENCHMARK_TEMPLATE(BM_FixedArray, char, 65536)->Range(0, 1 << 16);
52 ->Range(0, 1 << 16);
53 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 0)->Range(0, 1 << 16);
54 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 1)->Range(0, 1 << 16);
55 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 16)->Range(0, 1 << 16);
[all …]
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/
Dfixed_array_benchmark.cc44 ->Range(0, 1 << 16);
45 BENCHMARK_TEMPLATE(BM_FixedArray, char, 0)->Range(0, 1 << 16);
46 BENCHMARK_TEMPLATE(BM_FixedArray, char, 1)->Range(0, 1 << 16);
47 BENCHMARK_TEMPLATE(BM_FixedArray, char, 16)->Range(0, 1 << 16);
48 BENCHMARK_TEMPLATE(BM_FixedArray, char, 256)->Range(0, 1 << 16);
49 BENCHMARK_TEMPLATE(BM_FixedArray, char, 65536)->Range(0, 1 << 16);
52 ->Range(0, 1 << 16);
53 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 0)->Range(0, 1 << 16);
54 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 1)->Range(0, 1 << 16);
55 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 16)->Range(0, 1 << 16);
[all …]
/external/abseil-cpp/absl/container/
Dfixed_array_benchmark.cc44 ->Range(0, 1 << 16);
45 BENCHMARK_TEMPLATE(BM_FixedArray, char, 0)->Range(0, 1 << 16);
46 BENCHMARK_TEMPLATE(BM_FixedArray, char, 1)->Range(0, 1 << 16);
47 BENCHMARK_TEMPLATE(BM_FixedArray, char, 16)->Range(0, 1 << 16);
48 BENCHMARK_TEMPLATE(BM_FixedArray, char, 256)->Range(0, 1 << 16);
49 BENCHMARK_TEMPLATE(BM_FixedArray, char, 65536)->Range(0, 1 << 16);
52 ->Range(0, 1 << 16);
53 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 0)->Range(0, 1 << 16);
54 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 1)->Range(0, 1 << 16);
55 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 16)->Range(0, 1 << 16);
[all …]
/external/libtextclassifier/abseil-cpp/absl/container/
Dfixed_array_benchmark.cc44 ->Range(0, 1 << 16);
45 BENCHMARK_TEMPLATE(BM_FixedArray, char, 0)->Range(0, 1 << 16);
46 BENCHMARK_TEMPLATE(BM_FixedArray, char, 1)->Range(0, 1 << 16);
47 BENCHMARK_TEMPLATE(BM_FixedArray, char, 16)->Range(0, 1 << 16);
48 BENCHMARK_TEMPLATE(BM_FixedArray, char, 256)->Range(0, 1 << 16);
49 BENCHMARK_TEMPLATE(BM_FixedArray, char, 65536)->Range(0, 1 << 16);
52 ->Range(0, 1 << 16);
53 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 0)->Range(0, 1 << 16);
54 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 1)->Range(0, 1 << 16);
55 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 16)->Range(0, 1 << 16);
[all …]
/external/webrtc/third_party/abseil-cpp/absl/container/
Dfixed_array_benchmark.cc44 ->Range(0, 1 << 16);
45 BENCHMARK_TEMPLATE(BM_FixedArray, char, 0)->Range(0, 1 << 16);
46 BENCHMARK_TEMPLATE(BM_FixedArray, char, 1)->Range(0, 1 << 16);
47 BENCHMARK_TEMPLATE(BM_FixedArray, char, 16)->Range(0, 1 << 16);
48 BENCHMARK_TEMPLATE(BM_FixedArray, char, 256)->Range(0, 1 << 16);
49 BENCHMARK_TEMPLATE(BM_FixedArray, char, 65536)->Range(0, 1 << 16);
52 ->Range(0, 1 << 16);
53 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 0)->Range(0, 1 << 16);
54 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 1)->Range(0, 1 << 16);
55 BENCHMARK_TEMPLATE(BM_FixedArray, SimpleClass, 16)->Range(0, 1 << 16);
[all …]
/external/rust/crates/combine/src/parser/
Dregex.rs59 type Range; typedef
61 fn as_match(&self) -> Self::Range; in as_match() argument
64 pub trait Regex<Range> {
65 fn is_match(&self, range: Range) -> bool; in is_match()
66 fn find_iter<F>(&self, range: Range) -> (usize, F) in find_iter()
68 F: FromIterator<Range>; in find_iter() argument
69 fn captures<F, G>(&self, range: Range) -> (usize, G) in captures()
71 F: FromIterator<Range>, in captures() argument
76 impl<'a, R, Range> Regex<Range> for &'a R
78 R: Regex<Range>,
[all …]
/external/pdfium/core/fpdfapi/cmaps/Japan1/
Dcmaps_japan1.cpp12 {"83pv-RKSJ-H", g_FXCMAP_83pv_RKSJ_H_1, nullptr, 222, 0, FXCMAP_CMap::Range,
14 {"90ms-RKSJ-H", g_FXCMAP_90ms_RKSJ_H_2, nullptr, 171, 0, FXCMAP_CMap::Range,
16 {"90ms-RKSJ-V", g_FXCMAP_90ms_RKSJ_V_2, nullptr, 78, 0, FXCMAP_CMap::Range,
19 FXCMAP_CMap::Range, -2},
21 FXCMAP_CMap::Range, -1},
22 {"90pv-RKSJ-H", g_FXCMAP_90pv_RKSJ_H_1, nullptr, 263, 0, FXCMAP_CMap::Range,
24 {"Add-RKSJ-H", g_FXCMAP_Add_RKSJ_H_1, nullptr, 635, 0, FXCMAP_CMap::Range,
26 {"Add-RKSJ-V", g_FXCMAP_Add_RKSJ_V_1, nullptr, 57, 0, FXCMAP_CMap::Range,
28 {"EUC-H", g_FXCMAP_EUC_H_1, nullptr, 120, 0, FXCMAP_CMap::Range, 0},
29 {"EUC-V", g_FXCMAP_EUC_V_1, nullptr, 27, 0, FXCMAP_CMap::Range, -1},
[all …]

12345678910>>...67