| /frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
| az_isp.c | 25 * The ISPs are the roots of the two polynomials F1(z) and F2(z) *
30 * For a even order m=2n, F1(z) has M/2 conjugate roots on the unit *
31 * circle and F2(z) has M/2-1 conjugate roots on the unit circle in *
32 * addition to two roots at 0 and pi. *
63 Word16 old_isp[] /* (i) : old isp[] (in case not found M roots) */
98 * Find the ISPs (roots of F1(z) and F2(z) ) using the *
100 * The roots of F1(z) and F2(z) are alternatively searched. *
102 * to F2(z) then back to F1(z) and so on until all roots are found. *
181 /* Check if M-1 roots found */
|
| /art/runtime/ |
| runtime.h | 311 // Visit all the roots. If only_dirty is true then non-dirty roots won't be visited. If
312 // clean_dirty is true then dirty roots will be marked as non-dirty after visiting.
316 // Visit all of the roots we can do safely do concurrently.
319 // Visit all of the non thread roots, we can do this with mutators unpaused.
322 // Visit all other roots which must be done with mutators suspended.
|
| /development/ndk/tools/ |
| headers-diff-bionic-vs-ndk.py | 4 # script should be in development/ndk/tools for correct roots autodetection
22 """Init platform roots and structures before collecting"""
116 """Automated roots initialization (AOSP oriented)"""
186 roots = self.diffs[arch].keys()
187 roots.sort()
188 for root in roots:
|
| /packages/apps/Camera/jni/feature_stab/db_vlvm/ |
| db_image_homography.cpp | 119 double roots[3]; local
162 db_SolveCubic(roots,&nr_roots,p9[4],p9[3],p9[2],p9[1]);
166 if(roots[i]>0)
168 if((!signed_disambiguation) || (db_PolyEval1(p1,roots[i])*db_PolyEval1(p4,roots[i])>0))
170 fsol[j++]=db_SafeSqrtReciprocal(roots[i]);
|
| db_utilities_poly.h | 39 inline void db_SolveQuadratic(double *roots,int *nr_roots,double a,double b,double c)
50 roots[0]= -c/b;
62 roots[0]=q/a;
66 else roots[1]=c/q;
76 For a non-degenerate cubic with two roots, the first root is the single root and
79 DB_API void db_SolveCubic(double *roots,int *nr_roots,double a,double b,double c,double d);
84 DB_API void db_SolveQuartic(double *roots,int *nr_roots,double a,double b,double c,double d,double e);
89 DB_API void db_SolveQuarticForced(double *roots,int *nr_roots,double a,double b,double c,double d,double e);
|
| /packages/apps/Camera2/jni/feature_stab/db_vlvm/ |
| db_image_homography.cpp | 119 double roots[3]; local
162 db_SolveCubic(roots,&nr_roots,p9[4],p9[3],p9[2],p9[1]);
166 if(roots[i]>0)
168 if((!signed_disambiguation) || (db_PolyEval1(p1,roots[i])*db_PolyEval1(p4,roots[i])>0))
170 fsol[j++]=db_SafeSqrtReciprocal(roots[i]);
|
| db_utilities_poly.h | 39 inline void db_SolveQuadratic(double *roots,int *nr_roots,double a,double b,double c)
50 roots[0]= -c/b;
62 roots[0]=q/a;
66 else roots[1]=c/q;
76 For a non-degenerate cubic with two roots, the first root is the single root and
79 DB_API void db_SolveCubic(double *roots,int *nr_roots,double a,double b,double c,double d);
84 DB_API void db_SolveQuartic(double *roots,int *nr_roots,double a,double b,double c,double d,double e);
89 DB_API void db_SolveQuarticForced(double *roots,int *nr_roots,double a,double b,double c,double d,double e);
|
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_image_homography.cpp | 119 double roots[3]; local
162 db_SolveCubic(roots,&nr_roots,p9[4],p9[3],p9[2],p9[1]);
166 if(roots[i]>0)
168 if((!signed_disambiguation) || (db_PolyEval1(p1,roots[i])*db_PolyEval1(p4,roots[i])>0))
170 fsol[j++]=db_SafeSqrtReciprocal(roots[i]);
|
| db_utilities_poly.h | 39 inline void db_SolveQuadratic(double *roots,int *nr_roots,double a,double b,double c)
50 roots[0]= -c/b;
62 roots[0]=q/a;
66 else roots[1]=c/q;
76 For a non-degenerate cubic with two roots, the first root is the single root and
79 DB_API void db_SolveCubic(double *roots,int *nr_roots,double a,double b,double c,double d);
84 DB_API void db_SolveQuartic(double *roots,int *nr_roots,double a,double b,double c,double d,double e);
89 DB_API void db_SolveQuarticForced(double *roots,int *nr_roots,double a,double b,double c,double d,double e);
|
| /build/core/ |
| pathmap.mk | 75 # A list of all source roots under frameworks/base, which will be
105 # A list of all source roots under frameworks/support.
|
| /dalvik/vm/alloc/ |
| Verify.cpp | 68 * Searches the roots and heap for object references.
145 * Verifies references in the roots.
|
| /external/chromium_org/net/data/ssl/scripts/ |
| generate-cross-signed-certs.sh | 7 # This script generates a two roots - one legacy one signed with MD5, and
11 # The "cross-signed" comes from the fact that both the MD5 and SHA1 roots share
|
| /frameworks/base/packages/DocumentsUI/res/values-en-rGB/ |
| strings.xml | 36 <string name="drawer_open" msgid="4545466532430226949">"Show roots"</string>
37 <string name="drawer_close" msgid="7602734368552123318">"Hide roots"</string>
|
| /frameworks/base/packages/DocumentsUI/res/values-en-rIN/ |
| strings.xml | 36 <string name="drawer_open" msgid="4545466532430226949">"Show roots"</string>
37 <string name="drawer_close" msgid="7602734368552123318">"Hide roots"</string>
|
| /frameworks/base/packages/DocumentsUI/res/values-nl/ |
| strings.xml | 36 <string name="drawer_open" msgid="4545466532430226949">"Roots weergeven"</string>
37 <string name="drawer_close" msgid="7602734368552123318">"Roots verbergen"</string>
|
| /external/opencv/cxcore/src/ |
| cxutils.cpp | 243 Finds real roots of cubic, quadratic or linear equation.
266 cvSolveCubic( const CvMat* coeffs, CvMat* roots )
281 if( !CV_IS_MAT(roots) )
282 CV_ERROR( !roots ? CV_StsNullPtr : CV_StsBadArg, "Output parameter is not a valid matrix" );
285 (CV_MAT_TYPE(roots->type) != CV_32FC1 && CV_MAT_TYPE(roots->type) != CV_64FC1) )
295 if( (roots->rows != 1 && roots->cols != 1) ||
296 roots->rows + roots->cols - 1 != 3
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/digests/ |
| SHA384Digest.java | 75 * The first 64 bits of the fractional parts of the square roots
|
| SHA512Digest.java | 77 * The first 64 bits of the fractional parts of the square roots
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_codec_unittest.cc | 67 Value* roots; local
68 ASSERT_TRUE(d_value->Get(BookmarkCodec::kRootsKey, &roots));
69 ASSERT_EQ(Value::TYPE_DICTIONARY, roots->GetType());
71 DictionaryValue* roots_d_value = static_cast<DictionaryValue*>(roots);
|
| /frameworks/base/packages/DocumentsUI/src/com/android/documentsui/ |
| RecentLoader.java | 155 public RecentLoader(Context context, RootsCache roots, State state) {
157 mRoots = roots;
174 final Collection<RootInfo> roots = mRoots.getMatchingRootsBlocking(mState); local
175 for (RootInfo root : roots) {
|
| /development/tools/idegen/ |
| README | 54 Excluding source roots and jars
68 You may want some source roots to come before others in Eclipse. Simply
79 of the "path-precedence" file. To make source roots under ./out come last,
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsCubic.cpp | 111 // cubic roots
180 double* roots = s; local
181 if (R2MinusQ3 < 0) { // we have 3 real roots
186 *roots++ = r;
190 *roots++ = r;
193 if (!AlmostDequalUlps(s[0], r) && (roots - s == 1 || !AlmostDequalUlps(s[1], r))) {
194 *roots++ = r;
207 *roots++ = r;
211 *roots++ = r;
215 return static_cast<int>(roots - s)
304 int roots = FindExtrema(sub[0].fY, sub[1].fY, sub[2].fY, sub[3].fY, extremeTs); local
[all...] |
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| PolynomialUtils.h | 115 * Given the roots of a polynomial compute the coefficients in the
116 * monomial basis of the monic polynomial with same roots and minimal degree.
119 * \param[in] rv : a vector containing the roots of a polynomial.
|
| /external/llvm/include/llvm/CodeGen/ |
| GCStrategy.h | 27 // - Roots
74 bool InitRoots; ///< If set, roots are nulled during lowering.
113 /// customRoots - By default, roots are left for the code generator so it
|
| /external/skia/src/pathops/ |
| SkPathOpsCubic.cpp | 111 // cubic roots
180 double* roots = s; local
181 if (R2MinusQ3 < 0) { // we have 3 real roots
186 *roots++ = r;
190 *roots++ = r;
193 if (!AlmostDequalUlps(s[0], r) && (roots - s == 1 || !AlmostDequalUlps(s[1], r))) {
194 *roots++ = r;
207 *roots++ = r;
211 *roots++ = r;
215 return static_cast<int>(roots - s)
304 int roots = FindExtrema(sub[0].fY, sub[1].fY, sub[2].fY, sub[3].fY, extremeTs); local
[all...] |
