| /third_party/boost/boost/ |
| D | next_prior.hpp | 82 template< typename T, typename Distance, bool HasPlus = has_plus< T, Distance >::value >
85 template< typename T, typename Distance >
86 struct next_plus_impl< T, Distance, true >
88 static T call(T x, Distance n) in call()
94 template< typename T, typename Distance, bool HasPlusAssign = has_plus_assign< T, Distance >::value…
96 public next_plus_impl< T, Distance >
100 template< typename T, typename Distance >
101 struct next_plus_assign_impl< T, Distance, true >
103 static T call(T x, Distance n) in call()
110 template< typename T, typename Distance, bool IsIterator = is_iterator< T >::value >
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
| D | layout_test.cc | 40 size_t Distance(const void* from, const void* to) { in Distance() function
372 EXPECT_EQ(0, Distance(p, Type<const int32_t*>(L::Partial().Pointer<0>(p)))); in TEST()
374 Distance(p, Type<const int32_t*>(L::Partial(3).Pointer<0>(p)))); in TEST()
375 EXPECT_EQ(0, Distance(p, Type<const int32_t*>(L(3).Pointer<0>(p)))); in TEST()
379 EXPECT_EQ(0, Distance(p, Type<const int32_t*>(L::Partial().Pointer<0>(p)))); in TEST()
381 Distance(p, Type<const int32_t*>(L::Partial(3).Pointer<0>(p)))); in TEST()
383 Distance(p, Type<const int32_t*>(L::Partial(3).Pointer<1>(p)))); in TEST()
385 0, Distance(p, Type<const int32_t*>(L::Partial(3, 5).Pointer<0>(p)))); in TEST()
387 12, Distance(p, Type<const int32_t*>(L::Partial(3, 5).Pointer<1>(p)))); in TEST()
388 EXPECT_EQ(0, Distance(p, Type<const int32_t*>(L(3, 5).Pointer<0>(p)))); in TEST()
[all …]
|
| /third_party/abseil-cpp/absl/container/internal/ |
| D | layout_test.cc | 40 size_t Distance(const void* from, const void* to) { in Distance() function
370 EXPECT_EQ(0, Distance(p, Type<const int32_t*>(L::Partial().Pointer<0>(p)))); in TEST()
371 EXPECT_EQ(0, Distance(p, Type<const int32_t*>(L::Partial(3).Pointer<0>(p)))); in TEST()
372 EXPECT_EQ(0, Distance(p, Type<const int32_t*>(L(3).Pointer<0>(p)))); in TEST()
376 EXPECT_EQ(0, Distance(p, Type<const int32_t*>(L::Partial().Pointer<0>(p)))); in TEST()
377 EXPECT_EQ(0, Distance(p, Type<const int32_t*>(L::Partial(3).Pointer<0>(p)))); in TEST()
378 EXPECT_EQ(12, Distance(p, Type<const int32_t*>(L::Partial(3).Pointer<1>(p)))); in TEST()
380 Distance(p, Type<const int32_t*>(L::Partial(3, 5).Pointer<0>(p)))); in TEST()
382 Distance(p, Type<const int32_t*>(L::Partial(3, 5).Pointer<1>(p)))); in TEST()
383 EXPECT_EQ(0, Distance(p, Type<const int32_t*>(L(3, 5).Pointer<0>(p)))); in TEST()
[all …]
|
| /third_party/boost/boost/geometry/algorithms/ |
| D | buffer.hpp | 64 template <typename Distance>
65 static inline void apply(BoxIn const& box_in, Distance const& distance, in apply()
66 Distance const& , BoxOut& box_out) in apply()
81 template <typename Distance, typename GeometryOut>
83 Distance const& distance, in apply()
84 Distance const& chord_length, in apply()
94 template <typename Distance, typename GeometryOut>
97 Distance const& m_distance;
98 Distance const& m_chord_length;
101 visitor(Distance const& distance, in visitor()
[all …]
|
| D | simplify.hpp | 73 template<typename Range, typename Strategy, typename OutputIterator, typename Distance>
75 Distance const& max_distance, Strategy const& strategy) in apply()
100 template <typename RangeIn, typename RangeOut, typename Strategy, typename Distance>
102 Distance const& , Strategy const& ) in apply()
116 template <typename RangeIn, typename RangeOut, typename Strategy, typename Distance>
118 Distance const& max_distance, Strategy const& strategy) in apply()
185 template <typename Ring, typename Strategy, typename Distance>
187 Distance const& max_distance, Strategy const& strategy) in apply()
284 typename Distance,
289 Distance const& max_distance, Strategy const& strategy) in iterate()
[all …]
|
| D | line_interpolate.hpp | 73 typename Distance,
78 Distance const& max_distance, in apply()
102 Distance repeated_distance = max_distance; in apply()
103 Distance prev_distance = 0; in apply()
104 Distance current_distance = 0; in apply()
109 Distance dist = strategy.get_distance_pp_strategy().apply(*prev, *it); in apply()
115 Distance diff_distance = current_distance - prev_distance; in apply()
116 BOOST_ASSERT(diff_distance != Distance(0)); in apply()
147 template <typename Segment, typename Distance, typename Pointlike, typename Strategy>
149 Distance const& max_distance, in apply()
[all …]
|
| D | densify.hpp | 265 template <typename Geometry, typename Distance, typename Strategy>
268 Distance const& max_distance, in apply()
275 template <typename Geometry, typename Distance>
278 Distance const& max_distance, in apply()
302 template <typename Distance, typename Strategy>
305 Distance const& max_distance, in apply()
315 template <typename Distance, typename Strategy>
318 Distance const& m_max_distance;
321 visitor(Distance const& max_distance, Strategy const& strategy) in visitor()
333 template <typename Distance, typename Strategy>
[all …]
|
| /third_party/boost/boost/pending/ |
| D | is_heap.hpp | 15 template < class RandomAccessIterator, class Distance >
16 bool __is_heap(RandomAccessIterator first, RandomAccessIterator last, Distance*) in __is_heap() argument
18 const Distance n = last - first; in __is_heap()
20 Distance parent = 0; in __is_heap()
21 for (Distance child = 1; child < n; ++child) in __is_heap()
37 template < class RandomAccessIterator, class Distance,
40 StrictWeakOrdering comp, Distance*) in __is_heap() argument
42 const Distance n = last - first; in __is_heap()
44 Distance parent = 0; in __is_heap()
45 for (Distance child = 1; child < n; ++child) in __is_heap()
|
| /third_party/boost/boost/intrusive/detail/ |
| D | iterator.hpp | 145 template<class InputIt, class Distance>
147 iterator_advance(InputIt& it, Distance n) in iterator_advance()
153 template<class InputIt, class Distance>
155 iterator_advance(InputIt& it, Distance n) in iterator_advance()
161 template<class InputIt, class Distance>
163 iterator_advance(InputIt& it, Distance n) in iterator_advance()
171 template<class InputIt, class Distance>
173 iterator_advance(InputIt& it, Distance n) in iterator_advance()
178 template<class InputIt, class Distance>
181 iterator_advance(InputIt& it, Distance n) in iterator_advance()
[all …]
|
| /third_party/boost/boost/geometry/algorithms/detail/closest_feature/ |
| D | point_to_range.hpp | 45 template <typename Distance>
52 Distance& dist_min) in apply()
56 Distance const zero = Distance(0); in apply()
74 Distance const dist = strategy.apply(point, *prev, *it); in apply()
99 template <typename Distance>
104 Distance& dist_min) in apply()
127 template <typename Distance>
131 Distance& dist_min) in apply()
159 template <typename Distance>
166 Distance& dist_min) in apply()
[all …]
|
| D | geometry_to_range.hpp | 42 typename Distance
49 Distance& dist_min) in apply()
53 Distance const zero = Distance(0); in apply()
67 Distance dist = dispatch::distance in apply()
94 typename Distance
100 Distance& dist_min) in apply()
|
| D | range_to_range.hpp | 46 typename Distance
55 Distance& dist_min) in apply()
70 Distance const zero = Distance(0); in apply()
95 Distance dist = dispatch::distance in apply()
135 typename Distance
145 Distance& dist_min) in apply()
|
| /third_party/boost/boost/iterator/ |
| D | advance.hpp | 17 template <typename InputIterator, typename Distance>
21 , Distance n in advance_impl()
31 template <typename BidirectionalIterator, typename Distance>
35 , Distance n in advance_impl()
53 template <typename RandomAccessIterator, typename Distance>
57 , Distance n in advance_impl()
66 template <typename InputIterator, typename Distance>
68 advance(InputIterator& it, Distance n) in advance()
|
| /third_party/boost/boost/graph/detail/ |
| D | geodesic.hpp | 47 typename Distance >
48 inline Distance combine_distances( in combine_distances()
49 const Graph& g, DistanceMap dist, Combinator combine, Distance init) in combine_distances()
56 BOOST_CONCEPT_ASSERT((NumericValueConcept< Distance >)); in combine_distances()
57 typedef numeric_values< Distance > DistanceNumbers; in combine_distances()
58 BOOST_CONCEPT_ASSERT((AdaptableBinaryFunction< Combinator, Distance, in combine_distances()
59 Distance, Distance >)); in combine_distances()
65 Distance ret = init; in combine_distances()
|
| /third_party/skia/third_party/externals/oboe/samples/RhythmGame/third_party/glm/gtx/ |
| D | extend.inl | 11 genType const & Distance argument
14 return Origin + (Source - Origin) * Distance;
22 T const & Distance argument
25 return Origin + (Source - Origin) * Distance;
33 T const & Distance argument
36 return Origin + (Source - Origin) * Distance;
44 T const & Distance argument
47 return Origin + (Source - Origin) * Distance;
|
| D | closest_point.inl | 19 T Distance = dot(Vector, LineDirection); local
21 if(Distance <= T(0)) return a;
22 if(Distance >= LineLength) return b;
23 return a + LineDirection * Distance;
39 T Distance = dot(Vector, LineDirection); local
41 if(Distance <= T(0)) return a;
42 if(Distance >= LineLength) return b;
43 return a + LineDirection * Distance;
|
| /third_party/boost/boost/graph/ |
| D | closeness_centrality.hpp | 43 typedef typename property_traits< DistanceMap >::value_type Distance; in measure_closeness() typedef
44 return closeness_measure< Graph, Distance, double, in measure_closeness()
54 typedef typename property_traits< DistanceMap >::value_type Distance; in measure_closeness() typedef
55 return closeness_measure< Graph, Distance, T, detail::reciprocal< T > >(); in measure_closeness()
64 typedef typename property_traits< DistanceMap >::value_type Distance; in measure_closeness() typedef
65 return closeness_measure< Graph, Distance, T, Reciprocal >(); in measure_closeness()
76 typedef typename property_traits< DistanceMap >::value_type Distance; in closeness_centrality() typedef
77 BOOST_CONCEPT_ASSERT((NumericValueConcept< Distance >)); in closeness_centrality()
80 Distance n = detail::combine_distances(g, dist, combine, Distance(0)); in closeness_centrality()
91 typedef typename property_traits< DistanceMap >::value_type Distance; in closeness_centrality() typedef
[all …]
|
| D | successive_shortest_path_nonnegative_weights.hpp | 34 template < class Graph, class Weight, class Distance, class Reversed >
37 MapReducedWeight< Graph, Weight, Distance, Reversed > >
46 MapReducedWeight(const Graph& g, Weight w, Distance d, Reversed r) in MapReducedWeight()
60 Distance distance_;
64 template < class Graph, class Weight, class Distance, class Reversed >
65 MapReducedWeight< Graph, Weight, Distance, Reversed > make_mapReducedWeight( in make_mapReducedWeight()
66 const Graph& g, Weight w, Distance d, Reversed r) in make_mapReducedWeight()
68 return MapReducedWeight< Graph, Weight, Distance, Reversed >( in make_mapReducedWeight()
75 class Pred, class Weight, class Distance, class Distance2,
81 VertexIndex index, Pred pred, Distance distance, Distance2 distance_prev) in successive_shortest_path_nonnegative_weights()
[all …]
|
| /third_party/flatbuffers/tests/MyGame/Example/ |
| D | Ability.cs | 21 public uint Distance { get { return __p.bb.GetUint(__p.bb_pos + 4); } } property
24 …c Offset<MyGame.Example.Ability> CreateAbility(FlatBufferBuilder builder, uint Id, uint Distance) { in CreateAbility()
26 builder.PutUint(Distance); in CreateAbility()
37 _o.Distance = this.Distance; in UnPackTo()
44 _o.Distance); in Pack()
53 public uint Distance { get; set; } property in MyGame.Example.AbilityT
57 this.Distance = 0; in AbilityT()
|
| /third_party/boost/boost/compute/detail/ |
| D | iterator_plus_distance.hpp | 20 template<class Iterator, class Distance, class Tag>
21 inline Iterator iterator_plus_distance(Iterator i, Distance n, Tag) in iterator_plus_distance()
28 template<class Iterator, class Distance>
30 Distance n, in iterator_plus_distance()
41 template<class Iterator, class Distance>
42 inline Iterator iterator_plus_distance(Iterator i, Distance n) in iterator_plus_distance()
|
| /third_party/boost/libs/compute/include/boost/compute/detail/ |
| D | iterator_plus_distance.hpp | 20 template<class Iterator, class Distance, class Tag>
21 inline Iterator iterator_plus_distance(Iterator i, Distance n, Tag) in iterator_plus_distance()
28 template<class Iterator, class Distance>
30 Distance n, in iterator_plus_distance()
41 template<class Iterator, class Distance>
42 inline Iterator iterator_plus_distance(Iterator i, Distance n) in iterator_plus_distance()
|
| /third_party/boost/boost/mpl/ |
| D | upper_bound.hpp | 67 typename Distance
75 typename Distance
83 Distance
84 , upper_bound_step_impl<Distance,Predicate,T,DeferredIterator>
90 typename Distance
97 typedef typename divides< Distance, long_<2> >::type offset_;
106 typedef typename prior< minus< Distance, offset_ > >::type step_;
|
| D | lower_bound.hpp | 68 typename Distance
76 typename Distance
84 Distance
85 , lower_bound_step_impl<Distance,Predicate,T,DeferredIterator>
91 typename Distance
98 typedef typename divides< Distance, long_<2> >::type offset_;
107 typedef typename prior< minus< Distance, offset_> >::type step_;
|
| /third_party/boost/libs/graph/example/ |
| D | miles_span.cpp | 25 template < class Distance >
28 typedef typename boost::property_traits< Distance >::value_type D;
29 total_length_visitor(D& len, Distance d) : _total_length(len), _distance(d) in total_length_visitor()
38 Distance _distance;
105 typedef property_map< Graph*, z_property< long > >::type Distance; in main() typedef
106 Distance d = get(z_property< long >(), g); in main()
110 total_length_visitor< Distance > length_vis(sp_length, d); in main()
|
| /third_party/boost/boost/proto/functional/std/ |
| D | iterator.hpp | 27 template<typename InputIterator, typename Distance>
28 void operator()(InputIterator &x, Distance n) const in operator ()()
80 template<typename This, typename ForwardIterator, typename Distance>
81 struct result<This(ForwardIterator, Distance)>
127 template<typename This, typename BidirectionalIterator, typename Distance>
128 struct result<This(BidirectionalIterator, Distance)>
|