| /external/pdfium/core/fpdfapi/cmaps/GB1/ |
| cmaps_gb1.cpp | 15 {"GB-EUC-H", g_FXCMAP_GB_EUC_H_0, nullptr, 90, 0, FXCMAP_CMap::Range, 0},
16 {"GB-EUC-V", g_FXCMAP_GB_EUC_V_0, nullptr, 20, 0, FXCMAP_CMap::Range, -1},
17 {"GBpc-EUC-H", g_FXCMAP_GBpc_EUC_H_0, nullptr, 91, 0, FXCMAP_CMap::Range,
19 {"GBpc-EUC-V", g_FXCMAP_GBpc_EUC_V_0, nullptr, 20, 0, FXCMAP_CMap::Range,
21 {"GBK-EUC-H", g_FXCMAP_GBK_EUC_H_2, nullptr, 4071, 0, FXCMAP_CMap::Range,
23 {"GBK-EUC-V", g_FXCMAP_GBK_EUC_V_2, nullptr, 20, 0, FXCMAP_CMap::Range, -1},
24 {"GBKp-EUC-H", g_FXCMAP_GBKp_EUC_H_2, nullptr, 4070, 0, FXCMAP_CMap::Range,
26 {"GBKp-EUC-V", g_FXCMAP_GBKp_EUC_V_2, nullptr, 20, 0, FXCMAP_CMap::Range,
29 FXCMAP_CMap::Range, -4},
30 {"GBK2K-V", g_FXCMAP_GBK2K_V_5, nullptr, 41, 0, FXCMAP_CMap::Range, -1}
[all...] |
| /external/pdfium/core/fpdfapi/cmaps/CNS1/ |
| cmaps_cns1.cpp | 15 {"B5pc-H", g_FXCMAP_B5pc_H_0, nullptr, 247, 0, FXCMAP_CMap::Range, 0},
16 {"B5pc-V", g_FXCMAP_B5pc_V_0, nullptr, 12, 0, FXCMAP_CMap::Range, -1},
17 {"HKscs-B5-H", g_FXCMAP_HKscs_B5_H_5, nullptr, 1210, 0, FXCMAP_CMap::Range,
19 {"HKscs-B5-V", g_FXCMAP_HKscs_B5_V_5, nullptr, 13, 0, FXCMAP_CMap::Range,
21 {"ETen-B5-H", g_FXCMAP_ETen_B5_H_0, nullptr, 254, 0, FXCMAP_CMap::Range, 0},
22 {"ETen-B5-V", g_FXCMAP_ETen_B5_V_0, nullptr, 13, 0, FXCMAP_CMap::Range, -1},
23 {"ETenms-B5-H", g_FXCMAP_ETenms_B5_H_0, nullptr, 1, 0, FXCMAP_CMap::Range,
25 {"ETenms-B5-V", g_FXCMAP_ETenms_B5_V_0, nullptr, 18, 0, FXCMAP_CMap::Range,
28 FXCMAP_CMap::Range, 0},
30 FXCMAP_CMap::Range, 0}
[all...] |
| /external/pdfium/testing/ |
| range_set.h | 15 using Range = std::pair<size_t, size_t>;
20 bool Contains(const Range& range) const;
22 void Union(const Range& range);
31 bool operator()(const Range& lval, const Range& rval) const {
36 using RangesContainer = std::set<Range, range_compare>;
40 Range FixDirection(const Range& range) const
[all...] |
| range_set.cpp | 14 bool RangeSet::Contains(const Range& range) const {
15 if (IsEmptyRange(range))
18 const Range fixed_range = FixDirection(range);
22 return false; // No ranges includes range.first.
24 --it; // Now it starts equal or before range.first.
28 void RangeSet::Union(const Range& range) {
29 if (IsEmptyRange(range))
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/utils/TableGen/ |
| Types.cpp | 19 const char *llvm::getMinimalTypeForRange(uint64_t Range, unsigned MaxSize LLVM_ATTRIBUTE_UNUSED) {
26 assert(((MaxSize > 32) ? Range <= 0xFFFFFFFFFFFFFFFFULL
27 : Range <= 0xFFFFFFFFULL) &&
30 if (Range > 0xFFFFFFFFULL)
32 if (Range > 0xFFFF)
34 if (Range > 0xFF)
|
| /external/javaparser/javaparser-testing/src/test/java/com/github/javaparser/ |
| RangeTest.java | 34 Range r = Range.range(1, 1, 3, 10);
40 Range r = Range.range(1, 1, 3, 10);
46 Range r1 = Range.range(1, 1, 3, 10);
47 Range r2 = Range.range(2, 1, 7, 10)
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| RangeNonGwtTest.java | 24 * 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));
|
| RangeTest.java | 38 * Unit test for {@link Range}.
45 Range<Integer> range = Range.open(4, 8); local
46 checkContains(range);
47 assertTrue(range.hasLowerBound());
48 assertEquals(4, (int) range.lowerEndpoint());
49 assertEquals(OPEN, range.lowerBoundType());
50 assertTrue(range.hasUpperBound());
51 assertEquals(8, (int) range.upperEndpoint())
72 Range<Integer> range = Range.closed(5, 7); local
94 Range<Integer> range = Range.openClosed(4, 7); local
108 Range<Integer> range = Range.closedOpen(5, 8); local
139 Range<Integer> range = Range.closed(4, 4); local
155 Range<Integer> range = Range.closedOpen(4, 4); local
171 Range<Integer> range = Range.openClosed(4, 4); local
187 Range<Integer> range = Range.lessThan(5); local
201 Range<Integer> range = Range.greaterThan(5); local
215 Range<Integer> range = Range.atLeast(6); local
229 Range<Integer> range = Range.atMost(4); local
243 Range<Integer> range = Range.all(); local
294 Range<Integer> range = Range.closed(3, 5); local
310 Range<Integer> range = Range.open(2, 5); local
328 Range<Integer> range = Range.closed(2, 5); local
345 Range<Integer> range = Range.closedOpen(3, 3); local
361 Range<Integer> range = Range.open(3, 4); local
386 Range<Integer> range = Range.closed(3, 3); local
412 Range<Integer> range = Range.closed(4, 8); local
465 Range<Integer> range = Range.closed(4, 8); local
535 Range<LegacyComparable> range local
[all...] |
| ImmutableRangeSetTest.java | 42 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.closedOpen(1, 3)
[all...] |
| TreeRangeMapTest.java | 47 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<Integer>, String> entry = (Entry<Range<Integer>, String>) o
[all...] |
| TreeRangeSetTest.java | 18 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))
422 doPairTest(range(aLow, aLowType, aHigh, aHighType), method
423 range(bLow, bLowType, bHigh, bHighType)); method
[all...] |
| /external/pdfium/core/fpdfapi/cmaps/Japan1/ |
| cmaps_japan1.cpp | 15 {"83pv-RKSJ-H", g_FXCMAP_83pv_RKSJ_H_1, nullptr, 222, 0, FXCMAP_CMap::Range,
17 {"90ms-RKSJ-H", g_FXCMAP_90ms_RKSJ_H_2, nullptr, 171, 0, FXCMAP_CMap::Range,
19 {"90ms-RKSJ-V", g_FXCMAP_90ms_RKSJ_V_2, nullptr, 78, 0, FXCMAP_CMap::Range,
22 FXCMAP_CMap::Range, -2},
24 FXCMAP_CMap::Range, -1},
25 {"90pv-RKSJ-H", g_FXCMAP_90pv_RKSJ_H_1, nullptr, 263, 0, FXCMAP_CMap::Range,
27 {"Add-RKSJ-H", g_FXCMAP_Add_RKSJ_H_1, nullptr, 635, 0, FXCMAP_CMap::Range,
29 {"Add-RKSJ-V", g_FXCMAP_Add_RKSJ_V_1, nullptr, 57, 0, FXCMAP_CMap::Range,
31 {"EUC-H", g_FXCMAP_EUC_H_1, nullptr, 120, 0, FXCMAP_CMap::Range, 0},
32 {"EUC-V", g_FXCMAP_EUC_V_1, nullptr, 27, 0, FXCMAP_CMap::Range, -1}
[all...] |
| /external/pdfium/core/fpdfapi/cmaps/Korea1/ |
| cmaps_korea1.cpp | 15 {"KSC-EUC-H", g_FXCMAP_KSC_EUC_H_0, nullptr, 467, 0, FXCMAP_CMap::Range, 0},
16 {"KSC-EUC-V", g_FXCMAP_KSC_EUC_V_0, nullptr, 16, 0, FXCMAP_CMap::Range, -1},
17 {"KSCms-UHC-H", g_FXCMAP_KSCms_UHC_H_1, nullptr, 675, 0, FXCMAP_CMap::Range,
19 {"KSCms-UHC-V", g_FXCMAP_KSCms_UHC_V_1, nullptr, 16, 0, FXCMAP_CMap::Range,
22 FXCMAP_CMap::Range, 0},
24 FXCMAP_CMap::Range, -1},
25 {"KSCpc-EUC-H", g_FXCMAP_KSCpc_EUC_H_0, nullptr, 509, 0, FXCMAP_CMap::Range,
28 FXCMAP_CMap::Range, 0},
30 FXCMAP_CMap::Range, -1},
34 FXCMAP_CMap::Range, -1}
[all...] |
| /external/lzma/Java/SevenZip/Compression/RangeCoder/ |
| Decoder.java | 12 int Range;
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 & kTopMask) == 0)
[all...] |
| /external/libchrome/ui/gfx/range/ |
| range.cc | 5 #include "ui/gfx/range/range.h"
16 Range Range::Intersect(const Range& range) const {
17 uint32_t min = std::max(GetMin(), range.GetMin());
18 uint32_t max = std::min(GetMax(), range.GetMax());
23 return Range(min, max);
26 std::string Range::ToString() const
[all...] |
| range.h | 16 #include "ui/gfx/range/gfx_range_export.h"
32 // A Range contains two integer values that represent a numeric range, like the
33 // range of characters in a text selection. A range is made of a start and end
34 // position; when they are the same, the Range is akin to a caret. Note that
36 // range.
37 class GFX_RANGE_EXPORT Range {
39 // Creates an empty range {0,0}.
40 constexpr Range() : Range(0) {
[all...] |
| /external/clang/lib/Tooling/ |
| FixIt.cpp | 22 StringRef getText(SourceRange Range, const ASTContext &Context) {
23 return Lexer::getSourceText(CharSourceRange::getTokenRange(Range),
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/expr/ |
| LiteralExpr.java | 24 import com.github.javaparser.Range;
34 public LiteralExpr(Range range) {
35 super(range);
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/type/ |
| ReferenceType.java | 24 import com.github.javaparser.Range;
34 public ReferenceType(final Range range) {
35 super(range);
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ |
| Range.java | 6 * A range of characters in a source file, from "begin" to "end", including the characters at "begin" and "end".
8 public class Range {
9 public static final Range UNKNOWN = range(Position.UNKNOWN, Position.UNKNOWN);
14 public Range(Position begin, Position end) {
25 public static Range range(Position begin, Position end) { method in class:Range
26 return new Range(begin, end);
29 public static Range range(int beginLine, int beginColumn, int endLine, int endColumn) method in class:Range
[all...] |
| /bootable/recovery/otautil/include/otautil/ |
| rangeset.h | 25 using Range = std::pair<size_t, size_t>;
31 explicit RangeSet(std::vector<Range>&& pairs);
37 // Appends the given Range to the current RangeSet.
38 bool PushBack(Range range);
60 // Returns the number of Range's in this RangeSet.
70 std::vector<Range>::const_iterator cbegin() const {
74 std::vector<Range>::const_iterator cend() const {
78 std::vector<Range>::iterator begin() {
82 std::vector<Range>::iterator end()
[all...] |
| /external/grpc-grpc/test/cpp/microbenchmarks/ |
| bm_fullstack_streaming_pump.cc | 35 ->Range(0, 128 * 1024 * 1024);
37 ->Range(0, 128 * 1024 * 1024);
39 ->Range(0, 128 * 1024 * 1024);
41 ->Range(0, 128 * 1024 * 1024);
43 ->Range(0, 128 * 1024 * 1024);
45 ->Range(0, 128 * 1024 * 1024);
47 ->Range(0, 128 * 1024 * 1024);
49 ->Range(0, 128 * 1024 * 1024);
51 ->Range(0, 128 * 1024 * 1024);
53 ->Range(0, 128 * 1024 * 1024)
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| RangeMap.java | 27 * associated with the range (if any) that contains a specified key.
30 * Range#isConnected(Range) connected} ranges, even if they are mapped to the same value.
41 * <p>Specifically, if any range in this range map contains the specified key, the value
42 * associated with that range is returned.
48 * Returns the range containing this key and its associated value, if such a range is present
49 * in the range map, or {@code null} otherwise.
52 Map.Entry<Range<K>, V> getEntry(K key)
[all...] |
| TreeRangeSet.java | 48 final NavigableMap<Cut<C>, Range<C>> rangesByLowerBound;
54 return new TreeRangeSet<C>(new TreeMap<Cut<C>, Range<C>>());
58 * Returns a {@code TreeRangeSet} initialized with the ranges in the specified range set.
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()
345 Range<C> range = backingItr.next(); field in class:TreeRangeSet.RangesByUpperBound
[all...] |
| /external/llvm/lib/CodeGen/ |
| SafeStackLayout.h | 25 StackColoring::LiveRange Range;
27 const StackColoring::LiveRange &Range)
28 : Start(Start), End(End), Range(Range) {}
36 StackColoring::LiveRange Range;
49 const StackColoring::LiveRange &Range);
|
