/external/smali/util/src/test/java/org/jf/util/ |
H A D | PathUtilTest.java | 39 File[] roots = File.listRoots(); 41 if (roots.length > 1) { 42 File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt"); 43 File relativePath = new File(roots[1] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt"); 53 File[] roots = File.listRoots(); 55 File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt"); 56 File relativePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt"); 68 File[] roots = File.listRoots(); 70 File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar); 71 File relativePath = new File(roots[ [all...] |
/external/webkit/Source/WebCore/platform/graphics/ |
H A D | GlyphPageTreeNode.cpp | 45 HashMap<int, GlyphPageTreeNode*>* GlyphPageTreeNode::roots = 0; 54 roots = new HashMap<int, GlyphPageTreeNode*>; 58 if (!roots) 59 roots = new HashMap<int, GlyphPageTreeNode*>; 64 GlyphPageTreeNode* node = pageNumber ? roots->get(pageNumber) : pageZeroRoot; 71 roots->set(pageNumber, node); 81 if (roots) { 82 HashMap<int, GlyphPageTreeNode*>::iterator end = roots->end(); 83 for (HashMap<int, GlyphPageTreeNode*>::iterator it = roots->begin(); it != end; ++it) 104 if (roots) { [all...] |
H A D | GlyphPageTreeNode.h | 151 // GlyphPageTreeNode for each glyph page number. The roots do not have a 185 static HashMap<int, GlyphPageTreeNode*>* roots;
|
/external/dbus/test/ |
H A D | 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 [all...] |
/external/webkit/Source/JavaScriptCore/heap/ |
H A D | ConservativeRoots.h | 49 JSCell** roots(); 94 inline JSCell** ConservativeRoots::roots() function in class:JSC::ConservativeRoots
|
H A D | MarkStack.cpp | 51 JSCell** roots = conservativeRoots.roots(); local 54 internalAppend(roots[i]);
|
/external/webkit/Source/WebCore/platform/graphics/gpu/ |
H A D | 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]) argument 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]) 376 if (roots[ 422 chopCubicAtTValues(const FloatPoint src[4], FloatPoint dst[], const float tValues[], int roots) argument [all...] |
/external/skia/src/core/ |
H A D | SkGeometry.cpp | 135 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]) argument 137 SkASSERT(roots); 140 return valid_unit_divide(-C, B, roots); 142 SkScalar* r = roots; 146 if (R < 0 || SkScalarIsNaN(R)) { // complex roots 165 if (r - roots == 2) 167 if (roots[0] > roots[1]) 168 SkTSwap<SkScalar>(roots[0], roots[ 179 Sk64FindFixedQuadRoots(const Sk64& A, const Sk64& B, const Sk64& C, SkFixed roots[2]) argument 617 SkChopCubicAt(const SkPoint src[4], SkPoint dst[], const SkScalar tValues[], int roots) argument [all...] |
H A D | SkQuadClipper.cpp | 44 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local 45 int count = SkFindUnitQuadRoots(A, B, C, roots); 47 *t = roots[0];
|
H A D | SkEdgeClipper.cpp | 58 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local 59 int count = SkFindUnitQuadRoots(A, B, C, roots); 61 *t = roots[0];
|
/external/chromium/chrome/browser/history/ |
H A D | 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, StarredEntr 318 BuildStarNodes( std::set<StarredURLDatabase::StarredNode*>* roots, std::set<StarID>* folders_with_duplicate_ids, std::set<StarredNode*>* unparented_urls, std::set<StarID>* empty_url_ids) argument 423 EnsureStarredIntegrityImpl( std::set<StarredURLDatabase::StarredNode*>* roots, const std::set<StarID>& folders_with_duplicate_ids, std::set<StarredNode*>* unparented_urls, const std::set<StarID>& empty_url_ids) argument [all...] |
H A D | 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,
|
/external/chromium/chrome/browser/bookmarks/ |
H A D | 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...] |
H A D | 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);
|
H A D | 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/compiler-rt/BlocksRuntime/tests/ |
H A D | makefile | 55 ditto $(RootsDirectory)/libclosure.roots/libclosure~dst/usr/local/lib/system $(ALTUSRLOCALLIBSYSTEM) 67 LibsystemRootPath ?= $(RootsDirectory)/Libsystem-$(LibsystemVersion).roots/Libsystem-$(LibsystemVersion)~dst/usr/lib/
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.equinox.p2.director.app_1.0.201.R36x_v20100823.jar | ... .eclipse.equinox.p2.query.IQueryResult roots
boolean install
org.eclipse.equinox.internal. |
/external/opencv/cxcore/src/ |
H A D | 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 [all...] |
H A D | cxpersistence.cpp | 128 CvSeq* roots; member in struct:CvFileStorage 398 //icvFSReleaseCollection( fs->roots ); // delete all the user types recursively 498 if( !fs->roots ) 500 attempts = fs->roots->total; 511 map_node = (CvFileNode*)cvGetSeqElem( fs->roots, k ); 584 if( !fs->roots ) 586 attempts = fs->roots->total; 596 map_node = (CvFileNode*)cvGetSeqElem( fs->roots, k ); 644 if( !fs->roots || (unsigned)stream_index >= (unsigned)fs->roots [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/math/ |
H A D | Eigen3f.java | 70 double roots[] = new double[3];
71 computeRoots(scaledData, roots);
72 eigenValues[0] = (float) roots[0];
73 eigenValues[1] = (float) roots[1];
74 eigenValues[2] = (float) roots[2];
324 // eigenvalues are the roots to this equation, all guaranteed to be
334 // Construct the parameters used in classifying the roots of the
335 // equation and in solving the equation for the roots in closed form.
349 // Compute the eigenvalues by solving for the roots of the polynomial.
|
/external/blktrace/btt/ |
H A D | devs.c | 45 static void __destroy_heads(struct rb_root *roots) argument 50 __destroy(roots[i].rb_node); 52 free(roots);
|
H A D | inlines.h | 287 struct rb_root *roots = dip->heads; local 288 return &roots[type];
|
/external/skia/include/core/ |
H A D | SkGeometry.h | 30 /** Given a quadratic equation Ax^2 + Bx + C = 0, return 0, 1, 2 roots for the 33 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]);
|
/external/jmonkeyengine/engine/src/core-plugins/com/jme3/material/plugins/ |
H A D | J3MLoader.java | 425 private void loadFromRoot(List<Statement> roots) throws IOException{ argument 426 if (roots.size() == 2){ 427 Statement exception = roots.get(0); 434 }else if (roots.size() != 1){ 435 throw new IOException("Too many roots in J3M/J3MD file"); 439 Statement materialStat = roots.get(0);
|
/external/speex/libspeex/ |
H A D | lsp.c | 68 The zeros (roots) of P(z) also happen to alternate, which is why we 69 swap coefficients as we find roots. So the process of finding the 70 LSP frequencies is basically finding the roots of 5th order 241 int roots=0; /* DR 8/2/94: number of roots found */ local 355 roots++; 387 return(roots);
|