fastjet::AreaDefinition | Class that holds a generic area definition |

fastjet::BasicRandom< _Tp > | |

fastjet::BasicRandom< double > | Template specialization (double) for the BasicRandom template class |

fastjet::BasicRandom< int > | |

fastjet::ClosestPair2D | Concrete implementation for finding closest pairs in 2D -- will use Chan's (hopefully efficient) shuffle based structures |

fastjet::ClosestPair2D::Point | Class for representing all info needed about a point |

fastjet::ClosestPair2D::Shuffle | Class that will take care of ordering of shuffles for us |

fastjet::ClosestPair2D::triplet< T > | Since sets of three objects will crop up repeatedly, useful to have a triplet class? |

fastjet::ClosestPair2DBase | Abstract base class for finding closest pairs in 2D |

fastjet::ClusterSequence | Deals with clustering |

fastjet::ClusterSequence1GhostPassiveArea | Class that behaves essentially like ClusterSequence except that it also provides access to the area of a jet (which will be a random quantity |

fastjet::ClusterSequence::BriefJet | Fundamental structure which contains the minimal info about a jet, as needed for our plain N^2 algorithm -- the idea is to put all info that will be accessed N^2 times into an array of BriefJets |

fastjet::ClusterSequence::Extras | Class intended to serve as a base in case a plugin needs to associate extra information with a ClusterSequence (see SISConePlugin |

fastjet::ClusterSequence::history_element | Single element in the clustering history (see vector _history below) |

fastjet::ClusterSequence::Tile | The fundamental structures to be used for the tiled N^2 algorithm (see CCN27-44 for some discussion of pattern of tiling) |

fastjet::ClusterSequence::TiledJet | Structure analogous to BriefJet, but with the extra information needed for dealing with tiles |

fastjet::ClusterSequenceActiveArea | Class that behaves essentially like ClusterSequence except that it also provides access to the area of a jet (which will be a random quantity |

fastjet::ClusterSequenceActiveArea::GhostJet | Class for our internal storage of ghost jets |

fastjet::ClusterSequenceActiveAreaExplicitGhosts | Class that behaves essentially like ClusterSequence except that it also provides access to the area of a jet (which will be a random quantity |

fastjet::ClusterSequenceArea | |

fastjet::ClusterSequenceAreaBase | Base class that sets interface for extensions of ClusterSequence that provide information about the area of each jet; |

fastjet::ClusterSequencePassiveArea | |

fastjet::ClusterSequenceVoronoiArea | Handle the computation of Voronoi jet area |

fastjet::ClusterSequenceVoronoiArea::VoronoiAreaCalc | Class for carrying out a voronoi area calculation on a set of initial vectors |

CmdLine | Class designed to deal with command-line arguments in a fashion similar to what was done in f90 iolib |

fastjet::Coord2D | Class for representing 2d coordinates and carrying out some basic operations on them |

fastjet::Dnn2piCylinder | Class derived from DynamicNearestNeighbours that provides an implementation for the surface of cylinder (using one DnnPlane object spanning 0--2pi) |

fastjet::Dnn2piCylinder::MirrorVertexInfo | |

fastjet::Dnn3piCylinder | Class derived from DynamicNearestNeighbours that provides an implementation for the surface of cylinder (using one DnnPlane object spanning 0--3pi) |

fastjet::Dnn3piCylinder::MirrorVertexInfo | |

fastjet::Dnn4piCylinder | Class derived from DynamicNearestNeighbours that provides an implementation for the surface of cylinder (using two copies of DnnPlane, one running from 0--2pi, the other from pi--3pi) |

fastjet::DnnError | Class corresponding to errors that will be thrown by Dynamic Nearest Neighbours code |

fastjet::DnnPlane | Class derived from DynamicNearestNeighbours that provides an implementation for the Euclidean plane |

fastjet::DnnPlane::SuperVertex | Structure containing a vertex_handle and cached information on the nearest neighbour |

fastjet::DynamicNearestNeighbours | Abstract base class for quick location of nearest neighbours in a set of points, with facilities for adding and removing points from the set after initialisation |

fastjet::Edge | |

fastjet::Error | Class corresponding to errors that will be thrown by fastjet |

fastjet::EtaPhi | Use a class instead of a pair so that phi can be sanitized and put into proper range on initialization |

fastjet::Freelist | |

fastjet::Freenode | |

fastjet::FreeNodeArrayList | |

fastjet::GhostedAreaSpec | Class that defines the parameters that go into the measurement of active jet areas |

fastjet::GraphEdge | Handle an edge of the Voronoi Diagram |

fastjet::Halfedge | |

fastjet::IndexedSortHelper | Class that helps us carry out indexed sorting |

fastjet::InitialisedInt | A class to provide an "int" with an initial value |

fastjet::JetDefinition | Class that is intended to hold a full definition of the jet clusterer |

fastjet::JetDefinition::DefaultRecombiner | A class that will provide the recombination scheme facilities and/or allow a user to extend these facilities |

fastjet::JetDefinition::Plugin | Class that allows a user to introduce their own "plugin" jet finder |

fastjet::JetDefinition::Recombiner | An abstract base class that will provide the recombination scheme facilities and/or allow a user to extend these facilities |

fastjet::K | Basic geometrical kernel that lies at the base of all CGAL operations |

LimitedWarning | Class to provide facilities for giving warnings up to some maximum number of times |

fastjet::MinHeap | A class which provides a "heap"-like structure that allows access to a the minimal value of a dynamically changing set of numbers |

fastjet::MinHeap::ValueLoc | |

fastjet::Private::MirrorInfo | Class for helping us deal with mirror-image particles |

fastjet::Point | Class to handle a 2d point |

fastjet::PseudoJet | Class to contain pseudojets, including minimal information of use to to jet-clustering routines |

fastjet::RangeDefinition | Class for holding a range definition specification, given by limits on rapidity and azimuth |

fastjet::SearchTree< T > | This is the class for a search tree designed to be especially efficient when looking for successors and predecessors (to be used in Chan's CP algorithm) |

fastjet::SearchTree< T >::circulator | |

fastjet::SearchTree< T >::const_circulator | |

fastjet::SearchTree< T >::Node | |

fastjet::Site | Structure used both for particle sites and for vertices |

fastjet::VoronoiAreaSpec | Class for holding a "Voronoi area" specification; an area will be assigned to each particle, which is the area of the intersection of the particle's Voronoi cell with a circle of radius R*effective_Rfact |

fastjet::VoronoiDiagramGenerator |

Generated on Tue Dec 18 17:05:42 2007 for fastjet by 1.5.2