| /build/tools/apriori/ |
| rangesort.h | 4 /* This implements a simple sorted list of non-overlapping ranges. */
30 other ranges or contains them, or is contained by them, till we call
32 void add_unique_range_nosort(range_list_t *ranges,
38 /* Sorts the ranges. If there are overlapping ranges or ranges that contain
39 other ranges, it will cause the program to exit with a FAIL. */
40 range_list_t* sort_ranges(range_list_t *ranges);
43 range_t *find_range(range_list_t *ranges, GElf_Off value);
44 int get_num_ranges(const range_list_t *ranges);
72 range_t *ranges; member in struct:__anon619
[all...] |
| rangesort.c | 17 range_list_t *ranges = (range_list_t *)MALLOC(sizeof(range_list_t)); local
19 ranges->array = (range_t *)MALLOC(PARALLEL_ARRAY_SIZE*sizeof(range_t));
20 ranges->array_length = PARALLEL_ARRAY_SIZE;
21 ranges->num_ranges = 0;
23 ranges->is_sorted = 0;
25 return ranges;
28 void destroy_range_list(range_list_t *ranges) {
30 for (idx = 0; idx < ranges->num_ranges; idx++) {
31 if (ranges->array[idx].user_dtor) {
32 ASSERT(ranges->array[idx].user)
235 range_t *ranges = get_sorted_ranges(input, &num_ranges); local
[all...] |
| /external/elfcopy/ |
| rangesort.h | 4 /* This implements a simple sorted list of non-overlapping ranges. */
30 other ranges or contains them, or is contained by them, till we call
32 void add_unique_range_nosort(range_list_t *ranges,
38 /* Sorts the ranges. If there are overlapping ranges or ranges that contain
39 other ranges, it will cause the program to exit with a FAIL. */
40 range_list_t* sort_ranges(range_list_t *ranges);
43 range_t *find_range(range_list_t *ranges, GElf_Off value);
44 int get_num_ranges(const range_list_t *ranges);
72 range_t *ranges; member in struct:__anon3383
[all...] |
| rangesort.c | 17 range_list_t *ranges = (range_list_t *)MALLOC(sizeof(range_list_t)); local
19 ranges->array = (range_t *)MALLOC(PARALLEL_ARRAY_SIZE*sizeof(range_t));
20 ranges->array_length = PARALLEL_ARRAY_SIZE;
21 ranges->num_ranges = 0;
23 ranges->is_sorted = 0;
25 return ranges;
28 void destroy_range_list(range_list_t *ranges) {
30 for (idx = 0; idx < ranges->num_ranges; idx++) {
31 if (ranges->array[idx].user_dtor) {
32 ASSERT(ranges->array[idx].user)
253 range_t *ranges = get_sorted_ranges(input, &num_ranges); local
[all...] |
| /external/chromium/base/ |
| histogram_unittest.cc | 116 EXPECT_EQ(0, histogram->ranges(0));
119 EXPECT_EQ(power_of_2, histogram->ranges(i));
122 EXPECT_EQ(INT_MAX, histogram->ranges(8));
129 EXPECT_EQ(i, short_histogram->ranges(i));
130 EXPECT_EQ(INT_MAX, short_histogram->ranges(8));
134 // We also get a nice linear set of bucket ranges when we ask for it
136 EXPECT_EQ(i, linear_histogram->ranges(i));
137 EXPECT_EQ(INT_MAX, linear_histogram->ranges(8));
141 // ...but when the list has more space, then the ranges naturally spread out.
143 EXPECT_EQ(2 * i, linear_broad_histogram->ranges(i))
[all...] |
| histogram.cc | 99 DCHECK(value >= ranges(index));
100 DCHECK(value < ranges(index + 1));
181 // Standard assertions that all bucket ranges should satisfy.
244 DCHECK(ranges(0) <= value);
245 DCHECK(ranges(bucket_count()) > value);
255 if (ranges(mid) <= value)
261 DCHECK(ranges(mid) <= value && ranges(mid+1) > value);
271 DCHECK(ranges(i + 1) > ranges(i))
[all...] |
| /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/chromium/third_party/icu/source/i18n/ |
| ucol_wgt.h | 35 * what ranges to use for a given number of weights between (excluding)
38 * @param lowerLimit A collation element weight; the ranges will be filled to cover
40 * @param upperLimit A collation element weight; the ranges will be filled to cover
45 * @param ranges An array that is filled in with one or more ranges to cover
47 * @return number of ranges, 0 if it is not possible to fit n elements between the limits
53 WeightRange ranges[7]);
56 * Given a set of ranges calculated by ucol_allocWeights(),
58 * The ranges are modified to keep the current iteration state.
60 * @param ranges The array of ranges that ucol_allocWeights() filled in
[all...] |
| ucol_wgt.c | 121 /* for uprv_sortArray: sort ranges in weight order */
139 * possible ranges of weights between the two limits, excluding them
140 * for weights with up to 4 bytes there are up to 2*4-1=7 ranges
145 WeightRange ranges[7]) {
185 * With the limit lengths of 1..4, there are up to 7 ranges for allocation:
195 * We are now going to calculate up to 7 ranges.
196 * Some of them will typically overlap, so we will then have to merge and eliminate ranges.
235 /* reduce or remove the lower ranges that go beyond upperLimit */
242 /* lower and upper ranges collide or are directly adjacent: merge these two and remove all shorter ranges */
515 WeightRange ranges[8]; local
[all...] |
| ucol_bld.h | 41 WeightRange ranges[7]; member in struct:__anon2878
|
| /external/icu4c/i18n/ |
| ucol_wgt.h | 35 * what ranges to use for a given number of weights between (excluding)
38 * @param lowerLimit A collation element weight; the ranges will be filled to cover
40 * @param upperLimit A collation element weight; the ranges will be filled to cover
45 * @param ranges An array that is filled in with one or more ranges to cover
47 * @return number of ranges, 0 if it is not possible to fit n elements between the limits
53 WeightRange ranges[7]);
56 * Given a set of ranges calculated by ucol_allocWeights(),
58 * The ranges are modified to keep the current iteration state.
60 * @param ranges The array of ranges that ucol_allocWeights() filled in
[all...] |
| ucol_wgt.cpp | 121 /* for uprv_sortArray: sort ranges in weight order */
139 * possible ranges of weights between the two limits, excluding them
140 * for weights with up to 4 bytes there are up to 2*4-1=7 ranges
145 WeightRange ranges[7]) {
185 * With the limit lengths of 1..4, there are up to 7 ranges for allocation:
195 * We are now going to calculate up to 7 ranges.
196 * Some of them will typically overlap, so we will then have to merge and eliminate ranges.
235 /* reduce or remove the lower ranges that go beyond upperLimit */
242 /* lower and upper ranges collide or are directly adjacent: merge these two and remove all shorter ranges */
515 WeightRange ranges[8]; local
[all...] |
| ucol_bld.h | 41 WeightRange ranges[7]; member in struct:__anon3897
|
| /external/webkit/JavaScriptCore/wrec/ |
| CharacterClassConstructor.cpp | 64 void CharacterClassConstructor::addSortedRange(Vector<CharacterRange>& ranges, UChar lo, UChar hi)
66 unsigned end = ranges.size();
68 // Simple linear scan - I doubt there are that many ranges anyway...
72 if (hi < ranges[i].begin) {
73 // optional optimization: concatenate appending ranges? - may not be worthwhile.
74 if (hi == (ranges[i].begin - 1)) {
75 ranges[i].begin = lo;
79 ranges.insert(i, r);
85 if (lo <= (ranges[i].end + 1)) {
87 ranges[i].begin = std::min(ranges[i].begin, lo)
[all...] |
| CharacterClass.h | 54 const CharacterRange* ranges; member in struct:JSC::WREC::CharacterClass
|
| /external/webkit/WebCore/dom/ |
| RangeException.idl | 20 module ranges {
|
| /libcore/luni/src/main/java/java/text/ |
| AttributedString.java | 162 private boolean inRange(List<Range> ranges) {
163 Iterator<Range> it = ranges.iterator();
197 List<Range> ranges = entry.getValue(); local
198 if (inRange(ranges)) {
206 private Object currentValue(List<Range> ranges) {
207 Iterator<Range> it = ranges.iterator();
223 ArrayList<Range> ranges = (ArrayList<Range>) attrString.attributeMap local
225 if (ranges == null) {
228 return currentValue(ranges);
253 private int runLimit(List<Range> ranges) {
276 ArrayList<Range> ranges = (ArrayList<Range>) attrString.attributeMap local
324 ArrayList<Range> ranges = (ArrayList<Range>) attrString.attributeMap local
562 ArrayList<Range> ranges = new ArrayList<Range>(1); local
591 List<Range> ranges = attributeMap.get(attribute); local
632 List<Range> ranges = attributeMap.get(attribute); local
[all...] |
| /dalvik/vm/compiler/ |
| Ralloc.c | 104 * 0. Allocate the structure to hold the SSA name life ranges
108 * 2. Compute live ranges for all SSA names *not* including the
125 LiveRange *ranges; local
152 // Compute live ranges
153 ranges = dvmCompilerNew(cUnit->numSSARegs * sizeof(*ranges), true);
155 ranges[i].active = false;
156 seqNum = computeLiveRange(ranges, cUnit->blockList[i], seqNum);
|
| /external/webkit/WebCore/css/ |
| CSSSegmentedFontFace.cpp | 115 const Vector<CSSFontFace::UnicodeRange>& ranges = m_fontFaces[i]->ranges(); local
116 unsigned numRanges = ranges.size();
121 fontData->appendRange(FontDataRange(ranges[j].from(), ranges[j].to(), static_cast<const SimpleFontData*>(faceFontData)));
|
| /external/chromium/net/disk_cache/ |
| stats_histogram.h | 43 virtual Sample ranges(size_t i) const;
|
| /external/webkit/WebCore/svg/ |
| SVGFontElement.cpp | 120 // Handle the case of ranges separated by "-" sign.
163 static bool parseUnicodeRangeList(const UChar* characters, unsigned length, Vector<pair<unsigned, unsigned> >& ranges)
165 ranges.clear();
176 ranges.append(range);
185 ranges.append(make_pair(character, character));
200 Vector<pair<unsigned, unsigned> > ranges; local
201 if (!parseUnicodeRangeList(unicodeRangeSpec.characters(), unicodeRangeSpec.length(), ranges))
204 if (unicodeString.length() != ranges.size())
209 if (c < ranges[i].first || c > ranges[i].second
[all...] |
| /libcore/luni/src/main/java/java/awt/font/ |
| NumericShaper.java | 110 /** The Constant ALL_RANGES indicates all ranges. */
115 * range constant value. Also script ranges, context names and digits low
116 * ranges are indexed with these indices.
200 * Scripts ranges array. Array represents ranges as pairs of
205 /** The scripts ranges. */
229 * Digit low ranges values decreased by 0x0030. Each low range
238 /** The digits low ranges. */
423 // ranges to be shaped
424 /** The ranges. *
[all...] |
| /external/freetype/src/autofit/ |
| aftypes.h | 247 * - A set of Unicode ranges to test whether the face supports the
352 #define AF_DEFINE_SCRIPT_CLASS(script_class, script_, ranges, m_size, \
358 ranges, \
376 #define AF_DEFINE_SCRIPT_CLASS(script_class, script_, ranges, m_size, \
382 ac->script_uni_ranges = ranges; \
|
| /external/chromium/net/http/ |
| http_util_unittest.cc | 657 std::vector<net::HttpByteRange> ranges; local
659 &ranges);
662 EXPECT_EQ(tests[i].expected_ranges_size, ranges.size());
663 for (size_t j = 0; j < ranges.size(); ++j) {
665 ranges[j].first_byte_position());
667 ranges[j].last_byte_position());
669 ranges[j].suffix_length());
|
| /external/webkit/JavaScriptCore/yarr/ |
| RegexCompiler.cpp | 183 void addSortedRange(Vector<CharacterRange>& ranges, UChar lo, UChar hi)
185 unsigned end = ranges.size();
187 // Simple linear scan - I doubt there are that many ranges anyway...
191 if (hi < ranges[i].begin) {
192 // optional optimization: concatenate appending ranges? - may not be worthwhile.
193 if (hi == (ranges[i].begin - 1)) {
194 ranges[i].begin = lo;
197 ranges.insert(i, CharacterRange(lo, hi));
203 if (lo <= (ranges[i].end + 1)) {
205 ranges[i].begin = std::min(ranges[i].begin, lo)
[all...] |
