Namespace eastl

Description

No description yet.

Namespaces

chrono
internal
Internal
meta
rel_ops

Classes

add_const
add_const_helper
add_const_helper< T, false >
add_cv
add_lvalue_reference
add_lvalue_reference< const void >
add_lvalue_reference< const volatile void >
add_lvalue_reference< T & >
add_lvalue_reference< void >
add_lvalue_reference< volatile void >
add_pointer
add_reference
add_reference_impl
add_reference_impl< T & >
add_reference_impl< void >
add_rvalue_reference
add_rvalue_reference< const void >
add_rvalue_reference< const volatile void >
add_rvalue_reference< T & >
add_rvalue_reference< void >
add_rvalue_reference< volatile void >
add_signedadd_signed
add_unsignedadd_unsigned
add_volatile
add_volatile_helper
add_volatile_helper< T, false >
AdditionOverFlow
advance_bi_impl
advance_bi_impl< true >
aligned_buffer
aligned_buffer< size, 1024 >
aligned_buffer< size, 128 >
aligned_buffer< size, 16 >
aligned_buffer< size, 2 >
aligned_buffer< size, 2048 >
aligned_buffer< size, 256 >
aligned_buffer< size, 32 >
aligned_buffer< size, 4 >
aligned_buffer< size, 4096 >
aligned_buffer< size, 512 >
aligned_buffer< size, 64 >
aligned_buffer< size, 8 >
aligned_storage
aligned_unionTo consider: Expand this to include more possible types
alignment_of

Mentioned in

alignment_of_value
allocatorallocator
allocator_arg_tallocator_arg_t
allocator_mallocallocator_malloc
any20.7.3, class any
apply_cvapply_cv
apply_cv< T &, U, false, false >
apply_cv< T &, U, false, true >
apply_cv< T &, U, true, false >
apply_cv< T &, U, true, true >
apply_cv< T, U, false, true >
apply_cv< T, U, true, false >
apply_cv< T, U, true, true >
argument_sinkargument_sink
arrayarray
atomic
atomic< T * >
atomic< T, eastl::enable_if_t< eastl::is_integral_v< T > &&!eastl::is_same_v< bool, T > > >
atomic_flag
back_insert_iteratorback_insert_iterator
basic_stringbasic_string
bidirectional_iterator_tag

Mentioned in

binary_composebinary_compose
binary_function

Mentioned in

binary_negatebinary_negate
binder1stbind
binder2ndbind2nd
bitsetbitset
BitsetBaseBitsetBase
BitsetBase< 1, WordType >BitsetBase<1, WordType>
BitsetBase< 2, WordType >BitsetBase<2, WordType>
bitvectorbitvector
bitvector_const_iterator
bitvector_iterator
bitvector_reference
call_traits

Mentioned in

call_traits< const T[N]>
call_traits< T & >
call_traits< T[N]>
can_construct_scalar_helper
common_type
common_type< chrono::duration< Rep1, Period1 >, chrono::duration< Rep2, Period2 > >duration common_type specialization
common_type< chrono::time_point< Clock, Duration1 >, chrono::time_point< Clock, Duration2 > >time_point common_type specialization
common_type< T >
common_type< T, U >
common_type< T, U, V... >
compressed_pair
compressed_pair< T, T >Partial specialisation for case where T1 == T2:
compressed_pair_imp
compressed_pair_imp< T1, T2, 0 >Derive from neither.
compressed_pair_imp< T1, T2, 1 >Derive from T1.
compressed_pair_imp< T1, T2, 2 >Derive from T2.
compressed_pair_imp< T1, T2, 3 >Derive from T1 and T2.
compressed_pair_imp< T1, T2, 4 >T1 == T2, T1 and T2 are both empty Note does not actually store an instance of T2 at all; but reuses T1 base class for both first() and second().
compressed_pair_imp< T1, T2, 5 >T1 == T2 and are not empty.
compressed_pair_switch
compressed_pair_switch< T1, T2, false, false, false >
compressed_pair_switch< T1, T2, false, false, true >
compressed_pair_switch< T1, T2, false, true, false >
compressed_pair_switch< T1, T2, false, true, true >
compressed_pair_switch< T1, T2, true, false, false >
compressed_pair_switch< T1, T2, true, true, true >
conditionalconditional
conditional< false, T, F >
conjunctionconjunction
conjunction< B >
conjunction< B, Bn... >
const_mem_fun1_ref_tconst_mem_fun1_ref_t
const_mem_fun1_tconst_mem_fun1_t
const_mem_fun_ref_tconst_mem_fun_ref_t
const_mem_fun_tconst_mem_fun_t
ContainerTemporaryContainerTemporary
ContainerTemporary< Container, true >
contiguous_iterator_tag
ct_imp
ct_imp2
ct_imp2< T, true >
ct_imp< T, isp, true >
ct_imp< T, true, b1 >
decay
default_deletedefault_delete
default_delete< T[]>
default_ranged_hashdefault_ranged_hash
dequedeque
DequeBaseDequeBase
DequeIteratorDequeIterator
derives_from_binary_function
derives_from_unary_functionderives_from_unary_function derives_from_binary_function
destructible_test_helper
disable_if
disable_if< false, T >
disjunctiondisjunction
disjunction< B >
disjunction< B, Bn... >
divides
divides< void >http://en.cppreference.com/w/cpp/utility/functional/divides_void
dummy_allocatordummy_allocator
enable_ifenable_if, disable_if
enable_if< true, T >
enable_shared_from_thisenable_shared_from_this
equal_to
equal_to< void >http://en.cppreference.com/w/cpp/utility/functional/equal_to_void
equal_to_2Dual type functions.
equal_to_2< T, T >
extent
extent_help
extent_help< T[], N >
extent_help< T[I], 0 >
extent_help< T[I], N >
fill_impfill
fill_imp< true >
fill_n_impfill_n
fill_n_imp< true >
finallyfinally
first_type_selectfirst_type_select
fixed_allocatorfixed_allocator
fixed_allocator_with_overflowfixed_allocator_with_overflow
fixed_function
fixed_function< SIZE_IN_BYTES, R(Args...)>fixed_function
fixed_hashtable_allocatorfixed_hashtable_allocator
fixed_hashtable_allocator< bucketCount, nodeSize, nodeCount, nodeAlignment, nodeAlignmentOffset, false, OverflowAllocator >This is a near copy of the code above, with the only difference being the 'false' bEnableOverflow template parameter, the pool_type and this_type typedefs, and the get_overflow_allocator / set_overflow_allocator functions.
fixed_listfixed_list
fixed_mapfixed_map
fixed_multimapfixed_multimap
fixed_multisetfixed_multiset
fixed_node_allocatorfixed_node_allocator
fixed_node_allocator< nodeSize, nodeCount, nodeAlignment, nodeAlignmentOffset, false, OverflowAllocator >This is a near copy of the code above, with the only difference being the 'false' bEnableOverflow template parameter, the pool_type and this_type typedefs, and the get_overflow_allocator / set_overflow_allocator functions.
fixed_poolfixed_pool
fixed_pool_basefixed_pool_base
fixed_pool_with_overflowfixed_pool_with_overflow
fixed_setfixed_set
fixed_slistfixed_slist
fixed_stringfixed_string
fixed_substringfixed_substring
fixed_swap_implfixed_swap
fixed_swap_impl< Container, false >
fixed_swap_impl< Container, true >
fixed_tuple_vectorExternal interface of fixed_tuple_vector.
fixed_vectorfixed_vector
fixed_vector_allocatorfixed_vector_allocator
fixed_vector_allocator< nodeSize, nodeCount, nodeAlignment, nodeAlignmentOffset, false, OverflowAllocator >
forward_iterator_tag
front_insert_iteratorfront_insert_iterator
function
function< R(Args...)>
generic_iteratorgeneric_iterator
greater

Mentioned in

greater< void >http://en.cppreference.com/w/cpp/utility/functional/greater_void
greater_equal
greater_equal< void >http://en.cppreference.com/w/cpp/utility/functional/greater_equal_void
has_allocator_type_helperuses_allocator
has_equalityhas_equality
has_equality< T, eastl::void_t< decltype(eastl::declval< T >()==eastl::declval< T >())> >
has_nothrow_assign

Mentioned in

has_nothrow_constructor

Mentioned in

has_nothrow_copy

Mentioned in

has_result_typehas_result_type
has_trivial_assign

Mentioned in

has_trivial_constructorWith current compilers, this is all we can do.
has_trivial_copy

Mentioned in

has_trivial_destructorWith current compilers, this is all we can do.
has_trivial_relocate

Mentioned in

has_unique_object_representations
has_virtual_destructor

Mentioned in

has_void_arghas_void_arg
has_void_arg< A0, Args... >
has_void_arg<>
hashhash<string>
hash< bool >
hash< char * >string hashes
hash< char >
hash< char16_t * >
hash< char32_t * >
hash< const char * >
hash< const char16_t * >
hash< const char32_t * >
hash< double >
hash< float >
hash< long double >
hash< shared_ptr< T > >hash specialization for shared_ptr
hash< signed char >
hash< signed int >
hash< signed long >
hash< signed long long >
hash< signed short >
hash< string >
hash< string16 >
hash< string32 >
hash< T * >
hash< unique_ptr< T, D > >hash specialization for unique_ptr
hash< unsigned char >
hash< unsigned int >
hash< unsigned long >
hash< unsigned long long >
hash< unsigned short >
hash< wchar_t >If wchar_t is a native type instead of simply a define to an existing type...
hash_code_basehash_code_base
hash_code_base< Key, Value, ExtractKey, Equal, H1, H2, default_ranged_hash, false >hash_code_base
hash_code_base< Key, Value, ExtractKey, Equal, H1, H2, default_ranged_hash, true >hash_code_base
hash_code_base< Key, Value, ExtractKey, Equal, H1, H2, H, false >hash_code_base
hash_maphash_map
hash_multimaphash_multimap
hash_multisethash_multiset
hash_nodehash_node
hash_node< Value, false >
hash_sethash_set
hash_use_selfbucket_sort
hashtablehashtable
hashtable_iteratorhashtable_iterator
hashtable_iterator_basehashtable_iterator_base
identityidentity
in_place_tagin_place_tag
input_iterator_tagThe following declarations are taken directly from the C++ standard document
insert_iteratorinsert_iterator
insert_iterator< slist< T, Allocator > >insert_iterator
int_convertible
integral_constantintegral_constant
intrusive_hash_mapintrusive_hash_map
intrusive_hash_multimapintrusive_hash_multimap
intrusive_hash_multisetintrusive_hash_multiset
intrusive_hash_nodeintrusive_hash_node
intrusive_hash_node_key
intrusive_hash_setintrusive_hash_set
intrusive_hashtableintrusive_hashtable
intrusive_hashtable_iteratorintrusive_hashtable_iterator
intrusive_hashtable_iterator_baseintrusive_hashtable_iterator_base
intrusive_listintrusive_list
intrusive_list_baseintrusive_list_base
intrusive_list_iteratorintrusive_list_iterator
intrusive_list_nodeintrusive_list_node
intrusive_node_iteratorintrusive_node_iterator
intrusive_ptrintrusive_ptr
intrusive_sdlistintrusive_sdlist
intrusive_sdlist_baseintrusive_sdlist_base
intrusive_sdlist_nodeintrusive_sdlist_node
intrusive_slistintrusive_slist
intrusive_slist_baseintrusive_slist_base
intrusive_slist_nodeintrusive_slist_node
IntrusiveSDListIteratorIntrusiveSDListIterator
IntrusiveSListIteratorIntrusiveSListIterator
invoke_result
invoke_result_impl
invoke_result_impl< F, void_t< decltype(invoke_impl(eastl::declval< decay_t< F >>(), eastl::declval< Args >()...))>, Args... >
is_abstract

Mentioned in

is_abstract_helper
is_abstract_helper< T, true >
is_aggregateno compiler support so we always return false
is_aligned

Mentioned in

is_aligned_value
is_arithmetic

Mentioned in

is_array

Mentioned in

is_array< T[]>
is_array< T[N]>
is_array_of_known_boundsis_array_of_known_bounds
is_array_of_unknown_boundsis_array_of_unknown_bounds
is_assignable
is_assignable_helper
is_class

Mentioned in

is_compound

Mentioned in

is_const

Mentioned in

is_const< T & >
is_const_value
is_const_value< const T * >
is_const_value< const volatile T * >
is_constructibleis_constructible
is_constructible_helper_1
is_constructible_helper_1< true, T, Args... >Unilaterally dismiss void, abstract, unknown bound arrays, and function types as not constructible.
is_constructible_helper_2Except for scalars and references (handled below), check for constructibility via decltype.
is_constructible_helper_2< false, Array[N], Args... >Arrays with arguments are not constructible. e.g. the following is an invalid expression: int[3](37, 34, 12)
is_constructible_helper_2< false, Array[N]>Array types are constructible if constructed with no arguments and if their element type is default-constructible.
is_constructible_helper_2< true, T >
is_constructible_helper_2< true, T, Arg0 >
is_constructible_helper_2< true, T, Arg0, Args... >Scalars and references can be constructed only with 0 or 1 argument. e.g the following is an invalid expression: int(17, 23)
is_convertible

Mentioned in

is_convertible_helper
is_convertible_helper< From, To, false >
is_copy_assignable
is_copy_constructible
is_default_constructible
is_destructible
is_destructible_helper
is_destructible_helper< T, true >
is_empty

Mentioned in

is_empty_helperThe inheritance in empty_helper_t1 will not work with non-class types.
is_empty_helper2
is_empty_helper< T, true >
is_empty_helper_t1
is_empty_helper_t2
is_enum

Mentioned in

is_enum< void >
is_enum< void const >
is_enum< void const volatile >
is_enum< void volatile >
is_enum_helper
is_enum_helper2
is_enum_helper< true >
is_finalis_final
is_floating_point

Mentioned in

is_floating_point_helper
is_floating_point_helper< double >
is_floating_point_helper< float >
is_floating_point_helper< long double >
is_function

Mentioned in

is_function< ReturnValue(ArgPack...)>
is_function< ReturnValue(ArgPack...,...)>
is_fundamental

Mentioned in

is_generic_iteratoris_generic_iterator
is_generic_iterator< generic_iterator< Iterator, Container > >
is_hat_type
is_hat_type_helperis_hat_type
is_insert_iteratoris_insert_iterator
is_insert_iterator< eastl::insert_iterator< Iterator > >
is_integral

Mentioned in

is_integral_helper
is_integral_helper< bool >
is_integral_helper< char >
is_integral_helper< signed char >
is_integral_helper< signed int >
is_integral_helper< signed long >
is_integral_helper< signed long long >
is_integral_helper< signed short >
is_integral_helper< unsigned char >
is_integral_helper< unsigned int >
is_integral_helper< unsigned long >
is_integral_helper< unsigned long long >
is_integral_helper< unsigned short >
is_integral_helper< wchar_t >
is_invocable
is_invocable_impl
is_invocable_impl< F, void_t< typename eastl::invoke_result< F, Args... >::type >, Args... >
is_invocable_r
is_invocable_r_impl
is_invocable_r_impl< R, F, void_t< typename invoke_result< F, Args... >::type >, Args... >
is_iterator_wrapperis_iterator_wrapper
is_iterator_wrapper_helperunwrap_iterator
is_iterator_wrapper_helper< Iterator, true >
is_literal_typeIt's not clear if this trait can be fully implemented without explicit compiler support
is_lvalue_assignable
is_lvalue_reference
is_lvalue_reference< T & >
is_mem_fun_pointer_valueTo do: Revise this to support C++11 variadic templates when possible
is_mem_fun_pointer_value< R(T::*)() const >
is_mem_fun_pointer_value< R(T::*)() const volatile >
is_mem_fun_pointer_value< R(T::*)() volatile >
is_mem_fun_pointer_value< R(T::*)()>
is_mem_fun_pointer_value< R(T::*)(Arg0) const >
is_mem_fun_pointer_value< R(T::*)(Arg0) const volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0) volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0)>
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1) const >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1) const volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1) volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1)>
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2) const >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2) const volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2) volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2)>
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3) const >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3) const volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3) volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3)>
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4) const >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4) const volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4) volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4)>
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5) const >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5) const volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5) volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5)>
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5, Arg6) const >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5, Arg6) const volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5, Arg6) volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5, Arg6)>
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5, Arg6, Arg7) const >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5, Arg6, Arg7) const volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5, Arg6, Arg7) volatile >
is_mem_fun_pointer_value< R(T::*)(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5, Arg6, Arg7)>
is_member_function_pointer

Mentioned in

is_member_object_pointer

Mentioned in

is_member_pointer

Mentioned in

is_member_pointer< U T::* >
is_move_assignable
is_move_constructible
is_move_iteratoris_move_iterator
is_move_iterator< eastl::move_iterator< Iterator > >
is_nothrow_assignable
is_nothrow_assignable_helper
is_nothrow_assignable_helper< false, T, U >
is_nothrow_assignable_helper< true, T, U >
is_nothrow_constructible
is_nothrow_constructible< T[N]>
is_nothrow_constructible_helper
is_nothrow_constructible_helper< false, T, Args... >
is_nothrow_constructible_helper< true, T >
is_nothrow_constructible_helper< true, T, Arg >
is_nothrow_constructible_helper< true, T, Args... >
is_nothrow_constructible_helper_noexcept_wrapper*_noexcept_wrapper implements a workaround for VS2015 preview
is_nothrow_copy_assignable
is_nothrow_copy_constructible
is_nothrow_default_constructible
is_nothrow_destructible
is_nothrow_destructible< T & >
is_nothrow_destructible< T && >
is_nothrow_destructible< T[N]>
is_nothrow_destructible_helper
is_nothrow_destructible_helper< T, false >
is_nothrow_destructible_helper< T, true >
is_nothrow_destructible_helper_noexcept_wrapper*_noexcept_wrapper implements a workaround for VS2015
is_nothrow_move_assignable
is_nothrow_move_constructible
is_nothrow_swappable
is_nothrow_swappable_helper
is_nothrow_swappable_helper< T, false >
is_nothrow_swappable_helper_noexcept_wrapper
is_nothrow_swappable_with
is_nothrow_swappable_with_helper
is_nothrow_swappable_with_helper< T, U, true >
is_null_pointer
is_object

Mentioned in

is_POD
is_pod

Mentioned in

is_pod< T[N]>
is_pointer

Mentioned in

is_pointer_helper
is_pointer_helper< T * >
is_pointer_helper< T *const >
is_pointer_helper< T *const volatile >
is_pointer_helper< T *volatile >
is_pointer_value
is_polymorphic

Mentioned in

is_polymorphic_imp1
is_polymorphic_imp2
is_polymorphic_selector
is_polymorphic_selector< true >
is_polymorphic_value
is_reference

Mentioned in

is_reference< T & >
is_reference_wrapper
is_reference_wrapper_helperreference_wrapper-specific type traits
is_reference_wrapper_helper< eastl::reference_wrapper< T > >
is_reverse_iteratoris_reverse_iterator
is_reverse_iterator< eastl::reverse_iterator< Iterator > >
is_rvalue_reference
is_rvalue_reference< T && >
is_same

Mentioned in

is_same< T, T >
is_scalar

Mentioned in

is_scalar< T * >
is_scalar< T *const >
is_scalar< T *const volatile >
is_scalar< T *volatile >
is_signed

Mentioned in

is_signed_helper
is_signed_helper< char >
is_signed_helper< double >
is_signed_helper< float >
is_signed_helper< long double >
is_signed_helper< signed char >
is_signed_helper< signed int >
is_signed_helper< signed long >
is_signed_helper< signed long long >
is_signed_helper< signed short >
is_standard_layout
is_swappable
is_swappable_with
is_swappable_with_helperis_swappable_with
is_swappable_with_helper< T, U, true >
is_trivialAll other compilers seem to be able to handle aligned types passed as value.
is_trivially_assignable
is_trivially_assignable< T &, const T & >
is_trivially_assignable< T &, T & >
is_trivially_assignable< T &, T && >
is_trivially_assignable< T &, T >
is_trivially_constructible
is_trivially_constructible< T >
is_trivially_constructible< T, const T & >
is_trivially_constructible< T, const volatile T & >
is_trivially_constructible< T, T & >
is_trivially_constructible< T, T && >
is_trivially_constructible< T, T >It's questionable whether we can use has_trivial_copy here, as it could theoretically create a false-positive.
is_trivially_constructible< T, volatile T & >
is_trivially_copy_assignable
is_trivially_copy_constructible
is_trivially_copyable
is_trivially_default_constructible
is_trivially_destructible
is_trivially_destructible_helper
is_trivially_move_assignable
is_trivially_move_constructible
is_union

Mentioned in

is_unsigned

Mentioned in

is_unsigned_helper
is_unsigned_helper< char >
is_unsigned_helper< unsigned char >
is_unsigned_helper< unsigned int >
is_unsigned_helper< unsigned long >
is_unsigned_helper< unsigned long long >
is_unsigned_helper< unsigned short >
is_void

Mentioned in

is_void< void >
is_void< void const >
is_void< void const volatile >
is_void< void volatile >
is_volatile

Mentioned in

is_volatile< T & >
is_volatile_value
is_volatile_value< const volatile T * >
is_volatile_value< volatile T * >
iter_swap_impliter_swap helper functions
iter_swap_impl< true >
iteratorstruct iterator
iterator_traitsstruct iterator_traits
iterator_traits< const T * >
iterator_traits< T * >
late_constructedlate_constructed
late_constructed< T, false, autoDestruct >Specialization that doesn't auto-construct on demand.
lessless<T>
less< void >http://en.cppreference.com/w/cpp/utility/functional/less_void
less_2
less_2< T, T >
less_equal
less_equal< void >http://en.cppreference.com/w/cpp/utility/functional/less_equal_void
linked_arrayclass linked_array
linked_ptrlinked_ptr
linked_ptr_baselinked_ptr_base
listlist
list_maplist_map
list_map_datalist_map_data
list_map_data_baselist_map_data_base
list_map_iteratorlist_map_iterator
ListBaseListBase
ListIterator
ListNodeBaseListNodeBase
logical_and
logical_and< void >http://en.cppreference.com/w/cpp/utility/functional/logical_and_void
logical_not
logical_not< void >http://en.cppreference.com/w/cpp/utility/functional/logical_not_void
logical_or
logical_or< void >http://en.cppreference.com/w/cpp/utility/functional/logical_or_void
lru_cachelru_cache
make_signed
make_signed< const unsigned char >
make_signed< const unsigned int >
make_signed< const unsigned long >
make_signed< const unsigned long long >
make_signed< const unsigned short >
make_signed< unsigned char >
make_signed< unsigned int >
make_signed< unsigned long >
make_signed< unsigned long long >
make_signed< unsigned short >
make_unsigned
make_unsigned< const signed char >
make_unsigned< const signed int >
make_unsigned< const signed long >
make_unsigned< const signed long long >
make_unsigned< const signed short >
make_unsigned< signed char >
make_unsigned< signed int >
make_unsigned< signed long >
make_unsigned< signed long long >
make_unsigned< signed short >
mapmap
map_value_comparemap_value_compare
maybe_derive_from_binary_function
maybe_derive_from_binary_function< T, false >
maybe_derive_from_unary_functionmaybe_derives_from_unary_function maybe_derives_from_binary_function
maybe_derive_from_unary_function< T, false >
mem_fn_impl3 or more arguments
mem_fun1_ref_tmem_fun1_ref_t
mem_fun1_tmem_fun1_t
mem_fun_ref_tmem_fun_ref mem_fun1_ref mem_fun_ref_t
mem_fun_tmem_fun mem_fun1
MergeSortermerge_sort_buffer
minus
minus< void >http://en.cppreference.com/w/cpp/utility/functional/minus_void
mod_range_hashingmod_range_hashing
modulus
modulus< void >http://en.cppreference.com/w/cpp/utility/functional/modulus_void
move_and_copy_backward_helperImplementation moving copying both trivial and non-trivial data via a lesser iterator than random-access.
move_and_copy_backward_helper< BidirectionalIterator1Category, true, false >Specialization for moving non-trivial data via a lesser iterator than random-access.
move_and_copy_backward_helper< EASTL_ITC_NS::random_access_iterator_tag, false, false >Specialization for copying non-trivial data via a random-access iterator
move_and_copy_backward_helper< EASTL_ITC_NS::random_access_iterator_tag, isMove, true >Specialization for when we can use memmove/memcpy. See the notes above for what conditions allow this.
move_and_copy_backward_helper< EASTL_ITC_NS::random_access_iterator_tag, true, false >Specialization for moving non-trivial data via a random-access iterator. It's theoretically faster because the compiler can see the count when its a compile-time const.
move_and_copy_helperImplementation moving copying both trivial and non-trivial data via a lesser iterator than random-access.
move_and_copy_helper< EASTL_ITC_NS::random_access_iterator_tag, false, false >Specialization for copying non-trivial data via a random-access iterator
move_and_copy_helper< EASTL_ITC_NS::random_access_iterator_tag, isMove, true >Specialization for when we can use memmove/memcpy. See the notes above for what conditions allow this.
move_and_copy_helper< EASTL_ITC_NS::random_access_iterator_tag, true, false >Specialization for moving non-trivial data via a random-access iterator. It's theoretically faster because the compiler can see the count when its a compile-time const.
move_and_copy_helper< InputIteratorCategory, true, false >Specialization for moving non-trivial data via a lesser iterator than random-access.
move_iteratorunwrap_reverse_iterator
multimapmultimap
multimap_value_comparemultimap_value_compare
multiplies
multiplies< void >http://en.cppreference.com/w/cpp/utility/functional/multiplies_void
MultiplyOverFlow
multisetmultiset
negate
negate< void >http://en.cppreference.com/w/cpp/utility/functional/negate_void
negationnegation
no_type
node_iteratornode_iterator
node_iterator_basenode_iterator_base
not_equal_to
not_equal_to< void >http://en.cppreference.com/w/cpp/utility/functional/not_equal_to_void
not_equal_to_2

Mentioned in

not_equal_to_2< T, T >
not_fn_retnot_fn_ret not_fn_ret is a implementation specified return type of eastl::not_fn
output_iterator_tag
owner_lessowner_less
owner_less< shared_ptr< T > >
owner_less< weak_ptr< T > >
pairpair
pair_first_construct_tpair_first_construct
piecewise_construct_tpiecewise_construct_t
plusPrimary C++ functions.
plus< void >http://en.cppreference.com/w/cpp/utility/functional/plus_void
pointer_to_binary_functionpointer_to_binary_function
pointer_to_unary_function