Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123456]
 CA
 Cmn::add_cv< T >
 Cmn::add_pointer< T >
 Cmn::add_reference< T >
 Cmn::aligned_as< T >
 Cmn::alignment_of< T >
 Cmn::alignment_of< void >
 Cmn::alignment_of< void const >
 Cmn::alignment_of< void const volatile >
 Cmn::alignment_of< void volatile >
 Cmn::internal::alignof_helper< T >
 Cmn::memory::allocator_traits< TAllocator >
 Cmn::memory::internal::allocator_traits< TAlloC >
 Cmn::container::array_traits< TArray >
 Cmn::atomic_counterThis class implements a simple counter, whit atomic operations for use in a multithreaded environment
 Cmn::internal::atomic_flag< TFlag >
 Cmn::auto_release< TRELOBJ, TALLOCATOR >A simple garbage collector - pool based, a object for this colector must be extends auto_release_object
 Cmn::auto_release_object
 Cmn::back_insert_iterator< TCon >
 CBASE_ATOMIC_TYPE
 Cmn::base_event< TSender, TArgs >
 Cmn::base_eventargs
 Cmn::container::base_rb_tree< TTreeTraits, TAllocator >
 Cmn::base_tickhook_entry
 Cmn::memory::basic_allocator< TAllocator, TFilter >
 Cmn::memory::basic_allocator_filter
 Cmn::memory::basic_allocator_maximal_filter< TMaxAlloc >
 Cmn::memory::basic_allocator_stack_impl< TBUFFERSIZE >Stack based allocator
 Cmn::container::basic_anyAn Any class represents a general type and is capable of storing any type
 Cmn::container::basic_any::basic_any_holderInterface class for the holder
 Cmn::pointer::basic_any_ptr< T >
 Cmn::container::basic_array< T, TAllocator, TDeleter >Lightweight c++11 array implementation
 Cmn::container::basic_array_iterator< T >Helper class for array iterators
 Cmn::basic_atomic_flag< TAtomicType, TTrue, TFalse >
 Cmn::basic_atomic_gcc< T >Generic atomic type, primary class template
 Cmn::container::basic_atomic_queue< T, TMAXITEMS >A basic lockfree atomic queue
 Cmn::basic_atomic_singleton< T >Singleton with double-checked locking pattern with atomic and mutex lock
 Cmn::pointer::basic_auto_ptr< T >AutoPtr is a "smart" pointer for classes implementing reference counting based garbage collection
 Cmn::container::basic_binary_queue< T, TITEMSIZE >This queue can only hold one item. If sucessive push operations are called, that item is overwritten with whatever the last item was
 Cmn::container::basic_binary_queue_iterator< T >
 Cmn::memory::basic_caps_allocator< TCAPS, TSBITS >
 Cmn::math::basic_color< T >A class for RGBA Color handling
 Cmn::math::basic_color.__unnamed3__
 Cmn::math::basic_color.__unnamed3__.__unnamed5__
 Cmn::math::basic_color.__unnamed3__.__unnamed7__
 Cmn::pointer::basic_default_clone< T >
 Cmn::memory::basic_deleter< Type, TAllocator >A Simple template for a deleter
 Cmn::memory::basic_deleter< T, memory::default_allocator >
 Cmn::memory::basic_deleter< Type[], TAllocator >A Simple template for a deleter
 Cmn::container::basic_deque< T, TMAXITEMS, TITEMSIZE >A basic wrapper for the MiniLib deque's as Template deque
 Cmn::container::basic_deque_iterator< T, TQUEUE >
 Cmn::device::basic_device
 Cmn::net::basic_endpointThis abstract basic class represents an endpoint/socket address
 Cmn::basic_fbit
 Cmn::basic_fbit.__unnamed11__
 Cmn::container::basic_fixed_array< T, N >A standard container for storing a fixed size sequence of elements
 Cmn::basic_hardware_pin< TPin >
 Cmn::basic_initializer_list< T >
 Cmn::device::basic_input_pinBasic_input_pin class is an interface for single input pin
 Cmn::net::basic_ip_addressWrapper class around lwip implementation of a ip address
 Cmn::net::basic_ip_socketWrapper class around lwip implementation of a socket
 Cmn::container::basic_light_map< TKey, TValue, TALLOCATOR, TPairType, TContainer >Lightweight c++11 dictionary map implementation
 Cmn::pointer::basic_linked_ptr_nodeThis class allows basic_linked_ptr<T> and basic_linked_ptr to share the same base nodes
 Cmn::container::basic_list< T, TAllocator, TDeleter >
 Cmn::container::basic_list< auto_release_object, memory::default_allocator_t >
 Cmn::pointer::basic_lock_ptr< T, TLOCK >Auto lock pointer
 Cmn::memory::basic_malloc_allocator_impl
 Cmn::memory::basic_multiheap_allocator_impl< TBytes >
 Cmn::device::basic_net_ifWrapper class around esp-idf implementation of a esp-netif device
 Cmn::memory::basic_new_allocaor_impl
 Cmn::container::basic_node< T >
 Cmn::container::basic_node_itarrator< TNODE >
 Cmn::container::basic_node_itarrator_res< TNODE >
 Cmn::basic_optional< T >
 Cmn::container::basic_pair< TFIRST, TSECOND >
 Cmn::container::basic_queue< T, TMAXITEMS, TITEMSIZE >A basic wrapper for the MiniLib queue's as Template queue
 Cmn::queue::basic_queueQueue class wrapper for FreeRTOS queues
 Cmn::container::basic_queue_iterator< T, TQUEUE >
 Cmn::container::basic_ring_buffer< T, TCAPACITY, TLOCK >A basic ring buffer with iterator
 Cmn::container::basic_ring_buffer_iterator< T, E >Ring_buffer_iterator
 Cmn::basic_safe_counter< T, TLOCK >Safe counter is a base of thread saftly counter
 Cmn::pointer::basic_save_ptr< T >
 Cmn::basic_schedular
 Cmn::pointer::basic_scoped_ptr< T >
 Cmn::basic_shared_object< TOBJECT >
 Cmn::pointer::basic_shared_ptr< T, TRefType >
 Cmn::basic_singleton< T, TLOCK >
 Cmn::container::basic_stack< TType >
 Cmn::device::basic_systemGet system infos and useful system functins of the using platform
 Cmn::basic_tasklet
 Cmn::memory::basic_threadsafed_allocator< TMutex, TAllocator, TFilter >
 Cmn::basic_timed_lock< TLOCK >
 Cmn::basic_timer
 Cmn::basic_timespanThis class represents a time span (using microseconds)
 Cmn::basic_timestampA Timestamp stores a monotonic* time value with microseconds resolution
 Cmn::container::basic_triple< TFIRST, TSECOND, TTHIRD >
 Cmn::container::basic_tuple< N, T >
 Cmn::basic_uint128_t
 Cmn::basic_uint128_t.__unnamed16__
 Cmn::basic_uint128_t.__unnamed16__.__unnamed18__
 Cmn::pointer::basic_value_ptr< T, TCloner, TDeleter >
 Cmn::container::basic_vector_storage< T, TAllocator >
 Cmn::container::basic_vector_storage< T, TAllocator >
 Cmn::basic_void_typeA dummy class with value-type semantics, mostly useful as a template argument
 Cmn::pointer::basic_weak_ptr< T, TRefType >
 Cmn::queue::basic_work_queue
 Cmn::stl::binary_function< Arg1, Arg2, TResult >
 Cmn::stl::binary_function< T, T, bool >
 Cmn::stl::binary_function< T, T, T >
 Cmn::bit_or<... >
 Cmn::char_alignment< Target, check >
 Cmn::char_alignment< Target, false >
 Ccloner_type
 Cmn::container::internal::compare_func< TPair, TFunctor >Internal helper for sorting
 Cmn::container::internal::compare_func< value_type, mn::less< TKey > >
 Cmn::compressed_pair< T, U, typename >
 Cmn::conditional< B, T, F >
 Cmn::conditional< false, T, F >
 Cmn::IPseudoRandomUtil< TSEEDTYPE >::conversUnion for type convertion
 Cmn::copy_move_tag< t >Copyable and movable
 Cmn::dec< T >
 Cdeleter_type
 Cmn::divides
 Cmn::double_alignment< Target, check >
 Cmn::double_alignment< Target, false >
 Cmn::ebo_storage< T, TAG, typename >
 Cmn::ebo_storage< T, 0 >
 Cmn::ebo_storage< U, 1 >
 Cmn::enable_if< bool, class >
 Cmn::equal_to
 Cmn::event_system< TSender, TArgs, TBaseEvent, TContainer >
 Cmn::exit_eventargs
 Cmn::factorial< N >Calculates the Nth factorial value
 Cmn::factorial< 0 >Calculates the 0 factorial value
 Cmn::fast_type< Bits, TBaseType >
 Cmn::fast_type.__unnamed13__
 Cmn::fibonacci< N >Calculates the Nth Fibonacci value
 Cmn::fibonacci< 0 >Calculates the 0 Fibonacci value
 Cmn::fibonacci< 1 >Calculates the 1 Fibonacci value
 Cmn::container::fixed_vector_storage< T, TAllocator, TCapacity >
 Cmn::front_insert_iterator< TCon >
 Cmn::greater
 Cmn::greater_equal
 Cmn::hash< T >Default implementation of hasher
 Cmn::hash< char * >
 Cmn::hash< const char * >
 Cmn::hash< int16_t >
 Cmn::hash< int32_t >
 Cmn::hash< int64_t >
 Cmn::hash< int8_t >
 Cmn::hash< mn::pointer::value_ptr< T, D, C > >
 Cmn::hash< T * >
 Cmn::hash< uint16_t >
 Cmn::hash< uint32_t >
 Cmn::hash< uint64_t >
 Cmn::hash< uint8_t >
 Cmn::hash_function< T >
 Cmn::hash_function< const char * >
 Cmn::basic_thread::id
 Cmn::internal::in_place_index_tag
 Cmn::internal::in_place_type
 Cmn::internal::in_place_type_tag
 Cmn::inc< T >
 Cmn::input_iterator_tag
 Cmn::insert_iterator< TCon >
 Cmn::int_alignment< Target, check >
 Cmn::int_alignment< Target, false >
 Cmn::int_to_type< TVal >
 Cmn::integral_constant< T, v >
 Cmn::stl::integral_constant< T, v >
 Cmn::integral_constant< bool, !(is_function< T >::value|is_reference< T >::value|is_void< T >::value) >
 Cmn::integral_constant< bool, !(is_integral< T >::value|is_floating_point< T >::value) >
 Cmn::integral_constant< bool, !is_fundamental< T >::value >
 Cmn::integral_constant< bool, __is_abstract(T)>
 Cmn::integral_constant< bool, __is_base_of(TBase, TDerived)>
 Cmn::integral_constant< bool, __is_class(T)>
 Cmn::integral_constant< bool, __is_empty(T)>
 Cmn::integral_constant< bool, __is_enum(T)>
 Cmn::integral_constant< bool, __is_literal_type(T)>
 Cmn::integral_constant< bool, __is_pod(T)>
 Cmn::integral_constant< bool, __is_polymorphic(T)>
 Cmn::integral_constant< bool, __is_standard_layout(T)>
 Cmn::integral_constant< bool, __is_trivial(T)>
 Cmn::integral_constant< bool, __is_trivially_copyable(T)>
 Cmn::integral_constant< bool, __is_union(T)>
 Cmn::integral_constant< bool, false >
 Cmn::integral_constant< bool, internal::allocator_traits< TAlloC >::is_thread_safe::value >
 Cmn::integral_constant< bool, is_fundamental< T >::value|is_pointer< T >::value|is_pod< T >::value >
 Cmn::integral_constant< bool, is_fundamental< T >::value||is_pointer< T >::value||is_pod< T >::value >
 Cmn::integral_constant< bool, is_integral< T >::value||is_rational< T >::value >
 Cmn::integral_constant< bool, is_lvalue_reference< T >::value|is_rvalue_reference< T >::value >
 Cmn::integral_constant< bool, true >
 Cintegral_constant< bool,(char(255) > 0)>
 Cintegral_constant< bool,(char(255)< 0)>
 Cmn::integral_constant< int, 0 >
 Cmn::device::basic_net_if::ip_info
 Cmn::IPseudoRandomUtil< TSEEDTYPE >An Intarface for all randoms classes in this library
 Cmn::IPseudoRandomUtil< unsigned int >
 Cmn::is_member_pointer< typename >
 Cmn::is_pod< container::pair< TFIRST, TSECOND > >
 Cmn::is_pod< container::triple< TFIRST, TSECOND, TTHIRD > >
 Cmn::iterator_traits< IterT >
 Cmn::iterator_traits< T * >
 Cmn::ITimer
 Cmn::less
 Cmn::less_equal
 Cmn::container::list_node_iterator< TNodePtr, TPtr, TRef >
 Cmn::logic_and< T >
 Cmn::logic_not< T >
 Cmn::logic_or< T >
 Cmn::long_alignment< Target, check >
 Cmn::long_alignment< Target, false >
 Cmn::long_double_alignment< Target, check >
 Cmn::long_double_alignment< Target, false >
 Cmn::long_long_alignment< Target, check >
 Cmn::long_long_alignment< Target, false >
 Cmn::make_void< ts >
 Cmn::internal::max_align
 Cmn::minus
 CMN_DEFAULT_CLASS
 CMN_ONCOPYABLE_CLASS
 CMN_ONSIGLETN_CLASS
 Cmn::modulus
 Cmn::move_iterator< TIterator >
 Cmn::multiplies
 Cmn::negate
 Cmn::container::basic_atomic_queue< T, TMAXITEMS >::node
 Cmn::pointer::node_ptr< T, TAllocator >
 Cmn::memory::nodeleter_allocator_tag
 Cmn::not_equal_to
 Cmn::null_type
 Cmn::nullopt_t
 Cmn::numeric_limits< T >
 Cmn::numeric_limits< bool >Spezial version for bool
 Cmn::numeric_limits< char >Spezial version for char
 Cmn::numeric_limits< double >Spezial version for double
 Cmn::numeric_limits< float >Spezial version for float
 Cmn::numeric_limits< int >Spezial version for int
 Cmn::numeric_limits< long >Spezial version for long
 Cmn::numeric_limits< long double >Spezial version for long double
 Cmn::numeric_limits< long long >Spezial version for long long
 Cmn::numeric_limits< short >Spezial version for short
 Cmn::numeric_limits< signed char >Spezial version for uchar
 Cmn::numeric_limits< unsigned char >Spezial version for uchar
 Cmn::numeric_limits< unsigned int >Spezial version for unsigned int
 Cmn::numeric_limits< unsigned long >Spezial version for unsigned long
 Cmn::numeric_limits< unsigned long long >Spezial version for unsigned long long
 Cmn::numeric_limits< unsigned short >Spezial version for unsigned short
 Cmn::only_copyable_tag< t >Not movable
 Cmn::only_move_tag< t >Not copyable
 Cmn::only_move_tag< void >
 Cmn::only_oneable_tag< t >Not copyable or movable
 Cmn::output_iterator_tag
 Cmn::plus
 Cmn::memory::pointer_traits< TAllocator >
 Cmn::memory::pointer_traits< T * >
 Cmn::memory::detail::ptr_difference< class, class >
 Cmn::memory::detail::ptr_element< T, class >
 Cmn::memory::detail::ptr_element< T, typename ptr_void< typename T::element_type >::type >
 Cmn::memory::detail::ptr_first< T >
 Cmn::memory::detail::ptr_first< T< U, Args... > >
 Cmn::memory::detail::ptr_rebind< T, U, class >
 Cmn::memory::detail::ptr_rebind< T, U, typename ptr_void< typename T::template rebind< U > >::type >
 Cmn::memory::detail::ptr_transform< T, V >
 Cmn::memory::detail::ptr_transform< T< U, Args... >, V >
 Cmn::memory::detail::ptr_value< T >
 Cmn::memory::detail::ptr_value< void >
 Cmn::memory::detail::ptr_void< class >
 Cmn::container::internal::rb_tree_key_wrapper< TKey >
 Cmn::container::rb_tree_node< TVALUE >
 Cmn::container::internal::rb_tree_traits< TKey >
 Cmn::memory::pointer_traits< TAllocator >::rebind_to< U >
 Cmn::memory::pointer_traits< T * >::rebind_to< U >
 Cmn::internal::res_of< Sig, class >
 Cmn::reverse_iterator< TIterator >
 Cmn::select< flag, T, U >
 Cmn::select< false, T, U >
 Cmn::short_alignment< Target, check >
 Cmn::short_alignment< Target, false >
 Cmn::small_task< Sig, sz, algn >
 Cmn::small_task< int(void *)>
 Cmn::small_task< R(Args...), sz, algn >
 Cmn::small_task< void(sender_reference, const args_type)>
 Cmn::pointer::smart_pointer_traits< TPR >
 Cmn::sqrt< VAL, X >
 Cmn::memory::std_allocator_tag
 Cmn::system_endianGet the underlying endian architecture?
 Cmn::device::system_streamA simple abstractes class for easy handle any flash drivers
 CT
 Cmn::tag< T >
 Cmn::tag< const T >
 Cmn::tag< invoke_t< G, Args... > >
 Cmn::tag< R(*)(Args...)>
 Cmn::tag< T & >
 Cmn::tag< T && >
 Cmn::tag< T * >
 Cmn::tag< volatile T >
 Cmn::ext::task_message
 Cconditional::type
 Cconditional::type
 Cmn::memory::detail::ptr_value< void >::type
 Cmn::type_to_type< T >
 Cmn::stl::type_traits< T >
 Cmn::type_traits< T >
 Cmn::stl::type_traits< const T & >
 Cmn::type_traits< const T & >
 Cmn::stl::type_traits< const T >
 Cmn::type_traits< const T >
 Cmn::type_traits< const T[N]>
 Cmn::type_traits< const volatile T & >
 Cmn::stl::type_traits< T & >
 Cmn::type_traits< T & >
 Cmn::type_traits< T * >
 Cmn::type_traits< T[N]>
 Cmn::type_traits< volatile T & >
 Cmn::internal::type_with_alignment< N >
 Cmn::internal::type_with_alignment< 1 >
 Cmn::internal::type_with_alignment< 16 >
 Cmn::internal::type_with_alignment< 2 >
 Cmn::internal::type_with_alignment< 32 >
 Cmn::internal::type_with_alignment< 4 >
 Cmn::internal::type_with_alignment< 64 >
 Cmn::internal::type_with_alignment< 8 >
 Cmn::stl::unary_function< Arg, TResult >
 Cmn::stl::unary_function< T, bool >
 Cmn::stl::unary_function< T, T >
 Cmn::value2size
 Cmn::value2size_raw
 Cmn::small_task< R(Args...), sz, algn >::vtable_t
 Cmn::queue::work_queue_item