SYMBOL INDEX (211 symbols across 7 files)

FILE: include/tsl/ordered_hash.h
  function namespace (line 86) | namespace tsl {
  function iterator (line 579) | iterator begin() noexcept { return iterator(m_values.begin()); }
  function const_iterator (line 581) | const_iterator begin() const noexcept { return cbegin(); }
  function iterator (line 587) | iterator end() noexcept { return iterator(m_values.end()); }
  function const_iterator (line 589) | const_iterator end() const noexcept { return cend(); }
  function reverse_iterator (line 595) | reverse_iterator rbegin() noexcept {
  function const_reverse_iterator (line 599) | const_reverse_iterator rbegin() const noexcept { return rcbegin(); }
  function reverse_iterator (line 605) | reverse_iterator rend() noexcept {
  function const_reverse_iterator (line 609) | const_reverse_iterator rend() const noexcept { return rcend(); }
  function size_type (line 622) | size_type max_size() const noexcept {
  function iterator (line 726) | iterator erase(iterator pos) { return erase(const_iterator(pos)); }
  function iterator (line 728) | iterator erase(const_iterator pos) {
  function iterator (line 745) | iterator erase(const_iterator first, const_iterator last) {
  function hash (line 798) | size_t hash) {
  function swap (line 802) | void swap(ordered_hash& other) {
  function typename (line 834) | typename U::value_type& at(const K& key) const {
  function typename (line 840) | typename U::value_type& at(const K& key, std::size_t hash) const {
  function max_load_factor (line 948) | void max_load_factor(float ml) {
  function rehash (line 956) | void rehash(size_type count) {
  function reserve (line 962) | void reserve(size_type count) {
  function iterator (line 979) | iterator mutable_iterator(const_iterator pos) {
  function iterator (line 983) | iterator nth(size_type index) {
  function const_iterator (line 988) | const_iterator nth(size_type index) const {
  function values_container_type (line 1003) | const values_container_type& values_container() const noexcept {
  function pop_back (line 1052) | void pop_back() {
  function iterator (line 1061) | iterator unordered_erase(iterator pos) {
  function iterator (line 1065) | iterator unordered_erase(const_iterator pos) {
  function rehash_impl (line 1233) | void rehash_impl(size_type bucket_count) {
  function reserve_space_for_values (line 1295) | reserve_space_for_values(size_type /*count*/) {}
  function backward_shift (line 1301) | void backward_shift(std::size_t empty_ibucket) noexcept {
  function erase_value_from_bucket (line 1314) | void erase_value_from_bucket(
  function shift_indexes_in_buckets (line 1340) | void shift_indexes_in_buckets(index_type index_above_or_equal,
  function insert_index (line 1471) | void insert_index(std::size_t ibucket, std::size_t dist_from_ideal_bucket,
  function grow_on_high_load (line 1534) | bool grow_on_high_load() {
  function round_up_to_power_of_two (line 1628) | static std::size_t round_up_to_power_of_two(std::size_t value) {
  function is_power_of_two (line 1645) | static constexpr bool is_power_of_two(std::size_t value) {
  function bucket_entry (line 1669) | bucket_entry* static_empty_bucket_ptr() {

FILE: include/tsl/ordered_map.h
  function namespace (line 39) | namespace tsl {
  function iterator (line 208) | iterator begin() noexcept { return m_ht.begin(); }
  function iterator (line 212) | iterator end() noexcept { return m_ht.end(); }
  function reverse_iterator (line 216) | reverse_iterator rbegin() noexcept { return m_ht.rbegin(); }
  function reverse_iterator (line 220) | reverse_iterator rend() noexcept { return m_ht.rend(); }
  function clear (line 234) | void clear() noexcept { m_ht.clear(); }
  function iterator (line 250) | iterator insert(const_iterator hint, const value_type& value) {
  function iterator (line 260) | iterator insert(const_iterator hint, value_type&& value) {
  function insert (line 268) | void insert(std::initializer_list<value_type> ilist) {
  function iterator (line 344) | iterator erase(iterator pos) { return m_ht.erase(pos); }
  function iterator (line 349) | iterator erase(const_iterator pos) { return m_ht.erase(pos); }
  function iterator (line 354) | iterator erase(const_iterator first, const_iterator last) {
  function size_type (line 361) | size_type erase(const key_type& key) { return m_ht.erase(key); }
  function size_type (line 370) | size_type erase(const key_type& key, std::size_t precalculated_hash) {
  function precalculated_hash (line 398) | size_t precalculated_hash) {
  function swap (line 416) | void swap(ordered_map& other) { other.m_ht.swap(m_ht); }
  function T (line 432) | const T& at(const Key& key) const { return m_ht.at(key); }
  function T (line 437) | const T& at(const Key& key, std::size_t precalculated_hash) const {
  function size_type (line 490) | size_type count(const Key& key) const { return m_ht.count(key); }
  function size_type (line 497) | size_type count(const Key& key, std::size_t precalculated_hash) const {
  function iterator (line 527) | iterator find(const Key& key) { return m_ht.find(key); }
  function iterator (line 534) | iterator find(const Key& key, std::size_t precalculated_hash) {
  function const_iterator (line 538) | const_iterator find(const Key& key) const { return m_ht.find(key); }
  function const_iterator (line 543) | const_iterator find(const Key& key, std::size_t precalculated_hash) const {
  function precalculated_hash (line 569) | size_t precalculated_hash) {
  function contains (line 597) | bool contains(const Key& key) const { return m_ht.contains(key); }
  function contains (line 604) | bool contains(const Key& key, std::size_t precalculated_hash) const {
  function max_load_factor (line 719) | void max_load_factor(float ml) { m_ht.max_load_factor(ml); }
  function rehash (line 721) | void rehash(size_type count) { m_ht.rehash(count); }
  function reserve (line 722) | void reserve(size_type count) { m_ht.reserve(count); }
  function iterator (line 737) | iterator mutable_iterator(const_iterator pos) {
  function iterator (line 747) | iterator nth(size_type index) { return m_ht.nth(index); }
  function const_iterator (line 752) | const_iterator nth(size_type index) const { return m_ht.nth(index); }
  function typename (line 773) | typename values_container_type::value_type* data() const noexcept {
  function values_container_type (line 791) | values_container_type release() { return m_ht.release(); }
  function shrink_to_fit (line 800) | void shrink_to_fit() { m_ht.shrink_to_fit(); }
  function pop_back (line 854) | void pop_back() { m_ht.pop_back(); }
  function iterator (line 863) | iterator unordered_erase(iterator pos) { return m_ht.unordered_erase(pos...
  function iterator (line 868) | iterator unordered_erase(const_iterator pos) {
  function size_type (line 875) | size_type unordered_erase(const key_type& key) {
  function size_type (line 886) | size_type unordered_erase(const key_type& key,
  function precalculated_hash (line 915) | size_t precalculated_hash) {

FILE: include/tsl/ordered_set.h
  function namespace (line 39) | namespace tsl {
  function iterator (line 187) | iterator begin() noexcept { return m_ht.begin(); }
  function iterator (line 191) | iterator end() noexcept { return m_ht.end(); }
  function reverse_iterator (line 195) | reverse_iterator rbegin() noexcept { return m_ht.rbegin(); }
  function reverse_iterator (line 199) | reverse_iterator rend() noexcept { return m_ht.rend(); }
  function clear (line 213) | void clear() noexcept { m_ht.clear(); }
  function iterator (line 222) | iterator insert(const_iterator hint, const value_type& value) {
  function iterator (line 226) | iterator insert(const_iterator hint, value_type&& value) {
  function insert (line 234) | void insert(std::initializer_list<value_type> ilist) {
  function iterator (line 269) | iterator erase(iterator pos) { return m_ht.erase(pos); }
  function iterator (line 274) | iterator erase(const_iterator pos) { return m_ht.erase(pos); }
  function iterator (line 279) | iterator erase(const_iterator first, const_iterator last) {
  function size_type (line 286) | size_type erase(const key_type& key) { return m_ht.erase(key); }
  function size_type (line 295) | size_type erase(const key_type& key, std::size_t precalculated_hash) {
  function precalculated_hash (line 323) | size_t precalculated_hash) {
  function swap (line 341) | void swap(ordered_set& other) { other.m_ht.swap(m_ht); }
  function size_type (line 346) | size_type count(const Key& key) const { return m_ht.count(key); }
  function size_type (line 353) | size_type count(const Key& key, std::size_t precalculated_hash) const {
  function iterator (line 383) | iterator find(const Key& key) { return m_ht.find(key); }
  function iterator (line 390) | iterator find(const Key& key, std::size_t precalculated_hash) {
  function const_iterator (line 394) | const_iterator find(const Key& key) const { return m_ht.find(key); }
  function const_iterator (line 399) | const_iterator find(const Key& key, std::size_t precalculated_hash) const {
  function precalculated_hash (line 425) | size_t precalculated_hash) {
  function contains (line 453) | bool contains(const Key& key) const { return m_ht.contains(key); }
  function contains (line 460) | bool contains(const Key& key, std::size_t precalculated_hash) const {
  function max_load_factor (line 575) | void max_load_factor(float ml) { m_ht.max_load_factor(ml); }
  function rehash (line 577) | void rehash(size_type count) { m_ht.rehash(count); }
  function reserve (line 578) | void reserve(size_type count) { m_ht.reserve(count); }
  function iterator (line 593) | iterator mutable_iterator(const_iterator pos) {
  function iterator (line 603) | iterator nth(size_type index) { return m_ht.nth(index); }
  function const_iterator (line 608) | const_iterator nth(size_type index) const { return m_ht.nth(index); }
  function typename (line 629) | typename values_container_type::value_type* data() const noexcept {
  function values_container_type (line 647) | values_container_type release() { return m_ht.release(); }
  function shrink_to_fit (line 656) | void shrink_to_fit() { m_ht.shrink_to_fit(); }
  function pop_back (line 689) | void pop_back() { m_ht.pop_back(); }
  function iterator (line 698) | iterator unordered_erase(iterator pos) { return m_ht.unordered_erase(pos...
  function iterator (line 703) | iterator unordered_erase(const_iterator pos) {
  function size_type (line 710) | size_type unordered_erase(const key_type& key) {
  function size_type (line 721) | size_type unordered_erase(const key_type& key,
  function precalculated_hash (line 750) | size_t precalculated_hash) {

FILE: tests/custom_allocator_tests.cpp
  class custom_allocator (line 39) | class custom_allocator {
    type rebind (line 51) | struct rebind {
    method custom_allocator (line 55) | custom_allocator() = default;
    method custom_allocator (line 56) | custom_allocator(const custom_allocator&) = default;
    method custom_allocator (line 59) | custom_allocator(const custom_allocator<U>&) {}
    method pointer (line 61) | pointer address(reference x) const noexcept { return &x; }
    method const_pointer (line 63) | const_pointer address(const_reference x) const noexcept { return &x; }
    method pointer (line 65) | pointer allocate(size_type n, const void* /*hint*/ = 0) {
    method deallocate (line 80) | void deallocate(T* p, size_type /*n*/) { std::free(p); }
    method size_type (line 82) | size_type max_size() const noexcept {
    method construct (line 87) | void construct(U* p, Args&&... args) {
    method destroy (line 92) | void destroy(U* p) {
  function BOOST_AUTO_TEST_CASE (line 122) | BOOST_AUTO_TEST_CASE(test_custom_allocator_1) {

FILE: tests/ordered_map_tests.cpp
  function BOOST_AUTO_TEST_CASE_TEMPLATE (line 57) | BOOST_AUTO_TEST_CASE_TEMPLATE(test_insert, HMap, test_types) {
  function BOOST_AUTO_TEST_CASE (line 114) | BOOST_AUTO_TEST_CASE(test_range_insert) {
  function BOOST_AUTO_TEST_CASE (line 143) | BOOST_AUTO_TEST_CASE(test_insert_with_hint) {
  function BOOST_AUTO_TEST_CASE (line 166) | BOOST_AUTO_TEST_CASE(test_insert_copy_constructible_only_values) {
  function BOOST_AUTO_TEST_CASE (line 183) | BOOST_AUTO_TEST_CASE(test_emplace_hint) {
  function BOOST_AUTO_TEST_CASE (line 223) | BOOST_AUTO_TEST_CASE(test_emplace) {
  function BOOST_AUTO_TEST_CASE (line 246) | BOOST_AUTO_TEST_CASE(test_try_emplace) {
  function BOOST_AUTO_TEST_CASE (line 262) | BOOST_AUTO_TEST_CASE(test_try_emplace_2) {
  function BOOST_AUTO_TEST_CASE (line 294) | BOOST_AUTO_TEST_CASE(test_try_emplace_hint) {
  function BOOST_AUTO_TEST_CASE (line 316) | BOOST_AUTO_TEST_CASE(test_insert_or_assign) {
  function BOOST_AUTO_TEST_CASE (line 332) | BOOST_AUTO_TEST_CASE(test_insert_or_assign_hint) {
  function BOOST_AUTO_TEST_CASE (line 354) | BOOST_AUTO_TEST_CASE(test_insert_at_position) {
  function BOOST_AUTO_TEST_CASE (line 433) | BOOST_AUTO_TEST_CASE(test_insert_at_position_high_collisions) {
  function BOOST_AUTO_TEST_CASE (line 450) | BOOST_AUTO_TEST_CASE(test_try_emplace_at_position) {
  function BOOST_AUTO_TEST_CASE (line 532) | BOOST_AUTO_TEST_CASE(test_range_erase_all) {
  function BOOST_AUTO_TEST_CASE (line 544) | BOOST_AUTO_TEST_CASE(test_range_erase) {
  function BOOST_AUTO_TEST_CASE_TEMPLATE (line 577) | BOOST_AUTO_TEST_CASE_TEMPLATE(test_erase_loop, HMap, test_types) {
  function BOOST_AUTO_TEST_CASE_TEMPLATE (line 600) | BOOST_AUTO_TEST_CASE_TEMPLATE(test_erase_loop_range, HMap, test_types) {
  function BOOST_AUTO_TEST_CASE_TEMPLATE (line 620) | BOOST_AUTO_TEST_CASE_TEMPLATE(test_insert_erase_insert, HMap, test_types) {
  function BOOST_AUTO_TEST_CASE (line 693) | BOOST_AUTO_TEST_CASE(test_range_erase_same_iterators) {
  function BOOST_AUTO_TEST_CASE (line 718) | BOOST_AUTO_TEST_CASE(test_erase_if) {
  function BOOST_AUTO_TEST_CASE (line 746) | BOOST_AUTO_TEST_CASE(test_unordered_erase) {
  function BOOST_AUTO_TEST_CASE (line 770) | BOOST_AUTO_TEST_CASE(test_rehash_empty) {
  function BOOST_AUTO_TEST_CASE (line 797) | BOOST_AUTO_TEST_CASE(test_compare) {
  function BOOST_AUTO_TEST_CASE (line 823) | BOOST_AUTO_TEST_CASE(test_clear) {
  function BOOST_AUTO_TEST_CASE (line 844) | BOOST_AUTO_TEST_CASE(test_reverse_iterator) {
  function BOOST_AUTO_TEST_CASE (line 861) | BOOST_AUTO_TEST_CASE(test_iterator_arithmetic) {
  function BOOST_AUTO_TEST_CASE (line 919) | BOOST_AUTO_TEST_CASE(test_iterator_compartors) {
  function BOOST_AUTO_TEST_CASE (line 951) | BOOST_AUTO_TEST_CASE(test_modify_value) {
  function BOOST_AUTO_TEST_CASE (line 976) | BOOST_AUTO_TEST_CASE(test_max_size) {
  function BOOST_AUTO_TEST_CASE (line 1010) | BOOST_AUTO_TEST_CASE(test_extreme_bucket_count_value_construction) {
  function BOOST_AUTO_TEST_CASE (line 1016) | BOOST_AUTO_TEST_CASE(test_range_construct) {
  function BOOST_AUTO_TEST_CASE (line 1026) | BOOST_AUTO_TEST_CASE(test_assign_operator) {
  function BOOST_AUTO_TEST_CASE (line 1043) | BOOST_AUTO_TEST_CASE(test_move_constructor) {
  function BOOST_AUTO_TEST_CASE (line 1066) | BOOST_AUTO_TEST_CASE(test_move_constructor_empty) {
  function BOOST_AUTO_TEST_CASE (line 1077) | BOOST_AUTO_TEST_CASE(test_move_operator) {
  function BOOST_AUTO_TEST_CASE (line 1101) | BOOST_AUTO_TEST_CASE(test_move_operator_empty) {
  function BOOST_AUTO_TEST_CASE (line 1113) | BOOST_AUTO_TEST_CASE(test_reassign_moved_object_move_constructor) {
  function BOOST_AUTO_TEST_CASE (line 1127) | BOOST_AUTO_TEST_CASE(test_reassign_moved_object_move_operator) {
  function BOOST_AUTO_TEST_CASE (line 1141) | BOOST_AUTO_TEST_CASE(test_use_after_move_constructor) {
  function BOOST_AUTO_TEST_CASE (line 1163) | BOOST_AUTO_TEST_CASE(test_use_after_move_operator) {
  function BOOST_AUTO_TEST_CASE (line 1186) | BOOST_AUTO_TEST_CASE(test_copy_constructor_and_operator) {
  function BOOST_AUTO_TEST_CASE (line 1204) | BOOST_AUTO_TEST_CASE(test_copy_constructor_empty) {
  function BOOST_AUTO_TEST_CASE (line 1215) | BOOST_AUTO_TEST_CASE(test_copy_operator_empty) {
  function BOOST_AUTO_TEST_CASE (line 1230) | BOOST_AUTO_TEST_CASE(test_at) {
  function BOOST_AUTO_TEST_CASE (line 1242) | BOOST_AUTO_TEST_CASE(test_contains) {
  function BOOST_AUTO_TEST_CASE (line 1253) | BOOST_AUTO_TEST_CASE(test_equal_range) {
  function BOOST_AUTO_TEST_CASE (line 1268) | BOOST_AUTO_TEST_CASE(test_release) {
  function BOOST_AUTO_TEST_CASE (line 1279) | BOOST_AUTO_TEST_CASE(test_data) {
  function BOOST_AUTO_TEST_CASE (line 1292) | BOOST_AUTO_TEST_CASE(test_access_operator) {
  function BOOST_AUTO_TEST_CASE (line 1306) | BOOST_AUTO_TEST_CASE(test_swap) {
  function BOOST_AUTO_TEST_CASE (line 1331) | BOOST_AUTO_TEST_CASE(test_swap_empty) {
  function BOOST_AUTO_TEST_CASE (line 1358) | BOOST_AUTO_TEST_CASE(test_serialize_deserialize_empty) {
  function BOOST_AUTO_TEST_CASE (line 1375) | BOOST_AUTO_TEST_CASE(test_serialize_deserialize) {
  function BOOST_AUTO_TEST_CASE (line 1404) | BOOST_AUTO_TEST_CASE(test_serialize_deserialize_with_different_hash) {
  function BOOST_AUTO_TEST_CASE (line 1439) | BOOST_AUTO_TEST_CASE(test_front_back) {
  function BOOST_AUTO_TEST_CASE (line 1455) | BOOST_AUTO_TEST_CASE(test_nth) {
  function BOOST_AUTO_TEST_CASE (line 1477) | BOOST_AUTO_TEST_CASE(test_key_equal) {
  function BOOST_AUTO_TEST_CASE (line 1516) | BOOST_AUTO_TEST_CASE(test_heterogeneous_lookups) {
  function BOOST_AUTO_TEST_CASE (line 1602) | BOOST_AUTO_TEST_CASE(test_empty_map) {
  function BOOST_AUTO_TEST_CASE (line 1638) | BOOST_AUTO_TEST_CASE(test_precalculated_hash) {

FILE: tests/ordered_set_tests.cpp
  function BOOST_AUTO_TEST_CASE_TEMPLATE (line 52) | BOOST_AUTO_TEST_CASE_TEMPLATE(test_insert, HSet, test_types) {
  function BOOST_AUTO_TEST_CASE (line 98) | BOOST_AUTO_TEST_CASE(test_compare) {
  function BOOST_AUTO_TEST_CASE (line 113) | BOOST_AUTO_TEST_CASE(test_insert_pointer) {
  function BOOST_AUTO_TEST_CASE (line 126) | BOOST_AUTO_TEST_CASE(test_erase_if) {
  function BOOST_AUTO_TEST_CASE (line 139) | BOOST_AUTO_TEST_CASE(test_serialize_deserialize) {

FILE: tests/utils.h
  function class (line 60) | class move_only_test {
  function class (line 99) | class copy_constructible_only_test {
  function namespace (line 132) | namespace std {
  function class (line 148) | class utils {
  function counter (line 209) | size_t counter) {
  function counter (line 219) | size_t counter) {
  function counter (line 225) | size_t counter) {
  function counter (line 235) | size_t counter) {
  function HMap (line 241) | HMap utils::get_filled_hash_map(std::size_t nb_elements) {
  function class (line 264) | class serializer {
  function serialize_impl (line 282) | void serialize_impl(const std::string& val) {
  function serialize_impl (line 288) | void serialize_impl(const move_only_test& val) {
  function class (line 302) | class deserializer {