HomeSort by relevance Sort by last modified time
    Searched refs:roots (Results 51 - 75 of 115) sorted by null

1 23 4 5

  /external/blktrace/btt/
devs.c 45 static void __destroy_heads(struct rb_root *roots)
50 __destroy(roots[i].rb_node);
52 free(roots);
inlines.h 287 struct rb_root *roots = dip->heads; local
288 return &roots[type];
  /external/chromium_org/third_party/skia/tests/
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/chromium_org/chrome/browser/bookmarks/
bookmark_html_writer.cc 105 base::Value* roots = NULL;
109 BookmarkCodec::kRootsKey, &roots) ||
110 roots->GetType() != base::Value::TYPE_DICTIONARY) {
116 static_cast<base::DictionaryValue*>(roots);
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
TextAutosizer.cpp 142 // "Potential cluster roots" are the smallest unit for which we can
723 BlockSet* roots = m_fingerprintMapper.getTentativeClusterRoots(fingerprint);
724 if (!roots || roots->size() < 2 || !roots->contains(block))
731 Supercluster* supercluster = new Supercluster(roots);
805 const BlockSet* roots = supercluster->m_roots; local
806 for (BlockSet::iterator it = roots->begin(); it != roots->end(); ++it) {
    [all...]
TextAutosizer.h 134 // more blocks that all have the same fingerprint. Clusters whose roots
138 explicit Supercluster(const BlockSet* roots)
139 : m_roots(roots)
211 // blocks that will become cluster roots.
301 // cluster root. Clusters whose roots share the same fingerprint use the
  /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)"""
187 roots = self.diffs[arch].keys()
188 roots.sort()
189 for root in roots:
  /external/chromium_org/ash/touch/
touch_hud_debug.cc 372 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/
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/tools/gyp/pylib/gyp/
common.py 289 def DeepDependencyTargets(target_dicts, roots):
292 pending = set(roots)
305 return list(dependencies - set(roots))
  /external/chromium_org/components/bookmarks/browser/
bookmark_codec_unittest.cc 116 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/
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]);
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_org/third_party/skia/experimental/Intersection/
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/chrome/browser/resources/sync_internals/
sync_node_browser.js 144 var roots = tree.allNodes.filter(isTypeRootNode); variable
145 roots.sort(nodeComparator);
147 roots.forEach(function(typeRoot) {
  /external/chromium_org/third_party/WebKit/Source/platform/heap/
Handle.h 352 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())
    [all...]
  /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/nanohttpd/webserver/src/main/java/fi/iki/elonen/
SimpleWebServer.java 288 List<File> roots = getRootDirs(); local
289 for (int i = 0; !canServeUri && i < roots.size(); i++) {
290 homeDir = roots.get(i);
  /bootable/recovery/
Android.mk 36 roots.cpp \
  /external/chromium_org/chrome/browser/media_galleries/
media_folder_finder_unittest.cc 41 const std::vector<base::FilePath> roots,
51 media_folder_finder_->SetRootsForTesting(roots);
  /external/chromium_org/third_party/skia/src/pathops/
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/chrome/browser/resources/chromeos/chromevox/tools/
jsbundler.py 146 def ReadSources(roots=[], source_files=[], need_source_text=False,
160 need_source_text = need_source_text or len(roots) > 0
162 for root in roots:
290 parser.add_option('-r', '--root', dest='roots', action='append', default=[],
292 help='Roots of directory trees to scan for sources.')
320 sources = ReadSources(options.roots, args, will_output_source_text,
325 if len(options.roots) > 0:
  /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/chromium_org/chrome/installer/setup/
uninstall.cc 1060 HKEY roots[] = { HKEY_LOCAL_MACHINE, HKEY_CURRENT_USER }; local
    [all...]
  /external/opencv/cxcore/src/
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->total
    [all...]

Completed in 686 milliseconds

1 23 4 5