Searched refs:Range (Results 1 - 25 of 489) sorted by relevance

1234567891011>>

/external/guava/guava-tests/test/com/google/common/collect/
H A DRangeNonGwtTest.java24 * Test cases for {@link Range} which cannot run as GWT tests.
34 tester.testAllPublicStaticMethods(Range.class);
35 tester.testAllPublicStaticMethods(Range.class);
37 tester.testAllPublicInstanceMethods(Range.all());
38 tester.testAllPublicInstanceMethods(Range.open(1, 3));
H A DRangeTest.java38 * Unit test for {@link Range}.
45 Range<Integer> range = Range.open(4, 8);
60 Range.open(4, 3);
65 Range.open(3, 3);
72 Range<Integer> range = Range.closed(5, 7);
87 Range.closed(4, 3);
94 Range<Integer> range = Range
[all...]
H A DImmutableRangeSetTest.java42 private static final ImmutableSet<Range<Integer>> RANGES = ImmutableSet.of(
43 Range.<Integer>all(),
44 Range.closedOpen(3, 5),
45 Range.singleton(1),
46 Range.lessThan(2),
47 Range.greaterThan(10),
48 Range.atMost(4),
49 Range.atLeast(3),
50 Range.closed(4, 6),
51 Range
[all...]
H A DTreeRangeMapTest.java47 suite.addTest(MapTestSuiteBuilder.using(new TestMapGenerator<Range<Integer>, String>() {
49 public SampleElements<Entry<Range<Integer>, String>> samples() {
50 return new SampleElements<Entry<Range<Integer>, String>>(
51 mapEntry(Range.singleton(0), "banana"),
52 mapEntry(Range.closedOpen(3, 5), "frisbee"),
53 mapEntry(Range.atMost(-1), "fruitcake"),
54 mapEntry(Range.open(10, 15), "elephant"),
55 mapEntry(Range.closed(20, 22), "umbrella"));
59 public Map<Range<Integer>, String> create(Object... elements) {
63 Entry<Range<Intege
[all...]
H A DTreeRangeSetTest.java18 import static com.google.common.collect.Range.range;
36 private static final ImmutableList<Range<Integer>> QUERY_RANGES;
42 ImmutableList.Builder<Range<Integer>> queryBuilder = ImmutableList.builder();
44 queryBuilder.add(Range.<Integer>all());
48 queryBuilder.add(Range.upTo(i, boundType));
49 queryBuilder.add(Range.downTo(i, boundType));
51 queryBuilder.add(Range.singleton(i));
52 queryBuilder.add(Range.openClosed(i, i));
53 queryBuilder.add(Range.closedOpen(i, i));
58 queryBuilder.add(Range
[all...]
H A DContiguousSetTest.java78 ContiguousSet.create(Range.closed(1, 3), integers()),
79 ContiguousSet.create(Range.closedOpen(1, 4), integers()),
80 ContiguousSet.create(Range.openClosed(0, 3), integers()),
81 ContiguousSet.create(Range.open(0, 4), integers()),
82 ContiguousSet.create(Range.closed(1, 3), NOT_EQUAL_TO_INTEGERS),
83 ContiguousSet.create(Range.closedOpen(1, 4), NOT_EQUAL_TO_INTEGERS),
84 ContiguousSet.create(Range.openClosed(0, 3), NOT_EQUAL_TO_INTEGERS),
85 ContiguousSet.create(Range.open(0, 4), NOT_EQUAL_TO_INTEGERS),
90 ContiguousSet.create(Range.closed(Integer.MIN_VALUE, Integer.MAX_VALUE), integers()),
91 ContiguousSet.create(Range
[all...]
H A DAbstractRangeSetTest.java41 List<Range<C>> asRanges = ImmutableList.copyOf(rangeSet.asRanges());
45 Range<C> range1 = asRanges.get(i);
46 Range<C> range2 = asRanges.get(i + 1);
51 for (Range<C> range : asRanges) {
55 Iterator<Range<C>> itr = rangeSet.asRanges().iterator();
56 Range<C> expectedSpan = null;
65 Range<C> span = rangeSet.span();
/external/pdfium/core/fpdfapi/cmaps/CNS1/
H A Dcmaps_cns1.cpp16 {"B5pc-H", FXCMAP_CMap::Range, g_FXCMAP_B5pc_H_0, 247, FXCMAP_CMap::None,
18 {"B5pc-V", FXCMAP_CMap::Range, g_FXCMAP_B5pc_V_0, 12, FXCMAP_CMap::None,
20 {"HKscs-B5-H", FXCMAP_CMap::Range, g_FXCMAP_HKscs_B5_H_5, 1210,
22 {"HKscs-B5-V", FXCMAP_CMap::Range, g_FXCMAP_HKscs_B5_V_5, 13,
24 {"ETen-B5-H", FXCMAP_CMap::Range, g_FXCMAP_ETen_B5_H_0, 254,
26 {"ETen-B5-V", FXCMAP_CMap::Range, g_FXCMAP_ETen_B5_V_0, 13,
28 {"ETenms-B5-H", FXCMAP_CMap::Range, g_FXCMAP_ETenms_B5_H_0, 1,
30 {"ETenms-B5-V", FXCMAP_CMap::Range, g_FXCMAP_ETenms_B5_V_0, 18,
32 {"CNS-EUC-H", FXCMAP_CMap::Range, g_FXCMAP_CNS_EUC_H_0, 157,
33 FXCMAP_CMap::Range, g_FXCMAP_CNS_EUC_H_0_DWor
[all...]
/external/lzma/Java/SevenZip/Compression/RangeCoder/
H A DDecoder.java12 int Range; field in class:Decoder
30 Range = -1;
40 Range >>>= 1;
41 int t = ((Code - Range) >>> 31);
42 Code -= Range & (t - 1);
45 if ((Range & kTopMask) == 0)
48 Range <<= 8;
57 int newBound = (Range >>> kNumBitModelTotalBits) * prob;
60 Range = newBound;
62 if ((Range
[all...]
/external/pdfium/core/fpdfapi/cmaps/GB1/
H A Dcmaps_gb1.cpp16 {"GB-EUC-H", FXCMAP_CMap::Range, g_FXCMAP_GB_EUC_H_0, 90, FXCMAP_CMap::None,
18 {"GB-EUC-V", FXCMAP_CMap::Range, g_FXCMAP_GB_EUC_V_0, 20, FXCMAP_CMap::None,
20 {"GBpc-EUC-H", FXCMAP_CMap::Range, g_FXCMAP_GBpc_EUC_H_0, 91,
22 {"GBpc-EUC-V", FXCMAP_CMap::Range, g_FXCMAP_GBpc_EUC_V_0, 20,
24 {"GBK-EUC-H", FXCMAP_CMap::Range, g_FXCMAP_GBK_EUC_H_2, 4071,
26 {"GBK-EUC-V", FXCMAP_CMap::Range, g_FXCMAP_GBK_EUC_V_2, 20,
28 {"GBKp-EUC-H", FXCMAP_CMap::Range, g_FXCMAP_GBKp_EUC_H_2, 4070,
30 {"GBKp-EUC-V", FXCMAP_CMap::Range, g_FXCMAP_GBKp_EUC_V_2, 20,
32 {"GBK2K-H", FXCMAP_CMap::Range, g_FXCMAP_GBK2K_H_5, 4071,
34 {"GBK2K-V", FXCMAP_CMap::Range, g_FXCMAP_GBK2K_V_
[all...]
/external/clang/lib/Tooling/
H A DFixIt.cpp22 StringRef getText(SourceRange Range, const ASTContext &Context) { argument
23 return Lexer::getSourceText(CharSourceRange::getTokenRange(Range),
/external/pdfium/core/fpdfapi/cmaps/Japan1/
H A Dcmaps_japan1.cpp16 {"83pv-RKSJ-H", FXCMAP_CMap::Range, g_FXCMAP_83pv_RKSJ_H_1, 222,
18 {"90ms-RKSJ-H", FXCMAP_CMap::Range, g_FXCMAP_90ms_RKSJ_H_2, 171,
20 {"90ms-RKSJ-V", FXCMAP_CMap::Range, g_FXCMAP_90ms_RKSJ_V_2, 78,
22 {"90msp-RKSJ-H", FXCMAP_CMap::Range, g_FXCMAP_90msp_RKSJ_H_2, 170,
24 {"90msp-RKSJ-V", FXCMAP_CMap::Range, g_FXCMAP_90msp_RKSJ_V_2, 78,
26 {"90pv-RKSJ-H", FXCMAP_CMap::Range, g_FXCMAP_90pv_RKSJ_H_1, 263,
28 {"Add-RKSJ-H", FXCMAP_CMap::Range, g_FXCMAP_Add_RKSJ_H_1, 635,
30 {"Add-RKSJ-V", FXCMAP_CMap::Range, g_FXCMAP_Add_RKSJ_V_1, 57,
32 {"EUC-H", FXCMAP_CMap::Range, g_FXCMAP_EUC_H_1, 120, FXCMAP_CMap::None,
34 {"EUC-V", FXCMAP_CMap::Range, g_FXCMAP_EUC_V_
[all...]
/external/lzma/CS/7zip/Compress/RangeCoder/
H A DRangeCoder.cs12 public uint Range; field in class:SevenZip.Compression.RangeCoder.Encoder
33 Range = 0xFFFFFFFF;
56 Low += start * (Range /= total);
57 Range *= size;
58 while (Range < kTopValue)
60 Range <<= 8;
86 Range >>= 1;
88 Low += Range;
89 if (Range < kTopValue)
91 Range <<
125 public uint Range; field in class:SevenZip.Compression.RangeCoder.Decoder
[all...]
/external/lzma/CPP/7zip/Compress/
H A DRangeCoder.h22 UInt32 Range; member in class:NCompress::NRangeCoder::CEncoder
31 Range = 0xFFFFFFFF;
47 Low += start * (Range /= total);
48 Range *= size;
49 while (Range < kTopValue)
51 Range <<= 8;
77 Range >>= 1;
78 Low += Range & (0 - ((value >> numBits) & 1));
79 if (Range < kTopValue)
81 Range <<
111 UInt32 Range; member in class:NCompress::NRangeCoder::CDecoder
[all...]
/external/pdfium/core/fpdfapi/cmaps/Korea1/
H A Dcmaps_korea1.cpp16 {"KSC-EUC-H", FXCMAP_CMap::Range, g_FXCMAP_KSC_EUC_H_0, 467,
18 {"KSC-EUC-V", FXCMAP_CMap::Range, g_FXCMAP_KSC_EUC_V_0, 16,
20 {"KSCms-UHC-H", FXCMAP_CMap::Range, g_FXCMAP_KSCms_UHC_H_1, 675,
22 {"KSCms-UHC-V", FXCMAP_CMap::Range, g_FXCMAP_KSCms_UHC_V_1, 16,
24 {"KSCms-UHC-HW-H", FXCMAP_CMap::Range, g_FXCMAP_KSCms_UHC_HW_H_1, 675,
26 {"KSCms-UHC-HW-V", FXCMAP_CMap::Range, g_FXCMAP_KSCms_UHC_HW_V_1, 16,
28 {"KSCpc-EUC-H", FXCMAP_CMap::Range, g_FXCMAP_KSCpc_EUC_H_0, 509,
30 {"UniKS-UCS2-H", FXCMAP_CMap::Range, g_FXCMAP_UniKS_UCS2_H_1, 8394,
32 {"UniKS-UCS2-V", FXCMAP_CMap::Range, g_FXCMAP_UniKS_UCS2_V_1, 18,
36 {"UniKS-UTF16-V", FXCMAP_CMap::Range, g_FXCMAP_UniKS_UCS2_V_
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DRangeMap.java30 * Range#isConnected(Range) connected} ranges, even if they are mapped to the same value.
52 Map.Entry<Range<K>, V> getEntry(K key);
55 * Returns the minimal range {@linkplain Range#encloses(Range) enclosing} the ranges
60 Range<K> span();
66 * {@link Range#contains(Comparable) range.contains(k)}, then {@link #get(Comparable) get(k)}
69 * <p>If {@code range} {@linkplain Range#isEmpty() is empty}, then this is a no-op.
71 void put(Range<K> range, V value);
90 void remove(Range<
[all...]
H A DTreeRangeSet.java48 final NavigableMap<Cut<C>, Range<C>> rangesByLowerBound;
54 return new TreeRangeSet<C>(new TreeMap<Cut<C>, Range<C>>());
66 private TreeRangeSet(NavigableMap<Cut<C>, Range<C>> rangesByLowerCut) {
70 private transient Set<Range<C>> asRanges;
73 public Set<Range<C>> asRanges() {
74 Set<Range<C>> result = asRanges;
78 final class AsRanges extends ForwardingCollection<Range<C>> implements Set<Range<C>> {
80 protected Collection<Range<C>> delegate() {
97 public Range<
[all...]
H A DAbstractRangeSet.java33 public abstract Range<C> rangeContaining(C value);
41 public void add(Range<C> range) {
46 public void remove(Range<C> range) {
52 remove(Range.<C>all());
57 for (Range<C> range : other.asRanges()) {
67 for (Range<C> range : other.asRanges()) {
74 for (Range<C> range : other.asRanges()) {
80 public abstract boolean encloses(Range<C> otherRange);
H A DImmutableRangeMap.java46 ImmutableList.<Range<Comparable<?>>>of(), ImmutableList.of());
60 Range<K> range, V value) {
70 Map<Range<K>, ? extends V> map = rangeMap.asMapOfRanges();
71 ImmutableList.Builder<Range<K>> rangesBuilder = new ImmutableList.Builder<Range<K>>(map.size());
73 for (Entry<Range<K>, ? extends V> entry : map.entrySet()) {
105 public Builder<K, V> put(Range<K> range, V value) {
108 checkArgument(!range.isEmpty(), "Range must not be empty, but was %s", range);
111 for (Entry<Range<K>, V> entry : rangeMap.asMapOfRanges().entrySet()) {
112 Range<
[all...]
H A DRangeSet.java25 * A set comprising zero or more {@linkplain Range#isEmpty nonempty},
26 * {@linkplain Range#isConnected(Range) disconnected} ranges of type {@code C}.
28 * <p>Implementations that choose to support the {@link #add(Range)} operation are required to
32 * rangeSet.add(Range.closed(1, 10)); // {[1, 10]}
33 * rangeSet.add(Range.closedOpen(11, 15)); // disconnected range; {[1, 10], [11, 15)}
34 * rangeSet.add(Range.closedOpen(15, 20)); // connected range; {[1, 10], [11, 20)}
35 * rangeSet.add(Range.openClosed(0, 0)); // empty range; {[1, 10], [11, 20)}
36 * rangeSet.remove(Range.open(5, 10)); // splits [1, 10]; {[1, 5], [10, 10], [11, 20)}}</pre>
38 * <p>Note that the behavior of {@link Range#isEmpt
[all...]
/external/llvm/lib/CodeGen/
H A DSafeStackLayout.h25 StackColoring::LiveRange Range; member in struct:llvm::safestack::StackLayout::StackRegion
27 const StackColoring::LiveRange &Range)
28 : Start(Start), End(End), Range(Range) {}
36 StackColoring::LiveRange Range; member in struct:llvm::safestack::StackLayout::StackObject
49 const StackColoring::LiveRange &Range);
26 StackRegion(unsigned Start, unsigned End, const StackColoring::LiveRange &Range) argument
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
H A DContiguousSetTest.java61 ContiguousSet.create(Range.closed(1, 3), integers()),
62 ContiguousSet.create(Range.closedOpen(1, 4), integers()),
63 ContiguousSet.create(Range.openClosed(0, 3), integers()),
64 ContiguousSet.create(Range.open(0, 4), integers()),
65 ContiguousSet.create(Range.closed(1, 3), NOT_EQUAL_TO_INTEGERS),
66 ContiguousSet.create(Range.closedOpen(1, 4), NOT_EQUAL_TO_INTEGERS),
67 ContiguousSet.create(Range.openClosed(0, 3), NOT_EQUAL_TO_INTEGERS),
68 ContiguousSet.create(Range.open(0, 4), NOT_EQUAL_TO_INTEGERS),
73 ContiguousSet.create(Range.closed(Integer.MIN_VALUE, Integer.MAX_VALUE), integers()),
74 ContiguousSet.create(Range
[all...]
/external/easymock/src/org/easymock/internal/
H A DResults.java29 private final LinkedList<Range> ranges = new LinkedList<Range>();
33 public void add(Result result, Range range) {
35 Range lastRange = ranges.getLast();
48 Range interval = ranges.get(i);
71 private Range getMainInterval() {
74 for (Range interval : ranges) {
83 return new Range(min, max);
/external/clang/unittests/Tooling/
H A DRefactoringTest.cpp439 TEST(Range, overlaps) {
440 EXPECT_TRUE(Range(10, 10).overlapsWith(Range(0, 11)));
441 EXPECT_TRUE(Range(0, 11).overlapsWith(Range(10, 10)));
442 EXPECT_FALSE(Range(10, 10).overlapsWith(Range(0, 10)));
443 EXPECT_FALSE(Range(0, 10).overlapsWith(Range(10, 10)));
444 EXPECT_TRUE(Range(
[all...]
/external/clang/test/SemaCXX/
H A Dfor-range-no-std.cpp12 struct Range {}; struct
13 int begin(Range); // expected-note {{not viable}}
14 int end(Range);

Completed in 499 milliseconds

1234567891011>>