kdtree

Bindings for numeric::kdtree namespace

class pyrosetta.rosetta.numeric.kdtree.CompareKDPoints

Bases: pybind11_object

class pyrosetta.rosetta.numeric.kdtree.HyperRectangle

Bases: pybind11_object

assign(self: pyrosetta.rosetta.numeric.kdtree.HyperRectangle, : pyrosetta.rosetta.numeric.kdtree.HyperRectangle) → pyrosetta.rosetta.numeric.kdtree.HyperRectangle

C++: numeric::kdtree::HyperRectangle::operator=(const class numeric::kdtree::HyperRectangle &) –> class numeric::kdtree::HyperRectangle &

extend(self: pyrosetta.rosetta.numeric.kdtree.HyperRectangle, pt: pyrosetta.rosetta.utility.vector1_double) → None

C++: numeric::kdtree::HyperRectangle::extend(const class utility::vector1<double, class std::allocator<double> > &) –> void

lower(self: pyrosetta.rosetta.numeric.kdtree.HyperRectangle) → pyrosetta.rosetta.utility.vector1_double

C++: numeric::kdtree::HyperRectangle::lower() const –> class utility::vector1<double, class std::allocator<double> >

ndim(self: pyrosetta.rosetta.numeric.kdtree.HyperRectangle) → int

C++: numeric::kdtree::HyperRectangle::ndim() const –> unsigned long

show(self: pyrosetta.rosetta.numeric.kdtree.HyperRectangle, out: pyrosetta.rosetta.std.ostream) → None

C++: numeric::kdtree::HyperRectangle::show(std::ostream &) const –> void

upper(self: pyrosetta.rosetta.numeric.kdtree.HyperRectangle) → pyrosetta.rosetta.utility.vector1_double

C++: numeric::kdtree::HyperRectangle::upper() const –> class utility::vector1<double, class std::allocator<double> >

class pyrosetta.rosetta.numeric.kdtree.KDNode

Bases: pybind11_object

distance(*args, **kwargs)

Overloaded function.

1. distance(self: pyrosetta.rosetta.numeric.kdtree.KDNode) -> float

C++: numeric::kdtree::KDNode::distance() const –> double

2. distance(self: pyrosetta.rosetta.numeric.kdtree.KDNode, new_dist: float) -> None

C++: numeric::kdtree::KDNode::distance(double) –> void

is_leaf(self: pyrosetta.rosetta.numeric.kdtree.KDNode) → bool

Returns true if this node has no children, false otherwise.

C++: numeric::kdtree::KDNode::is_leaf() const –> bool

is_root(self: pyrosetta.rosetta.numeric.kdtree.KDNode) → bool

Returns true if this node has no parent, false otherwise.

C++: numeric::kdtree::KDNode::is_root() const –> bool

left_child(*args, **kwargs)

Overloaded function.

1. left_child(self: pyrosetta.rosetta.numeric.kdtree.KDNode) -> pyrosetta.rosetta.numeric.kdtree.KDNode

Returns the left child of this KDNode in the tree,

or NULL if there is no left child.

C++: numeric::kdtree::KDNode::left_child() const –> class std::shared_ptr<class numeric::kdtree::KDNode>

2. left_child(self: pyrosetta.rosetta.numeric.kdtree.KDNode, new_left_child: pyrosetta.rosetta.numeric.kdtree.KDNode) -> None

Sets the left child for this node.

C++: numeric::kdtree::KDNode::left_child(class std::shared_ptr<class numeric::kdtree::KDNode>) –> void

location(*args, **kwargs)

Overloaded function.

1. location(self: pyrosetta.rosetta.numeric.kdtree.KDNode) -> pyrosetta.rosetta.utility.vector1_double

Returns the location of this node in k-space.

C++: numeric::kdtree::KDNode::location() const –> class utility::vector1<double, class std::allocator<double> >

2. location(self: pyrosetta.rosetta.numeric.kdtree.KDNode, new_location: pyrosetta.rosetta.utility.vector1_double) -> None

Sets the location of this node in k-space.

C++: numeric::kdtree::KDNode::location(class utility::vector1<double, class std::allocator<double> >) –> void

parent(*args, **kwargs)

Overloaded function.

1. parent(self: pyrosetta.rosetta.numeric.kdtree.KDNode) -> pyrosetta.rosetta.numeric.kdtree.KDNode

Returns the parent of this KDNode in the tree,

or NULL if there is no parent.

C++: numeric::kdtree::KDNode::parent() const –> class std::shared_ptr<class numeric::kdtree::KDNode>

2. parent(self: pyrosetta.rosetta.numeric.kdtree.KDNode, new_parent: pyrosetta.rosetta.numeric.kdtree.KDNode) -> None

Sets the parent for this node.

C++: numeric::kdtree::KDNode::parent(class std::shared_ptr<class numeric::kdtree::KDNode>) –> void

point(*args, **kwargs)

Overloaded function.

1. point(self: pyrosetta.rosetta.numeric.kdtree.KDNode) -> pyrosetta.rosetta.numeric.kdtree.KDPoint

C++: numeric::kdtree::KDNode::point() const –> class std::shared_ptr<class numeric::kdtree::KDPoint>

2. point(self: pyrosetta.rosetta.numeric.kdtree.KDNode, new_point: pyrosetta.rosetta.numeric.kdtree.KDPoint) -> None

C++: numeric::kdtree::KDNode::point(class std::shared_ptr<class numeric::kdtree::KDPoint>) –> void

right_child(*args, **kwargs)

Overloaded function.

1. right_child(self: pyrosetta.rosetta.numeric.kdtree.KDNode) -> pyrosetta.rosetta.numeric.kdtree.KDNode

Returns the right child of this KDNode in the tree,

or NULL if there is no right child.

C++: numeric::kdtree::KDNode::right_child() const –> class std::shared_ptr<class numeric::kdtree::KDNode>

2. right_child(self: pyrosetta.rosetta.numeric.kdtree.KDNode, new_right_child: pyrosetta.rosetta.numeric.kdtree.KDNode) -> None

Sets the right child for this node.

C++: numeric::kdtree::KDNode::right_child(class std::shared_ptr<class numeric::kdtree::KDNode>) –> void

split_axis(*args, **kwargs)

Overloaded function.

1. split_axis(self: pyrosetta.rosetta.numeric.kdtree.KDNode) -> int

Returns the dimension along which this node splits points.

C++: numeric::kdtree::KDNode::split_axis() const –> unsigned long

2. split_axis(self: pyrosetta.rosetta.numeric.kdtree.KDNode, axis: int) -> None

Sets the dimension along which this node splits points.

C++: numeric::kdtree::KDNode::split_axis(unsigned long) –> void

tree(self: pyrosetta.rosetta.numeric.kdtree.KDNode) → pyrosetta.rosetta.numeric.kdtree.KDTree

Returns a const reference to the Tree that contains

this KDNode.

C++: numeric::kdtree::KDNode::tree() const –> const class numeric::kdtree::KDTree &

class pyrosetta.rosetta.numeric.kdtree.KDPoint

Bases: pybind11_object

assign(self: pyrosetta.rosetta.numeric.kdtree.KDPoint, src: pyrosetta.rosetta.numeric.kdtree.KDPoint) → pyrosetta.rosetta.numeric.kdtree.KDPoint

Assignment operator for KDPoint class.

C++: numeric::kdtree::KDPoint::operator=(const class numeric::kdtree::KDPoint &) –> class numeric::kdtree::KDPoint &

const_location(self: pyrosetta.rosetta.numeric.kdtree.KDPoint) → pyrosetta.rosetta.utility.vector1_double

Returns a const reference to the location of this point in

k-space.

C++: numeric::kdtree::KDPoint::const_location() const –> const class utility::vector1<double, class std::allocator<double> > &

distance(*args, **kwargs)

Overloaded function.

1. distance(self: pyrosetta.rosetta.numeric.kdtree.KDPoint) -> float

getter for distance() from this point to an arbitrary point

in kd-space.

C++: numeric::kdtree::KDPoint::distance() const –> double

2. distance(self: pyrosetta.rosetta.numeric.kdtree.KDPoint, dist: float) -> None

Sets the distance to an arbitrary point.

C++: numeric::kdtree::KDPoint::distance(double) –> void

location(*args, **kwargs)

Overloaded function.

1. location(self: pyrosetta.rosetta.numeric.kdtree.KDPoint) -> pyrosetta.rosetta.utility.vector1_double

Returns to the location of this point in k-space.

C++: numeric::kdtree::KDPoint::location() const –> class utility::vector1<double, class std::allocator<double> >

2. location(self: pyrosetta.rosetta.numeric.kdtree.KDPoint, dat: pyrosetta.rosetta.utility.vector1_double) -> None

sets the location of this point in k-space.

C++: numeric::kdtree::KDPoint::location(class utility::vector1<double, class std::allocator<double> >) –> void

read_data(self: pyrosetta.rosetta.numeric.kdtree.KDPoint, in: pyrosetta.rosetta.std.istream) → None

Reads the definition for this object from the given istream.

C++: numeric::kdtree::KDPoint::read_data(std::istream &) –> void

show(self: pyrosetta.rosetta.numeric.kdtree.KDPoint, out: pyrosetta.rosetta.std.ostream) → None

Prints the definition of this object to the given ostream.

C++: numeric::kdtree::KDPoint::show(std::ostream &) const –> void

size(self: pyrosetta.rosetta.numeric.kdtree.KDPoint) → int

Returns the number of dimensions for the space in which this point

lives.

C++: numeric::kdtree::KDPoint::size() const –> unsigned long

to_string(self: pyrosetta.rosetta.numeric.kdtree.KDPoint) → str

Returns a stringified version of this object.

C++: numeric::kdtree::KDPoint::to_string() const –> std::string

class pyrosetta.rosetta.numeric.kdtree.KDPointList

Bases: pybind11_object

Class for keeping track of the closest N KDPoint objects by distance.

assign(self: pyrosetta.rosetta.numeric.kdtree.KDPointList, : pyrosetta.rosetta.numeric.kdtree.KDPointList) → pyrosetta.rosetta.numeric.kdtree.KDPointList

C++: numeric::kdtree::KDPointList::operator=(const class numeric::kdtree::KDPointList &) –> class numeric::kdtree::KDPointList &

distance_cutoff(*args, **kwargs)

Overloaded function.

1. distance_cutoff(self: pyrosetta.rosetta.numeric.kdtree.KDPointList) -> float

C++: numeric::kdtree::KDPointList::distance_cutoff() const –> double

2. distance_cutoff(self: pyrosetta.rosetta.numeric.kdtree.KDPointList, cutoff: float) -> None

C++: numeric::kdtree::KDPointList::distance_cutoff(const double) –> void

insert(self: pyrosetta.rosetta.numeric.kdtree.KDPointList, pt: pyrosetta.rosetta.numeric.kdtree.KDPoint) → None

C++: numeric::kdtree::KDPointList::insert(class std::shared_ptr<class numeric::kdtree::KDPoint>) –> void

max_values(self: pyrosetta.rosetta.numeric.kdtree.KDPointList) → int

C++: numeric::kdtree::KDPointList::max_values() const –> unsigned long

merge(self: pyrosetta.rosetta.numeric.kdtree.KDPointList, other: pyrosetta.rosetta.numeric.kdtree.KDPointList) → None

merge another KDPointList with this KDPointList.

This calls insert which is a little slow, and is a candidate for optimization if the insert() method shows up in profiling.

C++: numeric::kdtree::KDPointList::merge(const class numeric::kdtree::KDPointList &) –> void

show(self: pyrosetta.rosetta.numeric.kdtree.KDPointList, out: pyrosetta.rosetta.std.ostream) → None

C++: numeric::kdtree::KDPointList::show(std::ostream &) const –> void

size(self: pyrosetta.rosetta.numeric.kdtree.KDPointList) → int

C++: numeric::kdtree::KDPointList::size() const –> unsigned long

sorted_values(self: pyrosetta.rosetta.numeric.kdtree.KDPointList) → pyrosetta.rosetta.utility.vector1_std_shared_ptr_numeric_kdtree_KDPoint_t

C++: numeric::kdtree::KDPointList::sorted_values() –> class utility::vector1<class std::shared_ptr<class numeric::kdtree::KDPoint>, class std::allocator<class std::shared_ptr<class numeric::kdtree::KDPoint> > >

worst_distance(self: pyrosetta.rosetta.numeric.kdtree.KDPointList) → float

C++: numeric::kdtree::KDPointList::worst_distance() const –> double

class pyrosetta.rosetta.numeric.kdtree.KDPoint_MinDist

Bases: pybind11_object

class pyrosetta.rosetta.numeric.kdtree.KDTree

Bases: pybind11_object

assign(self: pyrosetta.rosetta.numeric.kdtree.KDTree, : pyrosetta.rosetta.numeric.kdtree.KDTree) → pyrosetta.rosetta.numeric.kdtree.KDTree

C++: numeric::kdtree::KDTree::operator=(const class numeric::kdtree::KDTree &) –> class numeric::kdtree::KDTree &

bounds(self: pyrosetta.rosetta.numeric.kdtree.KDTree) → pyrosetta.rosetta.numeric.kdtree.HyperRectangle

Returns the HyperRectangle that bounds all of the points in the

kd-tree.

A HyperRectangle is defined as two vectors upper and lower, with each dimension of lower having the minimum value seen in each dimension, and each dimension of higher having the maximum value seen in each dimension.

C++: numeric::kdtree::KDTree::bounds() const –> class std::shared_ptr<class numeric::kdtree::HyperRectangle>

extend_bounds(self: pyrosetta.rosetta.numeric.kdtree.KDTree, pt: pyrosetta.rosetta.utility.vector1_double) → None

Pushes out the bounds of the HyperRectangle bounding this kd-tree

if necessary.

C++: numeric::kdtree::KDTree::extend_bounds(const class utility::vector1<double, class std::allocator<double> > &) –> void

ndim(self: pyrosetta.rosetta.numeric.kdtree.KDTree) → int

Number of dimensions in the kd-tree. This is the “k” in kd.

C++: numeric::kdtree::KDTree::ndim() const –> unsigned long

root(*args, **kwargs)

Overloaded function.

1. root(self: pyrosetta.rosetta.numeric.kdtree.KDTree) -> numeric::kdtree::KDNode

Returns the KDNodeOP that is the root of the balanced kd-tree.

C++: numeric::kdtree::KDTree::root() const –> class std::shared_ptr<class numeric::kdtree::KDNode>

2. root(self: pyrosetta.rosetta.numeric.kdtree.KDTree, new_root: numeric::kdtree::KDNode) -> None

Sets the root of the kd-tree.

C++: numeric::kdtree::KDTree::root(class std::shared_ptr<class numeric::kdtree::KDNode>) –> void

size(*args, **kwargs)

Overloaded function.

1. size(self: pyrosetta.rosetta.numeric.kdtree.KDTree) -> int

Number of points in the kd-tree.

C++: numeric::kdtree::KDTree::size() const –> unsigned long

2. size(self: pyrosetta.rosetta.numeric.kdtree.KDTree, new_size: int) -> None

Sets the number of points in this kd-tree.

C++: numeric::kdtree::KDTree::size(unsigned long) –> void

pyrosetta.rosetta.numeric.kdtree.construct_kd_tree(points: pyrosetta.rosetta.utility.vector1_std_shared_ptr_numeric_kdtree_KDPoint_t, depth: int, tree: pyrosetta.rosetta.numeric.kdtree.KDTree) → pyrosetta.rosetta.numeric.kdtree.KDNode

Function for constructing a KDTree. Returns a KDNodeOP that

represents the root of the tree. Points need to be sorted as the tree is being constructed, so the reference to the points is non-const.

C++: numeric::kdtree::construct_kd_tree(class utility::vector1<class std::shared_ptr<class numeric::kdtree::KDPoint>, class std::allocator<class std::shared_ptr<class numeric::kdtree::KDPoint> > > &, unsigned long, class numeric::kdtree::KDTree &) –> class std::shared_ptr<class numeric::kdtree::KDNode>

pyrosetta.rosetta.numeric.kdtree.get_percentile_bounds(points: pyrosetta.rosetta.utility.vector1_utility_vector1_double_std_allocator_double_t) → pyrosetta.rosetta.numeric.kdtree.HyperRectangle

C++: numeric::kdtree::get_percentile_bounds(class utility::vector1<class utility::vector1<double, class std::allocator<double> >, class std::allocator<class utility::vector1<double, class std::allocator<double> > > > &) –> class std::shared_ptr<class numeric::kdtree::HyperRectangle>

pyrosetta.rosetta.numeric.kdtree.hr_intersects_hs(hr: pyrosetta.rosetta.numeric.kdtree.HyperRectangle, pt: pyrosetta.rosetta.utility.vector1_double, r: float) → bool

returns true if the given hyper-rectangle intersects with the given

hypersphere.

C++: numeric::kdtree::hr_intersects_hs(class numeric::kdtree::HyperRectangle, const class utility::vector1<double, class std::allocator<double> > &, const double) –> bool

pyrosetta.rosetta.numeric.kdtree.is_legal_greater_than(current: pyrosetta.rosetta.numeric.kdtree.KDNode, split_axis: int, split_value: float) → bool

C++: numeric::kdtree::is_legal_greater_than(const class std::shared_ptr<class numeric::kdtree::KDNode> &, const unsigned long, const double) –> bool

pyrosetta.rosetta.numeric.kdtree.is_legal_kdtree_below_node(current: pyrosetta.rosetta.numeric.kdtree.KDNode) → bool

C++: numeric::kdtree::is_legal_kdtree_below_node(const class std::shared_ptr<class numeric::kdtree::KDNode> &) –> bool

pyrosetta.rosetta.numeric.kdtree.is_legal_less_than(current: pyrosetta.rosetta.numeric.kdtree.KDNode, split_axis: int, split_value: float) → bool

C++: numeric::kdtree::is_legal_less_than(const class std::shared_ptr<class numeric::kdtree::KDNode> &, const unsigned long, const double) –> bool

pyrosetta.rosetta.numeric.kdtree.make_points(points: pyrosetta.rosetta.utility.vector1_utility_vector1_double_std_allocator_double_t) → pyrosetta.rosetta.utility.vector1_std_shared_ptr_numeric_kdtree_KDPoint_t

Makes a vector of KDPoints.

C++: numeric::kdtree::make_points(const class utility::vector1<class utility::vector1<double, class std::allocator<double> >, class std::allocator<class utility::vector1<double, class std::allocator<double> > > > &) –> class utility::vector1<class std::shared_ptr<class numeric::kdtree::KDPoint>, class std::allocator<class std::shared_ptr<class numeric::kdtree::KDPoint> > >

pyrosetta.rosetta.numeric.kdtree.nearest_neighbor(*args, **kwargs)

Overloaded function.

1. nearest_neighbor(tree: pyrosetta.rosetta.numeric.kdtree.KDTree, pt: pyrosetta.rosetta.utility.vector1_double, nearest: pyrosetta.rosetta.numeric.kdtree.KDNode, dist_sq: float) -> None

Searches the KDtree for the nearest neigbor to a given input point,

returns nearest neighbor and distance-squared to nearest neigbor by reference.

C++: numeric::kdtree::nearest_neighbor(class numeric::kdtree::KDTree &, const class utility::vector1<double, class std::allocator<double> > &, class std::shared_ptr<class numeric::kdtree::KDNode> &, double &) –> void

2. nearest_neighbor(current: pyrosetta.rosetta.numeric.kdtree.KDNode, pt: pyrosetta.rosetta.utility.vector1_double, bounds: pyrosetta.rosetta.numeric.kdtree.HyperRectangle, max_dist_sq: float, nearest: pyrosetta.rosetta.numeric.kdtree.KDNode, dist_sq: float) -> None

returns the nearest neighbor to the given point.

Parameters are (in order): - current: the base of the tree - pt: the point that is being searched against the tree - bounds: hyper-rectangle in k-space that bounds all points in the tree - max_dist_sq: maximum squared distance that we care about.

• nearest neighbor (returned by reference)

• squared distance to the nearest neighbor

C++: numeric::kdtree::nearest_neighbor(class std::shared_ptr<class numeric::kdtree::KDNode> &, const class utility::vector1<double, class std::allocator<double> > &, class numeric::kdtree::HyperRectangle &, double, class std::shared_ptr<class numeric::kdtree::KDNode> &, double &) –> void

pyrosetta.rosetta.numeric.kdtree.nearest_neighbors(*args, **kwargs)

Overloaded function.

1. nearest_neighbors(tree: pyrosetta.rosetta.numeric.kdtree.KDTree, pt: pyrosetta.rosetta.utility.vector1_double, wanted: int) -> pyrosetta.rosetta.numeric.kdtree.KDPointList

Returns a KDPointList of the N nearest neighbors from the KDTree to

the given input point.

C++: numeric::kdtree::nearest_neighbors(class numeric::kdtree::KDTree &, const class utility::vector1<double, class std::allocator<double> > &, const unsigned long) –> class numeric::kdtree::KDPointList

2. nearest_neighbors(tree: pyrosetta.rosetta.numeric.kdtree.KDTree, pt: pyrosetta.rosetta.utility.vector1_double, wanted: int, max_dist_allowed: float) -> pyrosetta.rosetta.numeric.kdtree.KDPointList

C++: numeric::kdtree::nearest_neighbors(class numeric::kdtree::KDTree &, const class utility::vector1<double, class std::allocator<double> > &, const unsigned long, const double) –> class numeric::kdtree::KDPointList

3. nearest_neighbors(current: pyrosetta.rosetta.numeric.kdtree.KDNode, pt: pyrosetta.rosetta.utility.vector1_double, bounds: pyrosetta.rosetta.numeric.kdtree.HyperRectangle, max_dist_sq: float, neighbors: pyrosetta.rosetta.numeric.kdtree.KDPointList) -> None

Recursive function definition for search for a list of the N nearest

neighbors, where N is defined as a member variable of the KDPointList object.

C++: numeric::kdtree::nearest_neighbors(class std::shared_ptr<class numeric::kdtree::KDNode> &, const class utility::vector1<double, class std::allocator<double> > &, class numeric::kdtree::HyperRectangle &, double, class numeric::kdtree::KDPointList &) –> void

pyrosetta.rosetta.numeric.kdtree.print_point(out: pyrosetta.rosetta.std.ostream, point: pyrosetta.rosetta.utility.vector1_double) → None

C++: numeric::kdtree::print_point(std::ostream &, const class utility::vector1<double, class std::allocator<double> > &) –> void

pyrosetta.rosetta.numeric.kdtree.print_points(out: pyrosetta.rosetta.std.ostream, points: pyrosetta.rosetta.utility.vector1_utility_vector1_double_std_allocator_double_t) → None

C++: numeric::kdtree::print_points(std::ostream &, const class utility::vector1<class utility::vector1<double, class std::allocator<double> >, class std::allocator<class utility::vector1<double, class std::allocator<double> > > > &) –> void

pyrosetta.rosetta.numeric.kdtree.print_tree(*args, **kwargs)

Overloaded function.

1. print_tree(out: pyrosetta.rosetta.std.ostream, current: pyrosetta.rosetta.numeric.kdtree.KDNode, current_depth: int) -> None

2. print_tree(out: pyrosetta.rosetta.std.ostream, current: pyrosetta.rosetta.numeric.kdtree.KDNode, current_depth: int, width: int) -> None

C++: numeric::kdtree::print_tree(std::ostream &, const class std::shared_ptr<class numeric::kdtree::KDNode> &, unsigned long, const unsigned long) –> void

pyrosetta.rosetta.numeric.kdtree.sq_vec_distance(vec1: pyrosetta.rosetta.utility.vector1_double, vec2: pyrosetta.rosetta.utility.vector1_double) → float

Returns the square of the Euclidean distance between the two points

vec1 and vec2.

C++: numeric::kdtree::sq_vec_distance(const class utility::vector1<double, class std::allocator<double> > &, const class utility::vector1<double, class std::allocator<double> > &) –> double

pyrosetta.rosetta.numeric.kdtree.transform_percentile(*args, **kwargs)

Overloaded function.

1. transform_percentile(points: pyrosetta.rosetta.utility.vector1_utility_vector1_double_std_allocator_double_t) -> None

Transforms the list of points given into percentiles using

a linear mapping from the input space to percentile-space for each variable.

For each variable X in row R, replaces X with the quantity ( X - min(R) ) / ( max(R) - min(R) ). Runs in O(N) time.

C++: numeric::kdtree::transform_percentile(class utility::vector1<class utility::vector1<double, class std::allocator<double> >, class std::allocator<class utility::vector1<double, class std::allocator<double> > > > &) –> void

2. transform_percentile(points: pyrosetta.rosetta.utility.vector1_utility_vector1_double_std_allocator_double_t, bounds: pyrosetta.rosetta.numeric.kdtree.HyperRectangle) -> None

C++: numeric::kdtree::transform_percentile(class utility::vector1<class utility::vector1<double, class std::allocator<double> >, class std::allocator<class utility::vector1<double, class std::allocator<double> > > > &, class std::shared_ptr<class numeric::kdtree::HyperRectangle>) –> void

pyrosetta.rosetta.numeric.kdtree.transform_percentile_single_pt(point: pyrosetta.rosetta.utility.vector1_double, bounds: pyrosetta.rosetta.numeric.kdtree.HyperRectangle) → None

C++: numeric::kdtree::transform_percentile_single_pt(class utility::vector1<double, class std::allocator<double> > &, class std::shared_ptr<class numeric::kdtree::HyperRectangle>) –> void

pyrosetta.rosetta.numeric.kdtree.vec_distance(vec1: pyrosetta.rosetta.utility.vector1_double, vec2: pyrosetta.rosetta.utility.vector1_double) → float

Returns the Euclidean distance between the two points vec1 and vec2.

C++: numeric::kdtree::vec_distance(const class utility::vector1<double, class std::allocator<double> > &, const class utility::vector1<double, class std::allocator<double> > &) –> double