HomeSort by relevance Sort by last modified time
    Searched defs:roots (Results 76 - 100 of 162) sorted by null

1 2 34 5 6 7

  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.eclipse.equinox.p2.director.app_1.0.201.R36x_v20100823.jar 
  /prebuilts/eclipse/mavenplugins/tycho/tycho-dependencies-m2repo/org/eclipse/tycho/tycho-bundles-external/0.20.0/eclipse/plugins/
org.eclipse.equinox.p2.director.app_1.0.300.v20130819-1621.jar 
  /prebuilts/tools/common/m2/repository/org/eclipse/tycho/tycho-bundles-external/0.18.1/eclipse/plugins/
org.eclipse.equinox.p2.director.app_1.0.300.v20130327-2119.jar 
  /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/installer/setup/
uninstall.cc 1060 HKEY roots[] = { HKEY_LOCAL_MACHINE, HKEY_CURRENT_USER }; local
    [all...]
  /external/chromium_org/third_party/skia/src/pathops/
SkDQuadIntersection.cpp 21 static int findRoots(const SkDQuadImplicit& i, const SkDQuad& quad, double roots[4],
51 int rootCount = SkReducedQuarticRoots(t4, t3, t2, t1, t0, oneHint, roots);
53 rootCount = SkQuarticRootsReal(firstCubicRoot, t4, t3, t2, t1, t0, roots);
57 roots[index] = 1 - roots[index];
63 static int addValidRoots(const double roots[4], const int count, double valid[4]) {
67 if (!approximately_zero_or_more(roots[index]) || !approximately_one_or_less(roots[index])) {
70 double t = 1 - roots[index];
130 int roots = rootTs.intersect(q1, line) local
158 int roots = rootTs.intersect(q2, *testLines[index]); local
    [all...]
SkPathOpsCubic.cpp 186 // cubic roots
255 double* roots = s; local
256 if (R2MinusQ3 < 0) { // we have 3 real roots
261 *roots++ = r;
265 *roots++ = r;
268 if (!AlmostDequalUlps(s[0], r) && (roots - s == 1 || !AlmostDequalUlps(s[1], r))) {
269 *roots++ = r;
282 *roots++ = r;
286 *roots++ = r;
290 return static_cast<int>(roots - s)
379 int roots = FindExtrema(sub[0].fY, sub[1].fY, sub[2].fY, sub[3].fY, extremeTs); local
    [all...]
  /external/chromium_org/third_party/speex/libspeex/
nb_celp.c 255 int i, sub, roots; local
322 roots=lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA1, stack);
323 /* Check if we found all the roots */
324 if (roots!=st->lpcSize)
    [all...]
  /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);
  /external/skia/src/pathops/
SkDQuadIntersection.cpp 21 static int findRoots(const SkDQuadImplicit& i, const SkDQuad& quad, double roots[4],
51 int rootCount = SkReducedQuarticRoots(t4, t3, t2, t1, t0, oneHint, roots);
53 rootCount = SkQuarticRootsReal(firstCubicRoot, t4, t3, t2, t1, t0, roots);
57 roots[index] = 1 - roots[index];
63 static int addValidRoots(const double roots[4], const int count, double valid[4]) {
67 if (!approximately_zero_or_more(roots[index]) || !approximately_one_or_less(roots[index])) {
70 double t = 1 - roots[index];
130 int roots = rootTs.intersect(q1, line) local
158 int roots = rootTs.intersect(q2, *testLines[index]); local
    [all...]
SkPathOpsCubic.cpp 186 // cubic roots
255 double* roots = s; local
256 if (R2MinusQ3 < 0) { // we have 3 real roots
261 *roots++ = r;
265 *roots++ = r;
268 if (!AlmostDequalUlps(s[0], r) && (roots - s == 1 || !AlmostDequalUlps(s[1], r))) {
269 *roots++ = r;
282 *roots++ = r;
286 *roots++ = r;
290 return static_cast<int>(roots - s)
379 int roots = FindExtrema(sub[0].fY, sub[1].fY, sub[2].fY, sub[3].fY, extremeTs); local
    [all...]
  /external/speex/libspeex/
nb_celp.c 255 int i, sub, roots; local
322 roots=lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA1, stack);
323 /* Check if we found all the roots */
324 if (roots!=st->lpcSize)
    [all...]
  /frameworks/base/core/java/android/animation/
AnimatorSet.java 886 ArrayList<Node> roots = new ArrayList<Node>(); local
    [all...]
  /frameworks/base/core/java/android/widget/
RelativeLayout.java 1677 final ArrayDeque<Node> roots = findRoots(rules); local
1755 final ArrayDeque<Node> roots = mRoots; local
    [all...]
  /frameworks/base/packages/DocumentsUI/src/com/android/documentsui/
DocumentsActivity.java 184 // Hide roots when we're managing a specific root
888 final RootsFragment roots = RootsFragment.get(fm); local
889 if (roots != null) {
890 roots.onCurrentRootChanged();
    [all...]
DirectoryFragment.java 285 final RootsCache roots = DocumentsApplication.getRootsCache(context);
286 return new RecentLoader(context, roots, state);
756 final RootsCache roots = DocumentsApplication.getRootsCache(context); local
    [all...]
  /external/chromium_org/chrome/browser/ui/views/tabs/
tab_drag_controller_interactive_uitest.cc 1520 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
1572 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
1622 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
1681 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
1752 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
1902 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
1998 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
2029 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
    [all...]
  /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...]
  /external/chromium_org/chrome/installer/util/
shell_util.cc 546 // |look_for_in| specifies roots (HKCU and/or HKLM) in which to look for the
547 // key, unspecified roots are not looked into (i.e. the the key is assumed not
673 // registry roots).
1653 const HKEY roots[] = { HKEY_LOCAL_MACHINE, HKEY_CURRENT_USER }; local
    [all...]
  /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...]
ThreadState.h 319 // Trace all persistent roots, called when marking the managed heap objects.
564 // List of persistent roots allocated on the given thread.
565 PersistentNode* roots() const { return m_persistents.get(); } function in class:blink::ThreadState
567 // List of global persistent roots not owned by any particular thread.
  /external/chromium_org/third_party/skia/experimental/Intersection/
Simplify.cpp 767 int roots, rroots; local
778 roots = (*SegmentRayIntersect[fVerb])(fPts, ray, i);
780 } while ((roots == 0 || rroots == 0) && (flip ^= true));
781 if (roots == 0 || rroots == 0) {
793 for (index = 0; index < roots; ++index) {
    [all...]
  /external/chromium_org/v8/src/
serialize.cc 696 // This is called on the roots. It is the driver of the deserialization
1224 Object** roots = isolate()->heap()->roots_array_start(); local
    [all...]
  /external/opencv/cv/src/
cvfundam.cpp 692 CvMat roots = cvMat( 1, 3, CV_64F, r ); local
761 // solve the cubic equation; there can be 1 to 3 roots ...
762 n = cvSolveCubic( &coeffs, &roots );
    [all...]
  /external/skia/experimental/Intersection/
Simplify.cpp 767 int roots, rroots; local
778 roots = (*SegmentRayIntersect[fVerb])(fPts, ray, i);
780 } while ((roots == 0 || rroots == 0) && (flip ^= true));
781 if (roots == 0 || rroots == 0) {
793 for (index = 0; index < roots; ++index) {
    [all...]

Completed in 1346 milliseconds

1 2 34 5 6 7