Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
arg_parser
arg_parser::arg_record
CachedESTInfoA simple class to encapsulate data to be cached about ESTs
CLUCLU: An implementation of the CLU's analysis algorithm, originally developed by Andrey Ptitsyn and Winston Hide
CLU::CLUESTDataContainer for CLU's hash maps for ESTs
ClusterMakerThe base class of all cluster makers
ClusterMakerFactory
CmdEntryA structure to ease delegating processing of commands to various methods in this class
D2EST Analyzer that uses the D2 algorithm to compute distances between two ESTs
D2ZimEST Analyzer that uses the d2 algorithm to compute distances between two ESTs
InteractiveConsole::Entry
EqualIntegerInteger comparison structure for HashMap
EqualStrString comparison structure for HashMap
ESTA single EST
ESTAnalyzerThe base class of all EST analyzers
ESTAnalyzerFactory
ESTCodecA helper class to serve as a EST enCOder-DECoder
ESTCustomDataA dummy class that serves as a place holder
FilterThe base class of all filters
FilterChainClass that manages a list of filters
FilterFactoryCentralized factory for creating filters
FMWSCAFMWSCA: Framed, Multi-Word String Compare Analyzer
FWAnalyzerFWAnalyzer: Frame and Word based Analyzer
GreaterCachedESTInfoFunctor for CachedESTInfo sorting
HeuristicThe base class of all heuristics
HeuristicChainClass that manages a list of heuristics
HeuristicFactory
InteractiveConsoleAn interactive console for manually studying ESTs
LCFilterA filter to weed out reads with Low Complexity (LC) sections
LengthFilterA simple filter to filter out reads shorter than a given length
LessCachedESTInfoFunctor for CachedESTInfo sorting
EST::LessESTFunctor for EST sorting
MatrixFileAnalyzerMatrixFileAnalyzer: EST Analyzer that simply obtains distances from a matrix file for processing
MPIStatsA non-instantiable wrapper class to track MPI-related statistics
MSTClass to represent a Minimum Spanning Tree (MST)
MSTCacheA cache to maintain similarity/distance metrics to build a Minimum Spanning Tree (MST)
MSTClusterClass to encapsulate cluster information and aid in building clusters using Minimum Spanning Tree (MST) data
MSTClusterMakerA Minimum Spanning Tree (MST) based parallel cluster maker
MSTHeapCacheA cache to maintain similarity/distance metrics to build a Minimum Spanning Tree (MST) using a heap
MSTMultiListCacheA cache that uses multiple lists to maintain similarity/distance metrics to build a Minimum Spanning Tree (MST)
MSTNodeA simple class to represent a MSTNode
NewUVHeuristicHeuristic based upon the "u/v sample heuristic" used in WCD, a type of common word heuristic
ESTCodec::NormalEncoder< Shift, Mask >A functor to generate a encoded word (serves as a hash entry)
ParameterSetSimple class to encapsulate a set of parameters for analyzers and/or heuristics
ParameterSetManagerClass that manages a list of parameter sets
PartitionDataA simple class to encapsulate data regarding a partition in the PMSTClusterMaker owned by a particular process
PMSTClusterMakerA Minimum Spanning Tree (MST) based parallel cluster maker
PMSTHeapCacheA version of the MSTHeapCache that is specialized to work with the Partitioned MST Cluster Maker
ResultLog
ESTCodec::RevCompEncoder< Shift, Mask >A functor to generate a encoded word (serves as a hash entry)
TransCacheEntryClass to encapsulate information needed to apply conditional-transitivity
TransMSTClusterMakerA Minimum Spanning Tree (MST) based parallel cluster maker that uses conditional-transitivity relations to accelerate clustering
TVHeuristicHeuristic based upon the T/V heuristic used in WCD, a type of common word heuristic
TwoPassD2EST Analyzer that uses the D2 algorithm in both its symmetric and asymmetric variations to compute distance between two ESTs
UVSampleHeuristicHeuristic based upon the "u/v sample heuristic" used in WCD, a type of common word heuristic

Generated on 19 Mar 2010 for PEACE by  doxygen 1.6.1