Here are the classes, structs, unions and interfaces with brief descriptions:
| Abs< T > | Template class for generic, type-inferred absolute value |
| counter_iterator< T > | Counting output iterator that records how many times an output iterator was assigned to, but ignores the value stored |
| get_first | Functor to get the first element of a pair. Use with STL functions like transform() |
| get_second | Functor to get the second element of a pair. Use with STL functions like transform() |
| id_pair< T > | MPI-packable struct for an MPI-packable type plus its object id |
| indexed_lt_functor< Indexable > | |
| kmedoids | Implementations of the classic clustering algorithms PAM and CLARA, from Finding Groups in Data, by Kaufman and Rousseeuw |
| lazy_distance_functor< T, D > | Functor for computing distance lazily from an object array and a distance metric |
| matrix_distance | Adaptor for passing a matrix by reference to template functions that take a callable distance function |
| partition::member_writer | Writable structure returned by members() function |
| ms_summary | |
| multi_gather< T > | Asynchronous, some-to-some gather operation used by parallel clustering algorithms to simultaneously send members of sample sets to a set of distributed worker processes |
| par_kmedoids | This class implements the CAPEK and XCAPEK scalable parallel clustering algorithms |
| par_partition | Par_partition represents a partitioning of a distributed data set |
| partition | This represents a partitioning of a data set |
| sequence | Generator object for a strided sequence of ints |
| counter_iterator< T >::target | Struct representation of a no-op. Makes assignment to target do nothing |
| Timer | |
| trial | This struct represents parameters for a single trial run of kmedoids |
| trial_generator | Class to generate a set of trials for clustering |
