| /external/chromium_org/tools/json_comment_eater/ |
| json_comment_eater.py | 24 min_index, min_key = (-1, None)
28 min_index, min_key = (index, k)
29 return (min_index, min_key)
|
| /external/qemu/distrib/sdl-1.2.15/src/video/riscos/ |
| SDL_riscosevents.c | 358 int min_key, max_key; local
393 min_key = ROKEY_LAST_KEY+1;
406 if (j < min_key) min_key = j;
413 for (j = min_key; j <= max_key; j++)
|
| /external/chromium_org/tools/deep_memory_profiler/lib/ |
| range_dict.py | 70 begin = self._tree.min_key()
101 self._tree[begin] = (min(end, self._tree.min_key()), self._attr())
|
| /external/chromium_org/content/browser/indexed_db/ |
| indexed_db_leveldb_coding_unittest.cc | 129 std::string min_key = MinIDBKey(); local
141 EXPECT_GT(CompareKeys(max_key, min_key), 0);
150 std::string min_key = MinIDBKey(); local
164 EXPECT_LT(CompareKeys(min_key, max_key), 0);
165 EXPECT_LT(CompareKeys(min_key, array_key), 0);
166 EXPECT_LT(CompareKeys(min_key, binary_key), 0);
167 EXPECT_LT(CompareKeys(min_key, string_key), 0);
168 EXPECT_LT(CompareKeys(min_key, number_key), 0);
169 EXPECT_LT(CompareKeys(min_key, date_key), 0);
[all...] |
| /external/chromium_org/third_party/bintrees/bintrees/ |
| treemixin.py | 80 if 's' is None or T[:e] TreeSlice/iterator starts with value of min_key()
119 * min_key() -> get smallest key of T, O(log(n))
482 def min_key(self): member in class:TreeMixin
|
