HomeSort by relevance Sort by last modified time
    Searched full:poly (Results 26 - 50 of 140) sorted by null

12 3 4 5 6

  /frameworks/rs/java/tests/ImageProcessing2/src/com/android/rs/image/
shadows.rs 28 static double poly[] = {
39 static double fastevalPoly(double *poly,int n, double x){
42 double sum = poly[0]+poly[1]*f;
46 sum += poly[i]*f;
182 poly[i] = fastevalPoly(shadowFilterMap+i*2,2 , s);
188 double v = (fastevalPoly(poly,5,hsv.x/4080.)*4080);
  /frameworks/rs/java/tests/ImageProcessing_jb/src/com/android/rs/image/
shadows.rs 28 static double poly[] = {
39 static double fastevalPoly(double *poly,int n, double x){
42 double sum = poly[0]+poly[1]*f;
46 sum += poly[i]*f;
182 poly[i] = fastevalPoly(shadowFilterMap+i*2,2 , s);
188 double v = (fastevalPoly(poly,5,hsv.x/4080.)*4080);
  /external/chromium_org/chrome/test/chromedriver/js/
get_element_region_test.html 41 var region = getElementRegion(document.getElementById('poly'));
88 <area id="poly" shape="poly" coords="20,20,30,10,50,20,60,40,50,50,30,55">
  /external/e2fsprogs/lib/ext2fs/
crc16.h 6 * Poly 0x8005 (x16 + x15 + x2 + 1)
  /external/llvm/test/CodeGen/XCore/
misc-intrinsics.ll 19 define i32 @crc32(i32 %crc, i32 %data, i32 %poly) {
22 %result = call i32 @llvm.xcore.crc32(i32 %crc, i32 %data, i32 %poly)
26 define %0 @crc8(i32 %crc, i32 %data, i32 %poly) {
29 %result = call %0 @llvm.xcore.crc8(i32 %crc, i32 %data, i32 %poly)
  /packages/apps/Gallery2/jni/filters/
hsv.c 20 double fastevalPoly(double *poly,int n, double x){
23 double sum = poly[0]+poly[1]*f;
27 sum += poly[i]*f;
filters.h 52 extern double fastevalPoly(double *poly,int n, double x);
  /external/eigen/unsupported/Eigen/src/Polynomials/
Companion.h 75 void setPolynomial( const VectorType& poly )
77 const Index deg = poly.size()-1;
78 m_monic = -1/poly[deg] * poly.head(deg);
84 companion( const VectorType& poly ){
85 setPolynomial( poly ); }
  /external/chromium_org/third_party/WebKit/Source/core/html/
HTMLAreaElement.cpp 60 else if (equalIgnoringCase(value, "poly"))
61 m_shape = Poly;
140 shape = Poly;
146 case Poly:
HTMLAreaElement.h 61 enum Shape { Default, Poly, Rect, Circle, Unknown };
  /external/eigen/unsupported/Eigen/
Polynomials 50 void roots_to_monicPolynomial( const RootVector& rv, Polynomial& poly )
61 T poly_eval( const Polynomials& poly, const T& x )
74 Real cauchy_max_bound( const Polynomial& poly )
84 Real cauchy_min_bound( const Polynomial& poly )
  /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/
common_defs.h 32 enum KernelType { LINEAR, POLY, RBF };
  /bionic/libm/upstream-freebsd/lib/msun/src/
s_erf.c 34 * where R = P/Q where P is an odd poly of degree 8 and
35 * Q is an odd poly of degree 10.
56 * erf(1+s) = erf(1) + s*Poly(s)
62 * P1(s) = degree 6 poly in s
63 * Q1(s) = degree 6 poly in s
69 * R1(z) = degree 7 poly in z, (z=1/x^2)
70 * S1(z) = degree 8 poly in z
79 * R2(z) = degree 6 poly in z, (z=1/x^2)
80 * S2(z) = degree 7 poly in z
91 * erfc(x) ~ ---------- * ( 1 + Poly(1/x^2)
    [all...]
  /external/fdlibm/
s_erf.c 32 * where R = P/Q where P is an odd poly of degree 8 and
33 * Q is an odd poly of degree 10.
54 * erf(1+s) = ieee_erf(1) + s*Poly(s)
60 * P1(s) = degree 6 poly in s
61 * Q1(s) = degree 6 poly in s
67 * R1(z) = degree 7 poly in z, (z=1/x^2)
68 * S1(z) = degree 8 poly in z
77 * R2(z) = degree 6 poly in z, (z=1/x^2)
78 * S2(z) = degree 7 poly in z
89 * erfc(x) ~ ---------- * ( 1 + Poly(1/x^2)
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/
arc.h 63 struct polygon *poly,
bezier.c 94 struct polygon *poly = polygon_create(64); local
95 polygon_vertex_append(poly, bez->x1, bez->y1);
96 bezier_add_to_polygon(bez, poly);
97 return poly;
101 struct polygon *poly)
124 polygon_vertex_append(poly, b->x4, b->y4);
136 struct bezier left, right; /* bez poly splits */
700 struct polygon *poly = polygon_create(64); local
701 polygon_vertex_append(poly, bez->x1, bez->y1);
702 bezier_add_to_polygon(bez, poly);
    [all...]
bezier.h 58 struct polygon *poly);
  /external/mesa3d/src/gallium/state_trackers/vega/
arc.h 63 struct polygon *poly,
bezier.c 94 struct polygon *poly = polygon_create(64); local
95 polygon_vertex_append(poly, bez->x1, bez->y1);
96 bezier_add_to_polygon(bez, poly);
97 return poly;
101 struct polygon *poly)
124 polygon_vertex_append(poly, b->x4, b->y4);
136 struct bezier left, right; /* bez poly splits */
700 struct polygon *poly = polygon_create(64); local
701 polygon_vertex_append(poly, bez->x1, bez->y1);
702 bezier_add_to_polygon(bez, poly);
    [all...]
bezier.h 58 struct polygon *poly);
  /external/clang/lib/ASTMatchers/Dynamic/
Marshallers.h 171 static void mergePolyMatchers(const PolyMatcher &Poly, MatcherList *Out,
175 static void mergePolyMatchers(const PolyMatcher &Poly, MatcherList *Out,
177 Out->add(ast_matchers::internal::Matcher<typename TypeList::head>(Poly));
178 mergePolyMatchers(Poly, Out, typename TypeList::tail());
185 /// the latter, we instantiate all the possible Matcher<T> of the poly matcher.
  /external/chromium_org/third_party/skia/src/core/
SkMatrix.cpp     [all...]
  /external/skia/src/core/
SkMatrix.cpp     [all...]
  /external/chromium_org/third_party/openssl/openssl/crypto/ec/
ec_asn1.c 75 while (group->poly[i] != 0)
93 || !((group->poly[0] != 0) && (group->poly[1] != 0) && (group->poly[2] == 0)))
100 *k = group->poly[1];
111 || !((group->poly[0] != 0) && (group->poly[1] != 0) && (group->poly[2] != 0) && (group->poly[3] != 0) && (group->poly[4] == 0))
    [all...]
  /external/openssl/crypto/ec/
ec_asn1.c 75 while (group->poly[i] != 0)
93 || !((group->poly[0] != 0) && (group->poly[1] != 0) && (group->poly[2] == 0)))
100 *k = group->poly[1];
111 || !((group->poly[0] != 0) && (group->poly[1] != 0) && (group->poly[2] != 0) && (group->poly[3] != 0) && (group->poly[4] == 0))
    [all...]

Completed in 663 milliseconds

12 3 4 5 6