Searched refs:roots (Results 76 - 100 of 139) sorted by relevance

123456

/external/chromium_org/third_party/WebKit/Source/core/rendering/
H A DTextAutosizer.h134 // more blocks that all have the same fingerprint. Clusters whose roots
138 explicit Supercluster(const BlockSet* roots) argument
139 : m_roots(roots)
211 // blocks that will become cluster roots.
301 // cluster root. Clusters whose roots share the same fingerprint use the
/external/chromium_org/ash/touch/
H A Dtouch_hud_debug.cc372 aura::Window::Windows roots = Shell::GetInstance()->GetAllRootWindows(); local
373 for (aura::Window::Windows::iterator iter = roots.begin();
374 iter != roots.end(); ++iter) {
/external/chromium_org/chrome/browser/chromeos/net/
H A Dcert_verify_proc_chromeos_unittest.cc122 // 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/tools/gyp/pylib/gyp/
H A Dcommon.py289 def DeepDependencyTargets(target_dicts, roots):
292 pending = set(roots)
305 return list(dependencies - set(roots))
/external/chromium_org/components/bookmarks/browser/
H A Dbookmark_codec_unittest.cc116 base::Value* roots; local
117 ASSERT_TRUE(d_value->Get(BookmarkCodec::kRootsKey, &roots));
118 ASSERT_EQ(base::Value::TYPE_DICTIONARY, roots->GetType());
121 static_cast<base::DictionaryValue*>(roots);
/external/chromium_org/third_party/skia/src/core/
H A DSkGeometry.h30 /** 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]);
H A DSkEdgeClipper.cpp58 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/skia/src/core/
H A DSkGeometry.h30 /** 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]);
H A DSkEdgeClipper.cpp58 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_org/third_party/skia/experimental/Intersection/
H A DQuadraticUtilities.cpp25 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/skia/experimental/Intersection/
H A DQuadraticUtilities.cpp25 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/speex/libspeex/
H A Dlsp.c68 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);
H A Dsb_celp.c307 int i, roots, sub; local
411 roots=lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA1, stack);
412 if (roots!=st->lpcSize)
414 roots = lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA2, stack);
415 if (roots!=st->lpcSize) {
/external/nanohttpd/webserver/src/main/java/fi/iki/elonen/
H A DSimpleWebServer.java288 List<File> roots = getRootDirs();
289 for (int i = 0; !canServeUri && i < roots.size(); i++) {
290 homeDir = roots.get(i);
/external/speex/libspeex/
H A Dlsp.c68 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);
H A Dsb_celp.c307 int i, roots, sub; local
411 roots=lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA1, stack);
412 if (roots!=st->lpcSize)
414 roots = lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA2, stack);
415 if (roots!=st->lpcSize) {
/external/blktrace/btt/
H A Dinlines.h287 struct rb_root *roots = dip->heads; local
288 return &roots[type];
/external/chromium_org/chrome/browser/media_galleries/
H A Dmedia_folder_finder_unittest.cc41 const std::vector<base::FilePath> roots,
51 media_folder_finder_->SetRootsForTesting(roots);
40 CreateMediaFolderFinder( const std::vector<base::FilePath> roots, bool expected_success, const MediaFolderFinder::MediaFolderFinderResults& expected_results) argument
/external/chromium_org/third_party/skia/src/pathops/
H A DSkPathOpsQuad.cpp27 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/tools/code_coverage/
H A Dcroc.py206 # Replace alternate roots
439 path relative to an alt_name for one of the roots
518 for rootdict in cfg.get('roots', []):
629 '-r', '--root', dest='roots', type='string', action='append',
655 roots=[],
667 for root_opt in options.roots:
/external/skia/src/pathops/
H A DSkPathOpsQuad.cpp27 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/eigen/unsupported/Eigen/src/Polynomials/
H A DPolynomialSolver.h20 * - 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 o
[all...]
/external/chromium_org/third_party/WebKit/Source/platform/heap/
H A DHandle.h352 static PersistentNode* roots() { return state()->roots(); } function in class:blink::ThreadLocalPersistents
369 static PersistentNode* roots() { return ThreadState::globalRoots(); } function in class:blink::GlobalPersistents
388 ASSERT(m_roots == RootsAccessor::roots()); // Check that the thread is using the same roots list.
400 , m_roots(RootsAccessor::roots())
404 m_prev = RootsAccessor::roots();
413 , m_roots(RootsAccessor::roots())
/external/chromium_org/chrome/installer/setup/
H A Duninstall.cc1060 HKEY roots[] = { HKEY_LOCAL_MACHINE, HKEY_CURRENT_USER }; local
1061 for (size_t i = 0; i < arraysize(roots); ++i) {
1063 if (roots[i] == HKEY_LOCAL_MACHINE)
1071 InstallUtil::DeleteRegistryKey(roots[i], ext_prog_id,
1078 InstallUtil::DeleteRegistryKey(roots[i], ext_association,
/external/opencv/cxcore/src/
H A Dcxpersistence.cpp128 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...]

Completed in 720 milliseconds

123456