/frameworks/support/recyclerview-selection/src/main/java/androidx/recyclerview/selection/ |
ViewAutoScroller.java | 194 * Interpolates the given out of bounds ratio on a curve which starts at (0,0) and ends
|
/packages/apps/LegacyCamera/src/com/android/camera/panorama/ |
Mosaic.java | 50 * remove a one-sided curve in the mosaic (typically due to the camera not staying horizontal
|
/cts/apps/CameraITS/tests/sensor_fusion/ |
test_sensor_fusion.py | 215 # Fit a curve to the corr. dist. data to measure the minima more 218 # than the full +/- 10 range for the curve fit if the measured score 227 print "Test failed; bad fit to time-shift curve"
|
/external/dng_sdk/source/ |
dng_camera_profile.cpp | 1356 const dng_1d_function & curve = dng_function_GammaEncode_sRGB::Get (); local 1359 curve, 1362 const dng_1d_inverse inverse (curve);
|
dng_render.cpp | 936 // Compute tone curve. 942 // we fake this by darkening the tone curve. [all...] |
/external/libopus/celt/ |
rate.c | 224 /* N=2 is the only point that doesn't match the curve */ 461 /* N=2 is the only point that doesn't match the curve */ 576 /* Tilt of the allocation curve */
|
/external/pdfium/public/ |
fpdf_edit.h | 650 // Add a cubic Bezier curve to the given path, starting at the current point. 657 // x3 - the horizontal position of the ending point of the Bezier curve. 658 // y3 - the vertical position of the ending point of the Bezier curve.
|
/external/scapy/scapy/contrib/ |
ikev2.py | 109 9 : "ECDSA with SHA-256 on the P-256 curve", 110 10 : "ECDSA with SHA-384 on the P-384 curve", 111 11 : "ECDSA with SHA-512 on the P-521 curve",
|
/external/skia/src/gpu/ops/ |
GrShadowRRectOp.cpp | 84 // The center of the fan handles the curve of the corner. For roundrects where the stroke width 85 // is greater than the corner radius, the outer triangles blend from the curve to the straight 462 // elliptical curve.
|
/external/skia/src/pathops/ |
SkDQuadLineIntersection.cpp | 15 From http://stackoverflow.com/questions/1853637/how-to-find-the-mathematical-function-defining-a-bezier-curve 17 "A Bezier curve is a parametric function. A quadratic Bezier curve (i.e. three
|
SkPathOpsTSect.h | 71 double fPerpT; // perpendicular intersection on opposite curve 84 /* Curve is either TCurve or SkDCubic */ 172 void resetBounds(const TCurve& curve) { 174 initBounds(curve); [all...] |
/external/skqp/src/gpu/ops/ |
GrShadowRRectOp.cpp | 84 // The center of the fan handles the curve of the corner. For roundrects where the stroke width 85 // is greater than the corner radius, the outer triangles blend from the curve to the straight 462 // elliptical curve.
|
/external/skqp/src/pathops/ |
SkDQuadLineIntersection.cpp | 15 From http://stackoverflow.com/questions/1853637/how-to-find-the-mathematical-function-defining-a-bezier-curve 17 "A Bezier curve is a parametric function. A quadratic Bezier curve (i.e. three
|
SkPathOpsTSect.h | 71 double fPerpT; // perpendicular intersection on opposite curve 84 /* Curve is either TCurve or SkDCubic */ 172 void resetBounds(const TCurve& curve) { 174 initBounds(curve); [all...] |
/frameworks/native/services/surfaceflinger/RenderEngine/ |
ProgramCache.cpp | 394 // scale [x0, x1] to [y0, y1] using a curve 398 // scale [x1, x2] to [y1, y2] using a curve 402 // scale [x2, x3] to [y2, y3] using a curve
|
/external/boringssl/src/crypto/fipsmodule/ec/ |
p224-64.c | 15 // A 64-bit implementation of the NIST P-224 elliptic curve point multiplication 56 // group order size for the elliptic curve, and we also use this type for 627 // ELLIPTIC CURVE POINT OPERATIONS 633 // Double an elliptic curve point: 710 // Add two elliptic curve points: [all...] |
/external/fonttools/Lib/fontTools/ttLib/tables/ |
_g_l_y_f.py | 557 # analytically, handling cases without on-curve 565 # Collect on-curve points 568 # Add implicit on-curve points 589 warnings.warn("Outline has curve with implicit extrema.") 590 # Ouch! Find analytical curve bounds.
|
/prebuilts/go/darwin-x86/src/crypto/tls/ |
handshake_server_test.go | 1001 func benchmarkHandshakeServer(b *testing.B, cipherSuite uint16, curve CurveID, cert []byte, key crypto.PrivateKey) { 1004 config.CurvePreferences = []CurveID{curve} 1074 if testECDSAPrivateKey.PublicKey.Curve != elliptic.P521() [all...] |
/prebuilts/go/linux-x86/src/crypto/tls/ |
handshake_server_test.go | 1001 func benchmarkHandshakeServer(b *testing.B, cipherSuite uint16, curve CurveID, cert []byte, key crypto.PrivateKey) { 1004 config.CurvePreferences = []CurveID{curve} 1074 if testECDSAPrivateKey.PublicKey.Curve != elliptic.P521() [all...] |
/hardware/interfaces/camera/metadata/3.2/ |
types.hal | [all...] |
/external/boringssl/src/include/openssl/ |
ssl.h | [all...] |
/external/freetype/src/psaux/ |
psobjs.c | [all...] |
/system/iot/attestation/at-factory-tool/ |
atftman_unittest.py | 590 curve = atftman.EncryptionAlgorithm.ALGORITHM_CURVE25519 591 algorithm = atft_manager._ChooseAlgorithm([p256, curve]) 592 self.assertEqual(curve, algorithm) 604 curve = atftman.EncryptionAlgorithm.ALGORITHM_CURVE25519 605 algorithm = atft_manager._ChooseAlgorithm([curve]) 606 self.assertEqual(curve, algorithm) [all...] |
/cts/tests/tests/keystore/src/android/keystore/cts/ |
TestUtils.java | 248 assertEquals(msgPrefix + "curve field", expectedCurve.getField(), actualCurve.getField()); 249 assertEquals(msgPrefix + "curve A", expectedCurve.getA(), actualCurve.getA()); 250 assertEquals(msgPrefix + "curve B", expectedCurve.getB(), actualCurve.getB()); [all...] |
/external/ImageMagick/ImageMagick/script/ |
magick-vector-graphics.html | 369 <td><code>Bezier</code> (spline) requires three or more x,y coordinates to define its shape. The first and last points are the knots (preserved coordinates) and any intermediate coordinates are the control points. If two control points are specified, the line between each end knot and its sequentially respective control point determines the tangent direction of the curve at that end. If one control point is specified, the lines from the end knots to the one control point determines the tangent directions of the curve at each end. If more than two control points are specified, then the additional control points act in combination to determine the intermediate shape of the curve. In order to draw complex curves, it is highly recommended either to use the <code>Path</code> primitive or to draw multiple four-point bezier segments with the start and end knots of each successive segment repeated. </td>
|