/external/tensorflow/tensorflow/compiler/xla/service/cpu/ |
shape_partition_test.cc | 222 // index ranges by dimension. 223 std::vector<std::map<int64, int64>> ranges(num_outer_dims_to_partition); 229 ranges[dim].insert( 236 for (int i = 0; i < ranges.size(); ++i) { 238 for (auto& r : ranges[i]) {
|
/test/vts-testcase/kernel/api/proc/ |
ProcVmallocInfoTest.py | 22 '''/proc/vmallocinfo provides info on vmalloc'd ranges.'''
|
/external/tensorflow/tensorflow/python/debug/cli/ |
command_parser.py | 252 (list of list of float) A list of numerical ranges parsed from the input 256 ValueError: If the input doesn't represent a range or a list of ranges. 266 ranges = ast.literal_eval(range_string) 267 if isinstance(ranges, list) and not isinstance(ranges[0], list): 268 ranges = [ranges] 270 # Verify that ranges is a list of list of numbers. 271 for item in ranges: 281 return ranges [all...] |
/libcore/ojluni/src/main/java/sun/util/locale/ |
LocaleMatcher.java | 244 public static List<LanguageRange> parse(String ranges) { 246 ranges = ranges.replace(" ", "").toLowerCase(); 247 if (ranges.startsWith("accept-language:")) { 248 ranges = ranges.substring(16); // delete unnecessary prefix 251 String[] langRanges = ranges.split(",");
|
/frameworks/base/packages/PrintSpooler/src/com/android/printspooler/renderer/ |
PdfManipulationService.java | 238 public void removePages(PageRange[] ranges) { 245 ranges = PageRangeUtils.normalize(ranges); 249 final int rangeCount = ranges.length; 251 PageRange range = ranges[i];
|
/frameworks/base/packages/PrintSpooler/src/com/android/printspooler/util/ |
PageRangeUtils.java | 28 * This class contains utility functions for working with page ranges. 46 * Gets whether page ranges contains a given page. 48 * @param pageRanges The page ranges. 50 * @return Whether the page is within the ranges. 66 * @param ourRanges The container page ranges. 67 * @param otherRanges The contained page ranges. 69 * @return Whether the container page ranges contains the contained ones. 87 // Note that the code below relies on the ranges being normalized 89 // sub-ranges whose start is less that or equal to the end. 110 * Normalizes a page range, which is the resulting page ranges ar 302 ArrayList<PageRange> ranges = new ArrayList<>(); local [all...] |
/hardware/interfaces/broadcastradio/2.0/default/ |
TunerSession.cpp | 54 auto&& ranges = module.getAmFmConfig().ranges; local 55 if (ranges.size() > 0) { 56 tuneInternalLocked(utils::make_selector_amfm(ranges[0].lowerBound)); 313 for (auto&& range : module().getAmFmConfig().ranges) {
|
/prebuilts/gradle-plugin/org/jetbrains/kotlin/kotlin-runtime/1.0.5/ |
kotlin-runtime-1.0.5.jar | |
/prebuilts/tools/common/m2/repository/org/jetbrains/kotlin/kotlin-runtime/1.0.0/ |
kotlin-runtime-1.0.0.jar | |
/prebuilts/tools/common/m2/repository/org/jetbrains/kotlin/kotlin-runtime/1.0.2/ |
kotlin-runtime-1.0.2.jar | |
/prebuilts/tools/common/m2/repository/org/jetbrains/kotlin/kotlin-runtime/1.0.5/ |
kotlin-runtime-1.0.5.jar | |
/prebuilts/tools/common/m2/repository/org/jetbrains/kotlin/kotlin-runtime/1.0.6/ |
kotlin-runtime-1.0.6.jar | |
/prebuilts/tools/common/m2/repository/org/jetbrains/kotlin/kotlin-runtime/1.1.51/ |
kotlin-runtime-1.1.51.jar | |
/prebuilts/tools/common/offline-m2/org/jetbrains/kotlin/kotlin-runtime/1.0.0/ |
kotlin-runtime-1.0.0.jar | |
/external/deqp/modules/gles31/functional/ |
es31fShaderCommonFunctionTests.cpp | 698 const Vec2 ranges[] = local 717 const float v = de::clamp(float(ndx) - 10.5f, ranges[precision].x(), ranges[precision].y()); 724 fillRandomScalars(rnd, ranges[precision].x(), ranges[precision].y(), (float*)values[0] + numSpecialCases*scalarSize, (numValues-numSpecialCases)*scalarSize); 810 const Vec2 ranges[] = local 822 fillRandomScalars(rnd, ranges[precision].x(), ranges[precision].y(), values[0], numValues*scalarSize); 1046 const Vec2 ranges[] = local 1170 const Vec2 ranges[] = local 1266 const Vec2 ranges[] = local 1374 const Vec2 ranges[] = local 1502 const Vec2 ranges[] = local 1607 const Vec2 ranges[] = local [all...] |
/system/update_engine/payload_generator/ |
inplace_generator.cc | 393 ExtentRanges ranges; local 394 ranges.AddRepeatedExtents((*graph)[test_node].aop.op.dst_extents()); 395 ranges.SubtractExtent(ExtentForRange( 397 ranges.SubtractRepeatedExtents((*graph)[test_node].aop.op.src_extents()); 404 ranges.SubtractExtents(edge_i->second.extents); 408 if (ranges.ContainsBlock(0)) { 411 ranges.SubtractBlock(0); 414 if (ranges.blocks() == 0) 417 if (ranges.blocks() + scratch_blocks_found > blocks_needed) { 418 // trim down ranges [all...] |
/external/tensorflow/tensorflow/core/kernels/ |
quantization_utils_test.cc | 120 // These are the input and output ranges we'll test. 122 const float ranges[ranges_count][4] = { local 131 const auto& r = ranges[i]; 178 // These are the input and output ranges we'll test. 180 const float ranges[ranges_count][4] = { local 189 const auto& r = ranges[i]; 219 const float ranges[ranges_count][4] = { local 230 const float input_min = ranges[range_index][0]; 231 const float input_max = ranges[range_index][1]; 232 const float output_min = ranges[range_index][2] 516 const float ranges[ranges_count][4] = { local 573 const float ranges[ranges_count][4] = { local [all...] |
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
sre_compile.py | 298 ranges = [av]
299 # There are only two ranges of cased astral characters:
302 ranges, fixup)
303 for lo, hi in ranges:
357 # Compression is normally good: in a typical charset, large ranges of
360 # subranges of Kanji match). These ranges will be represented by
391 def _fixup_range(lo, hi, ranges, fixup):
393 for k, (lo, hi) in enumerate(ranges):
396 ranges[k] = (i, hi)
398 ranges.insert(k, (i, i)) [all...] |
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/ |
Trie2Test.java | 274 // (Ranges are more commonly created by iterating over a Trie2, 424 /* set consecutive ranges, even with value 0 */ 465 /* set some interesting overlapping ranges */ 473 { 0x241, 0x280, 6, 1 }, /* discontiguous value ranges, testing utrie2_enum() */ 586 private Trie2Writable genTrieFromSetRanges(int [][] ranges) { 591 if (ranges[i][1] < 0) { 592 errorValue = ranges[i][2]; 595 initialValue = ranges[i++][2]; 598 for (; i<ranges.length; i++) { 599 int rangeStart = ranges[i][0] [all...] |
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/ |
Trie2Test.java | 271 // (Ranges are more commonly created by iterating over a Trie2, 421 /* set consecutive ranges, even with value 0 */ 462 /* set some interesting overlapping ranges */ 470 { 0x241, 0x280, 6, 1 }, /* discontiguous value ranges, testing utrie2_enum() */ 583 private Trie2Writable genTrieFromSetRanges(int [][] ranges) { 588 if (ranges[i][1] < 0) { 589 errorValue = ranges[i][2]; 592 initialValue = ranges[i++][2]; 595 for (; i<ranges.length; i++) { 596 int rangeStart = ranges[i][0] [all...] |
/external/python/cpython2/Lib/ |
sre_compile.py | 298 ranges = [av] 299 # There are only two ranges of cased astral characters: 302 ranges, fixup) 303 for lo, hi in ranges: 357 # Compression is normally good: in a typical charset, large ranges of 360 # subranges of Kanji match). These ranges will be represented by 391 def _fixup_range(lo, hi, ranges, fixup): 393 for k, (lo, hi) in enumerate(ranges): 396 ranges[k] = (i, hi) 398 ranges.insert(k, (i, i) [all...] |
/external/clang/lib/StaticAnalyzer/Core/ |
RangeConstraintManager.cpp | 70 /// RangeSet contains a set of ranges. If the set is empty, then 75 PrimRangeSet ranges; // no need to make const, since it is an member in class:__anon15441::RangeSet 82 RangeSet(PrimRangeSet RS) : ranges(RS) {} 84 /// Create a new set with all ranges of this set and RS. 87 PrimRangeSet Ranges(RS.ranges); 88 for (const auto &range : ranges) 89 Ranges = F.add(Ranges, range); 90 return RangeSet(Ranges); [all...] |
/external/google-breakpad/src/common/windows/ |
pdb_source_line_writer.cc | 233 AddressRangeVector ranges; local 234 MapAddressRange(image_map_, AddressRange(rva, length), &ranges); 235 for (size_t i = 0; i < ranges.size(); ++i) { 236 fprintf(output_, "%x %x %d %d\n", ranges[i].rva, ranges[i].length, 277 AddressRangeVector ranges; local 279 &ranges); 280 for (size_t i = 0; i < ranges.size(); ++i) { 282 ranges[i].rva, ranges[i].length, stack_param_size, name) 819 AddressRangeVector ranges; local [all...] |
/external/syslinux/memdisk/ |
setup.c | 150 * Find a good place to put it: search memory ranges in descending 161 if (ranges[i].type != 1) 165 if (ranges[i].start >= 0xFFFFFFFF) 168 startrange = (uint32_t) ranges[i].start; 171 endrange = ((ranges[i + 1].start >= 0xFFFFFFFF || 172 ranges[i + 1].start == 0) 173 ? 0xFFFFFFFF : (uint32_t) ranges[i + 1].start); 181 (ranges[i].start + (UNZIP_ALIGN - 1)) & ~(UNZIP_ALIGN - 1); 736 for (ep = ranges; ep->type != -1U; ep++) { 994 ranges (each insertrange() can worst-case turn 1 area into 3 [all...] |
/device/linaro/bootloader/OpenPlatformPkg/Platforms/ARM/VExpress/DeviceTree/ |
fvp-base-gicv3-psci.dts | 198 ranges; 229 ranges; 250 ranges = <0 0 0 0x08000000 0x04000000>,
|