| /packages/apps/Camera/jni/feature_stab/db_vlvm/ |
| db_utilities_poly.cpp | 28 void db_SolveCubic(double *roots,int *nr_roots,double a,double b,double c,double d)
35 /*For nondegenerate cubics with three roots
40 if(a==0.0) db_SolveQuadratic(roots,nr_roots,b,c,d);
68 roots[0]= -2.0*srq*cos_theta_through3-bp_through3;
69 roots[1]=srq*min2_cos_theta_plu-bp_through3;
70 roots[2]=srq*min2_cos_theta_min-bp_through3;
77 if(A!=0.0) roots[0]=A+q/A-bp_through3;
78 else roots[0]= -bp_through3;
87 roots[0]= -2.0*si_r_srq-bp_through3;
89 roots[1]=si_r_srq-bp_through3
[all...] |
| 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/tools/ |
| fileslist.py | 26 roots = argv[1:]
27 for root in roots:
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/ui/tree/ |
| UiModelTreeContentProvider.java | 88 ArrayList<UiElementNode> roots = new ArrayList<UiElementNode>(); local
92 roots.add(ui_node);
96 roots.add(ui_node);
103 return roots.toArray();
|
| /external/webkit/Source/WebCore/platform/graphics/ |
| GlyphPageTreeNode.cpp | 45 HashMap<int, GlyphPageTreeNode*>* GlyphPageTreeNode::roots = 0;
53 roots = new HashMap<int, GlyphPageTreeNode*>;
57 GlyphPageTreeNode* node = pageNumber ? roots->get(pageNumber) : pageZeroRoot;
64 roots->set(pageNumber, node);
74 if (roots) {
75 HashMap<int, GlyphPageTreeNode*>::iterator end = roots->end();
76 for (HashMap<int, GlyphPageTreeNode*>::iterator it = roots->begin(); it != end; ++it)
98 // Enumerate all the roots and prune any tree that contains our custom font data.
99 if (roots) {
100 HashMap<int, GlyphPageTreeNode*>::iterator end = roots->end()
[all...] |
| /external/webkit/Source/JavaScriptCore/heap/ |
| ConservativeRoots.h | 49 JSCell** roots();
94 inline JSCell** ConservativeRoots::roots() function in class:JSC::ConservativeRoots
|
| MarkStack.cpp | 51 JSCell** roots = conservativeRoots.roots(); local
54 internalAppend(roots[i]);
|
| /external/webkit/Source/WebCore/platform/graphics/gpu/ |
| LoopBlinnMathUtils.cpp | 354 // Returns the number of real roots of the equation [0..2]. Roots are
356 int findUnitQuadRoots(float a, float b, float c, float roots[2])
359 return safeUnitDivide(-c, b, roots[0]) ? 1 : 0;
362 if (discriminant < 0 || isnan(discriminant)) // complex roots
368 if (safeUnitDivide(q, a, roots[numberOfRoots]))
370 if (safeUnitDivide(c, q, roots[numberOfRoots]))
373 // Seemingly have two roots. Check for equality and sort.
374 if (roots[0] == roots[1]
[all...] |
| /external/skia/src/core/ |
| SkGeometry.cpp | 143 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2])
145 SkASSERT(roots);
148 return valid_unit_divide(-C, B, roots);
150 SkScalar* r = roots;
154 if (R < 0 || SkScalarIsNaN(R)) { // complex roots
173 if (r - roots == 2)
175 if (roots[0] > roots[1])
176 SkTSwap<SkScalar>(roots[0], roots[1])
883 SkScalar* roots = tValues; local
1140 SkScalar roots[2]; local
[all...] |
| SkQuadClipper.cpp | 51 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local
52 int count = SkFindUnitQuadRoots(A, B, C, roots);
54 *t = roots[0];
|
| /external/dbus/test/ |
| unused-code-gc.py | 11 roots = {} variable
176 ## now we need to find the roots (exported symbols)
185 if roots.has_key(name):
188 roots[name] = 1
190 print "%d symbols exported from this object" % len(roots)
193 ## notice they are used. Manually add them as roots...
214 if roots.has_key(vr):
216 roots[vr] = 1
218 for k in roots.keys():
237 print "The following are hardcoded in as vtable roots: %s" % vtable_root
[all...] |
| /external/chromium/chrome/browser/history/ |
| starred_url_database.cc | 134 std::set<StarredNode*> roots; local
139 if (!BuildStarNodes(&roots, &folders_with_duplicate_ids, &unparented_urls,
144 bool valid = EnsureStarredIntegrityImpl(&roots, folders_with_duplicate_ids,
147 STLDeleteElements(&roots);
319 std::set<StarredURLDatabase::StarredNode*>* roots,
374 roots->insert(folder_id_to_node_map[star_entries[i].folder_id]);
383 // The node has a cycle. Add it to the list of roots so the cycle is
385 roots->insert(node);
424 std::set<StarredURLDatabase::StarredNode*>* roots,
430 GetNodeByType(*roots, StarredEntry::BOOKMARK_BAR)
[all...] |
| starred_url_database.h | 126 // would make a cycle) are added to roots.
134 // It's up to the caller to delete the nodes returned in roots and
139 std::set<StarredNode*>* roots,
158 // All entries in roots that are not the bookmark bar and other node are
165 std::set<StarredNode*>* roots,
|
| /dalvik/dx/src/junit/runner/ |
| ClassPathTestCollector.java | 32 Hashtable collectFilesInRoots(Vector roots) {
34 Enumeration e= roots.elements();
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_codec.cc | 19 const char* BookmarkCodec::kRootsKey = "roots";
53 DictionaryValue* roots = new DictionaryValue(); local
54 roots->Set(kRootFolderNameKey, EncodeNode(bookmark_bar_node));
55 roots->Set(kOtherBookmarkFolderNameKey, EncodeNode(other_folder_node));
64 main->Set(kRootsKey, roots);
137 Value* roots; local
138 if (!d_value.Get(kRootsKey, &roots))
139 return false; // No roots.
141 if (roots->GetType() != Value::TYPE_DICTIONARY)
142 return false; // Invalid type for roots
[all...] |
| 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);
|
| bookmark_html_writer.cc | 104 Value* roots; local
108 BookmarkCodec::kRootsKey, &roots) ||
109 roots->GetType() != Value::TYPE_DICTIONARY) {
114 DictionaryValue* roots_d_value = static_cast<DictionaryValue*>(roots);
|
| /external/junit/src/junit/runner/ |
| ClassPathTestCollector.java | 35 Hashtable collectFilesInRoots(Vector roots) {
37 Enumeration e= roots.elements();
|
| /frameworks/base/test-runner/src/junit/runner/ |
| ClassPathTestCollector.java | 33 Hashtable collectFilesInRoots(Vector roots) {
35 Enumeration e= roots.elements();
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/wizards/newxmlfile/ |
| NewXmlFileCreationPage.java | 597 Object[] roots = (Object[]) mRootTableViewer.getInput(); local
598 return roots[index].toString();
806 ArrayList<String> roots = type.getRoots(); local
1028 ArrayList<String> roots = type.getRoots(); local
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/manifest/model/ |
| UiClassAttributeNode.java | 475 IPackageFragmentRoot[] roots = javaProject.getPackageFragmentRoots();
476 for (int i = 0; i < roots.length; i++) {
477 IClasspathEntry entry = roots[i].getRawClasspathEntry();
481 result.add(roots[i]);
525 IPackageFragmentRoot[] roots = getPackageFragmentRoots(getProject(),
532 for (IPackageFragmentRoot root : roots) {
613 for (IPackageFragmentRoot root : roots) {
626 } else if (roots.length > 0) {
628 page.setPackageFragmentRoot(roots[0], true /* canBeModified*/);
|
| UiPackageAttributeNode.java | 267 IPackageFragmentRoot[] roots = javaProject.getPackageFragmentRoots(); local
268 for (int i = 0; i < roots.length; i++) {
269 IClasspathEntry entry = roots[i].getRawClasspathEntry();
271 result.add(roots[i]);
|
| /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...] |
| /frameworks/base/core/java/android/animation/ |
| AnimatorSet.java | 775 * - All nodes without dependencies become 'roots'
776 * - while roots list is not null
780 * - any nodes with no dependencies are added to the roots list
785 ArrayList<Node> roots = new ArrayList<Node>(); local
790 roots.add(node);
794 while (roots.size() > 0) {
795 int numRoots = roots.size();
797 Node root = roots.get(i);
810 roots.clear();
811 roots.addAll(tmpRoots)
[all...] |
