| /external/chromium_org/net/quic/crypto/ |
| crypto_server_config_protobuf.cc | 17 STLDeleteElements(&keys_);
|
| crypto_server_config_protobuf.h | 51 return keys_.size();
55 DCHECK_GT(keys_.size(), i);
56 return *keys_[i];
68 keys_.push_back(new PrivateKey);
69 return keys_.back();
73 STLDeleteElements(&keys_);
89 std::vector<PrivateKey*> keys_; member in class:net::QuicServerConfigProtobuf
|
| /art/compiler/utils/ |
| dedupe_set.h | 49 iterator begin() { return keys_.begin(); }
50 const_iterator begin() const { return keys_.begin(); }
51 iterator end() { return keys_.end(); }
52 const_iterator end() const { return keys_.end(); }
58 auto it = keys_.find(hashed_key);
59 if (it != keys_.end()) {
63 keys_.insert(hashed_key);
71 STLDeleteValues(&keys_);
76 Keys keys_; member in class:art::DedupeSet
|
| /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::__anon5401::OpenSSLMemoryKeyStore
|
| /external/chromium_org/net/base/ |
| openssl_private_key_store_memory.cc | 32 for (std::vector<EVP_PKEY*>::iterator it = keys_.begin();
33 it != keys_.end(); ++it) {
41 keys_.push_back(pkey);
47 for (std::vector<EVP_PKEY*>::iterator it = keys_.begin();
48 it != keys_.end(); ++it) {
56 std::vector<EVP_PKEY*> keys_; member in class:net::__anon10968::MemoryKeyPairStore
|
| /external/chromium_org/third_party/leveldatabase/src/util/ |
| bloom_test.cc | 25 std::vector<std::string> keys_; member in class:leveldb::BloomTest
35 keys_.clear();
40 keys_.push_back(s.ToString());
45 for (size_t i = 0; i < keys_.size(); i++) {
46 key_slices.push_back(Slice(keys_[i]));
50 keys_.clear();
70 if (!keys_.empty()) {
|
| /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/chromium_org/third_party/leveldatabase/src/table/ |
| filter_block.cc | 32 start_.push_back(keys_.size());
33 keys_.append(k.data(), k.size());
61 start_.push_back(keys_.size()); // Simplify length computation
64 const char* base = keys_.data() + start_[i];
74 keys_.clear();
|
| filter_block.h | 41 std::string keys_; // Flattened key contents member in class:leveldb::FilterBlockBuilder
42 std::vector<size_t> start_; // Starting index in keys_ of each key
|
| /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...] |
| /external/chromium_org/chrome/browser/policy/ |
| registry_dict_win.cc | 207 KeyMap::iterator entry = keys_.find(name);
208 return entry != keys_.end() ? entry->second : NULL;
212 KeyMap::const_iterator entry = keys_.find(name);
213 return entry != keys_.end() ? entry->second : NULL;
223 RegistryDict*& entry = keys_[name];
230 KeyMap::iterator entry = keys_.find(name);
231 if (entry != keys_.end()) {
233 keys_.erase(entry);
239 STLDeleteValues(&keys_);
279 for (KeyMap::const_iterator entry(other.keys_.begin())
[all...] |
| registry_dict_win.h | 78 const KeyMap& keys() const { return keys_; }
82 KeyMap keys_; member in class:policy::RegistryDict
|
| /external/chromium_org/chrome/common/extensions/ |
| manifest_handler_unittest.cc | 83 : name_(name), keys_(keys), prereqs_(prereqs), watcher_(watcher) {
97 std::vector<std::string> keys_; member in class:extensions::ManifestHandlerTest::TestManifestHandler
102 return keys_;
141 keys_(keys) {
161 return keys_;
167 std::vector<std::string> keys_; member in class:extensions::ManifestHandlerTest::TestManifestValidator
|
| /external/chromium_org/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 | 430 Key& key = keys_[index];
450 Key& key = keys_[index];
463 for (int index = 0; index < kLength; index++) keys_[index].data = NULL;
477 Key& key = keys_[index];
|
| heap.h | [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::__anon24402::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:__anon24405::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:__anon24418::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::__anon24415::PredictCallback
|
