HomeSort by relevance Sort by last modified time
    Searched full:curve (Results 151 - 175 of 1077) sorted by null

1 2 3 4 5 67 8 91011>>

  /system/media/camera/docs/
plots.py 37 # Print out interleaved coefficients for HAL3 tonemap curve tags
76 lin_title = 'Linear tonemapping curve'
92 inv_title = 'Inverting tonemapping curve'
109 gamma_title = r'$\gamma=1/2.2$ tonemapping curve'
117 ## sRGB curve
125 srgb_title = 'sRGB tonemapping curve'
200 rec709_title = 'Rec. 709 tonemapping curve'
  /external/skia/src/gpu/ops/
GrAAConvexTessellator.h 179 // Represents whether a given point is within a curve. A point is inside a curve only if it is
181 // or conic with another curve meeting it at (more or less) the same angle.
185 // endpoint of a curve with the other side's curvature not yet determined
187 // point is in the interior of a curve
196 int addPt(const SkPoint& pt, SkScalar depth, SkScalar coverage, bool movable, CurveState curve);
216 void lineTo(const SkPoint& p, CurveState curve);
218 void lineTo(const SkMatrix& m, SkPoint p, CurveState curve);
255 // Tracks whether a given point is interior to a curve. Such points are
  /external/skqp/src/gpu/ops/
GrAAConvexTessellator.h 179 // Represents whether a given point is within a curve. A point is inside a curve only if it is
181 // or conic with another curve meeting it at (more or less) the same angle.
185 // endpoint of a curve with the other side's curvature not yet determined
187 // point is in the interior of a curve
196 int addPt(const SkPoint& pt, SkScalar depth, SkScalar coverage, bool movable, CurveState curve);
216 void lineTo(const SkPoint& p, CurveState curve);
218 void lineTo(const SkMatrix& m, SkPoint p, CurveState curve);
255 // Tracks whether a given point is interior to a curve. Such points are
  /external/adhd/cras/src/server/config/
cras_card_config.c 35 syslog(LOG_INFO, "Configure curve found for %s.", control_name);
52 syslog(LOG_INFO, "Explicit volume curve found for %s.", control_name);
111 syslog(LOG_DEBUG, "No configure curve found for %s.", control_name);
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/agreement/
ECDHBasicAgreement.java 17 * ECSVDP-DH is Elliptic Curve Secret Value Derivation Primitive,
57 throw new IllegalStateException("The peer public key must be on the curve for ECDH");
59 // Explicitly construct a public key using the private key's curve.
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/ec/
ECUtils.java 82 ECCurve curve = EC5Util.convertCurve(ecSpec.getCurve()); local
85 curve,
86 EC5Util.convertPoint(curve, ecSpec.getGenerator(), withCompression),
  /external/lmfit/man/
lmfit.html 5 <title>lmfit: a self-contained C library for Levenberg-Marquardt least-squares minimization and curve fitting</title>
24 <p><b>lmfit</b> is a C library for Levenberg-Marquardt least-squares minimization and curve fitting. It is mature code, based on decades-old algorithms from the FORTRAN library MINPACK.</p>
26 <p>For fitting a data set {(x_i,y_i)|i=0,1,..} by a parametric curve f(x,t), see <b>lmcurve</b>(3).</p>
lmfit.pod 16 B<lmfit> is a C library for Levenberg-Marquardt least-squares minimization and curve fitting. It is mature code, based on decades-old algorithms from the FORTRAN library MINPACK.
18 For fitting a data set {(x_i,y_i)|i=0,1,..} by a parametric curve f(x,t), see B<lmcurve>(3).
  /external/skia/src/gpu/ccpr/
GrCCQuadraticShader.h 15 * "Resolution Independent Curve Rendering using Programmable Graphics Hardware" by Charles Loop and
43 * This pass draws a conservative raster hull around the quadratic bezier curve, computes the
44 * curve's coverage using the gradient-based AA technique outlined in the Loop/Blinn paper, and
GrCCCubicShader.h 15 * "Resolution Independent Curve Rendering using Programmable Graphics Hardware" by Charles Loop and
20 * The provided curve segments must be convex, monotonic with respect to the vector of their closing
  /external/skqp/src/gpu/ccpr/
GrCCQuadraticShader.h 15 * "Resolution Independent Curve Rendering using Programmable Graphics Hardware" by Charles Loop and
43 * This pass draws a conservative raster hull around the quadratic bezier curve, computes the
44 * curve's coverage using the gradient-based AA technique outlined in the Loop/Blinn paper, and
GrCCCubicShader.h 15 * "Resolution Independent Curve Rendering using Programmable Graphics Hardware" by Charles Loop and
20 * The provided curve segments must be convex, monotonic with respect to the vector of their closing
  /external/vulkan-validation-layers/libs/glm/gtx/
spline.hpp 54 //! Return a point from a catmull rom curve.
64 //! Return a point from a hermite curve.
74 //! Return a point from a cubic curve.
  /libcore/ojluni/src/main/java/java/security/spec/
ECPrivateKeySpec.java 30 * This immutable class specifies an elliptic curve private key with
49 * @param params the associated elliptic curve domain
74 * Returns the associated elliptic curve domain
ECPublicKeySpec.java 28 * This immutable class specifies an elliptic curve public key with
48 * @param params the associated elliptic curve domain
78 * Returns the associated elliptic curve domain
  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/
ImageFilterHighlights.java 63 float[][] curve = mSpline.calculatetCurve(256); local
64 float[] luminanceMap = new float[curve.length];
66 luminanceMap[i] = curve[i][1];
  /prebuilts/ndk/r16/sources/third_party/vulkan/src/libs/glm/gtx/
spline.hpp 54 //! Return a point from a catmull rom curve.
64 //! Return a point from a hermite curve.
74 //! Return a point from a cubic curve.
  /frameworks/base/media/java/android/media/
VolumeShaper.java 41 * a {@code VolumeShaper} transition, the precise curve position may be lost, and the
42 * {@code VolumeShaper} may advance to the end of the curve for the new audio output sink.
93 * new curve starts immediately.
96 * {@link VolumeShaper.Operation#REVERSE}, then the new curve will
220 * The {@code VolumeShaper.Configuration} class contains curve
239 * Returns the maximum number of curve points allowed for
258 * The type, curve, etc. may not be queried from
284 * Stepwise volume curve.
289 * Linear interpolated volume curve.
294 * Cubic interpolated volume curve
    [all...]
  /external/adhd/scripts/volume_tuning/
volume.html 15 <canvas id="curve"> </canvas>
  /external/bart/tests/
test_common_utils.py 67 # Area under curve post stepping
75 # Area under curve pre stepping
86 # Area under curve post stepping, edge case
94 # Area under curve pre stepping, edge case
  /external/conscrypt/common/src/main/java/org/conscrypt/
OpenSSLECKeyPairGenerator.java 66 throw new RuntimeException("Curve not recognized: " + curveName);
88 throw new InvalidParameterException("unknown curve " + name);
113 throw new InvalidAlgorithmParameterException("unknown curve name: " + curveName);
132 throw new AssertionError("Invalid curve names: "
  /external/pdfium/third_party/lcms/
0002-old-performance-fix.patch 5 @@ -799,7 +799,7 @@ void CMSEXPORT cmsFreeToneCurveTriple(cmsToneCurve* Curve[3])
  /frameworks/layoutlib/bridge/src/com/android/layoutlib/bridge/util/
CachedPathIteratorFactory.java 152 // http://stackoverflow.com/questions/11703283/cubic-bezier-curve-segment
256 float[] curve = new float[8]; local
259 System.arraycopy(coords, 0, curve, 2, coords.length);
260 curve[0] = lastX;
261 curve[1] = lastY;
263 cubicCurveSegment(curve, 0f, t);
265 quadCurveSegment(curve, 0f, t);
268 point[0] = curve[2 + lastPointIndex];
269 point[1] = curve[2 + lastPointIndex + 1];
457 float[] curve = new float[8] local
    [all...]
  /frameworks/support/compat/src/main/java/androidx/core/view/animation/
PathInterpolatorCompat.java 55 * Create an {@link Interpolator} for a quadratic Bezier curve. The end points
60 * @return the {@link Interpolator} representing the quadratic Bezier curve
70 * Create an {@link Interpolator} for a cubic Bezier curve. The end points
77 * @return the {@link Interpolator} representing the cubic Bezier curve
  /external/dng_sdk/source/
dng_tone_curve.cpp 36 bool dng_tone_curve::operator== (const dng_tone_curve &curve) const
39 return fCoord == curve.fCoord;

Completed in 376 milliseconds

1 2 3 4 5 67 8 91011>>