All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
NetworKit::QuadNode< T, poincare > Member List

This is the complete list of members for NetworKit::QuadNode< T, poincare >, including all inherited members.

addContent(T input, double angle, double R)NetworKit::QuadNode< T, poincare >inline
childrenNetworKit::QuadNode< T, poincare >
countLeaves() const NetworKit::QuadNode< T, poincare >inline
getAppropriateLeaf(double angle, double r)NetworKit::QuadNode< T, poincare >inline
getCellID(double phi, double r) const NetworKit::QuadNode< T, poincare >inline
getCoordinates(vector< double > &anglesContainer, vector< double > &radiiContainer) const NetworKit::QuadNode< T, poincare >inline
getElements() const NetworKit::QuadNode< T, poincare >inline
getElementsInEuclideanCircle(Point2D< double > center, double radius, vector< T > &result, double minAngle=0, double maxAngle=2 *M_PI, double lowR=0, double highR=1) const NetworKit::QuadNode< T, poincare >inline
getElementsProbabilistically(Point2D< double > euQuery, std::function< double(double)> prob, bool suppressLeft, vector< T > &result) const NetworKit::QuadNode< T, poincare >inline
getID() const NetworKit::QuadNode< T, poincare >inline
getLeftAngle() const NetworKit::QuadNode< T, poincare >inline
getMaxIDInSubtree() const NetworKit::QuadNode< T, poincare >inline
getMaxR() const NetworKit::QuadNode< T, poincare >inline
getMinR() const NetworKit::QuadNode< T, poincare >inline
getRightAngle() const NetworKit::QuadNode< T, poincare >inline
height() const NetworKit::QuadNode< T, poincare >inline
hyperbolicDistances(double phi, double r) const NetworKit::QuadNode< T, poincare >inline
indexSubtree(index nextID)NetworKit::QuadNode< T, poincare >inline
maybeGetKthElement(double upperBound, Point2D< double > euQuery, std::function< double(double)> prob, index k, vector< T > &circleDenizens) const NetworKit::QuadNode< T, poincare >inline
outOfReach(Point2D< double > query, double radius) const NetworKit::QuadNode< T, poincare >inline
outOfReach(double angle_c, double r_c, double radius) const NetworKit::QuadNode< T, poincare >inline
QuadNode()NetworKit::QuadNode< T, poincare >inline
QuadNode(double leftAngle, double minR, double rightAngle, double maxR, unsigned capacity=1000, bool splitTheoretical=false, double alpha=1, double balance=0.5)NetworKit::QuadNode< T, poincare >inline
QuadTreeGTest classNetworKit::QuadNode< T, poincare >friend
recount()NetworKit::QuadNode< T, poincare >inline
reindex(count offset)NetworKit::QuadNode< T, poincare >inline
removeContent(T input, double angle, double R)NetworKit::QuadNode< T, poincare >inline
responsible(double angle, double r) const NetworKit::QuadNode< T, poincare >inline
size() const NetworKit::QuadNode< T, poincare >inline
split()NetworKit::QuadNode< T, poincare >inline
trim()NetworKit::QuadNode< T, poincare >inline