| /external/skia/tools/lua/ |
| xfer-counter.lua | 31 for key,value in pairs(gXferModeTab) do
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/protorpc/protorpc/static/ |
| jquery.json-2.2.min.js | 16 var pairs=[];for(var k in o){var name;var type=typeof k;if(type=="number")
20 continue;var val=$.toJSON(o[k]);pairs.push(name+":"+val);}
21 return"{"+pairs.join(", ")+"}";}};$.evalJSON=function(src)
|
| /external/chromium-trace/catapult/third_party/mapreduce/mapreduce/static/ |
| jquery.json-2.2.min.js | 16 var pairs=[];for(var k in o){var name;var type=typeof k;if(type=="number")
20 continue;var val=$.toJSON(o[k]);pairs.push(name+":"+val);}
21 return"{"+pairs.join(", ")+"}";}};$.evalJSON=function(src)
|
| /external/chromium-trace/catapult/third_party/pipeline/pipeline/ui/ |
| jquery.json.min.js | 16 var pairs=[];for(var k in o){var name;var type=typeof k;if(type=="number")
20 continue;var val=$.toJSON(o[k]);pairs.push(name+":"+val);}
21 return"{"+pairs.join(", ")+"}";}};$.evalJSON=function(src)
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_tools_windows/tools/ |
| picoloadphones.lua | 104 for s in pairs(propnames) do propnames[s] = 0 end
105 for s in pairs(upropnames) do upropnames[s] = 0 end
106 for s, p in pairs(st) do
107 for prop, propval in pairs(p) do
118 for prop, propval in pairs(upropnames) do
134 for s, pl in pairs(symnrs) do
|
| /prebuilts/go/darwin-x86/src/encoding/ascii85/ |
| ascii85_test.go | 19 var pairs = []testpair{ var
44 var bigtest = pairs[len(pairs)-1]
68 for _, p := range pairs {
77 for _, p := range pairs {
107 for _, p := range pairs {
118 for _, p := range pairs {
|
| /prebuilts/go/linux-x86/src/encoding/ascii85/ |
| ascii85_test.go | 19 var pairs = []testpair{ var
44 var bigtest = pairs[len(pairs)-1]
68 for _, p := range pairs {
77 for _, p := range pairs {
107 for _, p := range pairs {
118 for _, p := range pairs {
|
| /external/v8/src/compiler/ |
| loop-peeling.cc | 105 // Maps a node to its index in the {pairs} vector.
108 NodeVector* pairs; member in struct:v8::internal::compiler::Peeling
111 : node_map(graph, static_cast<uint32_t>(max)), pairs(p) {}
115 return pairs->at(node_map.Get(node));
119 node_map.Set(original, 1 + pairs->size());
120 pairs->push_back(original);
121 pairs->push_back(copy);
135 Node* copy = pairs->at(node_map.Get(original));
|
| /external/libchrome/base/process/ |
| process_metrics_linux.cc | 33 void TrimKeyValuePairs(StringPairs* pairs) {
34 DCHECK(pairs);
35 StringPairs& p_ref = *pairs;
68 StringPairs pairs; local
69 SplitStringIntoKeyValuePairs(status, ':', '\n', &pairs);
70 TrimKeyValuePairs(&pairs);
71 for (size_t i = 0; i < pairs.size(); ++i) {
72 const std::string& key = pairs[i].first;
73 const std::string& value_str = pairs[i].second;
109 StringPairs pairs; local
270 StringPairs pairs; local
[all...] |
| /external/clang/test/SemaCXX/ |
| for-range-examples.cpp | 142 map_range::vector<T> pairs; local
143 pairs.push_back(T(42, 12.9));
144 pairs.push_back(T(6, 4.2));
145 pairs.push_back(T(9, 1.1));
146 for (auto a : map(map_range::mem_fun(&T::get<int>), pairs)) {
|
| /prebuilts/go/darwin-x86/src/compress/bzip2/ |
| huffman.go | 81 pairs := huffmanSymbolLengthPairs(make([]huffmanSymbolLengthPair, len(lengths)))
83 pairs[i].value = uint16(i)
84 pairs[i].length = length
87 sort.Sort(pairs)
97 for i := len(pairs) - 1; i >= 0; i-- {
98 if length > pairs[i].length {
101 length >>= 32 - pairs[i].length
102 length <<= 32 - pairs[i].length
103 length = pairs[i].length
107 codes[i].value = pairs[i].valu
[all...] |
| /prebuilts/go/linux-x86/src/compress/bzip2/ |
| huffman.go | 81 pairs := huffmanSymbolLengthPairs(make([]huffmanSymbolLengthPair, len(lengths)))
83 pairs[i].value = uint16(i)
84 pairs[i].length = length
87 sort.Sort(pairs)
97 for i := len(pairs) - 1; i >= 0; i-- {
98 if length > pairs[i].length {
101 length >>= 32 - pairs[i].length
102 length <<= 32 - pairs[i].length
103 length = pairs[i].length
107 codes[i].value = pairs[i].valu
[all...] |
| /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/translit/ |
| UnicodeSetCloseOver.java | 107 * groups: 'pairs', and 'nonpairs'. Create a tally of the length
128 * @param pairs Accumulate equivalency classes that consist of
134 * not including pairs. Each length structure is represented by a
141 StringBuffer pairs,
153 pairs.append(a).append(b);
155 // Note that pairs are included in 'lengths'
189 StringBuffer pairs = new StringBuffer(); local
196 analyzeCaseData(equivClasses, pairs, nonpairs, lengths);
205 out.println(Utility.formatForSource(pairs.toString()) + ";");
223 // In C++, the pairs are again emitted in an array, but thi
[all...] |
| /external/regex-re2/re2/ |
| make_unicode_casefold.py | 62 def _MakeRanges(pairs):
91 for a, b in pairs:
132 print "// %d groups, %d pairs, %d ranges" % (len(casegroups), len(foldpairs), len(foldranges))
|
| /external/chromium-trace/catapult/third_party/coverage/coverage/ |
| misc.py | 89 pairs = []
102 pairs.append((start, end))
106 pairs.append((start, end))
107 ret = ', '.join(map(nice_pair, pairs))
|
| /external/valgrind/cachegrind/ |
| cg_annotate.in | 801 my @pairs;
803 push(@pairs, $line_nums[$i] - $context); # lower marker
808 push(@pairs, $line_nums[$i] + $context); # upper marker
812 $pairs[0] = 1 if ($pairs[0] < 1);
813 while (@pairs) {
814 my $low = shift @pairs;
815 my $high = shift @pairs;
|
| /external/doclava/src/com/google/doclava/ |
| LinkReference.java | 88 int pairs = 0; local
96 pairs++;
99 pairs++;
102 pairs--;
105 pairs--;
111 if (pairs == 0) {
123 if (index == len && pairs != 0) {
|
| /external/chromium-trace/catapult/dashboard/dashboard/ |
| utils.py | 87 pairs = test_key.pairs()
88 if len(pairs) < 3:
90 return pairs[2][1]
105 return ndb.Key(pairs=key_list)
|
| /external/clang/lib/ARCMigrate/ |
| FileRemapper.cpp | 64 std::vector<std::pair<const FileEntry *, const FileEntry *> > pairs;
101 pairs.push_back(std::make_pair(origFE, newFE));
104 for (unsigned i = 0, e = pairs.size(); i != e; ++i)
105 remap(pairs[i].first, pairs[i].second);
|
| /external/v8/test/cctest/compiler/ |
| test-run-native-calls.cc | 26 // If there are less than {max_pairs} possible pairs, do them all, otherwise try
28 class Pairs {
30 Pairs(int max_pairs, int range, const int* codes)
75 // Pairs of general purpose registers.
76 class RegisterPairs : public Pairs {
79 : Pairs(
88 // Pairs of double registers.
89 class Float32RegisterPairs : public Pairs {
92 : Pairs(
101 // Pairs of double registers
623 RegisterPairs pairs; local
671 RegisterPairs pairs; local
688 RegisterPairs pairs; local
851 RegisterPairs pairs; local
878 Float32RegisterPairs pairs; local
906 Float64RegisterPairs pairs; local
[all...] |
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/lang/ |
| UCharacterSurrogateTest.java | 134 final char[] pairs = {(char) (UCharacter.MIN_HIGH_SURROGATE + 0), local
146 for (int i = 0; i < pairs.length; i += 2) {
147 int cp = UCharacter.toCodePoint(pairs[i], pairs[i + 1]);
148 if (pairs[i] != UTF16.getLeadSurrogate(cp)
149 || pairs[i + 1] != UTF16.getTrailSurrogate(cp)) {
151 errln(Integer.toHexString(pairs[i]) + ", " + pairs[i + 1]);
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/lang/ |
| UCharacterSurrogateTest.java | 130 final char[] pairs = {(char) (UCharacter.MIN_HIGH_SURROGATE + 0), local
142 for (int i = 0; i < pairs.length; i += 2) {
143 int cp = UCharacter.toCodePoint(pairs[i], pairs[i + 1]);
144 if (pairs[i] != UTF16.getLeadSurrogate(cp)
145 || pairs[i + 1] != UTF16.getTrailSurrogate(cp)) {
147 errln(Integer.toHexString(pairs[i]) + ", " + pairs[i + 1]);
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/Gimpact/ |
| btGImpactCollisionAlgorithm.h | 152 const int * pairs, int pair_count);
158 const int * pairs, int pair_count);
267 /// Accessor/Mutator pairs for Part and triangleID
|
| /external/opencv3/modules/calib3d/src/ |
| checkchessboard.cpp | 85 static void countClasses(const std::vector<std::pair<float, int> >& pairs, size_t idx1, size_t idx2, std::vector<int>& counts)
90 counts[pairs[i].second]++;
|
| /frameworks/wilhelm/tests/sandbox/ |
| reverb.c | 40 Pair pairs[] = { variable
132 for (j = 0; j < sizeof(pairs) / sizeof(pairs[0]); ++j) {
133 if (!strcasecmp(name, pairs[j].mName)) {
134 return &pairs[j].mSettings;
148 for (j = 0; j < sizeof(pairs) / sizeof(pairs[0]); ++j) {
149 const char *name = pairs[j].mName;
|
