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

<<11121314151617181920>>

  /frameworks/base/services/core/java/com/android/server/display/
PersistentDataStore.java 80 * &lt;brightness-curve description="some text">
83 * &lt;/brightness-curve>
113 private static final String TAG_BRIGHTNESS_CURVE = "brightness-curve";
670 Pair<float[], float[]> curve = null; local
674 curve = loadCurveFromXml(parser);
677 if (curve == null) {
681 curve.first, curve.second);
742 final Pair<float[], float[]> curve = config.getCurve(); local
743 for (int i = 0; i < curve.first.length; i++)
    [all...]
  /system/iot/attestation/atap/libatap/
atap_ops.h 112 /* Generates a new ECDH keypair using curve |curve|, and writes
121 AtapCurveType curve,
  /external/iproute2/tc/
q_hfsc.c 199 fprintf(stderr, "HFSC: Upper-limit Service Curve without Link-Share Service Curve\n");
368 * concave curve, slope of first segment is umax/dmax,
376 * convex curve, slope of first segment is 0, intersection
397 fprintf(stderr, "HFSC: Service Curve has two zero slopes\n");
  /external/skia/src/pathops/
SkOpAngle.cpp 179 // given a line, see if the opposite curve's convex hull is all on one side
218 // If the curve's control point in its original position is on one side of a compared line,
225 // This should support all curve types, but only bug that requires this has lines
277 // compute the perpendicular to the endpoints and see where it intersects the opposite curve
440 // if the curve is a line, then the line and the ray intersect only at their crossing
475 // If this point is on the curve, it should have been detected earlier by ordinary
476 // curve intersection. This may be hard to determine in general, but for lines,
503 const SkDCurve& curve = index ? rh->fPart.fCurve : this->fPart.fCurve; local
506 minX = SkTMin(minX, curve[idx2].fX);
507 minY = SkTMin(minY, curve[idx2].fY)
521 const SkDCurve& curve = sIndex ? rh->fPart.fCurve : this->fPart.fCurve; local
563 const SkDCurve& curve = rh->fPart.fCurve; local
    [all...]
  /external/skqp/src/pathops/
SkOpAngle.cpp 179 // given a line, see if the opposite curve's convex hull is all on one side
218 // If the curve's control point in its original position is on one side of a compared line,
225 // This should support all curve types, but only bug that requires this has lines
277 // compute the perpendicular to the endpoints and see where it intersects the opposite curve
440 // if the curve is a line, then the line and the ray intersect only at their crossing
475 // If this point is on the curve, it should have been detected earlier by ordinary
476 // curve intersection. This may be hard to determine in general, but for lines,
503 const SkDCurve& curve = index ? rh->fPart.fCurve : this->fPart.fCurve; local
506 minX = SkTMin(minX, curve[idx2].fX);
507 minY = SkTMin(minY, curve[idx2].fY)
521 const SkDCurve& curve = sIndex ? rh->fPart.fCurve : this->fPart.fCurve; local
563 const SkDCurve& curve = rh->fPart.fCurve; local
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/utils/google-benchmark/src/
complexity.cc 68 // minimizing the sum of squares of relative error, for the fitting curve
118 // - complexity : If different than oAuto, the fitting curve will stick to
120 // fitting curve.
124 CHECK_GE(n.size(), 2); // Do not compute fitting curve is less than two
133 // Take o1 as default best fitting curve
  /external/skia/src/core/
SkGeometry.h 75 point along the curve. Otherwise it will return a value of 0.
89 convert it into the cubic fitting the same curve. The new cubic
90 curve is returned in dst[0..3].
202 implicit are on the "left" side. For a serpentine curve they are the inflection points. For a
205 +inf (t,s = 1,0). If the curve is degenerate (i.e. quadratic or linear) they are both set to a
209 Curve Rendering using Programmable Graphics Hardware", 4.2 Curve Categorization:
SkEdge.cpp 89 // called from a curve subclass
142 Note that this limits the number of lines we use to approximate a curve.
162 // cheap calc of distance from center of p0-p2 to the center of the curve
395 // Can't use (center of curve - center of baseline), since center-of-curve
397 // so we try just looking at the two off-curve points
  /external/skqp/src/core/
SkGeometry.h 75 point along the curve. Otherwise it will return a value of 0.
89 convert it into the cubic fitting the same curve. The new cubic
90 curve is returned in dst[0..3].
202 implicit are on the "left" side. For a serpentine curve they are the inflection points. For a
205 +inf (t,s = 1,0). If the curve is degenerate (i.e. quadratic or linear) they are both set to a
209 Curve Rendering using Programmable Graphics Hardware", 4.2 Curve Categorization:
SkEdge.cpp 89 // called from a curve subclass
142 Note that this limits the number of lines we use to approximate a curve.
162 // cheap calc of distance from center of p0-p2 to the center of the curve
395 // Can't use (center of curve - center of baseline), since center-of-curve
397 // so we try just looking at the two off-curve points
  /frameworks/base/core/java/android/hardware/display/
DisplayManagerGlobal.java 567 * Returns the minimum brightness curve, which guarantess that any brightness curve that dips
573 * @return The minimum brightness curve (as lux values and their corresponding nits values).
577 Curve curve = mDm.getMinimumBrightnessCurve(); local
578 return Pair.create(curve.getX(), curve.getY());
  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/imageshow/
Spline.java 149 float[] curve = new float[256]; local
165 curve[i] = 1.0f - points[0].y;
168 curve[i] = 1.0f - points[points.length - 1].y;
205 curve[i] = (float) (1.0f - y);
207 curve[i] = 1.0f - next.y;
210 return curve;
443 Log.v(LOGTAG, "show curve " + this);
  /system/bt/stack/smp/
p_256_multprecision.cc 118 modp = curve.p;
148 // Curve specific optimization when p is a pseudo-Mersenns prime,
162 // Curve specific optimization when p is a pseudo-Mersenns prime
175 modp = curve.p;
196 modp = curve.p;
256 uint32_t* modp = curve.p;
567 modp = curve.p;
  /external/syslinux/gpxe/src/drivers/net/ath5k/
ath5k_eeprom.c 624 * For RF5111 we have an XPD -eXternal Power Detector- curve
625 * for each calibrated channel. Each curve has 0,5dB Power steps
627 * exponential function. To recreate the curve we read 11 points
635 * 10% of the pcdac curve -until the curve reaches it's maximum-
638 * the pcdac steps based on eeprom version and curve min/max so that we
685 /* Only one curve for RF5111
703 /* Allocate pd points for this curve */
831 * use the higher (3) and the lower (0) curves. Each curve has 0.5dB
833 * linear function. To recreate the curve and pass the power value
    [all...]
  /external/pdfium/third_party/lcms/src/
cmstypes.c 239 // Keep starting position of curve offsets
    [all...]
  /frameworks/av/include/media/
VolumeShaper.h 57 // Curve and dimension information
59 #define MIN_CURVE_TIME 0.f // type S: start of VolumeShaper curve (normalized)
60 #define MAX_CURVE_TIME 1.f // type S: end of VolumeShaper curve (normalized)
207 /* Check if the existing curve is valid.
212 ALOGE("curve must have at least 2 points");
216 ALOGE("curve must start at MIN_CURVE_TIME and end at MAX_CURVE_TIME");
238 /* Clamps the volume curve in the configuration to
260 * new VolumeShaper curve, when replacing one VolumeShaper
398 /* xOffset is the position on the volume curve and may go backwards
404 * running through the curve, but could be outside this range afterwards
    [all...]
  /cts/tests/camera/src/android/hardware/camera2/cts/rs/
raw_converter.rs 41 float4 toneMapCoeffs; // Coefficients for a polynomial tonemapping curve
66 // Apply gamma correction using sRGB gamma curve
80 // Apply polynomial tonemapping curve to each color channel in RGB pixel.
123 // Apply tonemapping curve to min, max RGB channel values
182 // a tonemapping curve, apply a colorspace transform to a final colorspace,
183 // and apply a gamma correction curve.
  /external/boringssl/src/crypto/fipsmodule/ecdsa/
ecdsa_test.cc 156 for (const auto &curve : kCurves) {
157 SCOPED_TRACE(curve.name);
159 int nid = curve.nid;
282 ADD_FAILURE() << "Unknown curve: " << curve_name;
326 bssl::UniquePtr<EC_GROUP> group = GetCurve(t, "Curve");
368 bssl::UniquePtr<EC_GROUP> group = GetCurve(t, "Curve");
  /external/libldac/src/
bitalloc_ldac.c 42 /* Calculate Gradient Curve */
218 Subfunction: Decrease Lower Offset of Gradient Curve
283 Subfunction: Decrease Higher Offset of Gradient Curve
347 Subfunction: Increase Lower Offset of Gradient Curve
410 Subfunction: Increase Lower QU of Gradient Curve
473 Subfunction: Increase Lower QU of Gradient Curve
  /frameworks/base/libs/hwui/utils/
VectorDrawableUtils.cpp 205 case 'c': // curveto - Draws a cubic Bézier curve (relative)
215 case 'C': // curveto - Draws a cubic Bézier curve
223 case 's': // smooth curveto - Draws a cubic Bézier curve (reflective cp)
238 case 'S': // shorthand/smooth curveto Draws a cubic Bézier curve(reflective cp)
269 case 't': // Draws a quadratic Bézier curve(reflective control point)(relative)
284 case 'T': // Draws a quadratic Bézier curve (reflective control point)
  /frameworks/base/services/core/java/com/android/server/locksettings/recoverablekeystore/
SecureBox.java 102 // Parameters for the NIST P-256 curve y^2 = x^3 + ax + b (mod p)
151 throw new NoSuchAlgorithmException("Unable to find the NIST P-256 curve", ex);
409 // Checks if the point is indeed on the P-256 curve for security considerations
426 throw new InvalidKeyException("Point lies outside of the expected curve");
429 // Points on the curve satisfy y^2 = x^3 + ax + b (mod p)
439 throw new InvalidKeyException("Point lies outside of the expected curve");
  /external/adhd/cras/
README 65 volume_curve - The type of volume curve, "simple_step" or "explicit".
77 step size of 0.75dBFS and the Speaker to have the curve specified by the steps
78 given, which is a 1dBFS per step curve from max = +0.5dBFS to min = -99.5dBFS
  /external/webrtc/webrtc/base/
sslidentity.h 144 // Generate a a KeyParams for ECDSA specifying the curve.
145 static KeyParams ECDSA(ECCurve curve = EC_NIST_P256);
162 ECCurve curve; member in union:rtc::KeyParams::__anon43929
  /frameworks/base/services/tests/servicestests/src/com/android/server/display/
DisplayManagerServiceTest.java 21 import android.hardware.display.Curve;
238 Curve minimumBrightnessCurve = displayManager.getMinimumBrightnessCurveInternal();
272 Curve minimumBrightnessCurve = displayManager.getMinimumBrightnessCurveInternal();
  /frameworks/base/wifi/java/android/net/wifi/
WifiNetworkScoreCache.java 135 * Returns whether there is a non-null score curve for the given ScanResult.
137 * A null score curve has special meaning - we should never connect to an ephemeral network if
138 * the score curve is null.

Completed in 851 milliseconds

<<11121314151617181920>>