| /external/chromium/net/disk_cache/ |
| bitmap.h | 17 Bitmap() : map_(NULL), num_bits_(0), array_size_(0), alloc_(false) {}
24 map_ = new uint32[array_size_];
35 : map_(map), num_bits_(num_bits),
43 delete[] map_;
61 memset(map_, (value ? 0xFF : 0x00), array_size_ * sizeof(*map_));
85 const uint32* GetMap() const { return map_; }
143 uint32* map_; // The bitmap. member in class:disk_cache::Bitmap
|
| bitmap.cc | 42 DCHECK(alloc_ || !map_);
51 memcpy(new_map, map_,
52 sizeof(*map_) * std::min(array_size_, old_array_size));
54 delete[] map_; // No need to check for NULL.
55 map_ = new_map;
71 map_[j] |= (1 << i);
73 map_[j] &= ~(1 << i);
81 return map_[j] & (1 << i) ? true : false;
89 map_[j] ^= (1 << i);
95 map_[array_index] = value
[all...] |
| /external/v8/src/ |
| hashmap.cc | 55 allocator_->Delete(map_);
118 q = map_;
129 Entry* r = map_ + (q->hash & (capacity_ - 1));
150 for (Entry* p = map_; p < end; p++) {
158 return Next(map_ - 1);
164 ASSERT(map_ - 1 <= p && p < end);
178 Entry* p = map_ + (hash & (capacity_ - 1));
180 ASSERT(map_ <= p && p < end);
186 p = map_;
196 map_ = reinterpret_cast<Entry*>(allocator_->New(capacity * sizeof(Entry)))
[all...] |
| hashmap.h | 107 Entry* map_; member in class:v8::internal::HashMap
111 Entry* map_end() const { return map_ + capacity_; }
|
| d8.h | 98 : map_(&map->hash_map_), entry_(map_->Start()) { }
99 void Next() { entry_ = map_->Next(entry_); }
104 i::HashMap* map_; member in class:v8::CounterMap::Iterator
|
| /external/chromium/base/ |
| id_map.h | 105 : map_(map),
106 iter_(map_->data_.begin()) {
107 ++map_->iteration_depth_;
112 if (--map_->iteration_depth_ == 0)
113 map_->Compact();
117 return iter_ == map_->data_.end();
135 while (iter_ != map_->data_.end() &&
136 map_->removed_ids_.find(iter_->first) !=
137 map_->removed_ids_.end()) {
142 IDMap<T>* map_; member in class:IDMap::Iterator
[all...] |
| /external/v8/test/cctest/ |
| test-hashmap.cc | 46 explicit IntSet(IntKeyHash hash) : hash_(hash), map_(DefaultMatchFun) {}
50 HashMap::Entry* p = map_.Lookup(reinterpret_cast<void*>(x), hash_(x), true);
58 map_.Remove(reinterpret_cast<void*>(x), hash_(x));
63 map_.Lookup(reinterpret_cast<void*>(x), hash_(x), false);
71 map_.Clear();
76 for (HashMap::Entry* p = map_.Start(); p != NULL; p = map_.Next(p)) {
79 CHECK_EQ(map_.occupancy(), static_cast<double>(count));
85 HashMap map_; member in class:IntSet
|
| /external/chromium/net/base/ |
| escape.cc | 50 map_[0] = b0; map_[1] = b1; map_[2] = b2; map_[3] = b3;
51 map_[4] = b4; map_[5] = b5; map_[6] = b6; map_[7] = b7;
55 return (map_[c >> 5] & (1 << (c & 31))) ? true : false;
59 uint32 map_[8] member in class:__anon2354::Charmap
[all...] |
| /external/protobuf/src/google/protobuf/ |
| dynamic_message.cc | 433 Map map_; member in struct:google::protobuf::DynamicMessageFactory::PrototypeMap
447 for (PrototypeMap::Map::iterator iter = prototypes_->map_.begin();
448 iter != prototypes_->map_.end(); ++iter) {
465 const DynamicMessage::TypeInfo** target = &prototypes_->map_[type];
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| map.h | 792 typename Map::iterator miter = map_.find(w1);
793 if (miter != map_.end()) {
797 map_.insert(pair<const SW, Label>(w1, l));
841 Map map_; member in struct:fst::GallicToNewSymbolsMapper
|
