/external/chromium_org/chrome/browser/chromeos/net/ |
cert_verify_proc_chromeos_unittest.cc | 122 // Test that the CertVerifyProcChromeOS doesn't trusts roots that are in other 192 // Test that roots specified through additional_trust_anchors are trusted for 251 net::CertificateList roots; local 252 roots.push_back(root_1_[0]); 255 db_2_->ImportCACerts(roots, net::NSSCertDatabase::TRUSTED_SSL, &failed));
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
LineCubicIntersection.cpp | 90 int intersectRay(double roots[3]) { 99 return cubicRootsValidT(A, B, C, D, roots); 105 int roots = intersectRay(rootVals); local 106 for (int index = 0; index < roots; ++index) { 118 int horizontalIntersect(double axisIntercept, double roots[3]) { 122 return cubicRootsValidT(A, B, C, D, roots); 128 int roots = horizontalIntersect(axisIntercept, rootVals); local 129 for (int index = 0; index < roots; ++index) { 144 int verticalIntersect(double axisIntercept, double roots[3]) { 148 return cubicRootsValidT(A, B, C, D, roots); 154 int roots = verticalIntersect(axisIntercept, rootVals); local 226 int roots = intersections.fUsed; local [all...] |
LineQuadraticIntersection.cpp | 100 int intersectRay(double roots[2]) { 102 solve by rotating line+quad so line is horizontal, then finding the roots 127 return quadraticRootsValidT(A, 2 * B, C, roots); 133 int roots = intersectRay(rootVals); local 134 for (int index = 0; index < roots; ++index) { 146 int horizontalIntersect(double axisIntercept, double roots[2]) { 153 return quadraticRootsValidT(D, 2 * E, F, roots); 159 int roots = horizontalIntersect(axisIntercept, rootVals); local 160 for (int index = 0; index < roots; ++index) { 175 int verticalIntersect(double axisIntercept, double roots[2]) 188 int roots = verticalIntersect(axisIntercept, rootVals); local 261 int roots = intersections.fUsed; local 298 int roots = q.horizontalIntersect(pt.y, rootVals); local 313 int roots = q.verticalIntersect(pt.x, rootVals); local [all...] |
QuarticRoot_Test.cpp | 32 double roots[2]; local 33 const int rootCount = limit ? quadraticRootsValidT(A, b, c, roots) 34 : quadraticRootsReal(A, b, c, roots); 46 SkASSERT(approximately_equal(roots[0], -B) 47 || approximately_equal(roots[0], -C)); 49 SkASSERT(!approximately_equal(roots[0], roots[1])); 50 SkASSERT(approximately_equal(roots[1], -B) 51 || approximately_equal(roots[1], -C)); 71 double roots[3] local 130 double roots[4]; local [all...] |
CubicReduceOrder.cpp | 36 int roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues); local 37 for (int index = 0; index < roots; ++index) { 59 int roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); local 60 for (int index = 0; index < roots; ++index) { 128 int roots; local 130 roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); 132 roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues); 134 for (int index = 0; index < roots; ++index) {
|
QuadraticImplicit.cpp | 27 static int findRoots(const QuadImplicitForm& i, const Quadratic& q2, double roots[4], 55 int rootCount = reducedQuarticRoots(t4, t3, t2, t1, t0, oneHint, roots); 59 return quarticRootsReal(firstCubicRoot, t4, t3, t2, t1, t0, roots); 62 static int addValidRoots(const double roots[4], const int count, double valid[4]) { 66 if (!approximately_zero_or_more(roots[index]) || !approximately_one_or_less(roots[index])) { 69 double t = 1 - roots[index]; 137 int roots = intersect(q1, line, rootTs); local 138 if (roots == 0) { 144 if (roots == 2) 166 int roots = intersect(q2, *testLines[index], rootTs); local [all...] |
QuadraticUtilities.cpp | 25 int roots = cubicRootsValidT(a, b, c, d, ts); local 30 for (int index = 0; index < roots; ++index) { 73 and using the roots 150 // unlike quadratic roots, this does not discard real roots <= 0 or >= 1
|
/external/chromium_org/third_party/skia/tests/ |
PathOpsCubicLineIntersectionTest.cpp | 46 int roots = i.intersect(cubic, line); local 47 REPORTER_ASSERT(reporter, roots == 0); 138 int roots = doIntersect(i, cubic, line); local 139 for (int pt = 0; pt < roots; ++pt) {
|
PathOpsCubicQuadIntersectionTest.cpp | 79 int roots = i.intersect(cubic, quad); local 80 SkASSERT(roots == quadCubicTests[index].answerCount); 81 for (int pt = 0; pt < roots; ++pt) {
|
/external/eigen/unsupported/Eigen/src/Polynomials/ |
PolynomialSolver.h | 20 * - real roots, 21 * - greatest, smallest complex roots, 22 * - real roots with greatest, smallest absolute real value, 23 * - greatest, smallest real roots. 25 * It stores the set of roots as a vector of complexes. 54 /** \returns the complex roots of the polynomial */ 55 inline const RootsType& roots() const { return m_roots; } function in class:Eigen::PolynomialSolverBase 58 /** Clear and fills the back insertion sequence with the real roots of the polynomial 59 * i.e. the real part of the complex roots that have an imaginary part which 307 * Computes the complex roots of a real polynomial [all...] |
/external/skia/experimental/Intersection/ |
LineCubicIntersection.cpp | 90 int intersectRay(double roots[3]) { 99 return cubicRootsValidT(A, B, C, D, roots); 105 int roots = intersectRay(rootVals); local 106 for (int index = 0; index < roots; ++index) { 118 int horizontalIntersect(double axisIntercept, double roots[3]) { 122 return cubicRootsValidT(A, B, C, D, roots); 128 int roots = horizontalIntersect(axisIntercept, rootVals); local 129 for (int index = 0; index < roots; ++index) { 144 int verticalIntersect(double axisIntercept, double roots[3]) { 148 return cubicRootsValidT(A, B, C, D, roots); 154 int roots = verticalIntersect(axisIntercept, rootVals); local 226 int roots = intersections.fUsed; local [all...] |
LineQuadraticIntersection.cpp | 100 int intersectRay(double roots[2]) { 102 solve by rotating line+quad so line is horizontal, then finding the roots 127 return quadraticRootsValidT(A, 2 * B, C, roots); 133 int roots = intersectRay(rootVals); local 134 for (int index = 0; index < roots; ++index) { 146 int horizontalIntersect(double axisIntercept, double roots[2]) { 153 return quadraticRootsValidT(D, 2 * E, F, roots); 159 int roots = horizontalIntersect(axisIntercept, rootVals); local 160 for (int index = 0; index < roots; ++index) { 175 int verticalIntersect(double axisIntercept, double roots[2]) 188 int roots = verticalIntersect(axisIntercept, rootVals); local 261 int roots = intersections.fUsed; local 298 int roots = q.horizontalIntersect(pt.y, rootVals); local 313 int roots = q.verticalIntersect(pt.x, rootVals); local [all...] |
QuarticRoot_Test.cpp | 32 double roots[2]; local 33 const int rootCount = limit ? quadraticRootsValidT(A, b, c, roots) 34 : quadraticRootsReal(A, b, c, roots); 46 SkASSERT(approximately_equal(roots[0], -B) 47 || approximately_equal(roots[0], -C)); 49 SkASSERT(!approximately_equal(roots[0], roots[1])); 50 SkASSERT(approximately_equal(roots[1], -B) 51 || approximately_equal(roots[1], -C)); 71 double roots[3] local 130 double roots[4]; local [all...] |
/external/skia/tests/ |
PathOpsCubicLineIntersectionTest.cpp | 46 int roots = i.intersect(cubic, line); local 47 REPORTER_ASSERT(reporter, roots == 0); 138 int roots = doIntersect(i, cubic, line); local 139 for (int pt = 0; pt < roots; ++pt) {
|
PathOpsCubicQuadIntersectionTest.cpp | 79 int roots = i.intersect(cubic, quad); local 80 SkASSERT(roots == quadCubicTests[index].answerCount); 81 for (int pt = 0; pt < roots; ++pt) {
|
/external/smali/util/src/test/java/org/jf/util/ |
PathUtilTest.java | 39 File[] roots = File.listRoots(); local 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(); local 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(); local 70 File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar); 71 File relativePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar) 80 File[] roots = File.listRoots(); local 92 File[] roots = File.listRoots(); local 104 File[] roots = File.listRoots(); local 116 File[] roots = File.listRoots(); local 128 File[] roots = File.listRoots(); local 140 File[] roots = File.listRoots(); local 152 File[] roots = File.listRoots(); local 164 File[] roots = File.listRoots(); local 176 File[] roots = File.listRoots(); local 188 File[] roots = File.listRoots(); local 200 File[] roots = File.listRoots(); local 212 File[] roots = File.listRoots(); local 224 File[] roots = File.listRoots(); local 236 File[] roots = File.listRoots(); local 248 File[] roots = File.listRoots(); local 260 File[] roots = File.listRoots(); local [all...] |
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/wizards/newxmlfile/ |
NewXmlFileCreationPage.java | 596 Object[] roots = (Object[]) mRootTableViewer.getInput(); local 597 return roots[index].toString(); 800 ArrayList<String> roots = type.getRoots(); local 1022 ArrayList<String> roots = type.getRoots(); local [all...] |
/external/blktrace/btt/ |
inlines.h | 287 struct rb_root *roots = dip->heads; local 288 return &roots[type];
|
/external/chromium_org/chrome/browser/media_galleries/ |
media_folder_finder.cc | 32 typedef base::Callback<void(const std::vector<base::FilePath>& /*roots*/)> 144 std::vector<base::FilePath> roots; local 156 roots.push_back(path); 161 roots.push_back(platform_root); 162 callback.Run(roots); 359 const std::vector<base::FilePath>& roots) { 364 roots_for_testing_ = roots; 368 const std::vector<base::FilePath>& roots) { 372 for (size_t i = 0; i < roots.size(); ++i) { 374 const base::FilePath& path = roots[i] [all...] |
/external/chromium_org/net/spdy/ |
spdy_priority_forest.h | 423 std::map<uint64, NodeId> roots; // maps cumulative weight to root node ID local 433 roots[total_weight] = root_id; 446 DCHECK(roots.empty()); 449 DCHECK(!roots.empty()); 454 roots.upper_bound(base::RandGenerator(total_weight)); 455 DCHECK(root_iter != roots.end());
|
/external/chromium_org/third_party/skia/src/pathops/ |
SkDCubicLineIntersection.cpp | 97 int intersectRay(double roots[3]) { 106 int count = SkDCubic::RootsValidT(A, B, C, D, roots); 108 SkDPoint calcPt = c.ptAtT(roots[index]); 116 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots); 129 int roots = intersectRay(rootVals); local 130 for (int index = 0; index < roots; ++index) { 163 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { 167 int count = SkDCubic::RootsValidT(A, B, C, D, roots); 169 SkDPoint calcPt = c.ptAtT(roots[index]); 173 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots); 185 double roots[3]; local 225 double roots[3]; local [all...] |
SkDQuadLineIntersection.cpp | 108 int intersectRay(double roots[2]) { 110 solve by rotating line+quad so line is horizontal, then finding the roots 135 return SkDQuad::RootsValidT(A, 2 * B, C, roots); 147 int roots = intersectRay(rootVals); local 148 for (int index = 0; index < roots; ++index) { 160 int horizontalIntersect(double axisIntercept, double roots[2]) { 167 return SkDQuad::RootsValidT(D, 2 * E, F, roots); 176 int roots = horizontalIntersect(axisIntercept, rootVals); local 177 for (int index = 0; index < roots; ++index) { 191 int verticalIntersect(double axisIntercept, double roots[2]) 207 int roots = verticalIntersect(axisIntercept, rootVals); local [all...] |
SkPathOpsQuad.cpp | 27 int roots = SkDCubic::RootsValidT(a, b, c, d, ts); local 32 for (int index = 0; index < roots; ++index) { 107 and using the roots 111 // this does not discard real roots <= 0 or >= 1
|
/external/chromium_org/third_party/speex/libspeex/ |
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);
|
/external/chromium_org/tools/clang/blink_gc_plugin/ |
process-graph.py | 18 help='Detect cycles containing GC roots') 51 roots = [] variable 228 roots.append(edge) 256 for root_edge in roots: 318 global roots 322 roots = dump[1] 326 dump = (graph, roots) 454 log("Detecting cycles containg GC roots")
|