| ►CAccessor | |
| Cspatial::accessor_less< Accessor, Tp > | A comparator that simplifies using the spatial containers with a Key type that has coordinate that are not accessible via the bracket, parenthesis operator or iterator deference |
| Cspatial::accessor_minus< Accessor, Tp, Unit > | This functor uses the minus operator to calculate the difference between 2 elements of Tp along the dimension n accessed through a custom accessor |
| ►CBalancing | |
| Cspatial::details::Compress< Balancing, key_compare > | |
| ►CBidirectional_iterator | |
| Cspatial::equal_iterator< Container > | This type provides an iterator to iterate through all elements of a container that match a given key, passed as a parameter to the constructor |
| Cspatial::region_iterator< Ct, Predicate > | This type provides both an iterator and a constant iterator to iterate through all elements of a tree that match an orthogonal region defined by a predicate |
| Cspatial::bracket_less< Tp > | A comparator that simplifies using the spatial containers with a Key type that has coordiates accessible via the bracket operator |
| Cspatial::bracket_minus< Tp, Unit > | This functor uses the minus operator to calculate the difference between 2 elements of Tp along the dimension n accessed through the bracket operator |
| Cspatial::details::builtin_difference< typename > | This internal type casting is used to resolve a built-in compare functor (provided by the library) into a built-in difference functor |
| Cspatial::details::builtin_difference< accessor_less< Accessor, Key > > | |
| Cspatial::details::builtin_difference< bracket_less< Key > > | |
| Cspatial::details::builtin_difference< iterator_less< Key > > | |
| Cspatial::details::builtin_difference< paren_less< Key > > | |
| ►CCompare | |
| Cspatial::bounds< Key, Compare > | A model of Region Predicate that defines an orthogonal region and checks if a value of type Key is contained within the boundaries marked by lower and upper |
| Cspatial::closed_bounds< Key, Compare > | A model of Region Predicate that checks if a value of type Key is contained within the closed boundaries defined by lower and upper |
| Cspatial::enclosed_bounds< Key, Compare, Layout > | This region predicate matches keys that are enclosed or equal to a target box |
| Cspatial::open_bounds< Key, Compare > | A model of Region Predicate that checks if a value of type Key is contained within the open boundaries defined by lower and upper |
| Cspatial::overlap_bounds< Key, Compare, Layout > | This class is a model of Region Predicate that matches any keys that is overlapping with a given test box |
| Cspatial::details::condition< bool, Tp1, Tp2 > | |
| Cspatial::details::condition< false, Tp1, Tp2 > | |
| ►CConst_bidirectional_iterator | |
| Cspatial::equal_iterator< const Container > | This type provides an iterator to iterate through all elements of a container that match a given key, passed as a parameter to the constructor |
| Cspatial::neighbor_iterator< const Ct, Metric > | A spatial iterator for a container Ct that goes through the nearest to the furthest element from a target key, with distances applied according to a user-defined geometric space of type Metric |
| Cspatial::region_iterator< const Ct, Predicate > | This type provides both an iterator and a constant iterator to iterate through all elements of a tree that match an orthogonal region defined by a predicate |
| Cspatial::details::Const_node_iterator< Link > | A bidirectional iterator traversing all node in the tree in inorder traversal |
| Cspatial::container_traits< Tp > | The traits type for all containers in the spatial namespace |
| Cspatial::container_traits< const Ct > | |
| Cspatial::container_traits< Ct > | |
| ►CDiff | |
| ►Cspatial::euclidian< Ct, DistanceType, Diff > | Defines a metric working on the Euclidian space where distances are expressed in one of C++'s floating point types |
| Cspatial::details::Compress< euclidian< Ct, DistanceType, Diff >, typename spatial::container_traits< const Ct >::key_type > | |
| Cspatial::details::Compress< euclidian< Ct, DistanceType, Diff >, typename spatial::container_traits< Ct >::key_type > | |
| ►Cspatial::manhattan< Ct, DistanceType, Diff > | Defines a metric for the a space where distances are the sum of all the elements of the vector |
| Cspatial::details::Compress< manhattan< Ct, DistanceType, Diff >, typename spatial::container_traits< const Ct >::key_type > | |
| Cspatial::details::Compress< manhattan< Ct, DistanceType, Diff >, typename spatial::container_traits< Ct >::key_type > | |
| ►Cspatial::quadrance< Ct, DistanceType, Diff > | Defines a metric in the Euclidian space where only the square of the distances are being computed into a scalar value expressed with the DistanceType which is one of C++'s arithmetic types |
| Cspatial::details::Compress< quadrance< Ct, DistanceType, Diff >, typename spatial::container_traits< const Ct >::key_type > | |
| Cspatial::details::Compress< quadrance< Ct, DistanceType, Diff >, typename spatial::container_traits< Ct >::key_type > | |
| Cspatial::details::Dynamic_rank | The dimension value is stored by a member of the object, but can be modified at run time |
| Cspatial::enable_if_c< B, Tp > | If B is true, spatial::enable_if has a public member typedef type, equal to Tp; otherwise, there is no member typedef |
| ►Cspatial::enable_if_c< Cond::value, Tp > | |
| Cspatial::enable_if< Cond, Tp > | |
| Cspatial::enable_if_c< true, Tp > | |
| ►Cstd::exception | STL class |
| ►Cstd::logic_error | STL class |
| Cspatial::arithmetic_error | Thrown to report that an arithmetic error has occured during a calculation |
| Cspatial::invalid_bounds | Thrown to report that an invalid range bound has been given as argument |
| Cspatial::invalid_box | Thrown to report that a box has incorrect coordinates with regards to its layout |
| Cspatial::invalid_dimension | Thrown to report that an invalid dimension was passed as an argument |
| Cspatial::invalid_distance | Thrown to report that an negative distance has been passed as a parameter while distances are expected to be positive |
| Cspatial::invalid_empty_container | Thrown to report that an empty container was passed as an argument, while the function does not accept an empty container |
| Cspatial::invalid_iterator | Thrown to report that an invalid iterator was passed as an argument |
| Cspatial::invalid_node | Thrown to report that an invalid node was passed as an argument |
| Cspatial::invalid_odd_rank | Thrown to report that an odd rank value was passed as a argument |
| Cspatial::invalid_rank | Thrown to report that an invalid rank was passed as an argument |
| Cspatial::hhll_layout_tag | Represents a coordinate layout for the box |
| Cspatial::hlhl_layout_tag | Represents a coordinate layout for the box |
| Cspatial::iterator_less< Tp > | A comparator that simplifies using the spatial containers with a Key type that has coordiates accessible via iterator deference |
| Cspatial::iterator_minus< Tp, Unit > | This functor uses the minus operator to calculate the difference between 2 elements of Tp along the dimension n accessed through an iterator |
| Cspatial::details::Kdtree< Rank, Key, Value, Compare, Alloc > | Detailed implementation of the kd-tree |
| ►Cspatial::details::Kdtree< details::Dynamic_rank, const Key, const Key, Compare, Alloc > | |
| Cspatial::idle_box_multiset< 0, Key, Compare, Alloc > | Specialization for spatial::idle_box_multiset with runtime rank support |
| Cspatial::idle_point_multiset< 0, Key, Compare, Alloc > | Specialization for spatial::idle_point_multiset with runtime rank support |
| ►Cspatial::details::Kdtree< details::Dynamic_rank, const Key, std::pair< const Key, Mapped >, Compare, Alloc > | |
| Cspatial::idle_box_multimap< 0, Key, Mapped, Compare, Alloc > | Specialization for spatial::idle_box_multimap with runtime rank support |
| Cspatial::idle_point_multimap< 0, Key, Mapped, Compare, Alloc > | When specified with a null dimension, the rank of the point_multimap can be determined at run time and is not fixed at compile time |
| ►Cspatial::details::Kdtree< details::Static_rank< Rank >, const Key, const Key, Compare, Alloc > | |
| Cspatial::idle_box_multiset< Rank, Key, Compare, Alloc > | Non-associative containers that and store values in space that can be represented as boxes |
| Cspatial::idle_point_multiset< Rank, Key, Compare, Alloc > | |
| ►Cspatial::details::Kdtree< details::Static_rank< Rank >, const Key, std::pair< const Key, Mapped >, Compare, Alloc > | |
| Cspatial::idle_box_multimap< Rank, Key, Mapped, Compare, Alloc > | |
| Cspatial::idle_point_multimap< Rank, Key, Mapped, Compare, Alloc > | These containers are mapped containers and store values in space that can be represented as points |
| ►Ckey_compare | |
| Cspatial::details::Compress< key_compare, size_type > | |
| Cspatial::details::Kdtree< Rank, Key, Value, Compare, Alloc >::Maximum | |
| ►Ckey_compare | |
| Cspatial::details::Equal< Container > | |
| Cspatial::details::Mapping< Container > | Extra information needed by the iterator to perform its work |
| ►Ckey_compare | |
| Cspatial::details::Mapping< Ct > | |
| ►Ckey_compare | |
| Cspatial::details::Neighbor_data< const Ct, euclidian< Ct, DistanceType, Diff > > | |
| Cspatial::details::Neighbor_data< const Ct, manhattan< Ct, DistanceType, Diff > > | |
| Cspatial::details::Neighbor_data< const Ct, quadrance< Ct, DistanceType, Diff > > | |
| Cspatial::details::Neighbor_data< Ct, euclidian< Ct, DistanceType, Diff > > | |
| Cspatial::details::Neighbor_data< Ct, manhattan< Ct, DistanceType, Diff > > | |
| Cspatial::details::Neighbor_data< Ct, quadrance< Ct, DistanceType, Diff > > | |
| Cspatial::details::Neighbor_data< Ct, Metric > | Extra information needed by the iterator to perform its work |
| ►CKeyCompare | |
| Cspatial::details::ValueCompare< Value, KeyCompare > | Value compare functor for container storing pairs of (Key, Mapped) types, such as in spatial::point_multimap, spatial::box_multimap, etc |
| Cspatial::lhlh_layout_tag | Represents a coordinate layout for the box |
| ►CLink_allocator | |
| Cspatial::details::Compress< Link_allocator, spatial::details::Node< spatial::details::Kdtree_link > > | |
| Cspatial::details::Compress< Link_allocator, spatial::details::Node< spatial::details::Relaxed_kdtree_link > > | |
| Cspatial::llhh_layout_tag | Represents a coordinate layout for the box |
| Cspatial::loose_balancing | This policy triggers rebalancing for the node when the difference in weight between left or right is more than a half |
| Cspatial::details::mapping_compare< Compare, Node_ptr > | |
| Cspatial::metric_traits< Tp > | The traits type for all metrics in the spatial namespace |
| Cspatial::mode_traits< Mode > | |
| Cspatial::details::mutate< Tp > | Changes a const type into a mutable type |
| Cspatial::details::mutate< const Tp > | |
| Cspatial::details::Node< Link > | The basic node for any tree in the library |
| ►Cspatial::details::Node< Kdtree_link< Key, Value > > | |
| Cspatial::details::Kdtree_link< Key, Value > | Define the link type for a Kdtree that contains the value member |
| ►Cspatial::details::Node< Relaxed_kdtree_link< Key, Value > > | |
| Cspatial::details::Relaxed_kdtree_link< Key, Value > | Define a weighted link type for the relaxed k-d tree |
| Cspatial::details::Node< spatial::details::Kdtree_link > | |
| Cspatial::details::Node< spatial::details::Relaxed_kdtree_link > | |
| Cspatial::details::Node_iterator< Link > | A bidirectional iterator traversing all node in the tree in inorder traversal |
| ►Cpair | |
| ►Cspatial::neighbor_iterator_pair< const Ct, euclidian< Ct, DistanceType, Diff > > | |
| Cspatial::euclidian_neighbor_iterator_pair< const Ct, DistanceType, Diff > | |
| ►Cspatial::neighbor_iterator_pair< const Ct, manhattan< Ct, DistanceType, Diff > > | |
| Cspatial::manhattan_neighbor_iterator_pair< const Ct, DistanceType, Diff > | |
| ►Cspatial::neighbor_iterator_pair< const Ct, quadrance< Ct, DistanceType, Diff > > | |
| Cspatial::quadrance_neighbor_iterator_pair< const Ct, DistanceType, Diff > | |
| ►Cspatial::neighbor_iterator_pair< Ct, euclidian< Ct, DistanceType, Diff > > | |
| Cspatial::euclidian_neighbor_iterator_pair< Ct, DistanceType, Diff > | Facilitate the creation of an iterator range representing a sequence from closest to furthest from the target key position, in euclidian space |
| ►Cspatial::neighbor_iterator_pair< Ct, manhattan< Ct, DistanceType, Diff > > | |
| Cspatial::manhattan_neighbor_iterator_pair< Ct, DistanceType, Diff > | Facilitate the creation of an iterator range representing a sequence from closest to furthest from the target key position, in manhattan space |
| ►Cspatial::neighbor_iterator_pair< Ct, quadrance< Ct, DistanceType, Diff > > | |
| Cspatial::quadrance_neighbor_iterator_pair< Ct, DistanceType, Diff > | Facilitate the creation of an iterator range representing a sequence from closest to furthest from the target key position, in quadrance space |
| ►Cspatial::region_iterator_pair< Ct, closed_bounds< container_traits< Ct >::key_type, container_traits< Ct >::key_compare > > | |
| Cspatial::closed_region_iterator_pair< Ct > | |
| Cspatial::equal_iterator_pair< Container > | This structure defines a pair of mutable equal iterator |
| Cspatial::equal_iterator_pair< const Container > | This structure defines a pair of constant equal iterator |
| Cspatial::mapping_iterator_pair< Ct > | This structure defines a pair of mutable mapping iterator |
| Cspatial::mapping_iterator_pair< const Ct > | This structure defines a pair of constant mapping iterator |
| Cspatial::neighbor_iterator_pair< Ct, Metric > | This structure defines a pair of neighbor iterator |
| Cspatial::neighbor_iterator_pair< const Ct, Metric > | This structure defines a pair of constant neighbor iterator |
| Cspatial::ordered_iterator_pair< Ct > | This structure defines a pair of mutable spatial::ordered_iterator |
| Cspatial::ordered_iterator_pair< const Ct > | This structure defines a pair of constant ordered iterator |
| Cspatial::region_iterator_pair< Ct, Predicate > | This structure defines a pair of mutable region iterator |
| Cspatial::region_iterator_pair< const Ct, Predicate > | This structure defines a pair of constant region iterator |
| Cspatial::paren_less< Tp > | A comparator that simplifies using the spatial containers with a Key type that has coordiates accessible via the parenthesis operator |
| Cspatial::paren_minus< Tp, Unit > | This functor uses the minus operator to calculate the difference between 2 elements of Tp along the dimension n accessed through the parenthesis operator |
| Cspatial::perfect_balancing | A policy that balances a node if the difference in weight between left and right is higher than 2 (two) |
| Cspatial::details::Preorder_node_iterator< Link > | A forward iterator that iterates through the node of the container in preorder transversal |
| ►Crank_type | |
| Cspatial::details::Relaxed_kdtree< Rank, Key, Value, Compare, Balancing, Alloc >::Implementation | The tree header |
| ►Crank_type | |
| ►Cspatial::details::Bidirectional_iterator< container_traits< const Ct >::mode_type, container_traits< const Ct >::rank_type > | |
| ►Cspatial::neighbor_iterator< const Ct, euclidian< Ct, DistanceType, Diff > > | |
| Cspatial::euclidian_neighbor_iterator< const Ct, DistanceType, Diff > | |
| ►Cspatial::neighbor_iterator< const Ct, manhattan< Ct, DistanceType, Diff > > | |
| Cspatial::manhattan_neighbor_iterator< const Ct, DistanceType, Diff > | |
| ►Cspatial::neighbor_iterator< const Ct, quadrance< Ct, DistanceType, Diff > > | |
| Cspatial::quadrance_neighbor_iterator< const Ct, DistanceType, Diff > | |
| ►Cspatial::details::Bidirectional_iterator< container_traits< Ct >::mode_type, container_traits< Ct >::rank_type > | |
| ►Cspatial::neighbor_iterator< Ct, euclidian< Ct, DistanceType, Diff > > | |
| Cspatial::euclidian_neighbor_iterator< Ct, DistanceType, Diff > | Facilitate the creation of neighbor iterator that works with an euclidian metric |
| ►Cspatial::neighbor_iterator< Ct, manhattan< Ct, DistanceType, Diff > > | |
| Cspatial::manhattan_neighbor_iterator< Ct, DistanceType, Diff > | Facilitate the creation of neighbor iterator that works with a manhattan metric |
| ►Cspatial::neighbor_iterator< Ct, quadrance< Ct, DistanceType, Diff > > | |
| Cspatial::quadrance_neighbor_iterator< Ct, DistanceType, Diff > | Facilitate the creation of neighbor iterator that works with a quadrance metric |
| Cspatial::mapping_iterator< Ct > | This iterator walks through all items in the container in order from the lowest to the highest value along a particular dimension |
| Cspatial::neighbor_iterator< Ct, Metric > | A spatial iterator for a container Ct that goes through the nearest to the furthest element from a target key, with distances applied according to a user-defined geometric space that is a model of Metric |
| Cspatial::ordered_iterator< Ct > | All elements returned by this iterator are ordered from the smallest to the largest value of their key's coordinate along a single dimension |
| ►Cspatial::details::Const_bidirectional_iterator< container_traits< Ct >::mode_type, container_traits< Ct >::rank_type > | |
| Cspatial::mapping_iterator< const Ct > | This iterator walks through all items in the container in order from the lowest to the highest value along a particular dimension |
| Cspatial::ordered_iterator< const Ct > | All elements returned by this iterator are ordered from the smallest to the largest value of their key's coordinate along a single dimension, called the ordered dimension |
| Cspatial::details::rebind_builtin_difference< Diff, DistanceType > | If Diff is a builtin difference type, change the current unit of Diff to the DistanceType specified in the template parameter |
| Cspatial::details::rebind_builtin_difference< accessor_minus< Accessor, Tp, Unit >, DistanceType > | Specialization of rebind_builtin_difference for the built-in spatial::accessor_minus functor |
| Cspatial::details::rebind_builtin_difference< bracket_minus< Tp, Unit >, DistanceType > | Specialization of rebind_builtin_difference for the built-in spatial::bracket_minus functor |
| Cspatial::details::rebind_builtin_difference< iterator_minus< Tp, Unit >, DistanceType > | Specialization of rebind_builtin_difference for the built-in spatial::iterator_minus functor |
| Cspatial::details::rebind_builtin_difference< paren_minus< Tp, Unit >, DistanceType > | Specialization of rebind_builtin_difference for the built-in spatial::paren_minus functor |
| ►Cregion_iterator | |
| Cspatial::closed_region_iterator< Ct > | |
| Cspatial::closed_region_iterator< const Ct > | |
| Cspatial::enclosed_region_iterator< Ct, Layout > | |
| Cspatial::enclosed_region_iterator< const Ct, Layout > | |
| Cspatial::open_region_iterator< Ct > | |
| Cspatial::open_region_iterator< const Ct > | |
| Cspatial::overlap_region_iterator< Ct, Layout > | |
| Cspatial::overlap_region_iterator< const Ct, Layout > | |
| ►Cregion_iterator_pair | |
| Cspatial::closed_region_iterator_pair< const Ct > | |
| Cspatial::enclosed_region_iterator_pair< Ct, Layout > | |
| Cspatial::enclosed_region_iterator_pair< const Ct, Layout > | |
| Cspatial::open_region_iterator_pair< Ct > | |
| Cspatial::open_region_iterator_pair< const Ct > | |
| Cspatial::overlap_region_iterator_pair< Ct, Layout > | |
| Cspatial::overlap_region_iterator_pair< const Ct, Layout > | |
| Cspatial::details::relaxed_invariant_tag | The category of invariants for a k-d tree node: strict or relaxed |
| Cspatial::details::Relaxed_kdtree< Rank, Key, Value, Compare, Balancing, Alloc > | Detailed implementation of the kd-tree |
| ►Cspatial::details::Relaxed_kdtree< details::Dynamic_rank, const Key, const Key, Compare, BalancingPolicy, Alloc > | |
| Cspatial::box_multiset< 0, Key, Compare, BalancingPolicy, Alloc > | Specialization for spatial::box_multiset with runtime rank support |
| Cspatial::point_multiset< 0, Key, Compare, BalancingPolicy, Alloc > | Specialization for spatial::point_multiset with runtime rank support |
| ►Cspatial::details::Relaxed_kdtree< details::Dynamic_rank, const Key, std::pair< const Key, Mapped >, Compare, BalancingPolicy, Alloc > | |
| Cspatial::box_multimap< 0, Key, Mapped, Compare, BalancingPolicy, Alloc > | Specialization for spatial::box_multimap with runtime rank support |
| Cspatial::point_multimap< 0, Key, Mapped, Compare, BalancingPolicy, Alloc > | When specified with a null dimension, the rank of the point_multimap can be determined at run time and does not need to be fixed at compile time |
| ►Cspatial::details::Relaxed_kdtree< details::Static_rank< Rank >, const Key, const Key, Compare, BalancingPolicy, Alloc > | |
| Cspatial::box_multiset< Rank, Key, Compare, BalancingPolicy, Alloc > | These containers are not mapped containers and store values in space that can be represented as boxes |
| Cspatial::point_multiset< Rank, Key, Compare, BalancingPolicy, Alloc > | |
| ►Cspatial::details::Relaxed_kdtree< details::Static_rank< Rank >, const Key, std::pair< const Key, Mapped >, Compare, BalancingPolicy, Alloc > | |
| Cspatial::box_multimap< Rank, Key, Mapped, Compare, BalancingPolicy, Alloc > | A mapped containers to store values in space that can be represented as boxes |
| Cspatial::point_multimap< Rank, Key, Mapped, Compare, BalancingPolicy, Alloc > | These containers are mapped containers and store values in space that can be represented as points |
| Cspatial::details::Relaxed_kdtree< Rank, Key, Value, Compare, Balancing, Alloc >::safe_allocator | |
| Cspatial::details::Kdtree< Rank, Key, Value, Compare, Alloc >::safe_allocator | |
| Cspatial::details::Static_rank< Value > | The dimension value is set by a template value, thus consuming no memory |
| Cspatial::details::strict_invariant_tag | |
| Cspatial::details::template_member_assign_provider< bool, Tp > | Perform a specialized assign for empty classes |
| ►Cspatial::details::template_member_assign_provider< import::is_empty< Tp >::value, Tp > | |
| Cspatial::details::template_member_assign< Tp > | |
| Cspatial::details::template_member_assign_provider< true, Tp > | |
| Cspatial::details::template_member_swap_provider< bool, Tp > | Perform a specialized swap for empty classes |
| ►Cspatial::details::template_member_swap_provider< import::is_empty< Tp >::value, Tp > | |
| Cspatial::details::template_member_swap< Tp > | |
| Cspatial::details::template_member_swap_provider< true, Tp > | |
| Cspatial::tight_balancing | A policy that balances a node if the difference in weight between left and right is higher than the current rank of the tree |
| Cspatial::details::with_builtin_difference< Container, Enable > | The generic helper class to determine if a container uses a built-in compare type |
| Cspatial::details::with_builtin_difference < Container, typename enable_if< is_compare_builtin< Container > >::type > | Retrieve the builtin difference functor on the condition that the compare functor used in Container is a builtin comparator |
| ►CBase | |
| Cspatial::details::Compress< Base, Member > | Uses the empty base class optimization in order to compress a potentially empty base class with a member of a class |
| ►Cfalse_type | |
| ►Cspatial::details::is_compare_builtin_helper< container_traits< Ct >::key_compare > | |
| Cspatial::details::is_compare_builtin< Ct > | Statically resolve if key_compare used in the container corresponds to one of the builtin library comparators or not |
| Cspatial::details::is_compare_builtin_helper< typename > | Help to resolve whether the type used is a builtin comparator or not |
| Cspatial::details::is_difference_builtin< typename > | Help to resolve whether the type used is a builtin difference or not |
| ►CMetric | |
| Cspatial::details::Compress< Metric, typename spatial::container_traits< Ct >::key_type > | |
| ►CRank | |
| Cspatial::details::Bidirectional_iterator< Link, Rank > | A common template for bidirectional iterators that work on identical modes of linking |
| Cspatial::details::Const_bidirectional_iterator< Link, Rank > | A common template for constant bidirectional iterators that work on identical modes of linking |
| Cspatial::details::Kdtree< Rank, Key, Value, Compare, Alloc >::Implementation | The tree header |
| ►Ctrue_type | |
| Cspatial::details::is_compare_builtin_helper< accessor_less< Accessor, Tp > > | |
| Cspatial::details::is_compare_builtin_helper< bracket_less< Tp > > | |
| Cspatial::details::is_compare_builtin_helper< iterator_less< Tp > > | |
| Cspatial::details::is_compare_builtin_helper< paren_less< Tp > > | |
| Cspatial::details::is_difference_builtin< accessor_minus< Accessor, Tp, Unit > > | |
| Cspatial::details::is_difference_builtin< bracket_minus< Tp, Unit > > | |
| Cspatial::details::is_difference_builtin< iterator_minus< Tp, Unit > > | |
| Cspatial::details::is_difference_builtin< paren_minus< Tp, Unit > > | |
1.8.10 
