Searched defs:distance (Results 126 - 150 of 240) sorted by relevance

12345678910

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DDataTypes.h319 double distance(const _Point& a) const { function in struct:_Point
/external/chromium_org/third_party/skia/src/animator/
H A DSkDrawExtraPathEffect.cpp104 virtual SkScalar next(SkPath* dst, SkScalar distance, SkPathMeasure&) const { argument
105 fMaker->setExtraPropertyCallBack(fDraw->fType, GetDistance, &distance);
113 apply->interpolate(*fMaker, SkScalarRoundToInt(distance * 1000));
126 apply->interpolate(*fMaker, SkScalarRoundToInt(distance * 1000));
152 if (SK_LITERAL_STR_EQUAL("distance", token, len)) {
/external/chromium_org/third_party/webrtc/modules/remote_bitrate_estimator/test/
H A Dbwe_test_framework_unittest.cc522 // We measure the amount of reordering by summing the distance by which out-
524 uint32_t distance = 0; local
529 distance += last_sequence_number - sequence_number;
535 // maximum distance a packet can be moved is PacketCount - 1.
537 ((kPacketCount - 1) * reorder_percent) / 100, distance, near_value);
/external/chromium_org/ui/chromeos/
H A Dtouch_exploration_controller.cc267 float distance = (event.location() - initial_press_->location()).Length(); local
271 if (distance <= gesture_detector_config_.touch_slop)
276 float velocity = distance / delta_time;
278 VLOG(0) << "\n Delta time: " << delta_time << "\n Distance: " << distance
538 // Check the distance between the current finger location and the original
655 float distance = (event.location() - original_location).Length(); local
658 if (distance > gesture_detector_config_.touch_slop) {
/external/chromium_org/ui/events/gesture_detection/
H A Dgesture_provider.cc241 // computation that is invariant to the focal distance, where
283 double distance = variable
286 if (distance > epsilon) {
289 distance - config_.gesture_detector_config.touch_slop) /
290 distance;
295 // Note that scroll start hints are in distance traveled, where
365 // The distance traveled in one second is a reasonable scroll start hint.
/external/chromium_org/v8/src/ia32/
H A Dmacro-assembler-ia32.h106 Label::Distance distance = Label::kFar) {
107 InNewSpace(object, scratch, zero, branch, distance);
115 Label::Distance distance = Label::kFar) {
116 InNewSpace(object, scratch, not_zero, branch, distance);
143 Label::Distance distance);
374 Label::Distance distance = Label::kFar);
380 Label::Distance distance = Label::kFar);
386 Label::Distance distance = Label::kFar);
494 Label::Distance distance = Label::kFar) {
496 j(zero, smi_label, distance);
922 JumpIfNotUniqueNameInstanceType(Operand(reg), not_unique_name, distance); local
[all...]
/external/chromium_org/v8/src/x87/
H A Dmacro-assembler-x87.h105 Label::Distance distance = Label::kFar) {
106 InNewSpace(object, scratch, zero, branch, distance);
114 Label::Distance distance = Label::kFar) {
115 InNewSpace(object, scratch, not_zero, branch, distance);
142 Label::Distance distance);
346 Label::Distance distance = Label::kFar);
352 Label::Distance distance = Label::kFar);
358 Label::Distance distance = Label::kFar);
466 Label::Distance distance = Label::kFar) {
468 j(zero, smi_label, distance);
890 JumpIfNotUniqueNameInstanceType(Operand(reg), not_unique_name, distance); local
[all...]
/external/deqp/modules/gles2/scripts/
H A Dgenutil.py171 def distance(a, b): return a.distance(b) member in class:GenMath
237 def distance(self, v): member in class:Scalar
355 def distance(self, v): member in class:Vec2
441 def distance(self, v): member in class:Vec3
534 def distance(self, v): member in class:Vec4
/external/deqp/modules/gles3/scripts/
H A Dgenutil.py181 def distance(a, b): return a.distance(b) member in class:GenMath
263 def distance(self, v): member in class:Scalar
417 def distance(self, v): member in class:Vec2
528 def distance(self, v): member in class:Vec3
648 def distance(self, v): member in class:Vec4
/external/deqp/modules/gles31/scripts/
H A Dgenutil.py181 def distance(a, b): return a.distance(b) member in class:GenMath
263 def distance(self, v): member in class:Scalar
419 def distance(self, v): member in class:Vec2
530 def distance(self, v): member in class:Vec3
650 def distance(self, v): member in class:Vec4
/external/icu/icu4c/source/i18n/
H A Ddtitvinf.cpp501 // calculate distance
502 int32_t distance = 0; local
512 distance += DIFFERENT_FIELD;
515 distance += DIFFERENT_FIELD;
518 distance += STRING_NUMERIC_DIFFERENCE;
520 distance += (inputFieldWidth > fieldWidth) ?
525 if ( distance < bestDistance ) {
527 bestDistance = distance;
530 if ( distance == 0 ) {
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_temporal_filter.c371 void vp9_temporal_filter_prepare(VP9_COMP *cpi, int distance) { argument
385 const int num_frames_backward = distance;
434 start_frame = distance + frames_to_blur_forward;
475 // filter frames that lie within a distance of half the GF interval
/external/llvm/include/llvm/CodeGen/
H A DSlotIndexes.h144 /// The default distance between instructions as returned by distance().
216 /// Return the distance from this index to the given one.
217 int distance(SlotIndex other) const { function in class:llvm::SlotIndex
221 /// Return the scaled distance from this index to the given one, where all
222 /// slots on the same instruction have zero distance.
/external/ltrace/
H A Doutput.c724 size_t distance; local
744 distance = (size_t) -1;
752 < distance)) {
753 distance = ip - lib->base;
/external/openfst/src/include/fst/
H A Dqueue.h303 NaturalShortestFirstQueue(const vector<W> &distance) : argument
304 ShortestFirstQueue<S, C>(C(distance, less_)) {}
539 // This constructor takes a state distance vector that, if non-null and if
541 // shortest-first queue using the natural order w.r.t to the distance.
543 AutoQueue(const Fst<Arc> &fst, const vector<typename Arc::Weight> *distance, argument
569 if (distance && (Weight::Properties() & kPath)) {
571 comp = new Compare(*distance, *less);
732 // an estimate of the shortest distance to the final states.
741 // shortest distance from the initial state, a Less comparison
743 // shortest distance t
778 NaturalAStarQueue(const vector<W> &distance, const E &estimate) argument
808 PruneQueue(const vector<Weight> &distance, Q *queue, L comp, const C &class_func, Weight threshold) argument
878 NaturalPruneQueue(const vector<W> &distance, Q *queue, const C &class_func_, Weight threshold) argument
[all...]
H A Drmepsilon.h42 #include <fst/shortest-distance.h>
78 vector<Weight> *distance,
80 : fst_(fst), distance_(distance), sd_state_(fst_, distance, opts, true),
135 // Shortest distance algorithm computation state.
224 // The vector 'distance' will be used to hold the shortest distances
229 vector<typename Arc::Weight> *distance,
292 rmeps_state(*fst, distance, opts);
358 vector<Weight> distance; local
359 AutoQueue<StateId> state_queue(*fst, &distance, EpsilonArcFilte
77 RmEpsilonState(const Fst<Arc> &fst, vector<Weight> *distance, const RmEpsilonOptions<Arc, Queue> &opts) argument
228 RmEpsilon(MutableFst<Arc> *fst, vector<typename Arc::Weight> *distance, const RmEpsilonOptions<Arc, Queue> &opts) argument
[all...]
/external/skia/experimental/Intersection/
H A DDataTypes.h319 double distance(const _Point& a) const { function in struct:_Point
/external/skia/src/animator/
H A DSkDrawExtraPathEffect.cpp104 virtual SkScalar next(SkPath* dst, SkScalar distance, SkPathMeasure&) const { argument
105 fMaker->setExtraPropertyCallBack(fDraw->fType, GetDistance, &distance);
113 apply->interpolate(*fMaker, SkScalarRoundToInt(distance * 1000));
126 apply->interpolate(*fMaker, SkScalarRoundToInt(distance * 1000));
152 if (SK_LITERAL_STR_EQUAL("distance", token, len)) {
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Drmepsilon.h33 #include "fst/lib/shortest-distance.h"
61 vector<Weight> *distance,
63 : fst_(fst), distance_(distance), sd_state_(fst_, distance, opts, true) {
116 // Shortest distance algorithm computation state.
196 // The vector 'distance' will be used to hold the shortest distances
201 vector<typename Arc::Weight> *distance,
242 rmeps_state(*fst, distance, opts);
291 vector<Weight> distance; local
292 AutoQueue<StateId> state_queue(*fst, &distance, EpsilonArcFilte
60 RmEpsilonState(const Fst<Arc> &fst, vector<Weight> *distance, const RmEpsilonOptions<Arc, Queue> &opts) argument
200 RmEpsilon(MutableFst<Arc> *fst, vector<typename Arc::Weight> *distance, const RmEpsilonOptions<Arc, Queue> &opts) argument
[all...]
/external/chromium_org/ash/shelf/
H A Dshelf_widget.cc260 gfx::Insets GetInsetsForAlignment(int distance, argument
264 return gfx::Insets(distance, 0, 0, 0);
266 return gfx::Insets(0, 0, 0, distance);
268 return gfx::Insets(0, distance, 0, 0);
270 return gfx::Insets(0, 0, distance, 0);
/external/chromium_org/cc/resources/
H A Dpicture_layer_tiling.cc806 int distance; member in struct:cc::__anon2748::EdgeEvent
894 // Sort the events by distance (closest first).
895 if (events[0].distance > events[1].distance) std::swap(events[0], events[1]);
896 if (events[2].distance > events[3].distance) std::swap(events[2], events[3]);
897 if (events[0].distance > events[2].distance) std::swap(events[0], events[2]);
898 if (events[1].distance > events[3].distance) st
[all...]
/external/chromium_org/skia/ext/
H A Dimage_operations_unittest.cc78 // Returns the euclidian distance between two RGBA colors interpreted
82 // - This is a really poor definition of color distance. Yet it
307 float distance = ColorsEuclidianDistance(average_color, actual_color); local
309 EXPECT_LE(distance, max_allowed_distance)
317 if (distance > max_allowed_distance) {
320 if (distance > max_observed_distance) {
321 max_observed_distance = distance;
326 ADD_FAILURE() << "Maximum observed color distance for method "
523 // a distance limit for each tested pixel for each method was judged to add
568 // 5.0f is the maximum distance w
613 float distance = ColorsEuclidianDistance(color_lanczos2, color_lanczos3); local
[all...]
/external/chromium_org/third_party/WebKit/Source/core/css/
H A DCSSGradientValue.cpp1099 float distance = distanceToClosestCorner(secondPoint, size, corner); local
1101 secondRadius = distance;
1116 float distance = distanceToFarthestCorner(secondPoint, size, corner); local
1118 secondRadius = distance;
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/
H A Dmcomp.c1331 int sad_per_bit, int distance,
1354 int row_min = ref_row - distance;
1355 int row_max = ref_row + distance;
1356 int col_min = ref_col - distance;
1357 int col_max = ref_col + distance;
1427 int sad_per_bit, int distance,
1450 int row_min = ref_row - distance;
1451 int row_max = ref_row + distance;
1452 int col_min = ref_col - distance;
1453 int col_max = ref_col + distance;
1330 vp8_full_search_sad_c(MACROBLOCK *x, BLOCK *b, BLOCKD *d, int_mv *ref_mv, int sad_per_bit, int distance, vp8_variance_fn_ptr_t *fn_ptr, int *mvcost[2], int_mv *center_mv) argument
1426 vp8_full_search_sadx3(MACROBLOCK *x, BLOCK *b, BLOCKD *d, int_mv *ref_mv, int sad_per_bit, int distance, vp8_variance_fn_ptr_t *fn_ptr, int *mvcost[2], int_mv *center_mv) argument
1560 vp8_full_search_sadx8(MACROBLOCK *x, BLOCK *b, BLOCKD *d, int_mv *ref_mv, int sad_per_bit, int distance, vp8_variance_fn_ptr_t *fn_ptr, int *mvcost[2], int_mv *center_mv) argument
[all...]
/external/chromium_org/third_party/lzma_sdk/
H A DLzmaDec.c230 UInt32 distance; local
236 distance = rep1;
245 distance = rep2;
250 distance = rep3;
256 rep0 = distance;
296 UInt32 distance; local
299 TREE_6_DECODE(prob, distance);
300 if (distance >= kStartPosModelIndex)
302 unsigned posSlot = (unsigned)distance;
303 int numDirectBits = (int)(((distance >>
[all...]

Completed in 2794 milliseconds

12345678910