Thrill  0.1
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 12345]
oNexamples
|oNbfs
|oNk_means
|oNlogistic_regression
|oNpage_rank
|oNselect
|oNstochastic_gradient_descent
|oNsuffix_sorting
|oNtriangles
|\Nword_count
oNgen_data
oNstdSTL namespace
|oChash< Edge >
|oChash< thrill::common::StringView >
|\Cnumeric_limits< thrill::common::UIntPair< HighType > >Template class providing some numeric_limits fields for UIntPair types
oNthrill
|oNapi
|oNcommonContains many common tools and helpers shared by higher layers. See common
|oNcore
|oNdata
|oNio
|oNmem
|oNnet
|\Nvfs
\Ntlx
 oNdetail
 oCAllocatorBase
 oCCmdlineParserCommand line parser which automatically fills variables and prints nice usage messages
 oCCountingPtrHigh-performance smart pointer used as a wrapping reference counting pointer
 oCCountingPtrDefaultDeleterDefault deleter for CountingPtr
 oCDelegate
 oCDelegate< R(A...), Allocator >This is a faster replacement than std::function
 oCFunctionChainA FunctionChain is a chain of functors that can be folded to a single functors
 oCFunctionStackA FunctionStack is a chain of functor that can be folded to a single functor (which is usually optimize by the compiler)
 oCindex_sequence
 oCis_std_arrayTest if is std::array<T, N>
 oCis_std_array< std::array< T, N > >
 oCis_std_pairTest if is a std::pair<...>
 oCis_std_pair< std::pair< S, T > >
 oCis_std_tupleTest if is a std::tuple<...>
 oCis_std_tuple< std::tuple< Ts...> >
 oCis_std_vectorTest if is std::vector<T>
 oCis_std_vector< std::vector< T > >
 oCLog2
 oCLog2< 0 >
 oCLog2< 1 >
 oCLog2Floor
 oCLog2Floor< 0 >
 oCLog2Floor< 1 >
 oCLoggerLOG and sLOG for development and debugging
 oCLoggerVoidify
 oCLoserTreeCopyGuarded loser tree/tournament tree, either copying the whole element into the tree structure, or looking up the element via the index
 oCLoserTreeCopy< true, ValueType, Comparator >Guarded loser tree/tournament tree, either copying the whole element into the tree structure, or looking up the element via the index
 oCLoserTreeCopyBaseGuarded loser tree/tournament tree, either copying the whole element into the tree structure, or looking up the element via the index
 oCLoserTreeCopyUnguarded
 oCLoserTreeCopyUnguarded< true, ValueType, Comparator >
 oCLoserTreeCopyUnguardedBaseUnguarded loser tree, copying the whole element into the tree structure
 oCLoserTreePointerGuarded loser tree, using pointers to the elements instead of copying them into the tree nodes
 oCLoserTreePointer< true, ValueType, Comparator >Guarded loser tree, using pointers to the elements instead of copying them into the tree nodes
 oCLoserTreePointerBaseGuarded loser tree, using pointers to the elements instead of copying them into the tree nodes
 oCLoserTreePointerUnguarded
 oCLoserTreePointerUnguarded< true, ValueType, Comparator >
 oCLoserTreePointerUnguardedBaseUnguarded loser tree, keeping only pointers to the elements in the tree structure
 oCLoserTreeSwitch
 oCLruCacheMapThis is an expected O(1) LRU cache which contains a map of (key -> value) elements
 oCLruCacheSetThis is an expected O(1) LRU cache which contains a set of key-only elements
 oCmake_index_sequence
 oCReferenceCounterProvides reference counting abilities for use with CountingPtr
 oCRingBufferA ring (circular) buffer of static (non-growing) size
 oCSimpleVectorSimpler non-growing vector without initialization
 oCSpacingLoggerA logging class which outputs spaces between elements pushed via operator<<
 oCStackAllocator
 oCStackArenaStorage area allocated on the stack and usable by a StackAllocator
 oCStaticIndex
 \CThreadPoolThreadPool starts a fixed number p of std::threads which process Jobs that are enqueued into a concurrent job queue