/external/emma/core/java12/com/vladium/jcd/cls/ |
H A D | IConstantCollection.java | 64 * @see IConstantCollection#find(int, IConstantComparator) 115 int find (int type, IConstantComparator comparator); method in interface:IConstantCollection
|
/external/jarjar/src/main/com/tonicsystems/jarjar/ |
H A D | Main.java | 65 public void find(String level, String cp1, String cp2) throws IOException { method in class:Main
|
/external/llvm/lib/CodeGen/ |
H A D | LiveInterval.cpp | 34 LiveRange::iterator LiveRange::find(SlotIndex Pos) { function in class:LiveRange 55 iterator I = find(Def); 145 // Use binary searches to find initial positions. 146 const_iterator I = find(Other.beginIndex()); 150 const_iterator J = Other.find(I->start); 351 iterator I = find(Start); 746 ReadI = WriteI = LR->find(Seg.start);
|
/external/mockito/src/org/mockito/ |
H A D | AdditionalMatchers.java | 432 public static String find(String regex) { method in class:AdditionalMatchers
|
/external/oprofile/libpp/ |
H A D | locate_images.cpp | 73 vector<string> const extra_images::find(string const & name) const function in class:extra_images 76 return find(match); 81 extra_images::find(extra_images::matcher const & match) const function in class:extra_images 172 vector<string> result = find(base); 176 result = find(module_matcher(base + ".ko"));
|
/external/regex-re2/util/ |
H A D | stringpiece.cc | 42 int StringPiece::find(const StringPiece& s, size_type pos) const { function in class:StringPiece 52 int StringPiece::find(char c, size_type pos) const { function in class:StringPiece 56 const char* result = std::find(ptr_ + pos, ptr_ + length_, c);
|
/external/robolectric/src/main/java/com/xtremelabs/robolectric/bytecode/ |
H A D | Type.java | 51 public static Type find(CtClass ctClass) { method in class:Type
|
/external/robolectric/src/main/java/com/xtremelabs/robolectric/res/ |
H A D | PluralResourceLoader.java | 28 Plural p = rules.find(quantity); 61 Plural find(int quantity) { method in class:PluralResourceLoader.PluralRules
|
/external/skia/src/animator/ |
H A D | SkTypedArray.cpp | 118 int SkDS32Array::find(const int32_t& elem) const function in class:SkDS32Array
|
/external/skia/src/core/ |
H A D | SkAnnotation.cpp | 28 SkData* SkAnnotation::find(const char key[]) const { function in class:SkAnnotation
|
H A D | SkPtrRecorder.h | 31 uint32_t find(void*) const; 88 uint32_t find(T ptr) { function in class:SkTPtrSet 89 return this->INHERITED::find((void*)ptr); 135 uint32_t find(SkFlattenable::Factory);
|
/external/skia/src/effects/gradients/ |
H A D | SkBitmapCache.cpp | 83 bool SkBitmapCache::find(const void* buffer, size_t size, SkBitmap* bm) const { function in class:SkBitmapCache
|
/external/skia/src/gpu/ |
H A D | GrTMultiMap.h | 39 ValueList* list = fHash.find(key); 57 ValueList* list = fHash.find(key); 83 T* find(const Key& key) const { function in class:GrTMultiMap 84 ValueList* list = fHash.find(key); 92 T* find(const Key& key, const FindPredicate f) { function in class:GrTMultiMap 93 ValueList* list = fHash.find(key);
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/ |
H A D | wizard.rb | 89 wizard.find(statement_node, '(PLUS . .)') 91 wizard.find(deep_node, 4) # where 4 is the value of type VAR 156 type, = PATTERNS.find do |type, pattern| 350 def find( tree, what ) method in class:ANTLR3.AST.Wizard 479 tree = @adaptor.each_ancestor( tree ).find do | t |
|
/external/chromium_org/base/containers/ |
H A D | scoped_ptr_hash_map.h | 43 iterator it = find(key); 68 iterator it = data_.find(k); 86 iterator it = find(k); 104 iterator it = find(k); 114 const_iterator it = find(k); 124 inline const_iterator find(const Key& k) const { return data_.find(k); } function in class:base::ScopedPtrHashMap 125 inline iterator find(const Key& k) { return data_.find(k); } function in class:base::ScopedPtrHashMap
|
/external/chromium_org/chrome/installer/mini_installer/ |
H A D | mini_string.cc | 112 const wchar_t* SearchStringI(const wchar_t* source, const wchar_t* find) { argument 113 if (!find || find[0] == L'\0') 119 const wchar_t* f = find;
|
/external/chromium_org/chrome/test/chromedriver/ |
H A D | keycode_text_conversion_x.cc | 138 KeyCodeAndXKeyCode find; local 139 find.key_code = key_code; 142 find);
|
/external/chromium_org/content/public/test/ |
H A D | mock_storage_client.cc | 46 DCHECK(origin_data_.find(make_pair(origin_url, type)) == origin_data_.end()); 55 OriginDataMap::iterator find = origin_data_.find(make_pair(origin_url, type)); local 56 DCHECK(find != origin_data_.end()); 57 find->second += delta; 58 DCHECK_GE(find->second, 0); 134 OriginDataMap::iterator find = origin_data_.find(make_pair(origin_url, type)); local 135 if (find == origin_data_.end()) { 138 callback.Run(find [all...] |
/external/chromium_org/net/base/ |
H A D | linked_hash_map.h | 26 // begin/end/find. 28 // We also keep a map<Key, list::iterator> for find. Since std::list is a 118 typename MapType::iterator found = map_.find(key); 131 typename MapType::iterator found = map_.find(position->first); 149 iterator find(const Key& key) { function in class:linked_hash_map 150 typename MapType::iterator found = map_.find(key); 157 const_iterator find(const Key& key) const { function in class:linked_hash_map 158 typename MapType::const_iterator found = map_.find(key); 198 typename MapType::iterator found = map_.find(pair.first);
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
H A D | 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/ |
H A D | 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/ |
H A D | 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/css/resolver/ |
H A D | MatchedPropertiesCache.cpp | 92 const CachedMatchedProperties* MatchedPropertiesCache::find(unsigned hash, const StyleResolverState& styleResolverState, const MatchResult& matchResult) function in class:blink::MatchedPropertiesCache 96 Cache::iterator it = m_cache.find(hash);
|
/external/chromium_org/third_party/WebKit/Source/core/events/ |
H A D | EventListenerMap.cpp | 114 if (vector->find(registeredListener) != kNotFound) 137 indexOfRemovedListener = listenerVector->find(registeredListener); 160 EventListenerVector* EventListenerMap::find(const AtomicString& eventType) function in class:blink::EventListenerMap
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | HashCountedSet.h | 61 iterator find(const ValueType& value) { return m_impl.find(value); } function in class:WTF::HashCountedSet 62 const_iterator find(const ValueType& value) const { return m_impl.find(value); } function in class:WTF::HashCountedSet 73 bool remove(const ValueType& value) { return remove(find(value)); } 77 void removeAll(const ValueType& value) { removeAll(find(value)); }
|