| /external/icu/icu4c/source/tools/toolutil/ |
| denseranges.h | 14 * Helper code for finding a small number of dense ranges.
23 * Does it make sense to write 1..capacity ranges?
24 * Returns 0 if not, otherwise the number of ranges.
29 * @param ranges Output ranges array.
30 * @param capacity Maximum number of ranges.
31 * @return Minimum number of ranges (at most capacity) that have the desired density,
37 int32_t ranges[][2], int32_t capacity);
|
| denseranges.cpp | 14 * Helper code for finding a small number of dense ranges.
87 * Does it make sense to write 1..capacity ranges?
88 * Returns 0 if not, otherwise the number of ranges.
93 * @param ranges Output ranges array.
94 * @param capacity Maximum number of ranges.
95 * @return Minimum number of ranges (at most capacity) that have the desired density,
101 int32_t ranges[][2], int32_t capacity) {
112 ranges[0][0]=minValue;
113 ranges[0][1]=maxValue
[all...] |
| /art/compiler/optimizing/ |
| live_interval_test.cc | 30 static constexpr size_t ranges[][2] = {{0, 42}}; local
31 LiveInterval* interval = BuildInterval(ranges, arraysize(ranges), &allocator);
36 static constexpr size_t ranges[][2] = {{4, 12}, {14, 16}}; local
37 LiveInterval* interval = BuildInterval(ranges, arraysize(ranges), &allocator);
47 static constexpr size_t ranges[][2] = {{0, 42}}; local
48 LiveInterval* interval = BuildInterval(ranges, arraysize(ranges), &allocator);
57 static constexpr size_t ranges[][2] = {{4, 12}, {14, 16}} local
75 static constexpr size_t ranges[][2] = {{0, 42}}; local
85 static constexpr size_t ranges[][2] = {{4, 12}, {14, 16}}; local
196 static constexpr size_t ranges[][2] = {{0, 4}}; local
207 static constexpr size_t ranges[][2] = {{0, 4}}; local
218 static constexpr size_t ranges[][2] = {{0, 4}, {8, 12}}; local
229 static constexpr size_t ranges[][2] = {{0, 4}, {8, 12}}; local
240 static constexpr size_t ranges[][2] = {{0, 4}, {8, 12}}; local
251 static constexpr size_t ranges[][2] = {{0, 4}, {6, 10}}; local
262 static constexpr size_t ranges[][2] = {{0, 4}, {6, 10}}; local
273 static constexpr size_t ranges[][2] = {{0, 4}}; local
287 static constexpr size_t ranges[][2] = {{0, 4}}; local
298 static constexpr size_t ranges[][2] = {{2, 4}}; local
309 static constexpr size_t ranges[][2] = {{2, 4}, {8, 10}}; local
320 static constexpr size_t ranges[][2] = {{2, 4}, {10, 12}}; local
[all...] |
| /external/llvm/test/DebugInfo/Inputs/ |
| fission-ranges.cc | 12 // $ cp fission-ranges.cc /tmp/dbginfo/
14 // $ gcc -gsplit-dwarf -O2 -fPIC fission-ranges.cc -c -o obj2.o
15 // $ clang -gsplit-dwarf -O2 -fsanitize=address -fPIC -Dmain=foo fission-ranges.cc -c -o obj1.o
|
| /external/llvm/include/llvm/Support/ |
| 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.
54 LLVM_CONSTEXPR UnicodeCharSet(CharRanges Ranges) : Ranges(Ranges) {}
56 UnicodeCharSet(CharRanges Ranges) : Ranges(Ranges) {
64 return std::binary_search(Ranges.begin(), Ranges.end(), C)
[all...] |
| /external/valgrind/coregrind/ |
| m_rangemap.c | 54 XArray* ranges; member in struct:_RangeMap
77 rm->ranges = VG_(newXA)( alloc_fn, cc, free_fn, sizeof(Range) );
83 Word i = VG_(addToXA)(rm->ranges, &r);
85 vg_assert(VG_(sizeXA)(rm->ranges) == 1);
94 vg_assert(rm->ranges);
95 VG_(deleteXA)(rm->ranges);
110 Range* rng = VG_(indexXA)(rm->ranges, i);
120 Range* rng = (Range*)VG_(indexXA)(rm->ranges, i);
128 vg_assert(rm && rm->ranges);
129 return VG_(sizeXA)(rm->ranges);
147 XArray* ranges = rm->ranges; local
163 XArray* ranges = rm->ranges; local
186 XArray* ranges = rm->ranges; local
[all...] |
| /external/chromium-trace/trace-viewer/tracing/tracing/base/ |
| range_utils_test.html | 113 var ranges = tr.b.findEmptyRangesBetweenRanges(
115 assert.equal(3, ranges.length);
116 assert.equal(0, ranges[0].min);
117 assert.equal(1, ranges[0].max);
118 assert.equal(4, ranges[1].min);
119 assert.equal(6, ranges[1].max);
120 assert.equal(8, ranges[2].min);
121 assert.equal(10, ranges[2].max);
125 var ranges = tr.b.findEmptyRangesBetweenRanges(
127 assert.equal(1, ranges.length)
[all...] |
| /external/icu/icu4c/source/i18n/ |
| collationweights.h | 54 * what ranges to use for a given number of weights between (excluding)
57 * @param lowerLimit A collation element weight; the ranges will be filled to cover
59 * @param upperLimit A collation element weight; the ranges will be filled to cover
68 * Given a set of ranges calculated by allocWeights(),
70 * The ranges are modified to keep the current iteration state.
72 * @return The next weight in the ranges, or 0xffffffff if there is none left.
93 * possible ranges of weights between the two limits, excluding them.
94 * For weights with up to 4 bytes there are up to 2*4-1=7 ranges.
103 WeightRange ranges[7]; member in class:CollationWeights
|
| collationweights.cpp | 192 /* for uprv_sortArray: sort ranges in weight order */
248 * With the limit lengths of 1..4, there are up to 7 ranges for allocation:
258 * We are now going to calculate up to 7 ranges.
259 * Some of them will typically overlap, so we will then have to merge and eliminate ranges.
300 /* reduce or remove the lower ranges that go beyond upperLimit */
307 /* lower and upper ranges collide or are directly adjacent: merge these two and remove all shorter ranges */
311 * merging directly adjacent ranges needs to subtract the 0/1 gaps in between;
328 /* print ranges */
344 /* copy the ranges, shortest first, into the result array *
[all...] |
| collationsettings.cpp | 84 const uint32_t *ranges, int32_t rangesLength,
92 (ranges[0] & 0xffff) == 0 && (ranges[rangesLength - 1] & 0xffff) != 0)) {
101 // Drop ranges before the first split byte. They are reordered by the table.
102 // This then speeds up reordering of the remaining ranges.
105 (ranges[firstSplitByteRangeIndex] & 0xff0000) == 0) {
115 U_ASSERT(table[ranges[firstSplitByteRangeIndex] >> 24] == 0);
116 minHighNoReorder = ranges[rangesLength - 1] & 0xffff0000;
117 reorderRanges = ranges + firstSplitByteRangeIndex;
143 const uint32_t *ranges = reinterpret_cast<uint32_t *>(rangesList.getBuffer()) local
262 const uint32_t *ranges = reorderRanges; local
[all...] |
| /external/regex-re2/re2/ |
| unicode_groups.h | 7 // The codes get split into ranges of 16-bit codes
8 // and ranges of 32-bit codes. It would be simpler
9 // to use only 32-bit ranges, but these tables are large
12 // Using just 32-bit ranges gives 27 kB of data.
13 // Adding 16-bit ranges gives 18 kB of data.
|
| make_unicode_groups.py | 32 ranges = []
36 ranges[-1][1] = c
38 ranges.append([c, c])
40 return ranges
42 def PrintRanges(type, name, ranges):
43 """Print the ranges as an array of type named name."""
45 for lo, hi in ranges:
62 # Split codes into 16-bit ranges and 32-bit ranges.
66 # Pull singleton ranges out of range16
[all...] |
| make_perl_groups.pl | 6 # Generate table entries giving character ranges
36 my @ranges;
48 push @ranges, [$start, $i-1];
53 return @ranges;
57 my ($cname, $name, @ranges) = @_;
59 for (my $i=0; $i<@ranges; $i++) {
60 my @a = @{$ranges[$i]};
64 my $n = @ranges;
82 my @ranges = ComputeClass($cl);
83 push @entries, PrintClass(++$gen, $cl, @ranges);
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| CollationWeights.java | 72 * what ranges to use for a given number of weights between (excluding)
75 * @param lowerLimit A collation element weight; the ranges will be filled to cover
77 * @param upperLimit A collation element weight; the ranges will be filled to cover
85 // which ranges to use for a given number of weights between (excluding)
90 // printf("error: unable to get Weight ranges\n");
94 /* try until we find suitably large ranges */
97 int minLength=ranges[0].length;
109 /* no good match, lengthen all minLength ranges and iterate */
110 // printf("lengthen the short ranges from %ld bytes to %ld and iterate\n", minLength, minLength+1);
111 for(int i=0; ranges[i].length==minLength; ++i)
534 private WeightRange[] ranges = new WeightRange[7]; field in class:CollationWeights
[all...] |
| /frameworks/base/services/core/jni/ |
| com_android_server_ConsumerIrService.cpp | 72 consumerir_freq_range_t *ranges; local
79 ranges = new consumerir_freq_range_t[len];
81 len = dev->get_carrier_freqs(dev, len, ranges);
83 delete[] ranges;
91 delete[] ranges;
95 arr[i*2] = ranges[i].min;
96 arr[i*2+1] = ranges[i].max;
99 delete[] ranges;
|
| /bootable/recovery/minzip/ |
| SysUtil.c | 81 pMap->ranges = malloc(sizeof(MappedRange));
82 pMap->ranges[0].addr = memPtr;
83 pMap->ranges[0].length = length;
116 pMap->ranges = malloc(range_count * sizeof(MappedRange));
117 memset(pMap->ranges, 0, range_count * sizeof(MappedRange));
127 pMap->ranges[range_count-1].addr = reserve;
128 pMap->ranges[range_count-1].length = blocks * blksize;
149 pMap->ranges[i].addr = addr;
150 pMap->ranges[i].length = (end-start)*blksize;
152 next += pMap->ranges[i].length
[all...] |
| /dalvik/dx/tests/096-dex-giant-catch/ |
| info.txt | 2 very long catch ranges (that cover >= 65536 code units) get emitted
|
| /external/pcre/dist/testdata/ |
| testinput23 | 14 /-- Check character ranges --/
|
| /external/easymock/src/org/easymock/internal/ |
| Results.java | 29 private final LinkedList<Range> ranges = new LinkedList<Range>();
field in class:Results
34 if (!ranges.isEmpty()) {
35 Range lastRange = ranges.getLast();
41 ranges.add(range);
47 for (int i = 0; i < ranges.size(); i++) {
48 Range interval = ranges.get(i);
74 for (Range interval : ranges) {
|
| /external/compiler-rt/test/msan/ |
| ifaddrs.cc | 18 ranges.push_back(std::make_pair((void *)addr, (size_t)size)); \
34 std::vector<std::pair<void *, size_t> > ranges; local
47 for (int i = 0; i < ranges.size(); i++)
48 assert(0 == __msan_test_shadow(ranges[i].first, ranges[i].second));
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| RangeDateRule.java | 31 // public RangeDateRule(Range[] ranges)
33 // for (int i = 0; i < ranges.length; i++) {
34 // this.ranges.addElement(ranges[i]);
53 ranges.add(new Range(start, rule));
65 if (index == ranges.size()) {
134 * returns an index >= ranges.size() if there is none
137 int lastIndex = ranges.size();
139 for (int i = 0; i < ranges.size(); i++) {
140 Range r = ranges.get(i)
154 List<Range> ranges = new ArrayList<Range>(2); field in class:RangeDateRule
[all...] |
| /frameworks/av/media/libstagefright/data/ |
| media_codecs_google_audio.xml | 21 <Limit name="sample-rate" ranges="8000,11025,12000,16000,22050,24000,32000,44100,48000" />
26 <Limit name="sample-rate" ranges="8000" />
31 <Limit name="sample-rate" ranges="16000" />
36 <Limit name="sample-rate" ranges="7350,8000,11025,12000,16000,22050,24000,32000,44100,48000" />
41 <Limit name="sample-rate" ranges="8000-48000" />
46 <Limit name="sample-rate" ranges="8000-48000" />
51 <Limit name="sample-rate" ranges="8000-96000" />
56 <Limit name="sample-rate" ranges="48000" />
61 <Limit name="sample-rate" ranges="8000-96000" />
68 <Limit name="sample-rate" ranges="8000,11025,12000,16000,22050,24000,32000,44100,48000" /
[all...] |
| /external/selinux/libsemanage/man/man3/ |
| semanage_port.3 | 144 count the number of port ranges defined in the persistent policy
149 count the number of port ranges defined in the local store
164 return an array containing all port ranges in the persistent policy
169 return an array containing all port ranges in the local store
|
| /frameworks/base/packages/PrintSpooler/src/com/android/printspooler/util/ |
| PageRangeUtils.java | 26 * This class contains utility functions for working with page ranges.
44 * Gets whether page ranges contains a given page.
46 * @param pageRanges The page ranges.
48 * @return Whether the page is within the ranges.
64 * @param ourRanges The container page ranges.
65 * @param otherRanges The contained page ranges.
67 * @return Whether the container page ranges contains the contained ones.
85 // Note that the code below relies on the ranges being normalized
87 // sub-ranges whose start is less that or equal to the end.
108 * Normalizes a page range, which is the resulting page ranges ar
[all...] |
| /external/lldb/source/Plugins/SymbolFile/DWARF/ |
| DWARFDebugRanges.cpp | 43 // if (!ranges.empty())
45 // Range::iterator pos = ranges.begin();
46 // Range::iterator end_pos = ranges.end();
47 // for (pos = ranges.begin(); pos != end_pos; ++pos)
61 // if (!ranges.empty())
63 // Range::iterator pos = ranges.begin();
64 // Range::iterator end_pos = ranges.end();
65 // for (pos = ranges.begin(); pos != end_pos; ++pos)
79 // if (i < ranges.size())
80 // return &ranges[i]
[all...] |
