Home
last modified time | relevance | path

Searched refs:keys_ (Results 1 – 25 of 28) sorted by relevance

12

/external/chromium_org/net/quic/crypto/
Dcrypto_server_config_protobuf.h51 return keys_.size(); in key_size()
55 DCHECK_GT(keys_.size(), i); in key()
56 return *keys_[i]; in key()
68 keys_.push_back(new PrivateKey); in add_key()
69 return keys_.back(); in add_key()
73 STLDeleteElements(&keys_); in clear_key()
89 std::vector<PrivateKey*> keys_;
Dcrypto_server_config_protobuf.cc17 STLDeleteElements(&keys_); in ~QuicServerConfigProtobuf()
/external/chromium/net/base/
Dopenssl_memory_private_key_store.cc30 for (std::vector<EVP_PKEY*>::iterator it = keys_.begin(); in ~OpenSSLMemoryKeyStore()
31 it != keys_.end(); ++it) { in ~OpenSSLMemoryKeyStore()
39 keys_.push_back(pkey); in StorePrivateKey()
45 for (std::vector<EVP_PKEY*>::iterator it = keys_.begin(); in FetchPrivateKey()
46 it != keys_.end(); ++it) { in FetchPrivateKey()
54 std::vector<EVP_PKEY*> keys_; member in net::__anonf88b79ec0111::OpenSSLMemoryKeyStore
/external/chromium_org/net/base/
Dopenssl_private_key_store_memory.cc32 for (std::vector<EVP_PKEY*>::iterator it = keys_.begin(); in ~MemoryKeyPairStore()
33 it != keys_.end(); ++it) { in ~MemoryKeyPairStore()
41 keys_.push_back(pkey); in StoreKeyPair()
47 for (std::vector<EVP_PKEY*>::iterator it = keys_.begin(); in HasPrivateKey()
48 it != keys_.end(); ++it) { in HasPrivateKey()
56 std::vector<EVP_PKEY*> keys_; member in net::__anon7a8d8e530111::MemoryKeyPairStore
/external/openfst/src/include/fst/
Dbi-table.h150 keys_(table_size, compact_hash_func_, compact_hash_equal_) { in hash_func_()
160 keys_(table.keys_.size(), compact_hash_func_, compact_hash_equal_), in CompactHashBiTable()
162 keys_.insert(table.keys_.begin(), table.keys_.end()); in CompactHashBiTable()
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);
200 keys_.rehash(0);
252 KeyHashSet keys_; variable
345 keys_(0, hash_func_, hash_equal_) { in selector_()
[all …]
/external/chromium_org/third_party/leveldatabase/src/util/
Dbloom_test.cc25 std::vector<std::string> keys_; member in leveldb::BloomTest
35 keys_.clear(); in Reset()
40 keys_.push_back(s.ToString()); in Add()
45 for (size_t i = 0; i < keys_.size(); i++) { in Build()
46 key_slices.push_back(Slice(keys_[i])); in Build()
50 keys_.clear(); in Build()
70 if (!keys_.empty()) { in Matches()
/external/chromium_org/components/policy/core/common/
Dregistry_dict_win.cc149 KeyMap::iterator entry = keys_.find(name); in GetKey()
150 return entry != keys_.end() ? entry->second : NULL; in GetKey()
154 KeyMap::const_iterator entry = keys_.find(name); in GetKey()
155 return entry != keys_.end() ? entry->second : NULL; in GetKey()
165 RegistryDict*& entry = keys_[name]; in SetKey()
172 KeyMap::iterator entry = keys_.find(name); in RemoveKey()
173 if (entry != keys_.end()) { in RemoveKey()
175 keys_.erase(entry); in RemoveKey()
181 STLDeleteValues(&keys_); in ClearKeys()
221 for (KeyMap::const_iterator entry(other.keys_.begin()); in Merge()
[all …]
Dregistry_dict_win.h79 const KeyMap& keys() const { return keys_; } in keys()
83 KeyMap keys_;
/external/chromium_org/chrome/common/
Dcrash_keys_unittest.cc32 return keys_.find(key) != keys_.end(); in HasCrashKey()
36 return keys_[key]; in GetKeyValue()
42 self_->keys_[key.as_string()] = value.as_string(); in SetCrashKeyValue()
46 self_->keys_.erase(key.as_string()); in ClearCrashKey()
51 std::map<std::string, std::string> keys_; member in CrashKeysTest
/external/openfst/src/include/fst/extensions/far/
Dsttable.h123 compare_ = new Compare(&keys_); in STTableReader()
124 keys_.resize(filenames.size()); in STTableReader()
199 return keys_[current_] == key; in Find()
207 ReadType(*(streams_[current_]), &(keys_[current_])); in Next()
223 return keys_[current_]; in GetKey()
235 Compare(const vector<string> *keys) : keys_(keys) {} in Compare()
238 return (*keys_)[i] > (*keys_)[j]; in operator()
242 const vector<string> *keys_;
281 ReadType(*streams_[i], &(keys_[i])); in MakeHeap()
306 << keys_[current_] << ", file: " << sources_[current_]; in PopHeap()
[all …]
Dfar.h407 : keys_(filenames), has_stdin_(false), pos_(0), fst_(0), error_(false) { in FstFarReader()
408 sort(keys_.begin(), keys_.end()); in FstFarReader()
409 streams_.resize(keys_.size(), 0); in FstFarReader()
410 for (size_t i = 0; i < keys_.size(); ++i) { in FstFarReader()
411 if (keys_[i].empty()) { in FstFarReader()
424 keys_[i].c_str(), ifstream::in | ifstream::binary); in FstFarReader()
427 if (pos_ >= keys_.size()) return; in FstFarReader()
452 bool Done() const { return error_ || pos_ >= keys_.size(); } in Done()
460 return keys_[pos_]; in GetKey()
473 for (size_t i = 0; i < keys_.size(); ++i) in ~FstFarReader()
[all …]
/external/chromium_org/third_party/leveldatabase/src/table/
Dfilter_block.cc32 start_.push_back(keys_.size()); in AddKey()
33 keys_.append(k.data(), k.size()); in AddKey()
61 start_.push_back(keys_.size()); // Simplify length computation in GenerateFilter()
64 const char* base = keys_.data() + start_[i]; in GenerateFilter()
74 keys_.clear(); in GenerateFilter()
Dfilter_block.h41 std::string keys_; // Flattened key contents variable
/external/chromium_org/extensions/common/
Dmanifest_handler_unittest.cc83 : name_(name), keys_(keys), prereqs_(prereqs), watcher_(watcher) { in TestManifestHandler()
97 std::vector<std::string> keys_; member in extensions::ManifestHandlerTest::TestManifestHandler
102 return keys_; in Keys()
141 keys_(keys) { in TestManifestValidator()
161 return keys_; in Keys()
167 std::vector<std::string> keys_; member in extensions::ManifestHandlerTest::TestManifestValidator
/external/chromium/chrome/browser/resources/keyboard/
Dmain.js427 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/v8/src/
Dscopeinfo.h66 keys_[i].data = NULL; in ContextSlotCache()
67 keys_[i].name = NULL; in ContextSlotCache()
125 Key keys_[kLength]; variable
Dscopeinfo.cc404 Key& key = keys_[index]; in Lookup()
424 Key& key = keys_[index]; in Update()
437 for (int index = 0; index < kLength; index++) keys_[index].data = NULL; in Clear()
451 Key& key = keys_[index]; in ValidateEntry()
Dheap.h2252 keys_[i].map = NULL; in KeyedLookupCache()
2253 keys_[i].name = NULL; in KeyedLookupCache()
2263 return reinterpret_cast<Address>(&keys_); in keys_address()
2275 Key keys_[kLength]; variable
2295 Key& key = keys_[index]; in Lookup()
2305 Key& key = keys_[index]; in Update()
2320 keys_[i].array = NULL; in DescriptorLookupCache()
2321 keys_[i].name = NULL; in DescriptorLookupCache()
2341 Key keys_[kLength]; variable
/external/chromium_org/v8/src/
Dscopeinfo.h66 keys_[i].data = NULL; in ContextSlotCache()
67 keys_[i].name = NULL; in ContextSlotCache()
125 Key keys_[kLength]; variable
Dscopeinfo.cc427 Key& key = keys_[index]; in Lookup()
448 Key& key = keys_[index]; in Update()
461 for (int index = 0; index < kLength; index++) keys_[index].data = NULL; in Clear()
476 Key& key = keys_[index]; in ValidateEntry()
Dheap.h2639 keys_[i].map = NULL; in KeyedLookupCache()
2640 keys_[i].name = NULL; in KeyedLookupCache()
2650 return reinterpret_cast<Address>(&keys_); in keys_address()
2662 Key keys_[kLength]; variable
2682 Key& key = keys_[index]; in Lookup()
2692 Key& key = keys_[index]; in Update()
2707 keys_[i].source = NULL; in DescriptorLookupCache()
2708 keys_[i].name = NULL; in DescriptorLookupCache()
2730 Key keys_[kLength]; variable
/external/marisa-trie/tests/
Dtrie-test.cc35 : key_ids_(key_ids), keys_(keys) {} in PredictCallback()
37 : key_ids_(callback.key_ids_), keys_(callback.keys_) {} in PredictCallback()
41 keys_->push_back(key); in operator ()()
47 std::vector<std::string> *keys_; member in __anon13cdd0df0111::PredictCallback
/external/marisa-trie/lib/marisa/
Dtrie-search.cc13 : key_ids_(key_ids), keys_(keys), in PredictCallback()
16 : key_ids_(callback.key_ids_), keys_(callback.keys_), in PredictCallback()
24 if (keys_.is_valid()) { in operator ()()
25 keys_.insert(num_results_, key); in operator ()()
32 U keys_; member in marisa::__anoncd93f2250111::PredictCallback
/external/marisa-trie/v0_1_5/lib/marisa_alpha/
Dtrie-search.cc13 : key_ids_(key_ids), keys_(keys), in PredictCallback()
16 : key_ids_(callback.key_ids_), keys_(callback.keys_), in PredictCallback()
24 if (keys_.is_valid()) { in operator ()()
25 keys_.insert(num_results_, key); in operator ()()
32 U keys_; member in marisa_alpha::__anonaa2088230111::PredictCallback
/external/marisa-trie/v0_1_5/tests/
Dtrie-test.cc35 : key_ids_(key_ids), keys_(keys) {} in PredictCallback()
37 : key_ids_(callback.key_ids_), keys_(callback.keys_) {} in PredictCallback()
41 keys_->push_back(key); in operator ()()
47 std::vector<std::string> *keys_; member in __anona166b0d80111::PredictCallback

12