/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/ |
iterator.hpp | 25 class Distance = std::ptrdiff_t, 30 typedef Distance difference_type; 40 template <class Category, class T, class Distance, class Pointer, class Reference> 42 struct iterator_base : std::iterator<Category, T, Distance, Pointer, Reference> {}; 44 struct iterator_base : std::iterator<Category, T, Distance> 48 typedef Distance difference_type; 53 template <class Category, class T, class Distance = std::ptrdiff_t, 55 struct iterator : boost::detail::iterator_base<Category, T, Distance, Pointer, Reference> {};
|
next_prior.hpp | 32 template <class T, class Distance> 33 inline T next(T x, Distance n) 42 template <class T, class Distance> 43 inline T prior(T x, Distance n)
|
/external/v8/src/x64/ |
macro-assembler-x64.h | 179 Label::Distance condition_met_distance = Label::kFar); 186 Label::Distance distance = Label::kFar) { 187 InNewSpace(object, scratch, not_equal, branch, distance); 195 Label::Distance distance = Label::kFar) { 196 InNewSpace(object, scratch, equal, branch, distance); 204 Label::Distance on_black_distance = Label::kFar); 211 Label::Distance not_data_object_distance); 222 Label::Distance distance) [all...] |
macro-assembler-x64.cc | 248 Label::Distance distance) { 263 j(cc, branch, distance); 275 j(cc, branch, distance); [all...] |
code-stubs-x64.h | 131 Label::Distance non_smi_near = Label::kFar, 132 Label::Distance slow_near = Label::kFar); 135 Label::Distance non_smi_near); 382 Label::Distance near_jump = Label::kFar);
|
/external/chromium_org/v8/src/x64/ |
macro-assembler-x64.h | 169 Label::Distance condition_met_distance = Label::kFar); 180 Label::Distance distance = Label::kFar) { 181 InNewSpace(object, scratch, not_equal, branch, distance); 189 Label::Distance distance = Label::kFar) { 190 InNewSpace(object, scratch, equal, branch, distance); 198 Label::Distance on_black_distance = Label::kFar); 205 Label::Distance not_data_object_distance); 216 Label::Distance distance) [all...] |
macro-assembler-x64.cc | 271 Label::Distance distance) { 286 j(cc, branch, distance); 298 j(cc, branch, distance); [all...] |
/external/jhead/ |
makernote.c | 138 if (Components > 19 && ImageInfo.Distance <= 0) { 139 // Inidcates the distance the autofocus camera is focused to. 140 // Tends to be less accurate as distance increases. 144 ImageInfo.Distance = (float)temp_dist/100; 146 ImageInfo.Distance = -1 /* infinity */;
|
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/vector/aux_/ |
iterator.hpp | 82 , typename Distance 84 struct advance< v_iter<Vector,n_>,Distance> 88 , (n_ + BOOST_MPL_AUX_NESTED_VALUE_WKND(long, Distance)) 97 struct distance< v_iter<Vector,n_>, v_iter<Vector,m_> > struct in namespace:boost::mpl
|
/external/v8/src/ia32/ |
macro-assembler-ia32.h | 91 Label::Distance condition_met_distance = Label::kFar); 98 Label::Distance distance = Label::kFar) { 99 InNewSpace(object, scratch, zero, branch, distance); 107 Label::Distance distance = Label::kFar) { 108 InNewSpace(object, scratch, not_zero, branch, distance); 116 Label::Distance has_color_distance, 124 Label::Distance on_black_distance = Label::kFar); 135 Label::Distance distance) [all...] |
code-stubs-ia32.h | 126 Label::Distance non_smi_near = Label::kFar, 127 Label::Distance undo_near = Label::kFar, 128 Label::Distance slow_near = Label::kFar); 131 Label::Distance non_smi_near = Label::kFar); 384 Label::Distance chars_not_equal_near = Label::kFar);
|
/external/chromium_org/v8/src/ia32/ |
macro-assembler-ia32.h | 94 Label::Distance condition_met_distance = Label::kFar); 101 Label::Distance condition_met_distance = Label::kFar); 112 Label::Distance distance = Label::kFar) { 113 InNewSpace(object, scratch, zero, branch, distance); 121 Label::Distance distance = Label::kFar) { 122 InNewSpace(object, scratch, not_zero, branch, distance); 130 Label::Distance has_color_distance, 138 Label::Distance on_black_distance = Label::kFar) 897 JumpIfNotUniqueName(Operand(reg), not_unique_name, distance); local [all...] |
/frameworks/base/media/mca/filterfw/native/core/ |
geometry.h | 38 static float Distance(const Point& p0, const Point& p1);
|
geometry.cpp | 40 float Point::Distance(const Point& p0, const Point& p1) {
|
/frameworks/base/media/mca/filterpacks/native/base/ |
geometry.h | 38 static float Distance(const Point& p0, const Point& p1);
|
geometry.cpp | 39 float Point::Distance(const Point& p0, const Point& p1) {
|
/external/chromium_org/third_party/skia/src/effects/gradients/ |
SkTwoPointConicalGradient.h | 65 SkScalar getCenterX1() const { return SkPoint::Distance(fCenter1, fCenter2); }
|
/external/skia/src/effects/gradients/ |
SkTwoPointConicalGradient.h | 65 SkScalar getCenterX1() const { return SkPoint::Distance(fCenter1, fCenter2); }
|
/external/llvm/include/llvm/Analysis/ |
DependenceAnalysis.h | 80 /// Dependence::DVEntry - Each level in the distance/direction vector 82 /// perhaps a distance. 97 const SCEV *Distance; // NULL implies no distance available. 99 PeelLast(false), Splitable(false), Distance(NULL) { } 155 /// getDistance - Returns the distance (or NULL) associated with a 249 /// getDistance - Returns the distance (or NULL) associated with a 380 /// 3) Distance - The value d of the dependence distance; 386 enum ConstraintKind { Empty, Point, Distance, Line, Any } Kind [all...] |
/external/openfst/src/include/fst/extensions/pdt/ |
expand.h | 327 // shortest-distance information computed using a reverse 448 Weight Distance(StateId s) const; 471 vector<Weight> distance_; // Distance from initial state in efst_/ofst 472 vector<Weight> fdistance_; // Distance to final states in efst_/ofst 494 // the shortest-distance from '(s, current_stack_id_)' to the final 551 << reverse_shortest_path_->GetShortestPathData().Distance(s); 552 return reverse_shortest_path_->GetShortestPathData().Distance(s); 570 // Returns the shortest distance from the initial state to 's' in 'ofst_'. 572 typename A::Weight PrunedExpand<A>::Distance(StateId s) const { 576 // Sets the shortest distance from the initial state to 's' in 'ofst_' to 'w' [all...] |
shortest-path.h | 51 // tree info 'Distance()', Parent(), and ArcParent() information keyed 57 // (b) the Distance() is from this 'start' state to the search state. 62 // (a) the Distance() is from the Parent() 'start' state to the 113 SearchData() : distance(Weight::Zero()), 118 Weight distance; // Distance to this state from PDT 'start' state member in struct:fst::PdtShortestPathData::SearchData 148 Weight Distance(SearchState s) const { 150 return data->distance; 153 Weight Distance(const ParenSpec &paren) const { 155 return data->distance; [all...] |
/external/chromium_org/third_party/skia/src/effects/ |
SkCornerPathEffect.cpp | 20 SkScalar dist = SkPoint::Distance(a, b);
|
/external/skia/src/effects/ |
SkCornerPathEffect.cpp | 20 SkScalar dist = SkPoint::Distance(a, b);
|
/external/llvm/lib/Analysis/ |
DependenceAnalysis.cpp | 244 // Returns the distance (or NULL) associated with a particular level. 247 return DV[Level - 1].Distance; 305 assert((Kind == Line || Kind == Distance) && 306 "Kind should be Line (or Distance)"); 314 assert((Kind == Line || Kind == Distance) && 315 "Kind should be Line (or Distance)"); 323 assert((Kind == Line || Kind == Distance) && 324 "Kind should be Line (or Distance)"); 329 // If constraint is a distance, returns D. 332 assert(Kind == Distance && "Kind should be Distance") [all...] |
/external/clang/lib/Basic/ |
DiagnosticIDs.cpp | 590 unsigned Distance = i->getName().edit_distance(Group, true, BestDistance); 591 if (Distance == BestDistance) { 592 // Two matches with the same distance, don't prefer one over the other. 594 } else if (Distance < BestDistance) { 597 BestDistance = Distance;
|