Searched defs:distance (Results 76 - 100 of 240) sorted by relevance

12345678910

/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/
H A Dapi_path.c306 VGfloat distance,
350 path_point(p, startSegment, numSegments, distance,
303 vegaPointAlongPath(VGPath path, VGint startSegment, VGint numSegments, VGfloat distance, VGfloat * x, VGfloat * y, VGfloat * tangentX, VGfloat * tangentY) argument
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DCubicReduceOrder.cpp163 double distance = lineParameters.controlPtDistance(cubic, 1); local
164 if (!approximately_zero(distance)) {
167 distance = lineParameters.controlPtDistance(cubic, 2);
168 return approximately_zero(distance);
/external/chromium_org/third_party/skia/src/effects/
H A DSkDashPathEffect.cpp266 SkScalar distance = 0; local
296 distance += clampedInitialDashLength;
299 distance += fIntervals[1]; // skip over the next blank block too
301 distance += clampedInitialDashLength;
306 distance += SkScalarHalf(fIntervals[0]);
309 SkScalar x = pts[0].fX + SkScalarMul(tangent.fX, distance);
310 SkScalar y = pts[0].fY + SkScalarMul(tangent.fY, distance);
316 distance += fIntervalLength;
319 distance -= SkScalarHalf(fIntervals[0]);
325 SkScalar temp = length - distance;
[all...]
/external/chromium_org/third_party/skia/src/pathops/
H A DSkPathOpsPoint.h121 double dist = distance(a); // OPTIMIZATION: can we compare against distSq instead ?
144 double dist = dA.distance(dB); // OPTIMIZATION: can we compare against distSq instead ?
165 double dist = distance(a); // OPTIMIZATION: can we compare against distSq instead ?
179 double dist = distance(a); // OPTIMIZATION: can we compare against distSq instead ?
195 double distance(const SkDPoint& a) const { function in struct:SkDPoint
216 double dist = distance(a); // OPTIMIZATION: can we compare against distSq instead ?
/external/chromium_org/third_party/skia/src/utils/
H A DSkDashPath.cpp269 double distance = 0; local
272 while (distance < length) {
280 lineRec.addSegment(SkDoubleToScalar(distance),
281 SkDoubleToScalar(distance + dlen),
284 meas.getSegment(SkDoubleToScalar(distance),
285 SkDoubleToScalar(distance + dlen),
289 distance += dlen;
/external/clang/test/OpenMP/
H A Dfor_loop_messages.cpp353 distance(Iter first, Iter last) { return first - last; } function in namespace:std
H A Dparallel_for_loop_messages.cpp302 distance(Iter first, Iter last) { return first - last; } function in namespace:std
H A Dsimd_loop_messages.cpp295 distance(Iter first, Iter last) { return first - last; } function in namespace:std
/external/libsepol/src/
H A Debitmap.c145 int distance = ebitmap_cardinality(&tmp); local
147 return distance;
/external/lzma/CS/7zip/Compress/LZ/
H A DLzBinTree.cs74 public new UInt32 GetMatchLen(Int32 index, UInt32 distance, UInt32 limit) argument
75 { return base.GetMatchLen(index, distance, limit); }
/external/mesa3d/src/gallium/state_trackers/vega/
H A Dapi_path.c306 VGfloat distance,
350 path_point(p, startSegment, numSegments, distance,
303 vegaPointAlongPath(VGPath path, VGint startSegment, VGint numSegments, VGfloat distance, VGfloat * x, VGfloat * y, VGfloat * tangentX, VGfloat * tangentY) argument
/external/opencv/cv/src/
H A Dcvdominants.cpp64 float *distance; local
90 distance = (float *) cvAlloc( n * sizeof( float ));
128 which satisfy distance constraint >dmin */
171 distance[(i + i_plus) % n] = cvSqrt( dist_r );
224 distance[ind] = cvSqrt( dist_l );
254 a = distance[leftind];
261 float b = distance[ind];
317 cvFree( &distance );
326 cvFree( &distance );
348 // [0] - minimal distance
[all...]
/external/openfst/src/include/fst/
H A Dprune.h29 #include <fst/shortest-distance.h>
46 // If non-zero, passes in pre-computed shortest distance to final states.
47 const vector<Weight> *distance; member in class:fst::PruneOptions
57 distance(d),
117 if (!opts.distance) {
121 const vector<Weight> *fdistance = opts.distance ? opts.distance : &tmp;
242 if (!opts.distance)
244 const vector<Weight> *fdistance = opts.distance ? opts.distance
[all...]
H A Dshortest-distance.h1 // shortest-distance.h
19 // Functions and classes to find shortest distance in an FST.
63 // Computation state of the shortest-distance algorithm. Reusable
68 // may not be freed before this class. Vector 'distance' should not be
79 vector<Weight> *distance,
82 : fst_(fst), distance_(distance), state_queue_(opts.state_queue),
104 vector<Weight> rdistance_; // Relaxation distance.
113 // Compute the shortest distance. If 'source' is kNoStateId, use
223 // Shortest-distance algorithm: this version allows fine control
226 // This computes the shortest distance fro
77 ShortestDistanceState( const Fst<Arc> &fst, vector<Weight> *distance, const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts, bool retain) argument
244 ShortestDistance( const Fst<Arc> &fst, vector<typename Arc::Weight> *distance, const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts) argument
281 ShortestDistance(const Fst<Arc> &fst, vector<typename Arc::Weight> *distance, bool reverse = false, float delta = kDelta) argument
326 vector<Weight> distance; local
[all...]
H A Dshortest-path.h33 #include <fst/shortest-distance.h>
46 bool has_distance; // distance vector already contains the
47 // shortest distance from the initial state
68 // 'ifst'. 'distance' returns the shortest distances from the source
80 vector<typename Arc::Weight> *distance,
103 distance->clear();
125 while (distance->size() < source) {
126 distance->push_back(Weight::Zero());
131 distance->push_back(Weight::One());
141 Weight sd = (*distance)[
78 SingleShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument
214 ShortestPathCompare(const vector<Pair>& pairs, const vector<Weight>& distance, StateId sfinal, float d) argument
413 ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument
489 vector<typename Arc::Weight> distance; local
[all...]
/external/qemu/distrib/sdl-1.2.15/src/video/
H A DSDL_pixels.c315 /* Do colorspace distance matching */
317 unsigned int distance; local
327 distance = (rd*rd)+(gd*gd)+(bd*bd);
328 if ( distance < smallest ) {
330 if ( distance == 0 ) { /* Perfect match! */
333 smallest = distance;
/external/skia/experimental/Intersection/
H A DCubicReduceOrder.cpp163 double distance = lineParameters.controlPtDistance(cubic, 1); local
164 if (!approximately_zero(distance)) {
167 distance = lineParameters.controlPtDistance(cubic, 2);
168 return approximately_zero(distance);
/external/skia/src/pathops/
H A DSkPathOpsPoint.h121 double dist = distance(a); // OPTIMIZATION: can we compare against distSq instead ?
144 double dist = dA.distance(dB); // OPTIMIZATION: can we compare against distSq instead ?
165 double dist = distance(a); // OPTIMIZATION: can we compare against distSq instead ?
179 double dist = distance(a); // OPTIMIZATION: can we compare against distSq instead ?
195 double distance(const SkDPoint& a) const { function in struct:SkDPoint
216 double dist = distance(a); // OPTIMIZATION: can we compare against distSq instead ?
/external/skia/src/utils/
H A DSkDashPath.cpp268 double distance = 0; local
271 while (distance < length) {
279 lineRec.addSegment(SkDoubleToScalar(distance),
280 SkDoubleToScalar(distance + dlen),
283 meas.getSegment(SkDoubleToScalar(distance),
284 SkDoubleToScalar(distance + dlen),
288 distance += dlen;
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dshortest-distance.h1 // shortest-distance.h
18 // Functions and classes to find shortest distance in an FST.
48 // Computation state of the shortest-distance algorithm. Reusable
52 // (e.g., in epsilon removal). Vector 'distance' should not be
62 vector<Weight> *distance,
65 : fst_(fst.Copy()), distance_(distance), state_queue_(opts.state_queue),
85 vector<Weight> rdistance_; // Relaxation distance.
91 // Compute the shortest distance. If 'source' is kNoStateId, use
180 // Shortest-distance algorithm: this version allows fine control
183 // This computes the shortest distance fro
60 ShortestDistanceState( const Fst<Arc> &fst, vector<Weight> *distance, const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts, bool retain) argument
199 ShortestDistance( const Fst<Arc> &fst, vector<typename Arc::Weight> *distance, const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts) argument
230 ShortestDistance(const Fst<Arc> &fst, vector<typename Arc::Weight> *distance, bool reverse = false) argument
[all...]
H A Dshortest-path.h27 #include "fst/lib/shortest-distance.h"
39 bool has_distance; // distance vector already contains the
40 // shortest distance from the initial state
51 // 'ifst'. 'distance' returns the shortest distances from the source
63 vector<typename Arc::Weight> *distance,
85 distance->clear();
95 while (distance->size() < source) {
96 distance->push_back(Weight::Zero());
101 distance->push_back(Weight::One());
111 Weight sd = (*distance)[
61 SingleShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument
173 ShortestPathCompare(const vector<Pair>& pairs, const vector<Weight>& distance, StateId sfinal, float d) argument
228 ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument
353 vector<typename Arc::Weight> distance; local
[all...]
/external/stlport/stlport/stl/
H A D_iterator_base.h361 distance(_InputIterator __first, _InputIterator __last) function in struct:iterator_traits
366 inline void _STLP_CALL distance(const _InputIterator& __first, function in struct:iterator_traits
368 { __n += _STLP_STD::distance(__first, __last); }
375 { __n += _STLP_STD::distance(__first, __last); }
/external/webp/src/dsp/
H A Dlossless.h181 // Splitting of distance and length codes into prefixes and
184 static WEBP_INLINE void VP8LPrefixEncodeBitsNoLUT(int distance, int* const code, argument
186 const int highest_bit = BitsLog2Floor(--distance);
187 const int second_highest_bit = (distance >> (highest_bit - 1)) & 1;
192 static WEBP_INLINE void VP8LPrefixEncodeNoLUT(int distance, int* const code, argument
195 const int highest_bit = BitsLog2Floor(--distance);
196 const int second_highest_bit = (distance >> (highest_bit - 1)) & 1;
198 *extra_bits_value = distance & ((1 << *extra_bits) - 1);
211 static WEBP_INLINE void VP8LPrefixEncodeBits(int distance, int* const code, argument
213 if (distance < PREFIX_LOOKUP_IDX_MA
222 VP8LPrefixEncode(int distance, int* const code, int* const extra_bits, int* const extra_bits_value) argument
[all...]
/external/webp/src/enc/
H A Dbackward_references.h50 static WEBP_INLINE PixOrCopy PixOrCopyCreateCopy(uint32_t distance, argument
54 retval.argb_or_distance = distance;
/external/chromium_org/chrome/browser/ui/panels/
H A Dpanel_drag_controller.cc19 // The minimum distance that the docked panel gets dragged up in order to
27 // The minimum distance and overlap (in pixels) between two panels such that
32 // The minimum distance between the panel edge and the screen (or work area)
70 // Return the vertical distance between the bottom edge of |top_bounds| and
77 // Return the vertical distance between the right edge of |left_bounds| and
688 int distance; local
695 distance = GetHorizontalDistance(potential_dragging_bounds,
697 if (distance < kGluePanelsDistanceThreshold &&
698 distance < best_distance) {
699 best_distance = distance;
[all...]

Completed in 1620 milliseconds

12345678910