|
| template<bool FastAsSonic, class Geometry > |
| float | distance (Geometry const &query, DistanceInterpolate interpolate=DistanceInterpolate::ALL, float max_distance=std::numeric_limits< float >::max(), float epsilon=0.0f, NearestSearchAlgorithm search_alg=NearestSearchAlgorithm::DEPTH_FIRST) const |
| |
| template<class Geometry , class Predicate = pred::Leaf, std::enable_if_t< pred::is_pred_v< Predicate >, bool > = true> |
| float | distance (Geometry const &query, Predicate const &pred=pred::Leaf(), DistanceInterpolate interpolate=DistanceInterpolate::ALL, float max_distance=std::numeric_limits< float >::max(), float epsilon=0.0f, NearestSearchAlgorithm search_alg=NearestSearchAlgorithm::DEPTH_FIRST) const |
| |
| template<bool FastAsSonic, class NodeType , class Geometry , std::enable_if_t< Tree::template is_node_type_v< NodeType >, bool > = true> |
| float | distance (NodeType node, Geometry const &query, DistanceInterpolate interpolate=DistanceInterpolate::ALL, float max_distance=std::numeric_limits< float >::max(), float epsilon=0.0f, NearestSearchAlgorithm search_alg=NearestSearchAlgorithm::DEPTH_FIRST) const |
| |
| template<class NodeType , class Pred , class Geometry , std::enable_if_t< Tree::template is_node_type_v< NodeType >, bool > = true, std::enable_if_t< pred::is_pred_v< Predicate >, bool > = true> |
| float | distance (NodeType node, Predicate const &pred, Geometry const &query, DistanceInterpolate interpolate=DistanceInterpolate::ALL, float max_distance=std::numeric_limits< float >::max(), float epsilon=0.0f, NearestSearchAlgorithm search_alg=NearestSearchAlgorithm::DEPTH_FIRST) const |
| |
| template<class NodeType , std::enable_if_t< Tree::template is_node_type_v< NodeType >, bool > = true> |
| DistanceBounds | distanceBounds (NodeType node) const |
| |
| template<class NodeType , std::enable_if_t< Tree::template is_node_type_v< NodeType >, bool > = true> |
| bool | distanceContainsSurface (NodeType node) const |
| |
| template<class NodeType , std::enable_if_t< Tree::template is_node_type_v< NodeType >, bool > = true> |
| DistanceInfo< Dim > | distanceInfo (NodeType node) const |
| |
| template<bool FastAsSonic, class Geometry > |
| std::pair< float, Index > | distancePoint (Geometry const &query, DistanceInterpolate interpolate=DistanceInterpolate::ALL, float max_distance=std::numeric_limits< float >::max(), float epsilon=0.0f, NearestSearchAlgorithm search_alg=NearestSearchAlgorithm::DEPTH_FIRST) const |
| |
| template<bool FastAsSonic, class NodeType , class Geometry , std::enable_if_t< Tree::template is_node_type_v< NodeType >, bool > = true> |
| std::pair< float, Index > | distancePoint (NodeType node, Geometry const &query, DistanceInterpolate interpolate=DistanceInterpolate::ALL, float max_distance=std::numeric_limits< float >::max(), float epsilon=0.0f, NearestSearchAlgorithm search_alg=NearestSearchAlgorithm::DEPTH_FIRST) const |
| |
| template<class NodeType , class Predicate , class Geometry , std::enable_if_t< Tree::template is_node_type_v< NodeType >, bool > = true, std::enable_if_t< pred::is_pred_v< Predicate >, bool > = true> |
| std::pair< float, Point > | distancePoint (NodeType node, Predicate const &pred, Geometry const &query, DistanceInterpolate interpolate=DistanceInterpolate::ALL, float max_distance=std::numeric_limits< float >::max(), float epsilon=0.0f, NearestSearchAlgorithm search_alg=NearestSearchAlgorithm::DEPTH_FIRST) const |
| |
| template<class Predicate , class Geometry , std::enable_if_t< pred::is_pred_v< Predicate >, bool > = true> |
| std::pair< float, Point > | distancePoint (Predicate const &pred, Geometry const &query, DistanceInterpolate interpolate=DistanceInterpolate::ALL, float max_distance=std::numeric_limits< float >::max(), float epsilon=0.0f, NearestSearchAlgorithm search_alg=NearestSearchAlgorithm::DEPTH_FIRST) const |
| |
| template<class NodeType , std::enable_if_t< Tree::template is_node_type_v< NodeType >, bool > = true> |
| void | distanceReset (NodeType node, bool propagate=true) |
| |
| template<class NodeType , class UnaryPred , std::enable_if_t< Tree::template is_node_type_v< NodeType >, bool > = true, std::enable_if_t< std::is_invocable_r_v< bool, UnaryPred, Index >, bool > = true> |
| void | distanceResetIf (NodeType node, UnaryPred p, bool propagate=true) |
| |
| template<class NodeType , std::enable_if_t< Tree::template is_node_type_v< NodeType >, bool > = true> |
| void | distanceSet (NodeType node, DistanceInfo< Dim > info, bool propagate=true) |
| |
| template<class NodeType , std::enable_if_t< Tree::template is_node_type_v< NodeType >, bool > = true> |
| void | distanceSet (NodeType node, Point const &point, float weight=1.0f, bool propagate=true) |
| |
| template<class NodeType , class UnaryOp , std::enable_if_t< Tree::template is_node_type_v< NodeType >, bool > = true, std::enable_if_t< std::is_invocable_r_v< DistanceInfo< Dim >, UnaryOp, Index >, bool > = true> |
| void | distanceSet (NodeType node, UnaryOp unary_op, bool propagate=true) |
| |
| template<class Geometry > |
| float | distanceSomething (Index node, Geometry const &query) const |
| |
| template<class Geometry > |
| float | distanceSquared (Index node, Geometry const &query) const |
| |
| template<class NodeType , std::enable_if_t< Tree::template is_node_type_v< NodeType >, bool > = true> |
| void | distanceUpdate (NodeType node, Point const &point, float weight=1.0f, bool propagate=true) |
| |
| template<class Geometry > |
| bool | intersects (Index node, Geometry const &query) const |
| |
|
|
| DistanceMap (DistanceMap &&other)=default |
| |
|
| DistanceMap (DistanceMap const &other)=default |
| |
| template<class Derived2 , class Tree2 , bool WithBounds2> |
| | DistanceMap (DistanceMap< Derived2, Tree2, WithBounds2 > &&other) |
| |
| template<class Derived2 , class Tree2 , bool WithBounds2> |
| | DistanceMap (DistanceMap< Derived2, Tree2, WithBounds2 > const &other) |
| |
| void | createRoot () |
| |
| constexpr Derived & | derived () |
| |
| constexpr Derived const & | derived () const |
| |
| bool | isPrunable (pos_t block) const |
| |
| void | onClear () |
| |
| void | onCreateChildren (Index node) |
| |
| void | onDisable () |
| |
| void | onDotFileInfo (std::ostream &out, Index node) const |
| |
| void | onEnable (std::size_t num_blocks) |
| |
| void | onFillChildren (Index node, pos_t children) |
| |
| void | onPruneChildren (Index node, pos_t) |
| |
| void | onRead (ReadBuffer &in, std::vector< std::pair< pos_t, BitSet< BF > > > const &nodes) |
| |
| void | onReserve (std::size_t cap) |
| |
| void | onSetSize (std::size_t size) |
| |
| void | onUpdateNode (Index node, pos_t children) |
| |
| void | onWrite (WriteBuffer &out, std::vector< std::pair< pos_t, BitSet< BF > > > const &nodes) |
| |
|
DistanceMap & | operator= (DistanceMap &&rhs)=default |
| |
|
DistanceMap & | operator= (DistanceMap const &rhs)=default |
| |
| template<class Derived2 , class Tree2 , bool WithBounds2> |
| DistanceMap & | operator= (DistanceMap< Derived2, Tree2, WithBounds2 > &&rhs) |
| |
| template<class Derived2 , class Tree2 , bool WithBounds2> |
| DistanceMap & | operator= (DistanceMap< Derived2, Tree2, WithBounds2 > const &rhs) |
| |
| constexpr std::size_t | serializedSize (std::vector< std::pair< pos_t, BitSet< BF > > > const &, std::size_t num_nodes) const |
| |
| void | swap (DistanceMap &other) noexcept(noexcept(distance_.swap(other.distance_))) |
| |
template<class Derived, class
Tree, bool WithBounds = true>
class ufo::DistanceMap< Derived, Tree, WithBounds >
Definition at line 67 of file map.hpp.