|
add_const< T >
|
Add_const
|
|
add_cv< T >
|
Add_cv
|
|
add_pointer< T >
|
Add_pointer
|
|
add_reference< T >
|
Add_reference
|
|
add_volatile< T >
|
Add_volatile
|
|
aligned_storage< LENGTH, ALIGNMENT >
|
Aligned storage LENGTH should be determined in terms of sizeof()
|
|
aligned_storage_as< LENGTH, T >
|
Aligned storage as
|
|
alignment_of< T >
|
Alignment templates
|
|
alignment_of< void >
|
Specialisation of 'alignment_of' for 'void'
|
|
array< T, SIZE_ >
|
A replacement for std::array if you haven't got C++0x11
|
|
array_exception
|
The base class for array exceptions
|
|
array_out_of_range
|
The out of range exceptions
|
|
array_view< T >
|
Array view
|
|
array_view_bounds
|
The exception thrown when the index is out of bounds
|
|
array_view_exception
|
The base class for
array_view
exceptions
|
|
array_view_uninitialised
|
The exception thrown when the view is uninitialised
|
|
array_wrapper< T, SIZE_, ARRAY_ >
|
Array wrapper
|
|
array_wrapper_bounds
|
The exception thrown when the index is out of bounds
|
|
array_wrapper_exception
|
The base class for
array_wrapper
exceptions
|
|
basic_string_view< T, TTraits >
|
String view
|
|
bidirectional_link< ID_ >
|
A bidirectional link
|
|
bit< POSITION >
|
Gets the value of the bit at POSITION Starts from LSB
|
|
ibitset::bit_reference
|
The reference type returned
|
|
bitset< MAXN >
|
The class emulates an array of bool elements, but optimized for space allocation
|
|
bitset_exception
|
Exception base for bitset
|
|
bitset_nullptr
|
Bitset nullptr exception
|
|
bloom_filter< DESIRED_WIDTH, THash1, THash2, THash3 >
|
An implementation of a bloom filter
|
|
bsd_checksum< T >
|
BSD Checksum
|
|
callback< TParameter, ID >
|
A callback class designed to be multiply inherited by other client classes
|
|
callback_timer< MAX_TIMERS_ >
|
The callback timer
|
|
callback_timer_data
|
The configuration of a timer
|
|
char_traits< T >
|
Character traits for any character type
|
|
checksum< T >
|
Standard Checksum
|
|
checksum_policy_bsd< T >
|
BSD checksum policy
|
|
checksum_policy_sum< T >
|
Standard addition checksum policy
|
|
checksum_policy_xor< T >
|
Standard XOR checksum policy
|
|
checksum_policy_xor_rotate< T >
|
XOR-rotate checksum policy
|
|
compare< T, TLess >
|
Defines <=, >, >= interms of < Default
|
|
conditional< B, T, F >
|
Conditional
|
|
const_array_view< T >
|
Constant array view
|
|
ilist< T >::const_iterator
|
Const_iterator
|
|
iforward_list< T >::const_iterator
|
Const_iterator
|
|
imap< TKey, TMapped, TKeyCompare >::const_iterator
|
Const_iterator
|
|
imultimap< TKey, TMapped, TKeyCompare >::const_iterator
|
Const_iterator
|
|
imultiset< T, TCompare >::const_iterator
|
Const_iterator
|
|
ideque< T >::const_iterator
|
Const Iterator
|
|
intrusive_forward_list< TValue, TLink >::const_iterator
|
Const_iterator
|
|
intrusive_list< TValue, TLink >::const_iterator
|
Const_iterator
|
|
iset< T, TCompare >::const_iterator
|
Const_iterator
|
|
crc16
|
CRC16
|
|
crc16_ccitt
|
CRC16 CCITT
|
|
crc16_kermit
|
CRC16 Kermit
|
|
crc32
|
CRC32
|
|
crc64_ecma
|
CRC64 ECMA
|
|
crc8_ccitt
|
CRC8 CCITT
|
|
crc_policy_16
|
CRC16 policy
|
|
crc_policy_16_ccitt
|
CRC16 CCITT policy
|
|
crc_policy_16_kermit
|
CRC16 Kermit policy
|
|
crc_policy_32
|
CRC32 policy
|
|
crc_policy_64_ecma
|
CRC64 policy
|
|
crc_policy_8_ccitt
|
CRC8 CCITT policy
|
|
create_copy< T >
|
Copy constructs a derived class to an address
|
|
cyclic_value< T, FIRST, LAST, typename >
|
Provides a value that cycles between two limits
|
|
cyclic_value< T, FIRST, LAST, typename etl::enable_if<(FIRST==0)&&(LAST==0)>::type >
|
Provides a value that cycles between two limits
|
|
imap< TKey, TMapped, TKeyCompare >::Data_Node
|
The data node element in the map
|
|
imultimap< TKey, TMapped, TKeyCompare >::Data_Node
|
The data node element in the multimap
|
|
imultiset< T, TCompare >::Data_Node
|
The data node element in the multiset
|
|
iset< T, TCompare >::Data_Node
|
The data node element in the set
|
|
iforward_list< T >::data_node_t
|
The data node element in the
forward_list
|
|
ilist< T >::data_node_t
|
The data node element in the list
|
|
debounce< VALID_COUNT, HOLD_COUNT, REPEAT_COUNT >
|
A class to debounce signals
|
|
debug_count
|
Used to count instances
|
|
decay< T >
|
Decay
|
|
deque< T, MAX_SIZE_ >
|
A fixed capacity double ended queue
|
|
deque_base
|
The base class for all templated deque types
|
|
deque_empty
|
Deque empty exception
|
|
deque_exception
|
Exception base for deques
|
|
deque_full
|
Deque full exception
|
|
deque_incompatible_type
|
Deque incompatible type exception
|
|
deque_out_of_bounds
|
Deque out of bounds exception
|
|
ecl_timer_config
|
The configuration of a timer
|
|
enable_if< B, T >
|
Enable_if
|
|
endian
|
Constants to denote endianness of operations
|
|
endianness
|
Checks the endianness of the platform
|
|
error_handler
|
Error handler for when throwing exceptions is not required
|
|
exception
|
A low overhead exception base class
|
|
extent< T, MAXN >
|
Extent
|
|
factorial< N >
|
Defines
value
as the Nth factorial number
|
|
fibonacci< N >
|
Defines
value
as the Nth Fibbonacci number
|
|
fixed_iterator< TIterator >
|
A fixed iterator class
|
|
flat_map< TKey, TValue, MAX_SIZE_, TCompare >
|
A
flat_map
implementation that uses a fixed size buffer
|
|
flat_map_exception
|
Exception base for reference_flat_maps
|
|
flat_map_full
|
Vector full exception
|
|
flat_map_out_of_bounds
|
Vector out of bounds exception
|
|
flat_multimap< TKey, TValue, MAX_SIZE_, TCompare >
|
A
flat_multimap
implementation that uses a fixed size buffer
|
|
flat_multimap_exception
|
Exception base for reference_flat_multimaps
|
|
flat_multimap_full
|
Vector full exception
|
|
flat_multiset< T, MAX_SIZE_, TCompare >
|
A
flat_multiset
implementation that uses a fixed size buffer
|
|
flat_multiset_exception
|
Exception base for reference_flat_multisets
|
|
flat_multiset_full
|
Vector full exception
|
|
flat_multiset_iterator
|
Vector iterator exception
|
|
flat_set< T, MAX_SIZE_, TCompare >
|
A
flat_set
implementation that uses a fixed size buffer
|
|
flat_set_exception
|
Exception base for flat_sets
|
|
flat_set_full
|
Vector full exception
|
|
flat_set_iterator
|
Vector iterator exception
|
|
fnv_1_32
|
Calculates the
fnv_1_32
hash
|
|
fnv_1_64
|
Calculates the
fnv_1_64
hash
|
|
fnv_1_policy_32
|
Fnv_1 policy
|
|
fnv_1_policy_64
|
Fnv_1 policy
|
|
fnv_1a_32
|
Calculates the
fnv_1a_32
hash
|
|
fnv_1a_64
|
Calculates the
fnv_1a_64
hash
|
|
fnv_1a_policy_32
|
Fnv_1a policy
|
|
fnv_1a_policy_64
|
Fnv_1a policy
|
|
forward_link< ID_ >
|
A forward link
|
|
forward_list< T, MAX_SIZE_ >
|
A templated
forward_list
implementation that uses a fixed size pool
|
|
forward_list_base
|
The base class for all forward_lists
|
|
forward_list_empty
|
Empty exception for the
forward_list
|
|
forward_list_exception
|
Exception for the
forward_list
|
|
forward_list_full
|
Full exception for the
forward_list
|
|
forward_list_iterator
|
Iterator exception for the
forward_list
|
|
frame_check_sequence< TPolicy >
|
Calculates a frame check sequence according to the specified policy
|
|
error_handler::free_function
|
Callback class for free handler functions
|
|
fsm
|
The FSM class
|
|
fsm_exception
|
Base exception class for FSM
|
|
fsm_null_state_exception
|
Exception for null state pointer
|
|
fsm_state_id_exception
|
Exception for invalid state id
|
|
fsm_state_list_exception
|
Exception for incompatible state list
|
|
function< TObject, TParameter >
|
A derived function template that takes an object type and parameter type
|
|
function< TObject, void >
|
A derived function template that takes a parameter type
|
|
function< void, TParameter >
|
Specialisation for static or global functions that takes a parameter
|
|
function< void, void >
|
Specialisation static functions taking void parameter
|
|
function_fp< TParameter, Function >
|
A derived function template that takes a parameter type
|
|
function_fv< Function >
|
A derived function template that takes a parameter type
|
|
function_imp< TObject, TParameter, Instance, Function >
|
A derived function template that takes an object type and parameter type
|
|
function_imv< TObject, Instance, Function >
|
A derived function template that takes an object type and parameter type
|
|
function_mp< TObject, TParameter, Function >
|
A derived function template that takes an object type and parameter type
|
|
function_mv< TObject, Function >
|
A derived function template that takes an object type and parameter type
|
|
generic_pool< TYPE_SIZE_, ALIGNMENT_, SIZE_ >
|
A templated abstract pool implementation that uses a fixed size pool
|
|
hash< bool >
|
Specialisation for bool
|
|
hash< char >
|
Specialisation for char
|
|
hash< double >
|
Specialisation for double
|
|
hash< etl::array_view< T > >
|
Hash function
|
|
hash< etl::array_wrapper< T, SIZE, ARRAY > >
|
Hash function
|
|
hash< etl::istring >
|
Hash function
|
|
hash< etl::iu16string >
|
Hash function
|
|
hash< etl::iu32string >
|
Hash function
|
|
hash< etl::iwstring >
|
Hash function
|
|
hash< etl::string_view >
|
Hash function
|
|
hash< float >
|
Specialisation for float
|
|
hash< int >
|
Specialisation for int
|
|
hash< long >
|
Specialisation for long
|
|
hash< long double >
|
Specialisation for long double
|
|
hash< long long >
|
Specialisation for long long
|
|
hash< short >
|
Specialisation for short
|
|
hash< signed char >
|
Specialisation for signed char
|
|
hash< T * >
|
Specialisation for pointers
|
|
hash< unsigned char >
|
Specialisation for unsigned char
|
|
hash< unsigned int >
|
Specialisation for unsigned int
|
|
hash< unsigned long >
|
Specialisation for unsigned long
|
|
hash< unsigned long long >
|
Specialisation for unsigned long long
|
|
hash< unsigned short >
|
Specialisation for unsigned short
|
|
hash< wchar_t >
|
Specialisation for wchar_t
|
|
hash_exception
|
Exception base for hashes
|
|
hash_finalised
|
Hash finalised exception
|
|
ibasic_string< T >
|
The base class for specifically sized strings
|
|
ibitset
|
The base class for
etl::bitset
|
|
icallback_timer
|
Interface for callback timer
|
|
ideque< T >
|
The base class for all
etl::deque
classes
|
|
iflat_map< TKey, TMapped, TKeyCompare >
|
The base class for specifically sized flat_maps
|
|
iflat_multimap< TKey, TMapped, TKeyCompare >
|
The base class for specifically sized flat_multimaps
|
|
iflat_multiset< T, TKeyCompare >
|
The base class for specifically sized flat_multisets
|
|
iflat_set< T, TKeyCompare >
|
The base class for specifically sized flat_sets
|
|
iforward_list< T >
|
A templated base for all
etl::forward_list
types
|
|
ifsm_state
|
Interface class for FSM states
|
|
ifunction< TParameter >
|
The base interface template for function template specialisations
|
|
ifunction< void >
|
The base interface template for functions taking
void
parameters
|
|
ilist< T >
|
A templated base for all
etl::list
types
|
|
imap< TKey, TMapped, TKeyCompare >
|
A templated base for all
etl::map
types
|
|
imessage_bus
|
Interface for message bus
|
|
imessage_timer
|
Interface for message timer
|
|
imultimap< TKey, TMapped, TKeyCompare >
|
A templated base for all
etl::multimap
types
|
|
imultiset< T, TCompare >
|
A templated base for all
etl::multiset
types
|
|
instance_count< T >
|
Inherit from this to count instances of a type
|
|
integral_constant< T, VALUE >
|
Integral_constant
|
|
intrusive_forward_list< TValue, TLink >
|
An intrusive forward list
|
|
intrusive_forward_list_base< TLink >
|
Base for intrusive forward list
|
|
intrusive_forward_list_empty
|
Empty exception for the
intrusive_forward_list
|
|
intrusive_forward_list_exception
|
Exception for the
intrusive_forward_list
|
|
intrusive_forward_list_index_exception
|
Index exception for the
intrusive_forward_list
|
|
intrusive_forward_list_iterator_exception
|
Iterator exception for the
intrusive_forward_list
|
|
intrusive_forward_list_unsorted
|
Unsorted exception for the
intrusive_forward_list
|
|
intrusive_list< TValue, TLink >
|
An intrusive list
|
|
intrusive_list_base< TLink >
|
Base for intrusive list
|
|
intrusive_list_empty
|
Empty exception for the
intrusive_list
|
|
intrusive_list_exception
|
Exception for the
intrusive_list
|
|
intrusive_list_iterator_exception
|
Iterator exception for the
intrusive_list
|
|
intrusive_list_unsorted
|
Unsorted exception for the
intrusive_list
|
|
intrusive_queue< TValue, TLink >
|
An intrusive queue
|
|
intrusive_queue_base< TLink >
|
Base for intrusive queue
|
|
intrusive_queue_empty
|
Intrusive_queue empty exception
|
|
intrusive_queue_exception
|
Exception base for intrusive queue
|
|
intrusive_stack< TValue, TLink >
|
An intrusive stack
|
|
intrusive_stack_base< TLink >
|
Base for intrusive stack
|
|
intrusive_stack_empty
|
Intrusive_stack empty exception
|
|
intrusive_stack_exception
|
Exception base for intrusive stack
|
|
io_port_ro< T, ADDRESS >
|
Read only port
|
|
io_port_ro< T, 0 >
|
Read only port
|
|
io_port_rw< T, ADDRESS >
|
Read write port
|
|
io_port_rw< T, 0 >
|
Read write port
|
|
io_port_wo< T, ADDRESS >
|
Write only port
|
|
io_port_wo< T, 0 >
|
Write only port
|
|
io_port_wos< T, ADDRESS >
|
Write only port with shadow register
|
|
io_port_wos< T, 0 >
|
Write only port with shadow register
|
|
ipriority_queue< T, TContainer, TCompare >
|
This is the base for all priority queues that contain a particular type
|
|
iqueue< T >
|
This is the base for all queues that contain a particular type
|
|
ireference_flat_map< TKey, TMapped, TKeyCompare >
|
The base class for specifically sized reference_flat_maps
|
|
ireference_flat_multimap< TKey, TMapped, TKeyCompare >
|
The base class for specifically sized reference_flat_multimaps
|
|
ireference_flat_multiset< T, TKeyCompare >
|
The base class for specifically sized reference_flat_multisets
|
|
ireference_flat_set< T, TKeyCompare >
|
The base class for specifically sized reference_flat_sets
|
|
is_arithmetic< T >
|
Is_arithmetic
|
|
is_array< T >
|
Is_array
|
|
is_base_of< TBase, TDerived, IsFundamental >
|
Is_base_of
|
|
is_compound< T >
|
Is_compound
|
|
is_const< T >
|
Is_const
|
|
is_floating_point< T >
|
Is_floating_point
|
|
is_fundamental< T >
|
Is_fundamental
|
|
is_integral< T >
|
Is_integral
|
|
ideque< T >::is_iterator< TIterator >
|
Test for an iterator
|
|
is_one_of< T, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17 >
|
Template to determine if a type is one of a specified list
|
|
is_pod< T >
|
Is_pod For C++03, only fundamental and pointers types are recognised
|
|
is_pointer< T >
|
Is_pointer
|
|
is_power_of_2< NV >
|
Checks if N is a power of 2
|
|
is_power_of_2< 0 >
|
Checks if N is a power of 2
|
|
is_power_of_2< 1 >
|
Checks if N is a power of 2
|
|
is_reference< T >
|
Is_reference
|
|
is_same< T1, T2 >
|
Is_same
|
|
is_signed< T >
|
Is_signed
|
|
is_trivially_constructible< T >
|
Is_trivially_constructible
|
|
is_trivially_copy_assignable< T >
|
Is_trivially_copy_assignable
|
|
is_trivially_copy_constructible< T >
|
Is_trivially_copy_constructible
|
|
is_trivially_destructible< T >
|
Is_trivially_destructible
|
|
is_unsigned< T >
|
Is_unsigned
|
|
is_void< T >
|
Is_void
|
|
is_volatile< T >
|
Is_volatile
|
|
ischeduler
|
Scheduler base
|
|
iset< T, TCompare >
|
A templated base for all
etl::set
types
|
|
istack< T >
|
This is the base for all stacks that contain a particular type
|
|
ilist< T >::iterator
|
Iterator
|
|
iforward_list< T >::iterator
|
Iterator
|
|
imap< TKey, TMapped, TKeyCompare >::iterator
|
Iterator
|
|
imultimap< TKey, TMapped, TKeyCompare >::iterator
|
Iterator
|
|
imultiset< T, TCompare >::iterator
|
Iterator
|
|
ideque< T >::iterator
|
Iterator
|
|
intrusive_list< TValue, TLink >::iterator
|
Iterator
|
|
iset< T, TCompare >::iterator
|
Iterator
|
|
intrusive_forward_list< TValue, TLink >::iterator
|
Iterator
|
|
iunordered_map< TKey, T, THash, TKeyEqual >
|
The base class for specifically sized
unordered_map
|
|
iunordered_multimap< TKey, T, THash, TKeyEqual >
|
The base class for specifically sized
unordered_multimap
|
|
iunordered_multiset< TKey, THash, TKeyEqual >
|
The base class for specifically sized
unordered_multiset
|
|
iunordered_set< TKey, THash, TKeyEqual >
|
The base class for specifically sized
unordered_set
|
|
ivector< T >
|
The base class for specifically sized vectors
|
|
ivector< T * >
|
The base class for specifically sized vectors
|
|
jenkins
|
Jenkins
|
|
jenkins_policy
|
Jenkins policy
|
|
imap< TKey, TMapped, TKeyCompare >::key_comp
|
How to compare two key elements
|
|
imultimap< TKey, TMapped, TKeyCompare >::key_comp
|
How to compare two key elements
|
|
imultiset< T, TCompare >::key_comp
|
How to compare two key elements
|
|
iset< T, TCompare >::key_comp
|
How to compare two key elements
|
|
larger_int_type< T >
|
Defines a type that is as larger or larger than the specified type
|
|
larger_uint_type< T >
|
Defines a type that is as larger or larger than the specified type
|
|
largest< T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16 >
|
Template to determine the largest type, size and alignment
|
|
largest_alignment< T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16 >
|
Template to determine the largest alignment
|
|
largest_type< T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16 >
|
Template to determine the largest type and size
|
|
link_exception
|
Link exception
|
|
list< T, MAX_SIZE_ >
|
A templated list implementation that uses a fixed size buffer
|
|
list
|
A specialised intrusive linked list for timer data
|
|
list
|
A specialised intrusive linked list for timer data
|
|
list_base
|
The base class for all lists
|
|
list_empty
|
Empty exception for the list
|
|
list_exception
|
Exception for the list
|
|
list_full
|
Full exception for the list
|
|
list_iterator
|
Iterator exception for the list
|
|
list_unsorted
|
Unsorted exception for the list
|
|
log< NV, BASE >
|
The base generic log template
|
|
log10< NV >
|
Calculates base 10 logs
|
|
log2< NV >
|
Calculates base 2 logs
|
|
make_signed< T >
|
Make_signed
|
|
make_unsigned< T >
|
Make_unsigned
|
|
map< TKey, TValue, MAX_SIZE_, TCompare >
|
A templated map implementation that uses a fixed size buffer
|
|
map_base
|
The base class for all maps
|
|
map_exception
|
Exception for the map
|
|
map_full
|
Full exception for the map
|
|
map_iterator
|
Iterator exception for the map
|
|
map_out_of_bounds
|
Map out of bounds exception
|
|
max_value_for_nbits< NBITS >
|
Maximum value that can be contained in N bits
|
|
max_value_for_nbits< 0 >
|
Specialisation for when NBITS == 0
|
|
error_handler::member_function< TObject >
|
Callback class for member handler functions
|
|
message_bus< MAX_ROUTERS_ >
|
The message bus
|
|
message_bus_exception
|
Base exception class for message bus
|
|
message_bus_too_many_subscribers
|
Too many subscribers
|
|
message_router_exception
|
Base exception class for message router
|
|
message_router_illegal_id
|
Router id is out of the legal range
|
|
message_timer< MAX_TIMERS_ >
|
The message timer
|
|
message_timer_data
|
The configuration of a timer
|
|
multimap< TKey, TValue, MAX_SIZE_, TCompare >
|
A templated multimap implementation that uses a fixed size buffer
|
|
multimap_base
|
The base class for all maps
|
|
multimap_exception
|
Exception for the map
|
|
multimap_full
|
Full exception for the map
|
|
multimap_iterator
|
Iterator exception for the map
|
|
multimap_out_of_bounds
|
Map out of bounds exception
|
|
multiset< T, MAX_SIZE_, TCompare >
|
A templated multiset implementation that uses a fixed size buffer
|
|
multiset_base
|
The base class for all sets
|
|
multiset_exception
|
Exception for the set
|
|
multiset_full
|
Full exception for the set
|
|
multiset_iterator
|
Iterator exception for the set
|
|
multiset_out_of_bounds
|
Map out of bounds exception
|
|
murmur3< THash >
|
Calculates the
murmur3
hash
|
|
no_type< ID >
|
Placeholder for unused template parameters
|
|
map_base::Node
|
The node element in the map
|
|
multimap_base::Node
|
The node element in the multimap
|
|
multiset_base::Node
|
The node element in the multiset
|
|
set_base::Node
|
The node element in the set
|
|
forward_list_base::node_t
|
The node element in the
forward_list
|
|
list_base::node_t
|
The node element in the list
|
|
not_unlinked_exception
|
Not unlinked exception
|
|
null_message_router
|
This router can be used either as a sink for messages or as a producer-only of messages such an interrupt routine
|
|
nullopt_t
|
A null option type
|
|
nullptr_t
|
A null pointer type
|
|
observable< TObserver, MAX_OBSERVERS >
|
The object that is being observed
|
|
observer< T1, T2, T3, T4, T5, T6, T7, T8 >
|
The observer interface for eight notification types
|
|
observer< T1 >
|
The observer interface for one notification type
|
|
observer< T1, T2 >
|
The observer interface for two notification types
|
|
observer< T1, T2, T3 >
|
The observer interface for three notification types
|
|
observer< T1, T2, T3, T4 >
|
The observer interface for four notification types
|
|
observer< T1, T2, T3, T4, T5 >
|
The observer interface for five notification types
|
|
observer< T1, T2, T3, T4, T5, T6 >
|
The observer interface for six notification types
|
|
observer< T1, T2, T3, T4, T5, T6, T7 >
|
The observer interface for seven notification types
|
|
observer_exception
|
The base class for observer exceptions
|
|
observer_list_full
|
The exception thrown when the observer list is full
|
|
optional< T >
|
An optional type
|
|
optional_exception
|
Exception for optional
|
|
optional_invalid
|
Invalid exception for optional
|
|
packet< TBase, SIZE, ALIGNMENT >
|
A template class that can store any types derived from TBase that conform to the size and alignment requirements
|
|
parameter_type< T >
|
Determine how to pass parameters
|
|
pearson< HASH_LENGTH >
|
Calculates a Pearson hash
|
|
pool< T, SIZE_ >
|
A templated pool implementation that uses a fixed size pool
|
|
pool_element_size
|
The exception thrown when an the type requested is larger than the element size
|
|
pool_exception
|
The base class for pool exceptions
|
|
pool_no_allocation
|
The exception thrown when the pool has no more free items
|
|
pool_object_not_in_pool
|
The exception thrown when an object is released which does not belong to the pool
|
|
power< NV, POWER >
|
Calculates powers
|
|
power< NV, 0 >
|
Calculates powers
|
|
power_of_2_round_down< NV >
|
Calculates the rounded down power of 2
|
|
power_of_2_round_down< 0 >
|
Calculates the rounded down power of 2
|
|
power_of_2_round_down< 1 >
|
Calculates the rounded down power of 2
|
|
power_of_2_round_down< 2 >
|
Calculates the rounded down power of 2
|
|
power_of_2_round_up< NV >
|
Calculates the rounded up power of 2
|
|
power_of_2_round_up< 0 >
|
Calculates the rounded up power of 2
|
|
priority_queue< T, SIZE, TContainer, TCompare >
|
A fixed capacity priority queue
|
|
priority_queue_exception
|
The base class for
priority_queue
exceptions
|
|
priority_queue_full
|
The exception thrown when the queue is full
|
|
priority_queue_iterator
|
The priority queue iterator exception on reversed iterators
|
|
pvoidvector
|
The base class for void* vectors
|
|
queue< T, SIZE >
|
A fixed capacity queue
|
|
queue_base
|
The base class for all queues
|
|
queue_empty
|
The exception thrown when the queue is empty
|
|
queue_exception
|
The base class for queue exceptions
|
|
queue_full
|
The exception thrown when the queue is full
|
|
random
|
The base for all 32 bit random number generators
|
|
random_clcg
|
A 32 bit random number generator
|
|
random_lcg
|
A 32 bit random number generator
|
|
random_lsfr
|
A 32 bit random number generator
|
|
random_mwc
|
A 32 bit random number generator
|
|
random_xorshift
|
A 32 bit random number generator
|
|
rank< T >
|
Rank
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::reader_type< R1, R2, R3, R4, R5, R6, R7, R8 >
|
Base reader type functor class
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::reader_type< R1, no_type2, no_type3, no_type4, no_type5, no_type6, no_type7, no_type8 >
|
Define the reader type for 1 type
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::reader_type< R1, R2, no_type3, no_type4, no_type5, no_type6, no_type7, no_type8 >
|
Define the reader type for 2 types
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::reader_type< R1, R2, R3, no_type4, no_type5, no_type6, no_type7, no_type8 >
|
Define the reader type for 3 types
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::reader_type< R1, R2, R3, R4, no_type5, no_type6, no_type7, no_type8 >
|
Define the reader type for 4 types
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::reader_type< R1, R2, R3, R4, R5, no_type6, no_type7, no_type8 >
|
Define the reader type for 5 types
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::reader_type< R1, R2, R3, R4, R5, R6, no_type7, no_type8 >
|
Define the reader type for 6 types
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::reader_type< R1, R2, R3, R4, R5, R6, R7, no_type8 >
|
Define the reader type for 7 types
|
|
reference_flat_map< TKey, TValue, MAX_SIZE_, TCompare >
|
A
reference_flat_map
implementation that uses a fixed size buffer
|
|
reference_flat_multimap< TKey, TValue, MAX_SIZE_, TCompare >
|
A
reference_flat_multimap
implementation that uses a fixed size buffer
|
|
reference_flat_multiset< TKey, MAX_SIZE_, TKeyCompare >
|
An reference flat set
|
|
reference_flat_set< TKey, MAX_SIZE_, TKeyCompare >
|
An reference flat set
|
|
reference_wrapper< T >
|
A definition of
reference_wrapper
for those that don't have C++ 0x11 support
|
|
remove_all_extents< T >
|
Remove_all_extents
|
|
remove_const< T >
|
Remove_const
|
|
remove_cv< T >
|
Remove_cv
|
|
remove_extent< T >
|
Remove_extent
|
|
remove_pointer< T >
|
Remove_pointer
|
|
remove_reference< T >
|
Remove_reference
|
|
remove_volatile< T >
|
Remove_volatile
|
|
scheduler< TSchedulerPolicy, MAX_TASKS_ >
|
Scheduler
|
|
scheduler_exception
|
Base exception class for scheduler
|
|
scheduler_no_tasks_exception
|
'No tasks' exception
|
|
scheduler_null_task_exception
|
'Null tasks' exception
|
|
scheduler_policy_highest_priority
|
Highest Priority
|
|
scheduler_policy_most_work
|
Most Work
|
|
scheduler_policy_sequencial_multiple
|
Sequencial Multiple
|
|
scheduler_policy_sequencial_single
|
Sequencial Single
|
|
scheduler_too_many_tasks_exception
|
'Too many tasks' exception
|
|
set< T, MAX_SIZE_, TCompare >
|
A templated set implementation that uses a fixed size buffer
|
|
set_base
|
The base class for all sets
|
|
set_exception
|
Exception for the set
|
|
set_full
|
Full exception for the set
|
|
set_iterator
|
Iterator exception for the set
|
|
set_out_of_bounds
|
Map out of bounds exception
|
|
smallest_int_for_bits< NBITS >
|
Template to determine the smallest signed int type that can contain a value with the specified number of bits
|
|
smallest_int_for_value< VALUE >
|
Template to determine the smallest int type that can contain the specified signed value
|
|
smallest_type< T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16 >
|
Template to determine the smallest type and size
|
|
smallest_uint_for_bits< NBITS >
|
Template to determine the smallest unsigned int type that can contain a value with the specified number of bits
|
|
smallest_uint_for_value< VALUE >
|
Template to determine the smallest unsigned int type that can contain the specified unsigned value
|
|
sqrt< VALUE, I >
|
Calculates the smallest value that, when squared, will be not greater than VALUE
|
|
stack< T, SIZE >
|
A fixed capacity stack
|
|
stack_base
|
A fixed capacity stack written in the STL style
|
|
stack_empty
|
The exception thrown when the stack is empty
|
|
stack_exception
|
The base class for stack exceptions
|
|
stack_full
|
The exception thrown when the stack is full
|
|
string< MAX_SIZE_ >
|
A string implementation that uses a fixed size buffer
|
|
string_base
|
The base class for all templated string types
|
|
string_empty
|
String empty exception
|
|
string_exception
|
Exception base for strings
|
|
string_iterator
|
String iterator exception
|
|
string_out_of_bounds
|
String out of bounds exception
|
|
string_view_bounds
|
The exception thrown when the index is out of bounds
|
|
string_view_exception
|
The base class for
basic_string_view
exceptions
|
|
string_view_uninitialised
|
The exception thrown when the view is uninitialised
|
|
task
|
Scheduler
|
|
task_exception
|
Base exception class for task
|
|
timer
|
Common definitions for the timer framework
|
|
tree_link< ID_ >
|
A binary tree link
|
|
type_def< TIdType, TValue >
|
A template type to define strong typedefs
|
|
type_id_pair< T, ID_ >
|
The type/id pair type to use for type/id lookup template parameters
|
|
type_type_pair< T1, T2 >
|
The type/type pair type to use for type/type lookup template parameters
|
|
type_with_alignment< ALIGNMENT >
|
Gets a type that has the same as the specified alignment
|
|
u16string< MAX_SIZE_ >
|
A
u16string
implementation that uses a fixed size buffer
|
|
u32string< MAX_SIZE_ >
|
A
u32string
implementation that uses a fixed size buffer
|
|
unordered_map< TKey, TValue, MAX_SIZE_, MAX_BUCKETS_, THash, TKeyEqual >
|
A templated
unordered_map
implementation that uses a fixed size buffer
|
|
unordered_map_exception
|
Exception for the
unordered_map
|
|
unordered_map_full
|
Full exception for the
unordered_map
|
|
unordered_map_iterator
|
Iterator exception for the
unordered_map
|
|
unordered_map_out_of_range
|
Out of range exception for the
unordered_map
|
|
unordered_multimap< TKey, TValue, MAX_SIZE_, MAX_BUCKETS_, THash, TKeyEqual >
|
A templated
unordered_multimap
implementation that uses a fixed size buffer
|
|
unordered_multimap_exception
|
Exception for the
unordered_multimap
|
|
unordered_multimap_full
|
Full exception for the
unordered_multimap
|
|
unordered_multimap_iterator
|
Iterator exception for the
unordered_multimap
|
|
unordered_multimap_out_of_range
|
Out of range exception for the
unordered_multimap
|
|
unordered_multiset< TKey, MAX_SIZE_, MAX_BUCKETS_, THash, TKeyEqual >
|
A templated
unordered_multiset
implementation that uses a fixed size buffer
|
|
unordered_multiset_exception
|
Exception for the
unordered_multiset
|
|
unordered_multiset_full
|
Full exception for the
unordered_multiset
|
|
unordered_multiset_iterator
|
Iterator exception for the
unordered_multiset
|
|
unordered_multiset_out_of_range
|
Out of range exception for the
unordered_multiset
|
|
unordered_set< TKey, MAX_SIZE_, MAX_BUCKETS_, THash, TKeyEqual >
|
A templated
unordered_set
implementation that uses a fixed size buffer
|
|
unordered_set_exception
|
Exception for the
unordered_set
|
|
unordered_set_full
|
Full exception for the
unordered_set
|
|
unordered_set_iterator
|
Iterator exception for the
unordered_set
|
|
unordered_set_out_of_range
|
Out of range exception for the
unordered_set
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::upcast_functor< TBase, U1, U2, U3, U4, U5, U6, U7, U8 >
|
Base
upcast_functor
for eight types
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::upcast_functor< TBase, U1, no_type2, no_type3, no_type4, no_type5, no_type6, no_type7, no_type8 >
|
Upcast_functor for one type
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::upcast_functor< TBase, U1, U2, no_type3, no_type4, no_type5, no_type6, no_type7, no_type8 >
|
Upcast_functor for two types
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::upcast_functor< TBase, U1, U2, U3, no_type4, no_type5, no_type6, no_type7, no_type8 >
|
Upcast_functor for three types
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::upcast_functor< TBase, U1, U2, U3, U4, no_type5, no_type6, no_type7, no_type8 >
|
Upcast_functor for four types
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::upcast_functor< TBase, U1, U2, U3, U4, U5, no_type6, no_type7, no_type8 >
|
Upcast_functor for five types
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::upcast_functor< TBase, U1, U2, U3, U4, U5, U6, no_type7, no_type8 >
|
Upcast_functor for six types
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >::upcast_functor< TBase, U1, U2, U3, U4, U5, U6, U7, no_type8 >
|
Upcast_functor for seven types
|
|
iset< T, TCompare >::value_comp
|
How to compare two value elements
|
|
imultimap< TKey, TMapped, TKeyCompare >::value_comp
|
How to compare two value elements
|
|
imap< TKey, TMapped, TKeyCompare >::value_comp
|
How to compare two value elements
|
|
imultiset< T, TCompare >::value_comp
|
How to compare two value elements
|
|
variant< T1, T2, T3, T4, T5, T6, T7, T8 >
|
A template class that can store any of the types defined in the template parameter list
|
|
variant_exception
|
Base exception for the variant class
|
|
variant_incorrect_type_exception
|
'Unsupported type' exception for the variant class
|
|
vector< T, MAX_SIZE_ >
|
A vector implementation that uses a fixed size buffer
|
|
vector< T *, MAX_SIZE_ >
|
A vector implementation that uses a fixed size buffer
|
|
vector_base
|
The base class for all templated vector types
|
|
vector_empty
|
Vector empty exception
|
|
vector_exception
|
Exception base for vectors
|
|
vector_full
|
Vector full exception
|
|
vector_incompatible_type
|
Vector incompatible type exception
|
|
vector_out_of_bounds
|
Vector out of bounds exception
|
|
visitable< T1, T2, T3, T4 >
|
The visitable base class for four visitor types
|
|
visitable< T1 >
|
The visitable base class for one visitor type
|
|
visitable< T1, T2 >
|
The visitable base class for two visitor types
|
|
visitable< T1, T2, T3 >
|
The visitable base class for three visitor types
|
|
visitor< T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16 >
|
The visitor base class for sixteen types
|
|
visitor< T1 >
|
The visitor base class for one type
|
|
visitor< T1, T2 >
|
The visitor base class for two types
|
|
visitor< T1, T2, T3 >
|
The visitor base class for three types
|
|
visitor< T1, T2, T3, T4 >
|
The visitor base class for four types
|
|
visitor< T1, T2, T3, T4, T5 >
|
The visitor base class for five types
|
|
visitor< T1, T2, T3, T4, T5, T6 >
|
The visitor base class for six types
|
|
visitor< T1, T2, T3, T4, T5, T6, T7 >
|
The visitor base class for seven types
|
|
visitor< T1, T2, T3, T4, T5, T6, T7, T8 >
|
The visitor base class for eight types
|
|
visitor< T1, T2, T3, T4, T5, T6, T7, T8, T9 >
|
The visitor base class for nine types
|
|
visitor< T1, T2, T3, T4, T5, T6, T7, T8, T9, T10 >
|
The visitor base class for ten types
|
|
visitor< T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11 >
|
The visitor base class for eleven types
|
|
visitor< T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12 >
|
The visitor base class for twelve types
|
|
visitor< T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13 >
|
The visitor base class for thirteen types
|
|
visitor< T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14 >
|
The visitor base class for fourteen types
|
|
visitor< T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15 >
|
The visitor base class for fifteen types
|
|
wstring< MAX_SIZE_ >
|
A wstring implementation that uses a fixed size buffer
|
|
xor_checksum< T >
|
XOR Checksum
|
|
xor_rotate_checksum< T >
|
XOR-shift Checksum
|