Lines Matching defs:value_type

55 // types within Map or MapIterator, such as Map::value_type.
467 // This is the class for google::protobuf::Map's internal value_type. Instead of using
468 // std::pair as value_type, we use this class which provides us more control of
513 typedef MapPair<Key, T> value_type;
515 typedef value_type* pointer;
516 typedef const value_type* const_pointer;
517 typedef value_type& reference;
518 typedef const value_type& const_reference;
578 typedef U value_type;
579 typedef value_type* pointer;
580 typedef const value_type* const_pointer;
581 typedef value_type& reference;
582 typedef const value_type& const_reference;
596 return reinterpret_cast<pointer>(malloc(n * sizeof(value_type)));
599 Arena::CreateArray<uint8>(arena_, n * sizeof(value_type)));
628 void construct(pointer p, const_reference t) { new (p) value_type(t); }
630 void destroy(pointer p) { p->~value_type(); }
661 // InnerMap's key type is Key and its value type is value_type*. We use a
667 KeyValuePair(const Key& k, value_type* v) : k_(k), v_(v) {}
671 value_type* const value() const { return v_; }
672 value_type*& value() { return v_; }
676 value_type* v_;
712 typedef value_type* Value;
1348 typedef hash_map<Key, value_type*, hash<Key>, equal_to<Key>,
1379 public std::iterator<std::forward_iterator_tag, value_type, ptrdiff_t,
1380 const value_type*, const value_type&> {
1425 public std::iterator<std::forward_iterator_tag, value_type> {
1502 value_type** value =
1557 std::pair<iterator, bool> insert(const value_type& value) {
1564 iterator(deprecated_elements_->insert(std::pair<Key, value_type*>(
1634 value_type* CreateValueTypeInternal(const Key& key) {
1636 return new value_type(key);
1638 value_type* value = reinterpret_cast<value_type*>(
1639 Arena::CreateArray<uint8>(arena_, sizeof(value_type)));
1647 value_type* CreateValueTypeInternal(const value_type& value) {
1649 return new value_type(value);
1651 value_type* p = reinterpret_cast<value_type*>(
1652 Arena::CreateArray<uint8>(arena_, sizeof(value_type)));