#include <vector>
#include <stack>
#include <iostream>
#include "fastjet/internal/ClosestPair2DBase.hh"
#include "fastjet/internal/SearchTree.hh"
#include "fastjet/internal/MinHeap.hh"
Include dependency graph for ClosestPair2D.hh:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Namespaces | |
namespace | fastjet |
Classes | |
class | fastjet::ClosestPair2D |
concrete implementation for finding closest pairs in 2D -- will use Chan's (hopefully efficient) shuffle based structures More... | |
class | fastjet::ClosestPair2D::triplet< T > |
since sets of three objects will crop up repeatedly, useful to have a triplet class? More... | |
class | fastjet::ClosestPair2D::Shuffle |
class that will take care of ordering of shuffles for us More... | |
class | fastjet::ClosestPair2D::Point |
class for representing all info needed about a point More... | |
Functions | |
bool | fastjet::floor_ln2_less (unsigned x, unsigned y) |
returns true if floor(ln_base2(x)) < floor(ln_base2(y)), using Chan's neat trick. |