HomeSort by relevance Sort by last modified time
    Searched refs:poly (Results 1 - 25 of 171) sorted by null

1 2 3 4 5 6 7

  /external/eigen/unsupported/Eigen/src/Polynomials/
PolynomialUtils.h 18 * \param[in] poly : the vector of coefficients of the polynomial ordered
19 * by degrees i.e. poly[i] is the coefficient of degree i of the polynomial
28 T poly_eval_horner( const Polynomials& poly, const T& x )
30 T val=poly[poly.size()-1];
31 for(DenseIndex i=poly.size()-2; i>=0; --i ){
32 val = val*x + poly[i]; }
39 * \param[in] poly : the vector of coefficients of the polynomial ordered
40 * by degrees i.e. poly[i] is the coefficient of degree i of the polynomial
46 T poly_eval( const Polynomials& poly, const T& x
    [all...]
PolynomialSolver.h 43 inline void setPolynomial( const OtherPolynomial& poly ){
44 m_roots.resize(poly.size()-1); }
48 inline PolynomialSolverBase( const OtherPolynomial& poly ){
49 setPolynomial( poly() ); }
345 void compute( const OtherPolynomial& poly )
347 eigen_assert( Scalar(0) != poly[poly.size()-1] );
348 eigen_assert( poly.size() > 1 );
349 if(poly.size() > 2 )
351 internal::companion<Scalar,_Deg> companion( poly );
    [all...]
  /external/arm-neon-tests/
ref_vceq.c 39 DECL_VARIABLE(vector, poly, 8, 8);
40 DECL_VARIABLE(vector, poly, 8, 16);
42 DECL_VARIABLE(vector2, poly, 8, 8);
43 DECL_VARIABLE(vector2, poly, 8, 16);
50 VLOAD(vector, buffer, , poly, p, 8, 8);
51 VLOAD(vector, buffer, q, poly, p, 8, 16);
53 VDUP(vector2, , poly, p, 8, 8, 0xF3);
54 VDUP(vector2, q, poly, p, 8, 16, 0xF4);
57 TEST_VCOMP(INSN_NAME, , poly, p, uint, 8, 8);
58 TEST_VCOMP(INSN_NAME, q, poly, p, uint, 8, 16)
    [all...]
ref_vcnt.c 57 DECL_VARIABLE(vector, poly, 8, 8);
60 DECL_VARIABLE(vector, poly, 8, 16);
64 DECL_VARIABLE(vector_res, poly, 8, 8);
67 DECL_VARIABLE(vector_res, poly, 8, 16);
74 VDUP(vector, , poly, p, 8, 8, 0x35);
77 VDUP(vector, q, poly, p, 8, 16, 0xBD);
82 TEST_UNARY_OP(INSN_NAME, , poly, p, 8, 8);
85 TEST_UNARY_OP(INSN_NAME, q, poly, p, 8, 16);
ref_vrev.c 61 TEST_VREV(, poly, p, 8, 8, 16);
64 TEST_VREV(q, poly, p, 8, 16, 16);
73 TEST_VREV(, poly, p, 8, 8, 32);
74 TEST_VREV(, poly, p, 16, 4, 32);
79 TEST_VREV(q, poly, p, 8, 16, 32);
80 TEST_VREV(q, poly, p, 16, 8, 32);
91 TEST_VREV(, poly, p, 8, 8, 64);
92 TEST_VREV(, poly, p, 16, 4, 64);
99 TEST_VREV(q, poly, p, 8, 16, 64);
100 TEST_VREV(q, poly, p, 16, 8, 64)
    [all...]
ref_vcreate.c 64 DECL_VAL(val, poly, 8, 8);
65 DECL_VAL(val, poly, 16, 4);
82 DECL_VARIABLE(vector_res, poly, 8, 8);
83 DECL_VARIABLE(vector_res, poly, 16, 4);
100 VECT_VAR(val, poly, 8, 8) = 0x123456789abcdef0ULL;
101 VECT_VAR(val, poly, 16, 4) = 0x123456789abcdef0ULL;
115 TEST_VCREATE(poly, p, 8, 8);
116 TEST_VCREATE(poly, p, 16, 4);
ref_vsli_n.c 60 VDUP(vector2, , poly, p, 8, 8, 20);
61 VDUP(vector2, , poly, p, 16, 4, 30);
70 VDUP(vector2, q, poly, p, 8, 16, 12);
71 VDUP(vector2, q, poly, p, 16, 8, 3);
82 TEST_VSXI_N(INSN_NAME, , poly, p, 8, 8, 7);
83 TEST_VSXI_N(INSN_NAME, , poly, p, 16, 4, 15);
92 TEST_VSXI_N(INSN_NAME, q, poly, p, 8, 16, 7);
93 TEST_VSXI_N(INSN_NAME, q, poly, p, 16, 8, 15);
ref_vsri_n.c 60 VDUP(vector2, , poly, p, 8, 8, 20);
61 VDUP(vector2, , poly, p, 16, 4, 30);
70 VDUP(vector2, q, poly, p, 8, 16, 12);
71 VDUP(vector2, q, poly, p, 16, 8, 3);
82 TEST_VSXI_N(INSN_NAME, , poly, p, 8, 8, 8);
83 TEST_VSXI_N(INSN_NAME, , poly, p, 16, 4, 16);
92 TEST_VSXI_N(INSN_NAME, q, poly, p, 8, 16, 8);
93 TEST_VSXI_N(INSN_NAME, q, poly, p, 16, 8, 16);
compute_ref_data.c 134 VECT_VAR_DECL_INIT(buffer, poly, 8, 8);
135 PAD(buffer_pad, poly, 8, 8);
136 VECT_VAR_DECL_INIT(buffer, poly, 16, 4);
137 PAD(buffer_pad, poly, 16, 4);
174 VECT_VAR_DECL_INIT(buffer, poly, 8, 16);
175 PAD(buffer_pad, poly, 8, 16);
176 VECT_VAR_DECL_INIT(buffer, poly, 16, 8);
177 PAD(buffer_pad, poly, 16, 8);
211 VECT_VAR_DECL_INIT(buffer_dup, poly, 8, 8);
212 VECT_VAR_DECL(buffer_dup_pad, poly, 8, 8)
    [all...]
ref_vreinterpret.c 107 TEST_VREINTERPRET(, int, s, 8, 8, poly, p, 8, 8);
108 TEST_VREINTERPRET(, int, s, 8, 8, poly, p, 16, 4);
118 TEST_VREINTERPRET(, int, s, 16, 4, poly, p, 8, 8);
119 TEST_VREINTERPRET(, int, s, 16, 4, poly, p, 16, 4);
129 TEST_VREINTERPRET(, int, s, 32, 2, poly, p, 8, 8);
130 TEST_VREINTERPRET(, int, s, 32, 2, poly, p, 16, 4);
140 TEST_VREINTERPRET(, int, s, 64, 1, poly, p, 8, 8);
141 TEST_VREINTERPRET(, int, s, 64, 1, poly, p, 16, 4);
151 TEST_VREINTERPRET(, uint, u, 8, 8, poly, p, 8, 8);
152 TEST_VREINTERPRET(, uint, u, 8, 8, poly, p, 16, 4)
    [all...]
ref_vdup_lane.c 64 TEST_VDUP_LANE(, poly, p, 8, 8, 8, 7);
65 TEST_VDUP_LANE(, poly, p, 16, 4, 4, 3);
76 TEST_VDUP_LANE(q, poly, p, 8, 16, 8, 5);
77 TEST_VDUP_LANE(q, poly, p, 16, 8, 4, 1);
ref_vuzp.c 82 DECL_VUZP(poly, 8, 8); \
83 DECL_VUZP(poly, 16, 4); \
91 DECL_VUZP(poly, 8, 16); \
92 DECL_VUZP(poly, 16, 8); \
109 VDUP(vector2, , poly, p, 8, 8, 0x55);
110 VDUP(vector2, , poly, p, 16, 4, 0x66);
119 VDUP(vector2, q, poly, p, 8, 16, 0x55);
120 VDUP(vector2, q, poly, p, 16, 8, 0x66);
130 TEST_VUZP(INSN, , poly, p, 8, 8); \
131 TEST_VUZP(INSN, , poly, p, 16, 4);
    [all...]
ref_vtbX.c 72 DECL_VARIABLE(vector, poly, 8, 8);
75 DECL_VARIABLE(vector_res, poly, 8, 8);
80 DECL_VARIABLE(table_vector, poly, 8, 8);
85 DECL_VARIABLE(default_vector, poly, 8, 8);
91 DECL_VTBX(poly, 8, 8, X)
96 TEST_VTBL1(poly, p, uint, 8, 8)
101 TEST_VTBLX(poly, p, uint, 8, 8, X)
116 VDUP(vector, , poly, p, 8, 8, 2);
126 TEST_VSET_LANE(vector, , poly, p, 8, 8, 0, 10);
127 TEST_VSET_LANE(vector, , poly, p, 8, 8, 4, 20)
    [all...]
ref_vbsl.c 71 VDUP(vector2, , poly, p, 8, 8, 0xF3);
72 VDUP(vector2, , poly, p, 16, 4, 0xFFF2);
82 VDUP(vector2, q, poly, p, 8, 16, 0xF3);
83 VDUP(vector2, q, poly, p, 16, 8, 0xFFF2);
96 TEST_VBSL(uint, , poly, p, 8, 8);
97 TEST_VBSL(uint, , poly, p, 16, 4);
98 TEST_VBSL(uint, q, poly, p, 8, 16);
99 TEST_VBSL(uint, q, poly, p, 16, 8);
  /external/gptfdisk/
crc32.cc 52 unsigned long crc, poly; local
55 poly = 0xEDB88320L;
63 crc = (crc >> 1) ^ poly;
  /frameworks/base/libs/hwui/
AmbientShadow.h 34 static void createAmbientShadow(bool isCasterOpaque, const Vector3* poly, int polyLength,
SpotShadow.h 31 const Vector3* poly, int polyLength, const Vector3& polyCentroid,
44 static float rayIntersectPoly(const Vector2* poly, int polyLength, const Vector2& point,
50 static void sort(Vector2* poly, int polyLength, const Vector2& center);
56 static bool testPointInsidePolygon(const Vector2 testPoint, const Vector2* poly, int len);
61 int umbraLength, const Vector3* poly, int polyLength,
70 static void dumpPolygon(const Vector2* poly, int polyLength, const char* polyName);
71 static void dumpPolygon(const Vector3* poly, int polyLength, const char* polyName);
  /packages/apps/Gallery2/jni/filters/
shadows.c 38 double *poly = (double *) malloc(5*sizeof(double)); local
40 poly[i] = fastevalPoly(shadowFilterMap+i*2,2 , s);
49 double v = (fastevalPoly(poly,5,hsv[0]/4080.)*4080);
56 free(poly);
  /external/syslinux/core/fs/btrfs/
crc32c.h 17 * poly = 0x1EDC6F41
41 const u32 poly = 0x82F63B78; /* Bit-reflected CRC32C polynomial */ local
46 v = (v >> 1) ^ ((v & 1) ? poly : 0);
  /external/ImageMagick/PerlMagick/demo/
tree.pl 28 motionsub => sub{ push( @poly, @_[0..1] ); }
  /external/clang/test/CodeGenCXX/
microsoft-abi-typeid.cpp 58 void f(const Polymorphic &poly) {
63 typeid(poly);
  /external/xz-embedded/linux/lib/xz/
xz_crc32.c 32 const uint32_t poly = 0xEDB88320; local
41 r = (r >> 1) ^ (poly & ~((r & 1) - 1));
xz_crc64.c 23 const uint64_t poly = 0xC96C5795D7870F42; local
32 r = (r >> 1) ^ (poly & ~((r & 1) - 1));
  /external/skia/tests/
InsetConvexPolyTest.cpp 10 static bool is_convex(const SkTDArray<SkPoint>& poly) {
11 if (poly.count() < 3) {
15 SkVector v0 = poly[0] - poly[poly.count() - 1];
16 SkVector v1 = poly[1] - poly[poly.count() - 1];
19 for (int i = 0; i < poly.count()-1; ++i) {
21 int k = (i + 2) % poly.count()
    [all...]
  /external/skqp/tests/
InsetConvexPolyTest.cpp 10 static bool is_convex(const SkTDArray<SkPoint>& poly) {
11 if (poly.count() < 3) {
15 SkVector v0 = poly[0] - poly[poly.count() - 1];
16 SkVector v1 = poly[1] - poly[poly.count() - 1];
19 for (int i = 0; i < poly.count()-1; ++i) {
21 int k = (i + 2) % poly.count()
    [all...]

Completed in 403 milliseconds

1 2 3 4 5 6 7