/external/chromium/net/base/ |
openssl_memory_private_key_store.cc | 30 for (std::vector<EVP_PKEY*>::iterator it = keys_.begin(); 31 it != keys_.end(); ++it) { 39 keys_.push_back(pkey); 45 for (std::vector<EVP_PKEY*>::iterator it = keys_.begin(); 46 it != keys_.end(); ++it) { 54 std::vector<EVP_PKEY*> keys_; member in class:net::__anon4936::OpenSSLMemoryKeyStore
|
/external/openfst/src/include/fst/ |
bi-table.h | 150 keys_(table_size, compact_hash_func_, compact_hash_equal_) { 160 keys_(table.keys_.size(), compact_hash_func_, compact_hash_equal_), 162 keys_.insert(table.keys_.begin(), table.keys_.end()); 172 typename KeyHashSet::const_iterator it = keys_.find(kCurrentKey); 173 if (it == keys_.end()) { // T not found 177 keys_.insert(key); 197 keys_.erase(key) 252 KeyHashSet keys_; member in class:fst::CompactHashBiTable 468 KeyHashSet keys_; member in class:fst::VectorHashBiTable [all...] |
/external/openfst/src/include/fst/extensions/far/ |
sttable.h | 123 compare_ = new Compare(&keys_); 124 keys_.resize(filenames.size()); 199 return keys_[current_] == key; 207 ReadType(*(streams_[current_]), &(keys_[current_])); 223 return keys_[current_]; 235 Compare(const vector<string> *keys) : keys_(keys) {} 238 return (*keys_)[i] > (*keys_)[j]; 242 const vector<string> *keys_; member in struct:fst::STTableReader::Compare 281 ReadType(*streams_[i], &(keys_[i])) 316 vector<string> keys_; \/\/ Lowest unread key for each stream member in class:fst::STTableReader [all...] |
far.h | 407 : keys_(filenames), has_stdin_(false), pos_(0), fst_(0), error_(false) { 408 sort(keys_.begin(), keys_.end()); 409 streams_.resize(keys_.size(), 0); 410 for (size_t i = 0; i < keys_.size(); ++i) { 411 if (keys_[i].empty()) { 424 keys_[i].c_str(), ifstream::in | ifstream::binary); 427 if (pos_ >= keys_.size()) return; 452 bool Done() const { return error_ || pos_ >= keys_.size(); } 460 return keys_[pos_] 490 vector<string> keys_; member in class:fst::FstFarReader [all...] |
/external/v8/src/ |
scopeinfo.h | 66 keys_[i].data = NULL; 67 keys_[i].name = NULL; 125 Key keys_[kLength]; member in class:v8::internal::ContextSlotCache
|
scopeinfo.cc | 404 Key& key = keys_[index]; 424 Key& key = keys_[index]; 437 for (int index = 0; index < kLength; index++) keys_[index].data = NULL; 451 Key& key = keys_[index];
|
heap.h | 2275 Key keys_[kLength]; member in class:v8::internal::KeyedLookupCache 2341 Key keys_[kLength]; member in class:v8::internal::DescriptorLookupCache [all...] |
heap.cc | [all...] |
/external/chromium/chrome/browser/resources/keyboard/ |
main.js | 427 this.keys_ = keys; 439 for (var i = 0; i < this.keys_.length; ++i) { 440 total += this.keys_[i].aspect; 459 for (var j = 0; j < this.keys_.length; ++j) { 460 var key = this.keys_[j]; 472 for (var i = 0; i < this.keys_.length; ++i) { 473 this.keys_[i].position = this.position_; 497 for (var i = 0; i < this.keys_.length; ++i) { 498 this.keys_[i].resize(height);
|
/external/marisa-trie/lib/marisa/ |
trie-search.cc | 13 : key_ids_(key_ids), keys_(keys), 16 : key_ids_(callback.key_ids_), keys_(callback.keys_), 24 if (keys_.is_valid()) { 25 keys_.insert(num_results_, key); 32 U keys_; member in class:marisa::__anon12140::PredictCallback
|
/external/marisa-trie/tests/ |
trie-test.cc | 35 : key_ids_(key_ids), keys_(keys) {} 37 : key_ids_(callback.key_ids_), keys_(callback.keys_) {} 41 keys_->push_back(key); 47 std::vector<std::string> *keys_; member in class:__anon12143::PredictCallback
|
/external/marisa-trie/v0_1_5/tests/ |
trie-test.cc | 35 : key_ids_(key_ids), keys_(keys) {} 37 : key_ids_(callback.key_ids_), keys_(callback.keys_) {} 41 keys_->push_back(key); 47 std::vector<std::string> *keys_; member in class:__anon12156::PredictCallback
|
/external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
trie-search.cc | 13 : key_ids_(key_ids), keys_(keys), 16 : key_ids_(callback.key_ids_), keys_(callback.keys_), 24 if (keys_.is_valid()) { 25 keys_.insert(num_results_, key); 32 U keys_; member in class:marisa_alpha::__anon12153::PredictCallback
|