| /external/chromium_org/net/base/ |
| linked_hash_map.h | 26 // begin/end/find.
28 // We also keep a map<Key, list::iterator> for find. Since std::list is a
96 typename MapType::iterator found = map_.find(key);
109 typename MapType::iterator found = map_.find(position->first);
127 iterator find(const Key& key) { function in class:linked_hash_map
128 typename MapType::iterator found = map_.find(key);
135 const_iterator find(const Key& key) const { function in class:linked_hash_map
136 typename MapType::const_iterator found = map_.find(key);
176 typename MapType::iterator found = map_.find(pair.first);
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
| v8-splay.js | 71 } while (splayTree.find(key) != null);
184 * @param {number} key Key to find and remove from the tree.
215 * @param {number} key Key to find in the tree.
218 SplayTree.prototype.find = function(key) {
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
| v8-splay.js | 71 } while (splayTree.find(key) != null);
184 * @param {number} key Key to find and remove from the tree.
215 * @param {number} key Key to find in the tree.
218 SplayTree.prototype.find = function(key) {
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
| v8-splay.js | 71 } while (splayTree.find(key) != null);
185 * @param {number} key Key to find and remove from the tree.
216 * @param {number} key Key to find in the tree.
219 SplayTree.prototype.find = function(key) {
|
| /external/chromium_org/third_party/WebKit/Source/core/page/ |
| FrameTree.cpp | 113 // Find the nearest parent that has a frame with a path in it.
207 Frame* FrameTree::find(const AtomicString& name) const function in class:WebCore::FrameTree
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| HashSet.h | 63 iterator find(const ValueType&) const;
66 // An alternate version of find() that finds the object by hashing and comparing
71 template<typename HashTranslator, typename T> iterator find(const T&) const;
149 inline typename HashSet<T, U, V>::iterator HashSet<T, U, V>::find(const ValueType& value) const function in class:WTF::HashSet
151 return m_impl.find(value);
163 inline HashSet<Value, HashFunctions, Traits>::find(const T& value) const function in class:WTF::HashSet::HashSet
165 return m_impl.template find<HashSetTranslatorAdapter<HashTranslator> >(value);
198 remove(find(value));
|
| /external/chromium_org/third_party/WebKit/Source/wtf/text/ |
| AtomicString.h | 91 static StringImpl* find(const StringImpl*);
111 size_t find(UChar c, size_t start = 0) const { return m_string.find(c, start); } function in class:WTF::AtomicString
112 size_t find(const LChar* s, size_t start = 0, bool caseSentitive = true) const function in class:WTF::AtomicString
113 { return m_string.find(s, start, caseSentitive); }
114 size_t find(const String& s, size_t start = 0, bool caseSentitive = true) const function in class:WTF::AtomicString
115 { return m_string.find(s, start, caseSentitive); }
|
| /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/clover/core/ |
| compat.hpp | 265 find(const string &s) const { function in class:clover::compat::string
|
| /external/chromium_org/third_party/skia/src/animator/ |
| SkTDArray_Experimental.h | 48 int find(const int32_t& elem) const;
120 int find(const T& elem) const { return SkDS32Array::find((const int32_t&) elem); } function in class:SkTDS32Array
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkTDynamicHash.h | 36 T* find(const Key& key) const { function in class:SkTDynamicHash
48 SkASSERT(0); // find: should be unreachable
54 SkASSERT(NULL == this->find(GetKey(*newEntry)));
63 SkASSERT(NULL != this->find(key));
135 SKTDYNAMICHASH_CHECK(NULL != this->find(GetKey(*fArray[i])));
|
| /external/chromium_org/third_party/skia/src/pdf/ |
| SkTSet.h | 19 Main operations supported now are: add, merge, find and contains.
125 int i = find(elem, &pos);
213 return (this->find(elem) >= 0);
321 int find(const T& elem, int* posToInsertSorted = NULL) const { function in class:SkTSet
|
| /external/chromium_org/tools/deep_memory_profiler/tests/ |
| dmprof_test.py | 38 def find(self, address_list): member in class:SymbolMappingCacheTest.MockSymbolFinder
|
| /external/chromium_org/tools/deep_memory_profiler/visualizer/static/ |
| profiler.js | 97 function find(model) {
102 var matched = find(current);
110 var matched = find(current);
|
| /external/chromium_org/tools/find_runtime_symbols/ |
| static_symbols.py | 30 def find(self, address): member in class:AddressMapping
49 def find(self, address): member in class:RangeAddressMapping
154 return target.find(elf_address)
|
| /external/chromium_org/v8/benchmarks/spinning-balls/ |
| splay-tree.js | 95 * @param {number} key Key to find and remove from the tree.
126 * @param {number} key Key to find in the tree.
129 SplayTree.prototype.find = function(key) {
|
| /external/chromium_org/v8/benchmarks/ |
| splay.js | 76 } while (splayTree.find(key) != null);
190 * @param {number} key Key to find and remove from the tree.
221 * @param {number} key Key to find in the tree.
224 SplayTree.prototype.find = function(key) {
|
| /external/chromium_org/v8/tools/ |
| splaytree.js | 97 * @param {number} key Key to find and remove from the tree.
128 * @param {number} key Key to find in the tree.
131 SplayTree.prototype.find = function(key) {
|
| /external/chromium_org/webkit/browser/quota/ |
| mock_storage_client.cc | 43 DCHECK(origin_data_.find(make_pair(origin_url, type)) == origin_data_.end());
52 OriginDataMap::iterator find = origin_data_.find(make_pair(origin_url, type)); local
53 DCHECK(find != origin_data_.end());
54 find->second += delta;
55 DCHECK_GE(find->second, 0);
131 OriginDataMap::iterator find = origin_data_.find(make_pair(origin_url, type)); local
132 if (find == origin_data_.end()) {
135 callback.Run(find->second)
[all...] |
| /external/clang/unittests/Tooling/ |
| CompilationDatabaseTest.cpp | 140 StringRef find(StringRef Path) { function in class:clang::tooling::FileMatchTrieTest
152 EXPECT_EQ("//net/path/file.cc", find("//net/path/file.cc"));
156 EXPECT_EQ("", find("file.cc"));
162 EXPECT_EQ("//net/d/b/b.cc", find("//net/d/b/b.cc"));
167 EXPECT_EQ("//net/AA/file.cc", find("//net/aa/file.cc"));
173 EXPECT_TRUE(find("//net/aa/file.cc").empty());
181 EXPECT_EQ("//net/SRC/aa/file.cc", find("//net/src/aa/file.cc"));
185 EXPECT_TRUE(find("//net/some/path").empty());
191 EXPECT_EQ("", find("//net/somepath/somefile.cc"));
197 EXPECT_EQ("//net/path/file.cc", find("//net/path/file.cc"))
[all...] |
| /external/droiddriver/src/com/google/android/droiddriver/base/ |
| AbstractDroidDriver.java | 54 public UiElement find(Finder finder) { method in class:AbstractDroidDriver
55 Logs.call(this, "find", finder);
56 return finder.find(refreshRootElement());
62 find(finder);
|
| /external/emma/core/java12/com/vladium/emma/report/ |
| SourcePathCache.java | 81 public synchronized File find (final String packageVMName, final String name) method in class:SourcePathCache
|
| /external/emma/core/java12/com/vladium/jcd/cls/ |
| ConstantCollection.java | 46 public int find (final int type, final IConstantComparator comparator) method in class:ConstantCollection
|
| /external/llvm/include/llvm/ADT/ |
| DenseSet.h | 113 iterator find(const ValueT &V) { return Iterator(TheMap.find(V)); } function in class:llvm::DenseSet
|
| /external/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 63 iterator find(BasicBlock *B) { return Frontiers.find(B); } function in class:llvm::DominanceFrontierBase
64 const_iterator find(BasicBlock *B) const { return Frontiers.find(B); } function in class:llvm::DominanceFrontierBase
67 assert(find(BB) == end() && "Block already in DominanceFrontier!");
73 assert(find(BB) != end() && "Block is not in DominanceFrontier!");
126 const_iterator DFI = find(Node);
|
| /external/mesa3d/src/gallium/state_trackers/clover/core/ |
| compat.hpp | 265 find(const string &s) const { function in class:clover::compat::string
|
