/external/clang/tools/clang-format/ |
git-clang-format | 57 Range = collections.namedtuple('Range', 'start, count') 300 list of line `Range`s.""" 313 matches.setdefault(filename, []).append(Range(start_line, line_count))
|
/external/clang/tools/libclang/ |
CIndex.cpp | 107 assert(R1.isValid() && "First range is invalid?"); 108 assert(R2.isValid() && "Second range is invalid?"); 119 /// a given source range. 122 assert(R.isValid() && "First range is invalid?"); 123 assert(L.isValid() && "Second range is invalid?"); 133 /// \brief Translate a Clang source range into a CIndex source range. 200 // If we have a range of interest, and this cursor doesn't intersect with it, 203 SourceRange Range = getRawCursorExtent(Cursor); 204 if (Range.isInvalid() || CompareRegionOfInterest(Range) [all...] |
/external/clang/unittests/AST/ |
SourceLocationTest.cpp | 68 TEST(LabelDecl, Range) { 74 TEST(LabelStmt, Range) {
|
/external/clang/unittests/Format/ |
FormatTestJS.cpp | 26 std::vector<tooling::Range> Ranges(1, tooling::Range(Offset, Length)); [all...] |
/external/google-benchmark/include/benchmark/ |
benchmark_api.h | 41 char* src = new char[state.range(0)]; char* dst = new char[state.range(0)]; 42 memset(src, 'x', state.range(0)); 44 memcpy(dst, src, state.range(0)); 46 int64_t(state.range(0))); 53 // appropriate arguments in the specified range and will generate a 55 BENCHMARK(BM_memcpy)->Range(8, 8<<10); 63 set<int> data = ConstructRandomSet(state.range(0)); 65 for (int j = 0; j < state.range(1); ++j) 88 // The following example enumerates a dense range o 408 int range(std::size_t pos = 0) const { function in class:benchmark::internal::State [all...] |
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
Normalizer2Impl.java | 505 // Range of code points with same-norm16-value algorithmic decompositions. 521 // Range of code points with same-norm16-value algorithmic decompositions. 535 /* add the start code point of each same-value range of each trie */ 536 Iterator<Trie2.Range> trieIterator=normTrie.iterator(); 537 Trie2.Range range; local 538 while(trieIterator.hasNext() && !(range=trieIterator.next()).leadSurrogate) { 539 enumLcccRange(range.startCodePoint, range.endCodePoint, range.value, set) 546 Trie2.Range range; local 564 Trie2.Range range; local 601 Trie2.Range range; local [all...] |
/external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
TailoredSet.java | 59 Iterator<Trie2.Range> trieIterator = data.trie.iterator(); 60 Trie2.Range range; local 61 while (trieIterator.hasNext() && !(range = trieIterator.next()).leadSurrogate) { 62 enumTailoredRange(range.startCodePoint, range.endCodePoint, range.value, this);
|
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
TailoredSet.java | 57 Iterator<Trie2.Range> trieIterator = data.trie.iterator(); 58 Trie2.Range range; local 59 while (trieIterator.hasNext() && !(range = trieIterator.next()).leadSurrogate) { 60 enumTailoredRange(range.startCodePoint, range.endCodePoint, range.value, this);
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
Normalizer2Impl.java | 501 // Range of code points with same-norm16-value algorithmic decompositions. 517 // Range of code points with same-norm16-value algorithmic decompositions. 531 /* add the start code point of each same-value range of each trie */ 532 Iterator<Trie2.Range> trieIterator=normTrie.iterator(); 533 Trie2.Range range; local 534 while(trieIterator.hasNext() && !(range=trieIterator.next()).leadSurrogate) { 535 enumLcccRange(range.startCodePoint, range.endCodePoint, range.value, set) 542 Trie2.Range range; local 560 Trie2.Range range; local 597 Trie2.Range range; local [all...] |
/external/libcxx/utils/google-benchmark/include/benchmark/ |
benchmark_api.h | 41 char* src = new char[state.range(0)]; char* dst = new char[state.range(0)]; 42 memset(src, 'x', state.range(0)); 44 memcpy(dst, src, state.range(0)); 46 int64_t(state.range(0))); 53 // appropriate arguments in the specified range and will generate a 55 BENCHMARK(BM_memcpy)->Range(8, 8<<10); 63 set<int> data = ConstructRandomSet(state.range(0)); 65 for (int j = 0; j < state.range(1); ++j) 88 // The following example enumerates a dense range o 408 int range(std::size_t pos = 0) const { function in class:benchmark::internal::State [all...] |
/external/mesa3d/src/gallium/auxiliary/tgsi/ |
tgsi_sanity.c | 279 * address register. No range checking done here.*/ 410 for (i = decl->Range.First; i <= decl->Range.Last; i++) {
|
/external/mesa3d/src/gallium/drivers/svga/ |
svga_tgsi_decl_sm30.c | 519 unsigned first = decl->Range.First; 520 unsigned last = decl->Range.Last;
|
/external/swiftshader/src/D3D9/ |
Direct3DDevice9.hpp | 234 Range = light.Range;
|
/external/swiftshader/third_party/LLVM/include/llvm/TableGen/ |
Record.h | 660 BitsInit(ArrayRef<Init *> Range) : Bits(Range.begin(), Range.end()) {} 666 static BitsInit *get(ArrayRef<Init *> Range); 673 assert(Bit < Bits.size() && "Bit index out of range!"); 816 explicit ListInit(ArrayRef<Init *> Range, RecTy *EltTy) 817 : TypedInit(ListRecTy::get(EltTy)), Values(Range.begin(), Range.end()) {} 823 static ListInit *get(ArrayRef<Init *> Range, RecTy *EltTy); 829 assert(i < Values.size() && "List element index out of range!"); [all...] |
/prebuilts/clang/host/darwin-x86/clang-3217047/bin/ |
git-clang-format | 57 Range = collections.namedtuple('Range', 'start, count') 300 list of line `Range`s.""" 313 matches.setdefault(filename, []).append(Range(start_line, line_count))
|
/prebuilts/clang/host/linux-x86/clang-3217047/bin/ |
git-clang-format | 57 Range = collections.namedtuple('Range', 'start, count') 300 list of line `Range`s.""" 313 matches.setdefault(filename, []).append(Range(start_line, line_count))
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
hidpi.h | 75 } Range; 112 } Range;
|
/prebuilts/go/darwin-x86/src/math/ |
tan.go | 29 // Range reduction is modulo pi/4. A rational function
|
/prebuilts/go/darwin-x86/src/net/http/ |
status.go | 117 StatusRequestedRangeNotSatisfiable: "Requested Range Not Satisfiable",
|
/prebuilts/go/linux-x86/src/math/ |
tan.go | 29 // Range reduction is modulo pi/4. A rational function
|
/prebuilts/go/linux-x86/src/net/http/ |
status.go | 117 StatusRequestedRangeNotSatisfiable: "Requested Range Not Satisfiable",
|
/toolchain/binutils/binutils-2.25/binutils/testsuite/binutils-all/i386/ |
compressed-1a.d | 72 Line Range: 14
|
/toolchain/binutils/binutils-2.25/binutils/testsuite/binutils-all/x86-64/ |
compressed-1a.d | 72 Line Range: 14
|
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/mips/ |
micromips@24k-triple-stores-7.d | 3 #name: 24K: Triple Store (Extended Range Check)
|
micromips@loc-swap.d | 20 Line Range: 14
|