/external/antlr/antlr-3.4/lib/ |
H A D | antlr-3.4-complete.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ... |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | TreeWizard.java | 109 * dynamic searches; i.e., go find me all PLUS nodes. 172 * TODO: save this index so that find and visit are faster 200 public List find(Object t, int ttype) { method in class:TreeWizard 211 public List find(Object t, String pattern) { method in class:TreeWizard 441 * This data structure allows you to find all nodes with type INT in order. 443 * If you really need to find a node of type, say, FUNC quickly then perhaps
|
/external/antlr/antlr-3.4/runtime/Python/antlr3/ |
H A D | treewizard.py | 399 def find(self, tree, what): member in class:TreeWizard 402 what may either be an integer specifzing the token type to find or
|
/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/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/support/ |
H A D | A.java | 27 public String find(String key) { method in class:A
|
H A D | I.java | 21 String find(String key); method in interface:I
|
/external/bluetooth/bluedroid/stack/a2dp/ |
H A D | a2d_int.h | 54 tA2D_FIND_CB find; /* find service control block */ member in struct:__anon1189
|
/external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/operator/ |
H A D | DefaultDigestAlgorithmIdentifierFinder.java | 89 public AlgorithmIdentifier find(AlgorithmIdentifier sigAlgId) method in class:DefaultDigestAlgorithmIdentifierFinder 105 public AlgorithmIdentifier find(String digAlgName) method in class:DefaultDigestAlgorithmIdentifierFinder
|
H A D | DefaultSignatureAlgorithmIdentifierFinder.java | 226 public AlgorithmIdentifier find(String sigAlgName) method in class:DefaultSignatureAlgorithmIdentifierFinder
|
H A D | DigestAlgorithmIdentifierFinder.java | 14 AlgorithmIdentifier find(AlgorithmIdentifier sigAlgId); method in interface:DigestAlgorithmIdentifierFinder 23 AlgorithmIdentifier find(String digAlgName); method in interface:DigestAlgorithmIdentifierFinder
|
H A D | SignatureAlgorithmIdentifierFinder.java | 14 AlgorithmIdentifier find(String sigAlgName); method in interface:SignatureAlgorithmIdentifierFinder
|
/external/chromium_org/athena/activity/ |
H A D | activity_manager_impl.cc | 59 std::find(activities_.begin(), activities_.end(), activity)); 69 std::vector<Activity*>::iterator find = local 70 std::find(activities_.begin(), activities_.end(), activity); 71 DCHECK(find != activities_.end()); 72 if (find != activities_.end()) { 75 activities_.erase(find);
|
/external/chromium_org/athena/wm/ |
H A D | window_list_provider_impl.cc | 99 aura::Window::Windows::iterator find = std::find(window_list_.begin(), local 102 CHECK(find != window_list_.end()); 103 int index = find - window_list_.begin(); 104 window_list_.erase(find);
|
/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
|
H A D | small_map.h | 386 iterator find(const key_type& key) { function in class:base::SmallMap 396 return iterator(map()->find(key)); 400 const_iterator find(const key_type& key) const { function in class:base::SmallMap 410 return const_iterator(map()->find(key)); 528 iterator iter = find(key); 535 return (find(key) == end()) ? 0 : 1;
|
/external/chromium_org/base/strings/ |
H A D | string_piece.cc | 115 size_t find(const StringPiece& self, const StringPiece& s, size_t pos) { function in namespace:base::internal 119 size_t find(const StringPiece16& self, const StringPiece16& s, size_t pos) { function in namespace:base::internal 131 std::find(self.begin() + pos, self.end(), c); 136 size_t find(const StringPiece& self, char c, size_t pos) { function in namespace:base::internal 140 size_t find(const StringPiece16& self, char16 c, size_t pos) { function in namespace:base::internal 204 return find(self, s.data()[0], pos);
|
H A D | string_piece.h | 25 // functions (find, find_first_of, etc.) are found to be useful in this context. 73 BASE_EXPORT size_t find(const StringPiece& self, 76 BASE_EXPORT size_t find(const StringPiece16& self, 79 BASE_EXPORT size_t find(const StringPiece& self, 82 BASE_EXPORT size_t find(const StringPiece16& self, 286 // find: Search for a character or substring at a given offset. 287 size_type find(const BasicStringPiece<STRING_TYPE>& s, function in class:base::BasicStringPiece 289 return internal::find(*this, s, pos); 291 size_type find(value_type c, size_type pos = 0) const { function in class:base::BasicStringPiece 292 return internal::find(*thi [all...] |
/external/chromium_org/cc/resources/ |
H A D | picture_layer_tiling.cc | 121 DCHECK(tiles_.find(key) == tiles_.end()); 160 TileMap::iterator find = tiles_.find(key); local 161 if (find != tiles_.end()) 466 TileMap::iterator found = tiles_.find(TileMapKey(i, j)); 599 TileMap::iterator find = tiles_.find(iter.index()); local 600 if (find == tiles_.end()) 603 Tile* tile = find->second.get(); 621 TileMap::iterator find local 644 TileMap::iterator find = tiles_.find(iter.index()); local 670 TileMap::iterator find = tiles_.find(iter.index()); local [all...] |
H A D | picture_layer_tiling_set_unittest.cc | 527 std::map<gfx::Point, scoped_refptr<Tile> >::iterator find = local 528 old_tile_map.find(tile->content_rect().origin()); 530 EXPECT_NE(tile, find->second.get()); 532 EXPECT_EQ(tile, find->second.get()); 559 std::vector<Tile*>::iterator find = local 560 std::find(new_tiles.begin(), new_tiles.end(), original_tiles[i]); 561 EXPECT_TRUE(find == new_tiles.end());
|
/external/chromium_org/chrome/browser/prefs/ |
H A D | profile_pref_store_manager_unittest.cc | 236 void ReplaceStringInPrefs(const std::string& find, argument 246 ReplaceSubstringsAfterOffset(&contents, 0u, find, replace);
|
/external/chromium_org/chrome/installer/mini_installer/ |
H A D | mini_installer.cc | 635 HANDLE find = ::FindFirstFile(path->get(), &find_data); local 636 if (find != INVALID_HANDLE_VALUE) { 653 } while (::FindNextFile(find, &find_data)); 654 ::FindClose(find); 675 HANDLE find = ::FindFirstFileEx(spec.get(), FindExInfoStandard, &find_data, local 677 if (find == INVALID_HANDLE_VALUE) 691 } while (::FindNextFile(find, &find_data)); 692 ::FindClose(find);
|
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/chrome/third_party/chromevox/ |
H A D | chromeVoxChromeBackgroundScript.js | 63 goog.array.find=function(a,b,c){b=goog.array.findIndex(a,b,c);return 0>b?null:goog.isString(a)?a.charAt(b):a[b]};goog.array.findIndex=function(a,b,c){for(var d=a.length,e=goog.isString(a)?a.split(""):a,f=0;f<d;f++)if(f in e&&b.call(c,e[f],f,a))return f;return-1};goog.array.findRight=function(a,b,c){b=goog.array.findIndexRight(a,b,c);return 0>b?null:goog.isString(a)?a.charAt(b):a[b]}; 1533 a.findNext&&(b="find",a.announce=!0);var c="",d="",e=!1;switch(b){case "handleTab":case "handleTabPrev":e=cvox.ChromeVoxUserCommands.handleTabAction_();break;case "forward":case "backward":e=!cvox.ChromeVox.navigationManager.navigate();break;case "right":case "left":cvox.ChromeVox.navigationManager.subnavigate();break;case "find":if(!a.findNext)throw"Invalid find command.";var f=cvox.CommandStore.NODE_INFO_MAP[a.findNext],g=f.predicate,h=cvox.DomPredicates[g],k="",l="";a.forward?(l=cvox.ChromeVox.msgs.getMsg("wrapped_to_top"),
|
H A D | chromeVoxChromeOptionsScript.js | 124 goog.array.find=function(a,b,c){b=goog.array.findIndex(a,b,c);return 0>b?null:goog.isString(a)?a.charAt(b):a[b]};goog.array.findIndex=function(a,b,c){for(var d=a.length,e=goog.isString(a)?a.split(""):a,f=0;f<d;f++)if(f in e&&b.call(c,e[f],f,a))return f;return-1};goog.array.findRight=function(a,b,c){b=goog.array.findIndexRight(a,b,c);return 0>b?null:goog.isString(a)?a.charAt(b):a[b]}; 1469 a.findNext&&(b="find",a.announce=!0);var c="",d="",e=!1;switch(b){case "handleTab":case "handleTabPrev":e=cvox.ChromeVoxUserCommands.handleTabAction_();break;case "forward":case "backward":e=!cvox.ChromeVox.navigationManager.navigate();break;case "right":case "left":cvox.ChromeVox.navigationManager.subnavigate();break;case "find":if(!a.findNext)throw"Invalid find command.";var f=cvox.CommandStore.NODE_INFO_MAP[a.findNext],g=f.predicate,h=cvox.DomPredicates[g],k="",l="";a.forward?(l=cvox.ChromeVox.msgs.getMsg("wrapped_to_top"),
|