| /external/llvm/lib/Support/ |
| YAMLParser.cpp | 406 /// @brief Skip \a Distance UTF-8 code units. Updates \a Cur and \a Column.
407 void skip(uint32_t Distance);
956 void Scanner::skip(uint32_t Distance) {
957 Current += Distance;
958 Column += Distance;
[all...] |
| CommandLine.cpp | 307 unsigned Distance = StringRef(Name).edit_distance(
309 if (!Best || Distance < BestDistance) {
311 BestDistance = Distance;
[all...] |
| /external/skia/include/core/ |
| SkPoint.h | 241 /** Return the euclidian distance from (0,0) to the point
431 /** Returns the euclidian distance from (0,0) to (x,y)
446 /** Returns the euclidian distance between a and b
448 static SkScalar Distance(const SkPoint& a, const SkPoint& b) {
493 * Returns the squared distance to the infinite line between two pts. Also
502 * Returns the distance to the infinite line between two pts. Also
513 * Returns the squared distance to the line segment between pts a and b
519 * Returns the distance to the line segment between pts a and b.
|
| /external/skia/src/effects/ |
| SkDashPathEffect.cpp | 202 SkScalar length = SkPoint::Distance(pts[1], pts[0]);
267 SkScalar distance = 0; local
297 distance += clampedInitialDashLength;
300 distance += fIntervals[1]; // skip over the next blank block too
302 distance += clampedInitialDashLength;
307 distance += SkScalarHalf(fIntervals[0]);
310 SkScalar x = pts[0].fX + SkScalarMul(tangent.fX, distance);
311 SkScalar y = pts[0].fY + SkScalarMul(tangent.fY, distance);
317 distance += fIntervalLength;
320 distance -= SkScalarHalf(fIntervals[0])
[all...] |
| /external/skia/src/utils/ |
| SkPatchUtils.cpp | 105 arcLength += SkPoint::Distance(points[i], points[i + 1]);
|
| /external/v8/src/ia32/ |
| code-stubs-ia32.h | 46 Label::Distance chars_not_equal_near = Label::kFar);
|
| assembler-ia32.cc | [all...] |
| assembler-ia32.h | 521 // Distance between the address of the code target in the call instruction
530 // Distance between start of patched debug break slot and the emitted address
821 void jmp(Label* L, Label::Distance distance = Label::kFar);
830 Label::Distance distance = Label::kFar);
[all...] |
| /external/v8/src/x64/ |
| code-stubs-x64.h | 41 Label::Distance near_jump = Label::kFar);
|
| /external/v8/src/x87/ |
| code-stubs-x87.h | 46 Label::Distance chars_not_equal_near = Label::kFar);
|
| assembler-x87.h | 518 // Distance between the address of the code target in the call instruction
527 // Distance between start of patched debug break slot and the emitted address
813 void jmp(Label* L, Label::Distance distance = Label::kFar);
822 Label::Distance distance = Label::kFar);
[all...] |
| assembler-x87.cc | 1339 void Assembler::jmp(Label* L, Label::Distance distance) {
1355 } else if (distance == Label::kNear) {
1393 void Assembler::j(Condition cc, Label* L, Label::Distance distance) {
1411 } else if (distance == Label::kNear) {
[all...] |
| /external/v8/src/ |
| assembler.h | 260 enum Distance {
303 void link_to(int pos, Distance distance = kFar) {
304 if (distance == kNear) {
[all...] |
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/ |
| Distance.java | 40 * construct a distance object.
44 public class Distance {
73 * Used to warm start Distance. Set count to zero on first call.
280 return MathUtils.distance(m_v1.w, m_v2.w);
471 * A distance proxy is used by the GJK algorithm. It encapsulates any shape. TODO: see if we can
591 * Get a vertex by index. Used by Distance.
619 public final void distance(final DistanceOutput output, final SimplexCache cache, method in class:Distance
742 output.distance = MathUtils.distance(output.pointA, output.pointB);
753 if (output.distance > rA + rB && output.distance > Settings.EPSILON)
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/NarrowPhaseCollision/ |
| btGjkEpa2.cpp | 714 // Pick distance vertex a
719 // Pick distance vertex b
724 // Pick distance to edge a->b
756 // Use distance to triangle plane
865 bool btGjkEpaSolver2::Distance( const btConvexShape* shape0,
889 results.distance = results.normal.length();
890 results.normal /= results.distance>GJK_MIN_DISTANCE?results.distance:1;
932 results.distance = -epa.m_depth;
1008 if(!Distance(shape0,wtrs0,shape1,wtrs1,guess,results)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInterchange.cpp | 134 const SCEV *Distance = D->getDistance(II);
136 dyn_cast_or_null<SCEVConstant>(Distance);
[all...] |
| /external/llvm/utils/FileCheck/ |
| FileCheck.cpp | 155 /// matching this pattern at the start of \arg Buffer; a distance of zero
523 // match distance and the number of lines skipped to get to this match.
524 unsigned Distance = ComputeMatchDistance(Buffer.substr(i), VariableTable);
525 double Quality = Distance + (NumLinesForward / 100.);
[all...] |
| /external/skia/src/gpu/effects/ |
| GrDashingEffect.cpp | 515 SkScalar lineLength = SkPoint::Distance(devicePts[0], devicePts[1]);
535 draw.fLineLength = SkPoint::Distance(devicePts[0], devicePts[1]);
[all...] |
| /external/skia/samplecode/ |
| SampleQuadStroker.cpp | 22 return SkPoint::Distance(target, SkPoint::Make(x, y)) <= TOL;
|
| /frameworks/base/core/jni/android/graphics/ |
| Path.cpp | 286 float length = lengths.back() + SkPoint::Distance(segmentPoints.back(), toPoint);
|
| /external/v8/src/crankshaft/ia32/ |
| lithium-codegen-ia32.cc | [all...] |
| /external/v8/src/crankshaft/x64/ |
| lithium-codegen-x64.cc | [all...] |
| /external/deqp/external/vulkancts/modules/vulkan/shaderexecutor/ |
| vktShaderBuiltinPrecisionTests.cpp | [all...] |
| /external/deqp/modules/glshared/ |
| glsBuiltinPrecisionTests.cpp | [all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolution.cpp | [all...] |
