Lines Matching defs:std
51 fifo_map_compare(std::unordered_map<Key, std::size_t>* k) : keys(k) {}
91 std::unordered_map<Key, std::size_t>* keys = nullptr;
101 class Allocator = std::allocator<std::pair<const Key, T>>
107 using value_type = std::pair<const Key, T>;
108 using size_type = std::size_t;
109 using difference_type = std::ptrdiff_t;
114 using pointer = typename std::allocator_traits<Allocator>::pointer;
115 using const_pointer = typename std::allocator_traits<Allocator>::const_pointer;
117 using internal_map_type = std::map<Key, T, Compare, Allocator>;
143 fifo_map(std::initializer_list<value_type> init) : fifo_map()
295 std::pair<iterator, bool> insert(const value_type& value)
303 std::pair<iterator, bool> insert( P&& value )
336 void insert(std::initializer_list<value_type> ilist)
348 std::pair<iterator, bool> emplace(Args&& ... args)
350 typename fifo_map::value_type value(std::forward<Args>(args)...);
352 return m_map.emplace(std::move(value));
359 typename fifo_map::value_type value(std::forward<Args>(args)...);
361 return m_map.emplace_hint(hint, std::move(value));
398 std::swap(m_map, other.m_map);
399 std::swap(m_compare, other.m_compare);
400 std::swap(m_keys, other.m_keys);
427 std::pair<iterator, iterator> equal_range(const Key& key)
433 std::pair<const_iterator, const_iterator> equal_range(const Key& key) const
510 std::unordered_map<Key, std::size_t> m_keys;
519 // specialization of std::swap
520 namespace std // NOLINT(cert-dcl58-cpp,-warnings-as-errors)
528 } // namespace std