Map.hpp File Reference

#include "axom/config.hpp"
#include "axom/core/Macros.hpp"
#include "axom/core/memory_management.hpp"
#include "axom/core/execution/execution_space.hpp"
#include "axom/core/Types.hpp"
#include <functional>
#include <iostream>

Classes
class	axom::experimental::axom_map::Node< Key, T >
	Node is the foundational data type of the Map, being the lowest-level data storage unit, with the key and value data for a given item, along with a next value for the linked list. More...
class	axom::experimental::axom_map::Pair< Key, T >
	Pair is strictly for returning from insert, to match the pair-returning setup of STL unordered_map. More...
class	axom::experimental::axom_map::Bucket< Key, T >
	Bucket is the implementation of a bucket for this Map with chaining. It's a singly-linked list, and supports search, insertion, and removal. More...
class	axom::experimental::Map< Key, T, Hash, Policy >
	Provides a hashmap implementation, relying upon chaining to resolve hash collisions. Simple hashmap for now, future work will use RAJA and Umpire to allow use of map within kernels. Resembles unordered_map, which we can't use due to a lack of host-device decoration. More...

Namespaces
	axom
	axom::experimental
	axom::experimental::axom_map