UT_ARTMap.h File Reference

#include "UT_API.h"
#include "UT_Array.h"
#include "UT_Assert.h"
#include "UT_Debug.h"
#include "UT_Optional.h"
#include "UT_StringHolder.h"
#include "UT_UniquePtr.h"
#include "UT_WorkBuffer.h"
#include <SYS/SYS_Compiler.h>
#include <SYS/SYS_Platform.h>
#include <SYS/SYS_ProcessorDefines.h>
#include <cctype>
#include <variant>
#include "UT_ARTMapImpl.h"

Include dependency graph for UT_ARTMap.h:

Go to the source code of this file.

Classes
class	UT_ARTMap< T >
class	UT_ARTNode< T >
class	UT_ARTNodeDelete
class	UT_ARTNode< T >
class	UT_ARTIterator< T >
	Iterator for traversing the adaptive radix tree. More...
class	UT_ARTNode4< T >
	The smallest (also known as base node) node with 4 max children. More...
class	UT_ARTNode16< T >
	The middle sized node with 16 max children. More...
class	UT_ARTNode48< T >
	The second largest node size with 48 max children. More...
class	UT_ARTNode256< T >
	The largest node size in the art map. The 256 node has at most 256 children. More...
class	UT_ARTMap< T >
struct	std::tuple_size< UT_ARTIterator< T > >
struct	std::tuple_element< N, UT_ARTIterator< T > >

Namespaces
	std
	std::hash specialization for UT_IntrusivePtr<T>

Macros
#define	UT_VERIFY_ROOT   UT_ASSERT(myRoot && !myRoot->hasValue())

Typedefs
template<typename T >
using	UT_ARTNodePtr = UT_UniquePtr< T, UT_ARTNodeDelete >

Functions
template<std::size_t N, class T , std::enable_if_t< N==0, int > = 0>
auto	get (const UT_ARTIterator< T > &it) -> decltype(it.key())

Macro Definition Documentation

#define UT_VERIFY_ROOT   UT_ASSERT(myRoot && !myRoot->hasValue())

Definition at line 96 of file UT_ARTMap.h.

Typedef Documentation

template<typename T >

using UT_ARTNodePtr = UT_UniquePtr<T, UT_ARTNodeDelete>

Definition at line 114 of file UT_ARTMap.h.

Function Documentation

template<std::size_t N, class T , std::enable_if_t< N==0, int > = 0>

auto get

(

const UT_ARTIterator< T > &

it

)

-> decltype(it.key())

Definition at line 1173 of file UT_ARTMap.h.