HomeSort by relevance Sort by last modified time
    Searched full:distance (Results 551 - 575 of 3970) sorted by null

<<21222324252627282930>>

  /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
RealVector.java 762 * Distance between two vectors.
763 * <p>This method computes the distance consistent with the
765 * elements differences, or euclidian distance.</p>
766 * @param v vector to which distance is requested
767 * @return distance between two vectors.
777 * Distance between two vectors.
778 * <p>This method computes the distance consistent with the
780 * elements differences, or euclidian distance.</p>
781 * @param v vector to which distance is requested
782 * @return distance between two vectors
    [all...]
  /external/freetype/src/truetype/
ttinterp.c 5802 FT_F26Dot6 distance; local
5872 FT_F26Dot6 distance; local
5924 FT_F26Dot6 distance; local
6036 FT_F26Dot6 org_dist, distance, minimum_distance; local
6177 distance, local
6401 FT_F26Dot6 distance; local
6560 FT_F26Dot6 distance; local
    [all...]
  /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/truetype/
ttinterp.c 5783 FT_F26Dot6 distance; local
5853 FT_F26Dot6 distance; local
5905 FT_F26Dot6 distance; local
6017 FT_F26Dot6 org_dist, distance, minimum_distance; local
6158 distance, local
6382 FT_F26Dot6 distance; local
6541 FT_F26Dot6 distance; local
    [all...]
  /external/pdfium/third_party/freetype/src/truetype/
ttinterp.c 5792 FT_F26Dot6 distance; local
5862 FT_F26Dot6 distance; local
5914 FT_F26Dot6 distance; local
6026 FT_F26Dot6 org_dist, distance, minimum_distance; local
6167 distance, local
6391 FT_F26Dot6 distance; local
6550 FT_F26Dot6 distance; local
    [all...]
  /frameworks/base/core/java/android/view/
FocusFinder.java 355 * Fudge-factor opportunity: how to calculate distance given major and minor
431 * @return The distance from the edge furthest in the given direction
455 * @return The distance along the major axis w.r.t the direction from the
480 * Find the distance on the minor axis w.r.t the direction to the nearest
485 * @return The distance.
491 // the distance between the center verticals
497 // the distance between the center horizontals
541 int distance = Integer.MAX_VALUE; local
545 distance = x - touchableBounds.right + 1;
548 distance = touchableBounds.left
    [all...]
ViewConfiguration.java 114 * Defines the maximum distance in pixels that a touch pad touch can move
132 * Distance a touch can wander before we think the user is scrolling in dips.
145 * Distance the first touch can wander before we stop considering this event a double tap
151 * Distance a touch can wander before we think the user is attempting a paged scroll
165 * Distance in dips between the first touch and second touch to still be considered a double tap
170 * Distance in dips a touch needs to be outside of a window's bounds for it to
206 * Max distance in dips to overscroll for edge effects
211 * Max distance in dips to overfling for edge effects
506 * @return the maximum distance in pixels that a touch pad touch can move
535 * @return Distance in dips a touch can wander before we think the user is scrollin
    [all...]
  /art/test/431-optimizing-arith-shifts/src/
Main.java 238 static int $opt$ShlInt(int value, int distance) {
239 return value << distance;
242 static long $opt$ShlLong(long value, int distance) {
243 return value << distance;
246 static int $opt$ShrInt(int value, int distance) {
247 return value >> distance;
250 static long $opt$ShrLong(long value, int distance) {
251 return value >> distance;
254 static int $opt$UShrInt(int value, int distance) {
255 return value >>> distance;
    [all...]
  /cts/tests/tests/graphics/src/android/graphics/cts/
PathMeasureTest.java 50 float distance = 1f; local
54 mPathMeasure.getPosTan(distance, pos, tan);
61 assertFalse(mPathMeasure.getPosTan(distance, pos2, tan2));
  /external/autotest/client/site_tests/firmware_TouchMTB/geometry/
elements.py 56 def distance(self, p): member in class:Point
57 """Calculate the distance between p and this point.
93 return self.center.distance(p) <= self.radius + TOLERANCE
  /external/chromium-trace/catapult/dashboard/dashboard/
find_step.py 73 distance = _DistanceFromStep(values, step_index)
74 if not distance:
76 return step_size / distance
  /external/chromium-trace/catapult/telemetry/telemetry/internal/actions/
scroll.py 14 distance=None, distance_expr=None,
35 if distance:
37 distance_expr = str(distance)
scroll_bounce.py 12 direction='down', distance=100,
26 self._distance = distance
83 distance: %s,
  /external/dng_sdk/source/
dng_lens_correction.h 59 // the distance from fCenter to the farthest corner of the image's
122 /// i.e., the normalized Euclidean distance between a corrected pixel
132 /// i.e., normalized Euclidean distance between a corrected pixel
142 /// distance between a corrected pixel position and the optical center
154 /// radius, i.e., the square of the normalized Euclidean distance
179 /// radius, i.e., the square of the normalized Euclidean distance
194 /// Euclidean distance between rDstFar and rDstNear. Warp D through this
245 // distance (in pixels) from (xCenter, yCenter) to the farthest image
248 // First, compute the normalized distance of the corrected pixel
365 // distance (in pixels) from (xCenter, yCenter) to the farthest imag
    [all...]
  /external/libcxx/include/experimental/
algorithm 26 template <class PopulationIterator, class SampleIterator, class Distance,
29 SampleIterator out, Distance n,
88 _Distance __unsampled_sz = _VSTD::distance(__first, __last);
  /external/libcxx/test/std/containers/associative/map/map.cons/
initializer_list_compare_alloc.pass.cpp 41 assert(distance(m.begin(), m.end()) == 3);
65 assert(distance(m.begin(), m.end()) == 3);
91 assert(distance(m.begin(), m.end()) == 3);
iter_iter_comp_alloc.pass.cpp 47 assert(distance(m.begin(), m.end()) == 3);
73 assert(distance(m.begin(), m.end()) == 3);
100 assert(distance(m.begin(), m.end()) == 3);
  /external/libcxx/test/std/containers/associative/multiset/multiset.cons/
initializer_list.pass.cpp 29 assert(distance(m.begin(), m.end()) == 6);
45 assert(distance(m.begin(), m.end()) == 6);
61 assert(distance(m.begin(), m.end()) == 6);
  /external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/
default.pass.cpp 44 assert(std::distance(c.begin(), c.end()) == 0);
64 assert(std::distance(c.begin(), c.end()) == 0);
73 assert(std::distance(c.begin(), c.end()) == 0);
  /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/
default.pass.cpp 44 assert(std::distance(c.begin(), c.end()) == 0);
64 assert(std::distance(c.begin(), c.end()) == 0);
73 assert(std::distance(c.begin(), c.end()) == 0);
  /external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/
default.pass.cpp 42 assert(std::distance(c.begin(), c.end()) == 0);
60 assert(std::distance(c.begin(), c.end()) == 0);
69 assert(std::distance(c.begin(), c.end()) == 0);
  /external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/
default.pass.cpp 42 assert(std::distance(c.begin(), c.end()) == 0);
60 assert(std::distance(c.begin(), c.end()) == 0);
69 assert(std::distance(c.begin(), c.end()) == 0);
  /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/com/badlogic/gdx/physics/box2d/joints/
DistanceJointDef.java 23 /** Distance joint definition. This requires defining an anchor point on both bodies and the non-zero length of the distance joint.
66 fd.type = org.jbox2d.dynamics.joints.JointType.DISTANCE;
  /external/libgdx/extensions/gdx-tools/src/com/badlogic/gdx/tools/flame/
BillboardBatchPanel.java 41 Distance("Distance", new ParticleSorter.Distance());
  /external/libgdx/gdx/src/com/badlogic/gdx/utils/compression/lz/
InWindow.java 101 public int GetMatchLen (int index, int distance, int limit) {
103 distance++;
108 for (i = 0; i < limit && _bufferBase[pby + i] == _bufferBase[pby + i - distance]; i++)
  /external/libgdx/tests/gdx-tests/src/com/badlogic/gdx/tests/g3d/shadows/utils/
AABBNearFarAnalyzer.java 115 float distance = tmpV.dst(camera.position); local
116 float near = distance - radius;
117 float far = distance + radius;

Completed in 790 milliseconds

<<21222324252627282930>>