Honeycomb  0.1
Component-Model Framework
Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123456]
 Choney::Allocator< FreeListAllocator, T >
 Choney::Allocator< SmallAllocator, T >
 Choney::Atomic< bool >
 Choney::Atomic< float >
 Choney::Atomic< honey::MemPool::Bucket::TaggedHandle >
 Choney::Atomic< honey::MonoClock::honey::TimePoint >
 Choney::Atomic< honey::Thread::ThreadId >
 Choney::Atomic< int >
 Choney::Atomic< intptr_t >
 Choney::Atomic< MarkedHandle >
 Choney::Atomic< Node * >
 Choney::Atomic< RunMode >
 Choney::Atomic< sdt >
 Choney::Atomic< State >
 Choney::Atomic< szt >
 Choney::Atomic< uint8 >
 Choney::BitSet_< Block, Alloc >
 Choney::matrix::priv::BlockTraits< MatrixP, Rows, Cols >
 Choney::matrix::priv::BlockTraits< Vec, 1, 1 >
 Choney::matrix::priv::BlockTraits< Vec, 1, Cols >
 Choney::matrix::priv::BlockTraits< Vec, Rows, 1 >
 CVariant
 Choney::DefaultAllocator< Bucket >
 Choney::DefaultAllocator< Heap >
 Choney::DefaultAllocator< honey::ConditionLock >
 Choney::DefaultAllocator< honey::ListenerList >
 Choney::DefaultAllocator< honey::lockfree::HazardMem::ThreadData::DelNode >
 Choney::DefaultAllocator< honey::SlotBase >
 Choney::DefaultAllocator< honey::SpinLock >
 Choney::DefaultAllocator< std::string >
 Choney::DefaultAllocator< ThreadData >
 Choney::DefaultAllocator< uint8 >
 Choney::DefaultAllocator< Vec< dim, Real > >
 Choney::DefaultAllocator< Worker >
 Choney::DepGraph< const log::Level >
 Choney::DepGraph< DepNode >
 Choney::DepGraph< DepTask::DepNode >
 Choney::DepNode< DepTask * >
 Choney::DepNode< Type * >
 Choney::deref_wrap< honey::json::Value_ >
 Choney::deref_wrap< TreeNode >
 Choney::finalize< Block, Alloc >
 Choney::finalize< Bucket >
 Choney::finalize< Heap >
 Choney::finalize< honey::ConditionLock >
 Choney::finalize< honey::ListenerList >
 Choney::finalize< honey::lockfree::HazardMem::ThreadData::DelNode >
 Choney::finalize< honey::SlotBase >
 Choney::finalize< honey::SpinLock >
 Choney::finalize< std::string >
 Choney::finalize< ThreadData >
 Choney::finalize< uint8 >
 Choney::finalize< Vec< dim, Real > >
 Choney::finalize< Worker >
 Choney::lockfree::FreeList< Node >< Node >
 CFunc
 Choney::mt::Funcptr< void()>
 Choney::FutureCommon< Future< R >, R >
 Choney::FutureCommon< SharedFuture< R >, R >
 Choney::Allocator< Subclass, T >Std::allocator compatible allocator
 Choney::Allocator< Subclass, T >::rebind< U >
 Choney::AllocatorObject< Alloc >Objects that inherit from this class will use Alloc for new/delete ops
 Choney::app::ModuleRegistryList of application modules
 Choney::Atomic< T, B >
 Choney::atomic::SwapType< T >Get the smallest atomically-swappable type that is large enough to hold T
 Choney::Atomic< T *, false >Wrapper around pointer type to make all operations atomic and sequentially consistent
 Choney::Atomic< T, false >Wrapper around a trivially copyable type to make load/store operations atomic and sequentially consistent
 Choney::Atomic< T, true >Wrapper around integral type to make all operations atomic and sequentially consistent
 Choney::BackSub< Real >Back substitute to solve a linear system
 Choney::BetaInc< Real >Evaluate the incomplete beta function
 Choney::Bisect< Real >Find the root of a function by the bisection method. ie. Finds where function returns 0
 Choney::BisectN< Real, Dim >Find the root of a set of functions by the bisection method. ie. Finds (x,y,...) where all functions return 0
 Choney::BitOpCommonBit util common to any endian type. Use through class BitOp
 Choney::BitOpEndian< Endian >Bit util specific to endian type. Use through class BitOp
 Choney::BitSet_< Block, Alloc_ >A compact array of bits. Dynamic version of std::bitset
 Choney::bloom_filter::hash< T >Functor used to generate hash. Each hashIndex for the same object must produce a unique hash
 Choney::bloom_filter::Key< T, Alloc >Caches multiple hashes of an object. The key can be inserted into a bloom filter and tested very quickly
 Choney::BloomFilter< T, Block, Alloc >A space-efficient probabilistic data structure that is used to test set membership. Can be tuned to use less space at the expense of increased false positive probabilty
 Choney::Bootstrap< SampleT, Dim, Real__ >Monte Carlo (random-based) method to estimate the interval of confidence in a function's result, when that function operates on samples from a complex or unknown distribution
 Choney::Bootstrap< SampleT, Dim, Real__ >::meanFuncFunctor to estimate the sample mean
 Choney::Bootstrap< SampleT, Dim, Real__ >::varianceFuncFunctor to estimate the sample variance. This is the unbiased estimator (mean over all possible samples is the population variance)
 Choney::Buffer< T >A contiguous region of referenced (not owned by object) memory
 Choney::Chacha::StateGenerator State
 Choney::ComRegistryHolds global list of all component types
 Choney::ConditionAnyCondition that can be used with any kind of lock. Slightly slower than the default Condition class
 Choney::DefaultAllocator< T, class >Returns T::Allocator<T> if available, otherwise std::allocator<T>
 Choney::DefaultAllocator< T, typename mt::True< typename T::template Allocator< T > >::type >
 Choney::DefaultAllocator< T[], std::true_type >
 Choney::DepGraph< DepNode_ >Dependency graph. Collects nodes and builds a searchable directed graph
 Choney::DepGraph< DepNode_ >::Iter_< Vertex_ >Depth-first pre-order iterator over vertices
 Choney::DepGraph< DepNode_ >::NodeIter_< Vertex_ >Depth-first pre-order iterator over nodes. Iterates over nodes that constitute each vertex in a vertex range
 Choney::DepGraph< DepNode_ >::VertexA vertex is initially associated with one key and acts like a multi-map, storing all nodes and graph links of DepNodes matching that key
 Choney::DepNode< Data_, Key_, Alloc_ >Dependency node for insertion into graph
 Choney::DepSchedScheduler that serializes and parallelizes task execution given a dependency graph of tasks and a pool of threads
 Choney::deref_wrap< T, Ptr, ConstPtr >Wraps a pointer so that it behaves similar to a reference
 Choney::Duration< Rep_, Period_ >Duration represented by repetitions of a period. The period must be a ratio
 Choney::Eigen< Real >Eigendecomposition. Decomposes any square (n x n) symmetric matrix $(A = A^T)$ into eigenvalues and eigenvectors
 Choney::EnumElemBase class of all generated enum classes. A single element in the enumeration. See Enumeration Classes
 Choney::EnumInfo_< EnumType >Run-time info about an enum class. Contains a list of elements and maps for element lookups. See Enumeration Classes for more info and examples
 Choney::EnumInfo_< EnumType >::Elem
 Choney::Exception::RaiserHelper to raise an exception after the right side of ^ has been evaluated
 Choney::Exception::SourceInfo about source where exception was thrown
 Choney::finalize< T, Alloc >Functor to delete a pointer
 Choney::finalize< T[], std::allocator< T > >Specialization for array
 Choney::finalize< void, std::allocator< void > >Specialization for void
 Choney::future::AsyncSched_tag
 Choney::FutureCommon< Subclass, R >Mixin for common future methods
 Choney::GammaFunc_< Real >Class to evaluate Gamma and related functions
 Choney::IdHolds a name string and its hashed value for fast comparison ops. See String Identifier
 Choney::IdLiteralId created from a string literal at compile-time
 Choney::IntIter< T >Incremental integer iterator (step size = 1). See range(int, int) to create
 Choney::IntStepIter< T >Integer iterator with step size. See range(int, int, int) to create
 Choney::json::Config< ordered, Alloc >Configuration for json value variant
 Choney::json::null_tJson null value type
 Choney::lazy< T, Eval, Pred >Wraps a value so that it is calculated only when needed. A lock synchronizes access
 Choney::LinearLeastSqr< Real >Linear least squares solver
 Choney::ListenerListCollection of listeners
 Choney::ListenerList::CallbackCallback to handle events from this class
 Choney::lockfree::BackoffExponential backoff algorithm. Backoff spins for first X ticks, then sleeps with a time that doubles every X ticks thereafter
 Choney::lockfree::HazardMem< Config >::ThreadData::DelNode
 Choney::lockfree::HazardMemConfigConfiguration interface for memory manager. Inherit this class and override types and static members
 Choney::lockfree::HazardMemLink< Node >Base link class, contains a generic Cas-able data chunk. The data chunk contains a pointer to a HazardMemNode
 Choney::lockfree::HazardMemNodeBase node class, inherit from this class, add link members, and use as Node type in HazardMemConfig
 Choney::lockfree::List< T, Alloc_, Backoff, iterMax >::Iter_< T_ >Iterator
 Choney::lockfree::List< T, Alloc_, Backoff, iterMax >::IterR_< T_ >Reverse iterator
 Choney::LogLogger
 Choney::Manip< Subclass >Base class to hold iostream manipulator state. Inherit from this class and call Subclass::inst(ios) to attach an instance of Subclass to an iostream
 Choney::ManipFunc< Func, Tuple >Helper to create a manipulator that takes arguments
 Choney::matrix::Builder< Matrix >Matrix comma initializer
 Choney::matrix::Iter< Matrix >Matrix element iterator
 Choney::matrix::OptionMatrix type options
 Choney::matrix::priv::BlockTraits< MatrixP_, Rows, Cols >
 Choney::matrix::priv::StorageAutoArray< Real, Size, Align >
 Choney::matrix::priv::StorageAutoArray< Real, Size, 16 >
 Choney::matrix::priv::StorageDense< Subclass >
 Choney::matrix::priv::Traits< Subclass >
 Choney::matrix::priv::Traits< Matrix< Rows, Cols, Real_, Options, Alloc_ > >(m x n)-dimensional matrix traits
 Choney::MemPool::Bucket::BlockHeaderBucket block header
 Choney::MemPool::Bucket::BlockHeader::Debug
 Choney::MemPool::Bucket::HandleEnables blocks to be referenced via index rather than pointer so that they can include a tag while still maintaining a swappable size
 Choney::MemPool::Heap::BlockHeaderHeap block header
 Choney::MemPool::Heap::BlockHeader::Debug
 Choney::Minimize< Real >Find a local minimum of a 1-dimensional function using "Brent's method" – bisection and inverse quadratic interpolation
 Choney::MinimizeN< Real, Dim >Find a local minimum of an n-dimensional function using "Powell's conjugate gradient descent method"
 Choney::mt::elemOf< Range >Get range element type
 Choney::mt::Funcptr< Sig >
 Choney::mt::Funcptr< R(Args...)>Holds a function pointer so that a functor can be called non-virtually. The functor must inherit from FuncptrBase
 Choney::mt::Funcptr< void(Args...)>Specialization for void return type
 Choney::mt::FuncptrBaseInherit to enable non-virtual functor calling
 Choney::mt::gcd< a, b >Calc greatest common divisor of a and b
 Choney::mt::identity< T >Returns type T unchanged
 Choney::mt::isCallable< Func, Args >Check if functor is callable with arguments
 Choney::mt::isRange< T >Check if type is a range or a reference to one. A range is a type where std::begin(range) is a valid call
 Choney::mt::iter_endOf< Range >Get range iterator end type
 Choney::mt::iterOf< Range >Get range iterator begin type
 Choney::mt::max< vals >Get maximum of all arguments
 Choney::mt::min< vals >Get minimum of all arguments
 Choney::mt::NoCopyInherit to declare that class is not copyable
 Choney::mt::tag< int >Use to differentiate an overloaded function by type. Accepts dummy parameter default value: func(tag<0> = 0)
 Choney::mt::VoidSpecial void type, use where void is intended but implicit members are required (default ctor, copyable, etc.)
 Choney::MtMapCommon< Subclass, Key_, Val_, List_ >Common functions between map elem and the map tail specialization. Use through class MtMapElem
 Choney::MtMapCommon< Subclass, Key_, Val_, List_ >::priv< isTail, _ >::findElem< Key, Prev_ >Specialize for our key
 Choney::MtMapCommon< Subclass, Key_, Val_, List_ >::priv< true, _ >::findElem< Key, Prev_ >
 Choney::MtMapCommon< Subclass, Key_, Val_, List_ >::size_Get size of map at compile-time
 Choney::MtMapIter< Head, Elem >Bidirectional iterator over map key/value pairs
 Choney::MtPair< Key_, Val_ >Key/value pair. A pair can be constructed with the syntax: (key() = value)
 Choney::Numeral< T >Numeric type information, use numeral() to get instance safely from a static context
 Choney::NumeralFloat< T >Numeric type info for floating point types
 Choney::NumeralInt< T >Numeric type info for integer types
 Choney::optional< T >Enables any type to be optional so it can exist in an uninitialized null state
 Choney::optional< T & >Specialization for references
 Choney::optnull_tNull optional type
 Choney::overload_< Funcs >
 Choney::overload_<>
 Choney::PackagedTask< Sig >A container that wraps a function so that its result is stored in a future when invoked
 Choney::PeriodicSchedScheduler that executes tasks periodically or after a delay given a pool of threads
 Choney::Permute_< Real >Generate all permutations of a list. A functor can be specified for fast culling of entire subtrees of undesired permutations
 Choney::Permute_< Real >::Iter< T >Iter for permutations of a list
 Choney::Polynomial< Real >Polynomial algorithms
 Choney::Qrd< Real >QR Decomposition. Can be used to solve least squares problems
 Choney::Quat_< Real__ >Quaternion rotation class. Represents a counter-clockwise rotation of an angle about its axis
 Choney::Random_< Real >Random-related methods
 Choney::Random_< Real >::DistStats
 Choney::RandomDist< Real >Base class for all random distributions
 Choney::RandomGenRandom number generator interface
 Choney::Range_< T1_, T2_ >Iterator range. See range(Iter1&&, Iter2&&) to create
 Choney::Ratio< Num, Den >Class to hold compile-time finite rational numbers, ie. the fraction num / den
 Choney::Ratio< Num, Den >::add< rhs >Operator+
 Choney::Ratio< Num, Den >::div< rhs >Operator/
 Choney::Ratio< Num, Den >::mul< rhs >Operator*
 Choney::Ratio< Num, Den >::sub< rhs >Operator-
 Choney::RealIter< T >Real number iterator. See range(Real, Real, Real) to create
 Choney::recursive_wrap< T, Alloc >Allows for recursive type definitions, eg. class Object : vector<recursive_wrap<Object>>
 Choney::RingIter< Range, Iter >Ring iterator. See ringRange() to create
 Choney::SharedMutexA thread lock for shared data where there may be many readers and one writer
 Choney::SimplexNoiseCommon< Subclass, Dim, Real >Methods common to all simplex noise dimensions
 Choney::SinTable< Real >Speeds up all trig functions at the cost of precision. Precision is roughly 1 / size
 Choney::SpinLockA thread lock where the lock is acquired through a busy wait loop
 Choney::StudentT_< Real >::PooledStats
 Choney::StudentT_< Real >::Stats
 Choney::Svd< Real >Singular Value Decomposition. Can be used to calculate the pseudo-inverse of any matrix or solve least squares problems
 Choney::thread::Local< T >Local thread storage. Multiple threads can access one Local object, but each thread will only see its own separate "local" instance
 Choney::TimePoint< Clock_, Dur >TimePoint represented by a duration since a clock's epoch time
 Choney::Transform_< Real >A 3D linear transform from TRS components (translation, rotation, and scale/skew)
 Choney::TreeClone< TreeNode >Clone and track changes to an entire tree
 Choney::TreeNode< Data_, Key_, Alloc >Unrooted acyclic tree
 Choney::TreeNode< Data_, Key_, Alloc >::PreOrdIter_< TreeNode >Depth-first pre-order traversal
 Choney::Trig_< Real >Trigonometry
 Choney::TupleIter< Iter, I, IterCategory >Wrapper around an iterator with tuple value type. When dereferenced returns I'th element
 Choney::TupleIter< Iter, I, std::forward_iterator_tag >
 Choney::vec::priv::Segment< Vec, Dim >Vector segment view
 Choney::vec::priv::StorageFieldsMixin< Real, Dim, Align >
 Choney::vec::priv::StorageFieldsMixin< Real, 1, Align >
 Choney::vec::priv::StorageFieldsMixin< Real, 2, Align >
 Choney::vec::priv::StorageFieldsMixin< Real, 3, Align >
 Choney::vec::priv::StorageFieldsMixin< Real, 4, 16 >
 Choney::vec::priv::StorageFieldsMixin< Real, 4, Align >
 Choney::vec::priv::Traits< Dim, Real_, Options, Alloc_ >N-dimensional vector traits
 Choney::VecSwizCon< Dim, Real, Options >Vector for const swizzle operators
 Choney::VecSwizRef< Dim, Real, Options >Vector reference holder for mutable swizzle operators
 Choney::Vegas< Dim, DimRes, Real__, BinCount >Monte Carlo (random-based) method to approximate the integral of a function over any number of dimensions
 Choney::lazy< Matrix< matrix::dynamic, matrix::dynamic, Real > >
 Ctemplate findElem
 Ctemplate sizeR
 CList_
 Choney::thread::Local< Local >
 Choney::thread::Local< ThreadDataRef >
 Choney::thread::Local< Worker * >
 CStorage
 CValue
 Choney::MtMapCommon< MtMapElem< Key_, Val_, List_ >, Key_, Val_, List_ >
 Choney::Numeral< Real >
 Choney::optional< honey::MonoClock::honey::Duration >
 Choney::overload_< Funcs... >
 Choney::PackagedTask< Result()>
 Choney::PackagedTask< void()>
 CCondition
 CMonoClock
 CMutex
 COp
 CSystemClock
 CThread
 CfunctorTraits
 CSharedControlPtr
 CSharedObj_tag
 CBase
 Cvariant
 Choney::Quat_< Real >
 Choney::RandomDist< Numeral< Int >::Real >
 Choney::SimplexNoiseCommon< SimplexNoise< Dim, Real >, Dim, Real >
 Cstd::array< T >STL class
 Cstd::basic_string< Char >STL class
 Cstd::common_type< honey::Duration< Rep, Period >, honey::Duration< Rep2, Period2 > >Get common duration between two durations. The period of the resulting duration is the greatest common divisor
 Cstd::common_type< honey::Ratio< Num, Den >, honey::Ratio< Num2, Den2 > >Get common ratio between two ratios
 Ctype
 Cstd::exceptionSTL class
 Cfalse_type
 Cstd::hash< honey::bloom_filter::Key< T, Alloc > >Adapter for std hasher
 Cstd::hash< honey::SharedPtr< T > >Allow class to be used as key in unordered containers
 Cstd::hash< honey::UniquePtr< T, Fin > >Allow class to be used as key in unordered containers
 Cstd::ios_baseSTL class
 Ciostream
 Cis_base_of
 Cstringbuf
 Ctrue_type
 Cstd::unordered_map< K, T >STL class
 Cstd::vector< T >STL class
 Choney::matrix::priv::StorageAutoArray< Real, honey::matrix::priv::StorageDense::s_size, honey::matrix::Option::getAlign< honey::matrix::priv::StorageDense::options >::value >
 Choney::vec::priv::StorageFieldsMixin< matrix::priv::Traits< Subclass >::Real, matrix::priv::Traits< Subclass >::dim, matrix::Option::getAlign< matrix::priv::Traits< Subclass >::options >::value >
 Csize_
 Ctemplate Type_
 Choney::atomic::SwapType< T * >
 Choney::vec::priv::Traits< 1, Real, Options, std::allocator< int8 > >
 Choney::vec::priv::Traits< 2, Real, Options, std::allocator< int8 > >
 Choney::vec::priv::Traits< 3, Real, Options, std::allocator< int8 > >
 Choney::vec::priv::Traits< 4, Real, Options, std::allocator< int8 > >
 Choney::vec::priv::Traits< Dim, Real, Options, Alloc >
 Choney::matrix::priv::Traits< Vec< Dim, Real, Options > >
 Choney::TreeNode< honey::ComRegistry::Type * >
 CValue
 Choney::Vec< dim, Real >< dim, Real >