| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_collections.py | 722 # test random pairs of multisets
770 pairs = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5)]
771 self.assertEqual(sorted(OrderedDict(dict(pairs)).items()), pairs) # dict input
772 self.assertEqual(sorted(OrderedDict(**dict(pairs)).items()), pairs) # kwds input
773 self.assertEqual(list(OrderedDict(pairs).items()), pairs) # pairs input
775 c=3, e=5).items()), pairs) # mixed inpu
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| mhlib.py | 776 internally as a list of three pairs: [(1,100), (200,400),
795 self.pairs = []
801 self.pairs = []
804 return cmp(self.pairs, other.pairs)
807 return hash(self.pairs)
813 self.pairs.sort()
815 while i < len(self.pairs):
816 alo, ahi = self.pairs[i-1]
817 blo, bhi = self.pairs[i
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| mhlib.py | 776 internally as a list of three pairs: [(1,100), (200,400),
795 self.pairs = []
801 self.pairs = []
804 return cmp(self.pairs, other.pairs)
807 return hash(self.pairs)
813 self.pairs.sort()
815 while i < len(self.pairs):
816 alo, ahi = self.pairs[i-1]
817 blo, bhi = self.pairs[i
[all...] |
| /external/skia/tools/lua/ |
| bbh_filter.lua | 12 for _,_ in pairs(table) do
77 for k,v in pairs(verbCounts) do
86 for k, v in pairs(meta) do
104 for name, count in pairs(verbs) do
109 for n, info in pairs(globalInfo) do
120 for i, t in pairs(meta) do
124 for verb,count in pairs(globalInfo[t.fileName].verbs) do
|
| /packages/apps/Browser/src/com/android/browser/ |
| PreloadRequestReceiver.java | 113 final Bundle pairs = i.getBundleExtra(Browser.EXTRA_HEADERS); local
114 if (pairs != null && !pairs.isEmpty()) {
115 Iterator<String> iter = pairs.keySet().iterator();
119 headers.put(key, pairs.getString(key));
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_tools_windows/tools/ |
| picoloaddbg.lua | 106 for s in pairs(propnames) do propnames[s] = 0 end
107 for s in pairs(upropnames) do upropnames[s] = 0 end
108 for s, p in pairs(st) do
109 for prop, propval in pairs(p) do
120 for prop, propval in pairs(upropnames) do
136 for s, pl in pairs(symnrs) do
163 for k, v in pairs(syms) do
|
| 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
|
| /external/qemu/android/utils/ |
| ini.c | 39 IniPair* pairs; member in struct:IniFile
47 AFREE(i->pairs[nn].key);
48 i->pairs[nn].key = NULL;
49 i->pairs[nn].value = NULL;
51 AFREE(i->pairs);
99 AARRAY_RENEW(i->pairs, newMax);
103 pair = i->pairs + i->numPairs;
116 if (!strcmp(i->pairs[nn].key,key))
117 return &i->pairs[nn];
305 * strip - If 1, ignore (don't save) pairs with empty values. If 0, save al
[all...] |
| /frameworks/ml/bordeaux/learning/multiclass_pa/jni/ |
| jni_multiclass_pa.cpp | 27 const int length, vector<pair<int, float> >* pairs) {
28 pairs->clear();
32 pairs->push_back(new_pair);
|
| /external/chromium_org/chrome/browser/extensions/api/identity/ |
| gaia_web_auth_flow.cc | 121 std::vector<std::pair<std::string, std::string> > pairs; local
122 base::SplitStringIntoKeyValuePairs(fragment, '=', '&', &pairs);
128 it = pairs.begin();
129 it != pairs.end();
|
| /external/openfst/src/include/fst/ |
| util.h | 271 // Utilities for reading/writing integer pairs (typically labels)
276 vector<pair<I, I> >* pairs,
289 pairs->clear();
308 pairs->push_back(make_pair(i1, i2));
316 const vector<pair<I, I> >& pairs) {
326 for (ssize_t n = 0; n < pairs.size(); ++n)
327 *strm << pairs[n].first << "\t" << pairs[n].second << "\n";
339 // Utilities for reading/writing label pairs
343 vector<pair<Label, Label> >* pairs,
[all...] |
| shortest-path.h | 214 ShortestPathCompare(const vector<Pair>& pairs,
217 : pairs_(pairs), distance_(distance), superfinal_(sfinal), delta_(d) {}
301 // characterized by a pair (s,w). The vector 'pairs' maps each
304 vector<Pair> pairs;
310 compare(pairs, distance, superfinal, delta);
328 while (pairs.size() <= final)
329 pairs.push_back(Pair(kNoStateId, Weight::Zero()));
330 pairs[final] = Pair(ifst.Start(), Weight::One());
337 Pair p = pairs[state];
362 pairs.push_back(Pair(arc.nextstate, w))
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| shortest-path.h | 173 ShortestPathCompare(const vector<Pair>& pairs,
176 : pairs_(pairs), distance_(distance), superfinal_(sfinal), delta_(d) {}
270 // characterized by a pair (s,w). The vector 'pairs' maps each
273 vector<Pair> pairs; local
280 compare(pairs, *distance, superfinal, opts.delta);
288 while (pairs.size() <= final)
289 pairs.push_back(Pair(kNoStateId, Weight::Zero()));
290 pairs[final] = Pair(rfst.Start(), Weight::One());
296 Pair p = pairs[state];
314 pairs.push_back(Pair(arc.nextstate, w))
[all...] |
| /external/marisa-trie/lib/marisa/ |
| trie-build.cc | 80 Vector<TerminalIdPair> pairs; local
81 pairs.resize(terminals.size());
82 for (UInt32 i = 0; i < pairs.size(); ++i) {
83 pairs[i].first = terminals[i];
84 pairs[i].second = i;
87 std::sort(pairs.begin(), pairs.end());
90 for (UInt32 i = 0; i < pairs.size(); ++i) {
91 while (node < pairs[i].first) {
95 if (node == pairs[i].first)
[all...] |
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| trie-build.cc | 89 Vector<TerminalIdPair> pairs; local
90 pairs.resize(terminals.size());
91 for (UInt32 i = 0; i < pairs.size(); ++i) {
92 pairs[i].first = terminals[i];
93 pairs[i].second = i;
96 std::sort(pairs.begin(), pairs.end());
99 for (UInt32 i = 0; i < pairs.size(); ++i) {
100 while (node < pairs[i].first) {
104 if (node == pairs[i].first)
[all...] |
| /external/chromium/base/ |
| string_split.cc | 100 std::vector<std::string> pairs; local
101 SplitString(line, key_value_pair_delimiter, &pairs);
104 for (size_t i = 0; i < pairs.size(); ++i) {
107 if (pairs[i].empty())
112 if (!SplitStringIntoKeyValues(pairs[i],
|
| /external/chromium_org/base/strings/ |
| string_split.cc | 89 std::vector<std::string> pairs; local
90 SplitString(line, key_value_pair_delimiter, &pairs);
93 for (size_t i = 0; i < pairs.size(); ++i) {
96 if (pairs[i].empty())
101 if (!SplitStringIntoKeyValues(pairs[i],
|
| /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)) {
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/ |
| ordered_dict.py | 78 pairs = ', '.join(map('%r: %r'.__mod__, self.items()))
79 return '%s({%s})' % (self.__class__.__name__, pairs)
|
| /external/chromium_org/third_party/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/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/valgrind/main/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_org/third_party/skia/src/core/ |
| SkData.cpp | 237 Pair* pairs = fPairs = allocatePairStorage(count, keySize); local
238 char* keyStorage = (char*)(pairs + count);
243 if (!findValue(array[i].fKey, pairs, uniqueCount)) {
246 pairs[uniqueCount].fKey = keyStorage;
250 pairs[uniqueCount].fValue = dupdata(array[i].fValue);
|
| /external/clang/lib/ARCMigrate/ |
| FileRemapper.cpp | 67 std::vector<std::pair<const FileEntry *, const FileEntry *> > pairs;
103 pairs.push_back(std::make_pair(origFE, newFE));
106 for (unsigned i = 0, e = pairs.size(); i != e; ++i)
107 remap(pairs[i].first, pairs[i].second);
|
