Home
last modified time | relevance | path

Searched refs:poly (Results 1 – 25 of 69) sorted by relevance

123

/external/eigen/unsupported/Eigen/src/Polynomials/
DPolynomialUtils.h28 T poly_eval_horner( const Polynomials& poly, const T& x ) in poly_eval_horner() argument
30 T val=poly[poly.size()-1]; in poly_eval_horner()
31 for(DenseIndex i=poly.size()-2; i>=0; --i ){ in poly_eval_horner()
32 val = val*x + poly[i]; } in poly_eval_horner()
46 T poly_eval( const Polynomials& poly, const T& x ) in poly_eval() argument
51 return poly_eval_horner( poly, x ); } in poly_eval()
54 T val=poly[0]; in poly_eval()
56 for( DenseIndex i=1; i<poly.size(); ++i ){ in poly_eval()
57 val = val*inv_x + poly[i]; } in poly_eval()
59 return std::pow(x,(T)(poly.size()-1)) * val; in poly_eval()
[all …]
DPolynomialSolver.h43 inline void setPolynomial( const OtherPolynomial& poly ){ in setPolynomial() argument
44 m_roots.resize(poly.size()); } in setPolynomial()
48 inline PolynomialSolverBase( const OtherPolynomial& poly ){ in PolynomialSolverBase() argument
49 setPolynomial( poly() ); } in PolynomialSolverBase()
345 void compute( const OtherPolynomial& poly ) in compute() argument
347 eigen_assert( Scalar(0) != poly[poly.size()-1] ); in compute()
348 internal::companion<Scalar,_Deg> companion( poly ); in compute()
356 inline PolynomialSolver( const OtherPolynomial& poly ){ in PolynomialSolver() argument
357 compute( poly ); } in PolynomialSolver()
377 void compute( const OtherPolynomial& poly ) in EIGEN_POLYNOMIAL_SOLVER_BASE_INHERITED_TYPES()
[all …]
DCompanion.h75 void setPolynomial( const VectorType& poly ) in setPolynomial() argument
77 const Index deg = poly.size()-1; in setPolynomial()
78 m_monic = -1/poly[deg] * poly.head(deg); in setPolynomial()
84 companion( const VectorType& poly ){ in companion() argument
85 setPolynomial( poly ); } in companion()
/external/mesa3d/src/gallium/state_trackers/vega/
Dpolygon.c70 static void polygon_print(struct polygon *poly)
74 debug_printf("Polygon %p, size = %d\n", poly, poly->num_verts);
75 for (i = 0; i < poly->num_verts; ++i) {
76 vert = ptr_to_vertex(poly->data, i);
86 struct polygon *poly = (struct polygon*)malloc(sizeof(struct polygon)); in polygon_create() local
88 poly->data = malloc(sizeof(float) * COMPONENTS * size); in polygon_create()
89 poly->size = size; in polygon_create()
90 poly->num_verts = 0; in polygon_create()
91 poly->dirty = VG_TRUE; in polygon_create()
92 poly->user_vbuf = NULL; in polygon_create()
[all …]
Dpolygon.h39 void polygon_destroy(struct polygon *poly);
41 void polygon_resize(struct polygon *poly, int new_size);
42 int polygon_size(struct polygon *poly);
44 int polygon_vertex_count(struct polygon *poly);
45 float * polygon_data(struct polygon *poly);
/external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/python2/crcmod/
Dcrcmod.py88 def __init__(self, poly, initCrc=~0L, rev=True, xorOut=0, initialize=True): argument
94 (sizeBits, initCrc, xorOut) = _verifyParams(poly, initCrc, xorOut)
99 self.poly = poly
102 (crcfun, table) = _mkCrcFun(poly, sizeBits, initCrc, rev, xorOut)
110 lst.append('poly = 0x%X' % self.poly)
124 n = Crc(poly=None, initialize=False)
132 n.poly = self.poly
234 poly = 'polynomial: 0x%X' % self.poly
236 poly = poly + ', bit reverse algorithm'
261 'poly' : poly,
[all …]
Dtest.py92 class poly: class
122 return poly(self.p ^ x)
125 return poly(self.p ^ other.p)
128 return poly(self.p ^ other.p)
133 if a == 0 or b == 0: return poly(0)
140 return poly(x)
148 if n == 0: return (self,poly(0))
149 if m < n: return (poly(0),self)
165 return (poly(q),poly(u))
208 g8p = poly(g8)
[all …]
/external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod_osx/crcmod/
Dcrcmod.py88 def __init__(self, poly, initCrc=~0L, rev=True, xorOut=0, initialize=True): argument
94 (sizeBits, initCrc, xorOut) = _verifyParams(poly, initCrc, xorOut)
99 self.poly = poly
102 (crcfun, table) = _mkCrcFun(poly, sizeBits, initCrc, rev, xorOut)
110 lst.append('poly = 0x%X' % self.poly)
124 n = Crc(poly=None, initialize=False)
132 n.poly = self.poly
234 poly = 'polynomial: 0x%X' % self.poly
236 poly = poly + ', bit reverse algorithm'
261 'poly' : poly,
[all …]
Dtest.py92 class poly: class
122 return poly(self.p ^ x)
125 return poly(self.p ^ other.p)
128 return poly(self.p ^ other.p)
133 if a == 0 or b == 0: return poly(0)
140 return poly(x)
148 if n == 0: return (self,poly(0))
149 if m < n: return (poly(0),self)
165 return (poly(q),poly(u))
208 g8p = poly(g8)
[all …]
/external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/python3/crcmod/
Dcrcmod.py89 def __init__(self, poly, initCrc=~0, rev=True, xorOut=0, initialize=True): argument
95 (sizeBits, initCrc, xorOut) = _verifyParams(poly, initCrc, xorOut)
100 self.poly = poly
103 (crcfun, table) = _mkCrcFun(poly, sizeBits, initCrc, rev, xorOut)
111 lst.append('poly = 0x%X' % self.poly)
125 n = Crc(poly=None, initialize=False)
133 n.poly = self.poly
235 poly = 'polynomial: 0x%X' % self.poly
237 poly = poly + ', bit reverse algorithm'
262 'poly' : poly,
[all …]
Dtest.py87 class poly: class
117 return poly(self.p ^ x)
120 return poly(self.p ^ other.p)
123 return poly(self.p ^ other.p)
128 if a == 0 or b == 0: return poly(0)
135 return poly(x)
143 if n == 0: return (self,poly(0))
144 if m < n: return (poly(0),self)
160 return (poly(q),poly(u))
203 g8p = poly(g8)
[all …]
/external/ceres-solver/internal/ceres/
Dpolynomial_test.cc51 Vector poly(1); in ConstantPolynomial() local
52 poly(0) = value; in ConstantPolynomial()
53 return poly; in ConstantPolynomial()
57 Vector AddRealRoot(const Vector& poly, double root) { in AddRealRoot() argument
58 Vector poly2(poly.size() + 1); in AddRealRoot()
60 poly2.head(poly.size()) += poly; in AddRealRoot()
61 poly2.tail(poly.size()) -= root * poly; in AddRealRoot()
67 Vector AddComplexRootPair(const Vector& poly, double real, double imag) { in AddComplexRootPair() argument
68 Vector poly2(poly.size() + 2); in AddComplexRootPair()
71 poly2.head(poly.size()) += poly; in AddComplexRootPair()
[all …]
/external/srtp/test/
Dlfsr.c120 weight(uint32_t poly) { in weight() argument
124 wt += octet_weight[poly & 0xff]; in weight()
125 wt += octet_weight[(poly >> 8) & 0xff]; in weight()
126 wt += octet_weight[(poly >> 16) & 0xff]; in weight()
127 wt += octet_weight[(poly >> 24)]; in weight()
137 period(uint32_t poly) { in period() argument
149 x = (x >> 1) ^ poly; in period()
176 weight_distribution2(uint32_t poly, int *A) { in weight_distribution2() argument
194 x = (x >> 1) ^ poly; in weight_distribution2()
217 weight_distribution(uint32_t poly, int *A) { in weight_distribution() argument
[all …]
/external/v8/test/mjsunit/regress/
Dregress-deep-proto.js28 function poly(x) { function
42 poly(one);
43 poly(two);
44 poly(three);
/external/mesa3d/src/gallium/state_trackers/d3d1x/progs/d3d11app/
Dd3d11u.h42 void poly(unsigned a, unsigned b, unsigned c) in poly() function
49 void poly(unsigned a, unsigned b, unsigned c, unsigned d) in poly() function
51 poly(a, b, c); in poly()
52 poly(a, c, d); in poly()
55 void poly(unsigned a, unsigned b, unsigned c, unsigned d, unsigned e) in poly() function
57 poly(a, b, c, d); in poly()
58 poly(a, d, e); in poly()
61 void poly(unsigned a, unsigned b, unsigned c, unsigned d, unsigned e, unsigned f) in poly() function
63 poly(a, b, c, d, e); in poly()
64 poly(a, e, f); in poly()
[all …]
/external/opencv3/modules/features2d/test/
Dtest_orb.cpp58 Point poly[] = {Point(100, 20), Point(300, 50), Point(400, 200), Point(10, 500)}; in TEST() local
59 fillConvexPoly(roi, poly, int(sizeof(poly) / sizeof(poly[0])), Scalar(255)); in TEST()
/external/gptfdisk/
Dcrc32.cc52 unsigned long crc, poly; in chksum_crc32gentab() local
55 poly = 0xEDB88320L; in chksum_crc32gentab()
63 crc = (crc >> 1) ^ poly; in chksum_crc32gentab()
/external/skia/src/gpu/
DGrTessellator.cpp392 Poly* poly = this; in addVertex() local
409 poly = partner; in addVertex()
419 return poly; in addVertex()
457 Poly* poly = ALLOC_NEW(Poly, (winding), alloc); in new_poly() local
458 poly->addVertex(v, Poly::kNeither_Side, alloc); in new_poly()
459 poly->fNext = *head; in new_poly()
460 *head = poly; in new_poly()
461 return poly; in new_poly()
1271 Poly* poly = new_poly(&polys, v, winding, alloc); in tessellate() local
1272 leftEdge->fRightPoly = rightEdge->fLeftPoly = poly; in tessellate()
[all …]
/external/chromium-trace/catapult/third_party/flot/
Djquery.flot.pie.min.js7 …poly,pt){for(var c=false,i=-1,l=poly.length,j=l-1;++i<l;j=i)(poly[i][1]<=pt[1]&&pt[1]<poly[j][1]||… argument
Djquery.flot.pie.js566 function isPointInPoly(poly, pt) { argument
567 for(var c = false, i = -1, l = poly.length, j = l - 1; ++i < l; j = i)
568 ((poly[i][1] <= pt[1] && pt[1] < poly[j][1]) || (poly[j][1] <= pt[1] && pt[1]< poly[i][1]))
569 …&& (pt[0] < (poly[j][0] - poly[i][0]) * (pt[1] - poly[i][1]) / (poly[j][1] - poly[i][1]) + poly[i]…
/external/llvm/test/CodeGen/XCore/
Dmisc-intrinsics.ll19 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)
/external/lzma/xz-embedded/
Dxz_crc32.c32 const uint32_t poly = 0xEDB88320; in xz_crc32_init() local
41 r = (r >> 1) ^ (poly & ~((r & 1) - 1)); in xz_crc32_init()
Dxz_crc64.c23 const uint64_t poly = 0xC96C5795D7870F42; in xz_crc64_init() local
32 r = (r >> 1) ^ (poly & ~((r & 1) - 1)); in xz_crc64_init()
/external/lzma/Java/Tukaani/src/org/tukaani/xz/check/
DCRC64.java13 private static final long poly = 0xC96C5795D7870F42L; field in CRC64
23 r = (r >>> 1) ^ poly;
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/spec/
DECNamedCurveSpec.java43 Polynomial poly = ((PolynomialExtensionField)field).getMinimalPolynomial(); in convertField() local
44 int[] exponents = poly.getExponentsPresent(); in convertField()
46 return new ECFieldF2m(poly.getDegree(), ks); in convertField()

123