| /external/guava/guava/src/com/google/common/collect/ |
| D | ImmutableRangeSet.java | 60 * ImmutableRangeSet}. As in {@link Builder}, overlapping ranges are not permitted and adjacent
61 * ranges will be merged.
116 * Returns an {@code ImmutableRangeSet} containing each of the specified disjoint ranges.
117 * Overlapping ranges and empty ranges are forbidden, though adjacent ranges are permitted and
120 * @throws IllegalArgumentException if any ranges overlap or are empty
123 public static <C extends Comparable<?>> ImmutableRangeSet<C> copyOf(Iterable<Range<C>> ranges) { in copyOf() argument
124 return new ImmutableRangeSet.Builder<C>().addAll(ranges).build(); in copyOf()
128 * Returns an {@code ImmutableRangeSet} representing the union of the specified ranges.
130 * <p>This is the smallest {@code RangeSet} which encloses each of the specified ranges. Duplicate
131 * or connected ranges are permitted, and will be coalesced in the result.
[all …]
|
| /external/cldr/tools/java/org/unicode/cldr/util/ |
| D | StringRange.java | 81 …// TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from … in compact()
83 …Relation<Integer, Ranges> lengthToArrays = Relation.of(new TreeMap<Integer, Set<Ranges>>(), TreeSe… in compact()
85 Ranges item = new Ranges(s); in compact()
89 for (Entry<Integer, Set<Ranges>> entry : lengthToArrays.keyValuesSet()) { in compact()
90 LinkedList<Ranges> compacted = compact(entry.getKey(), entry.getValue()); in compact()
91 for (Ranges ranges : compacted) { in compact()
92 adder.add(ranges.start(), ranges.end(shorterPairs)); in compact()
108 private static LinkedList<Ranges> compact(int size, Set<Ranges> inputRanges) { in compact()
109 LinkedList<Ranges> ranges = new LinkedList<>(inputRanges); in compact() local
111 Ranges last = null; in compact()
[all …]
|
| /external/guava/android/guava/src/com/google/common/collect/ |
| D | ImmutableRangeSet.java | 103 * Returns an {@code ImmutableRangeSet} containing each of the specified disjoint ranges.
104 * Overlapping ranges and empty ranges are forbidden, though adjacent ranges are permitted and
107 * @throws IllegalArgumentException if any ranges overlap or are empty
110 public static <C extends Comparable<?>> ImmutableRangeSet<C> copyOf(Iterable<Range<C>> ranges) { in copyOf() argument
111 return new ImmutableRangeSet.Builder<C>().addAll(ranges).build(); in copyOf()
115 * Returns an {@code ImmutableRangeSet} representing the union of the specified ranges.
117 * <p>This is the smallest {@code RangeSet} which encloses each of the specified ranges. Duplicate
118 * or connected ranges are permitted, and will be coalesced in the result.
122 public static <C extends Comparable<?>> ImmutableRangeSet<C> unionOf(Iterable<Range<C>> ranges) { in unionOf() argument
123 return copyOf(TreeRangeSet.create(ranges)); in unionOf()
[all …]
|
| /external/rust/crates/regex-syntax/src/hir/ |
| D | interval.rs | 37 ranges: Vec<I>, field
44 /// The given ranges do not need to be in any specific order, and ranges
47 let mut set = IntervalSet { ranges: intervals.into_iter().collect() }; in new()
56 self.ranges.push(interval); in push()
64 IntervalSetIter(self.ranges.iter()) in iter()
71 &self.ranges in intervals()
77 /// ranges `a-z` and `A-Z`.
82 let len = self.ranges.len(); in case_fold_simple()
84 let range = self.ranges[i]; in case_fold_simple()
85 if let Err(err) = range.case_fold_simple(&mut self.ranges) { in case_fold_simple()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| D | StringRange.java | 95 …// TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from … in compact()
97 …Relation<Integer,Ranges> lengthToArrays = Relation.of(new TreeMap<Integer,Set<Ranges>>(), TreeSet.… in compact()
99 Ranges item = new Ranges(s); in compact()
103 for (Entry<Integer, Set<Ranges>> entry : lengthToArrays.keyValuesSet()) { in compact()
104 LinkedList<Ranges> compacted = compact(entry.getKey(), entry.getValue()); in compact()
105 for (Ranges ranges : compacted) { in compact()
106 adder.add(ranges.start(), ranges.end(shorterPairs)); in compact()
122 private static LinkedList<Ranges> compact(int size, Set<Ranges> inputRanges) { in compact()
123 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); in compact() local
125 Ranges last = null; in compact()
[all …]
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | StringRange.java | 88 …// TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from … in compact()
90 …Relation<Integer,Ranges> lengthToArrays = Relation.of(new TreeMap<Integer,Set<Ranges>>(), TreeSet.… in compact()
92 Ranges item = new Ranges(s); in compact()
96 for (Entry<Integer, Set<Ranges>> entry : lengthToArrays.keyValuesSet()) { in compact()
97 LinkedList<Ranges> compacted = compact(entry.getKey(), entry.getValue()); in compact()
98 for (Ranges ranges : compacted) { in compact()
99 adder.add(ranges.start(), ranges.end(shorterPairs)); in compact()
115 private static LinkedList<Ranges> compact(int size, Set<Ranges> inputRanges) { in compact()
116 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); in compact() local
118 Ranges last = null; in compact()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| D | CollationWeights.java | 76 * what ranges to use for a given number of weights between (excluding)
79 * @param lowerLimit A collation element weight; the ranges will be filled to cover
81 * @param upperLimit A collation element weight; the ranges will be filled to cover
89 // which ranges to use for a given number of weights between (excluding) in allocWeights()
94 // printf("error: unable to get Weight ranges\n"); in allocWeights()
98 /* try until we find suitably large ranges */ in allocWeights()
101 int minLength=ranges[0].length; in allocWeights()
113 /* no good match, lengthen all minLength ranges and iterate */ in allocWeights()
114 …// printf("lengthen the short ranges from %ld bytes to %ld and iterate\n", minLength, minLength+1); in allocWeights()
115 for (int i = 0; i < rangeCount && ranges[i].length == minLength; ++i) { in allocWeights()
[all …]
|
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| D | CollationWeights.java | 74 * what ranges to use for a given number of weights between (excluding)
77 * @param lowerLimit A collation element weight; the ranges will be filled to cover
79 * @param upperLimit A collation element weight; the ranges will be filled to cover
87 // which ranges to use for a given number of weights between (excluding) in allocWeights()
92 // printf("error: unable to get Weight ranges\n"); in allocWeights()
96 /* try until we find suitably large ranges */ in allocWeights()
99 int minLength=ranges[0].length; in allocWeights()
111 /* no good match, lengthen all minLength ranges and iterate */ in allocWeights()
112 …// printf("lengthen the short ranges from %ld bytes to %ld and iterate\n", minLength, minLength+1); in allocWeights()
113 for (int i = 0; i < rangeCount && ranges[i].length == minLength; ++i) { in allocWeights()
[all …]
|
| /external/icu/icu4c/source/i18n/ |
| D | collationweights.cpp | 194 /* for uprv_sortArray: sort ranges in weight order */
250 * With the limit lengths of 1..4, there are up to 7 ranges for allocation: in getWeightRanges()
260 * We are now going to calculate up to 7 ranges. in getWeightRanges()
261 * Some of them will typically overlap, so we will then have to merge and eliminate ranges. in getWeightRanges()
313 // These two lower and upper ranges collide. in getWeightRanges()
322 // Intersect these two ranges. in getWeightRanges()
335 // Merge adjacent ranges. in getWeightRanges()
342 // Remove all shorter ranges. in getWeightRanges()
343 // There was no room available for them between the ranges we just merged. in getWeightRanges()
355 /* print ranges */ in getWeightRanges()
[all …]
|
| /external/libchrome/base/metrics/ |
| D | bucket_ranges_unittest.cc | 15 BucketRanges ranges(5); in TEST() local
16 ASSERT_EQ(5u, ranges.size()); in TEST()
17 ASSERT_EQ(4u, ranges.bucket_count()); in TEST()
20 EXPECT_EQ(0, ranges.range(i)); in TEST()
22 EXPECT_EQ(0u, ranges.checksum()); in TEST()
24 ranges.set_range(3, 100); in TEST()
25 EXPECT_EQ(100, ranges.range(3)); in TEST()
29 // Compare empty ranges. in TEST()
38 // Compare full filled ranges. in TEST()
61 BucketRanges ranges(3); in TEST() local
[all …]
|
| D | sample_vector_unittest.cc | 34 BucketRanges ranges(3); in TEST_F() local
35 ranges.set_range(0, 1); in TEST_F()
36 ranges.set_range(1, 5); in TEST_F()
37 ranges.set_range(2, 10); in TEST_F()
38 SampleVector samples(1, &ranges); in TEST_F()
61 BucketRanges ranges(3); in TEST_F() local
62 ranges.set_range(0, 1); in TEST_F()
63 ranges.set_range(1, 250000000); in TEST_F()
64 ranges.set_range(2, 500000000); in TEST_F()
65 SampleVector samples(1, &ranges); in TEST_F()
[all …]
|
| D | histogram.cc | 128 BucketRanges* ranges = new BucketRanges(bucket_count_ + 1); in CreateRanges() local
129 Histogram::InitializeBucketRanges(minimum_, maximum_, ranges); in CreateRanges()
130 return ranges; in CreateRanges()
135 virtual std::unique_ptr<HistogramBase> HeapAlloc(const BucketRanges* ranges) { in HeapAlloc() argument
137 new Histogram(GetPermanentName(name_), minimum_, maximum_, ranges)); in HeapAlloc()
311 const BucketRanges* ranges, in PersistentCreate() argument
316 return WrapUnique(new Histogram(name, minimum, maximum, ranges, counts, in PersistentCreate()
324 // ranges(i) == ranges(i + 1)
332 BucketRanges* ranges) { in InitializeBucketRanges() argument
338 ranges->set_range(bucket_index, current); in InitializeBucketRanges()
[all …]
|
| /external/llvm-project/llvm/include/llvm/Support/ |
| D | UnicodeCharRanges.h | 1 //===--- UnicodeCharRanges.h - Types and functions for character ranges ---===//
45 /// Array pointed by \p Ranges should have the lifetime at least as long as
48 /// instances per each array of ranges, as possible.
55 constexpr UnicodeCharSet(CharRanges Ranges) : Ranges(Ranges) {} in UnicodeCharSet() argument
57 UnicodeCharSet(CharRanges Ranges) : Ranges(Ranges) { in UnicodeCharSet() argument
65 return std::binary_search(Ranges.begin(), Ranges.end(), C); in contains()
69 /// Returns true if each of the ranges is a proper closed range
70 /// [min, max], and if the ranges themselves are ordered and non-overlapping.
73 for (CharRanges::const_iterator I = Ranges.begin(), E = Ranges.end(); in rangesAreValid()
75 if (I != Ranges.begin() && Prev >= I->Lower) { in rangesAreValid()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/ |
| D | UnicodeCharRanges.h | 1 //===--- UnicodeCharRanges.h - Types and functions for character ranges ---===//
45 /// Array pointed by \p Ranges should have the lifetime at least as long as
48 /// instances per each array of ranges, as possible.
55 constexpr UnicodeCharSet(CharRanges Ranges) : Ranges(Ranges) {} in UnicodeCharSet() argument
57 UnicodeCharSet(CharRanges Ranges) : Ranges(Ranges) { in UnicodeCharSet() argument
65 return std::binary_search(Ranges.begin(), Ranges.end(), C); in contains()
69 /// Returns true if each of the ranges is a proper closed range
70 /// [min, max], and if the ranges themselves are ordered and non-overlapping.
73 for (CharRanges::const_iterator I = Ranges.begin(), E = Ranges.end(); in rangesAreValid()
75 if (I != Ranges.begin() && Prev >= I->Lower) { in rangesAreValid()
[all …]
|
| /external/mesa3d/src/amd/vulkan/winsys/amdgpu/ |
| D | radv_amdgpu_bo.c | 145 if (bo->ranges[i].bo) in radv_amdgpu_winsys_rebuild_bo_list()
146 bo->bos[temp_bo_count++] = bo->ranges[i].bo; in radv_amdgpu_winsys_rebuild_bo_list()
175 …/* We have at most 2 new ranges (1 by the bind, and another one by splitting a range that contains… in radv_amdgpu_winsys_bo_virtual_bind()
178 struct radv_amdgpu_map_range *ranges = in radv_amdgpu_winsys_bo_virtual_bind() local
179 realloc(parent->ranges, in radv_amdgpu_winsys_bo_virtual_bind()
181 if (!ranges) in radv_amdgpu_winsys_bo_virtual_bind()
183 parent->ranges = ranges; in radv_amdgpu_winsys_bo_virtual_bind()
188 * [first, last] is exactly the range of ranges that either overlap the in radv_amdgpu_winsys_bo_virtual_bind()
189 * new parent, or are adjacent to it. This corresponds to the bind ranges in radv_amdgpu_winsys_bo_virtual_bind()
192 …while(first + 1 < parent->range_count && parent->ranges[first].offset + parent->ranges[first].size… in radv_amdgpu_winsys_bo_virtual_bind()
[all …]
|
| /external/llvm-project/llvm/lib/DebugInfo/GSYM/ |
| D | Range.cpp | 24 auto It = llvm::upper_bound(Ranges, Range); in insert()
26 while (It2 != Ranges.end() && It2->Start < Range.End) in insert()
30 It = Ranges.erase(It, It2); in insert()
32 if (It != Ranges.begin() && Range.Start < It[-1].End) in insert()
35 Ranges.insert(It, Range); in insert()
40 Ranges.begin(), Ranges.end(), in contains()
42 return It != Ranges.begin() && Addr < It[-1].End; in contains()
49 Ranges.begin(), Ranges.end(), in contains()
51 if (It == Ranges.begin()) in contains()
59 Ranges.begin(), Ranges.end(), in getRangeThatContains()
[all …]
|
| D | InlineInfo.cpp | 25 for (auto Range : II.Ranges) { in operator <<()
41 if (II.Ranges.contains(Addr)) { in getInlineStackHelper()
66 /// objects where the addres ranges isn't contained in the InlineInfo object
74 /// \param SkippedRanges If true, address ranges have already been skipped.
112 Inline.Ranges.decode(Data, BaseAddr, Offset); in lookup()
113 if (Inline.Ranges.empty()) in lookup()
117 if (!Inline.Ranges.contains(Addr)) { in lookup()
129 // Child address ranges are encoded relative to the first address in the in lookup()
131 const auto ChildBaseAddr = Inline.Ranges[0].Start; in lookup()
153 SrcLocs.back().Offset = Addr - Inline.Ranges[0].Start; in lookup()
[all …]
|
| /external/llvm/include/llvm/Support/ |
| D | UnicodeCharRanges.h | 1 //===--- UnicodeCharRanges.h - Types and functions for character ranges ---===//
49 /// Array pointed by \p Ranges should have the lifetime at least as long as
52 /// instances per each array of ranges, as possible.
59 LLVM_CONSTEXPR UnicodeCharSet(CharRanges Ranges) : Ranges(Ranges) {} in UnicodeCharSet() argument
61 UnicodeCharSet(CharRanges Ranges) : Ranges(Ranges) { in UnicodeCharSet() argument
69 return std::binary_search(Ranges.begin(), Ranges.end(), C); in contains()
73 /// \brief Returns true if each of the ranges is a proper closed range
74 /// [min, max], and if the ranges themselves are ordered and non-overlapping.
77 for (CharRanges::const_iterator I = Ranges.begin(), E = Ranges.end(); in rangesAreValid()
79 if (I != Ranges.begin() && Prev >= I->Lower) { in rangesAreValid()
[all …]
|
| /external/llvm-project/llvm/test/DebugInfo/X86/ |
| D | live-debug-values-constprop.mir | 2 …iletype=obj -mtriple=x86_64-unknown-unknown | llvm-dwarfdump - | FileCheck %s --check-prefix=RANGES
4 # DBG_VALUEs interact, and that their ranges are correctly terminated by the
121 ; RANGES-LABEL: DW_TAG_subprogram
122 ; RANGES: DW_AT_high_pc (0x[[NOPEHIGHPC:[0-9a-f]+]])
123 ; RANGES-LABEL: DW_AT_name ("nope")
124 ; RANGES: DW_AT_location (0x{{[0-9a-f]+}}
125 ; RANGES-NEXT: [0x{{[0-9a-f]+}}, 0x[[NOPEADDR:[0-9a-f]+]]): DW_OP_reg0 RAX
126 ; RANGES-NEXT: [
127 ; RANGES-NOT: 0x[[NOPEADDR]]
128 ; RANGES-SAME: , 0x[[NOPEHIGHPC]]): DW_OP_reg0 RAX
[all …]
|
| /external/clang/unittests/Format/ |
| D | CleanupTest.cpp | 24 const std::vector<tooling::Range> &Ranges, in cleanup() argument
26 tooling::Replacements Replaces = format::cleanup(Style, Code, Ranges); in cleanup()
46 std::vector<tooling::Range> Ranges; in TEST_F() local
47 Ranges.push_back(tooling::Range(28, 0)); in TEST_F()
48 Ranges.push_back(tooling::Range(91, 6)); in TEST_F()
49 Ranges.push_back(tooling::Range(132, 0)); in TEST_F()
50 std::string Result = cleanup(Code, Ranges); in TEST_F()
66 std::vector<tooling::Range> Ranges(1, tooling::Range(0, Code.size())); in TEST_F() local
67 std::string Result = cleanup(Code, Ranges); in TEST_F()
75 // block is not affected by the changed ranges. in TEST_F()
[all …]
|
| /external/arm-trusted-firmware/fdts/ |
| D | stm32mp15xxaa-pinctrl.dtsi | 13 gpio-ranges = <&pinctrl 0 0 16>;
19 gpio-ranges = <&pinctrl 0 16 16>;
25 gpio-ranges = <&pinctrl 0 32 16>;
31 gpio-ranges = <&pinctrl 0 48 16>;
37 gpio-ranges = <&pinctrl 0 64 16>;
43 gpio-ranges = <&pinctrl 0 80 16>;
49 gpio-ranges = <&pinctrl 0 96 16>;
55 gpio-ranges = <&pinctrl 0 112 16>;
61 gpio-ranges = <&pinctrl 0 128 16>;
67 gpio-ranges = <&pinctrl 0 144 16>;
[all …]
|
| /external/elfutils/tests/ |
| D | run-all-dwarf-ranges.sh | 20 # See run-dwarf-ranges.sh
22 # gcc -c -O2 -o testfile-ranges-hello.o -gsplit-dwarf -gdwarf-4 hello.c
23 # gcc -c -O2 -o testfile-ranges-world.o -gsplit-dwarf -gdwarf-4 world.c
25 # testfile-ranges-hello.o testfile-ranges-world.o
29 testfiles testfile-ranges-hello.dwo testfile-ranges-world.dwo
31 testrun_compare ${abs_builddir}/all-dwarf-ranges testfilesplitranges4.debug <<\EOF
75 # gcc -c -O2 -o testfile-ranges-hello5.o -gsplit-dwarf -gdwarf-5 hello.c
76 # gcc -c -O2 -o testfile-ranges-world5.o -gsplit-dwarf -gdwarf-5 world.c
77 # gcc -o testfilesplitranges5 -O2 testfile-ranges-hello5.o testfile-ranges-world5.o
81 testfiles testfile-ranges-hello5.dwo testfile-ranges-world5.dwo
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/DebugInfo/GSYM/ |
| D | Range.h | 56 /// ranges to be efficiently encoded using ULEB128 encodings as we encode the
78 /// insertions and searches efficiently. The address ranges are always sorted
79 /// and never contain any invalid or empty address ranges. This allows us to
80 /// emit address ranges into the GSYM file efficiently. Intersecting address
81 /// ranges are combined during insertion so that we can emit the most compact
82 /// representation for address ranges when writing to disk.
86 Collection Ranges; variable
88 void clear() { Ranges.clear(); } in clear()
89 bool empty() const { return Ranges.empty(); } in empty()
93 size_t size() const { return Ranges.size(); } in size()
[all …]
|
| /external/llvm-project/llvm/include/llvm/DebugInfo/GSYM/ |
| D | Range.h | 57 /// ranges to be efficiently encoded using ULEB128 encodings as we encode the
79 /// insertions and searches efficiently. The address ranges are always sorted
80 /// and never contain any invalid or empty address ranges. This allows us to
81 /// emit address ranges into the GSYM file efficiently. Intersecting address
82 /// ranges are combined during insertion so that we can emit the most compact
83 /// representation for address ranges when writing to disk.
87 Collection Ranges; variable
89 void clear() { Ranges.clear(); } in clear()
90 bool empty() const { return Ranges.empty(); } in empty()
95 size_t size() const { return Ranges.size(); } in size()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/DebugInfo/GSYM/ |
| D | Range.cpp | 24 auto It = llvm::upper_bound(Ranges, Range); in insert()
26 while (It2 != Ranges.end() && It2->Start < Range.End) in insert()
30 It = Ranges.erase(It, It2); in insert()
32 if (It != Ranges.begin() && Range.Start < It[-1].End) in insert()
35 Ranges.insert(It, Range); in insert()
40 Ranges.begin(), Ranges.end(), in contains()
42 return It != Ranges.begin() && Addr < It[-1].End; in contains()
49 Ranges.begin(), Ranges.end(), in contains()
51 if (It == Ranges.begin()) in contains()
86 O.writeULEB(Ranges.size()); in encode()
[all …]
|