HomeSort by relevance Sort by last modified time
    Searched full:roots (Results 101 - 125 of 329) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/webkit/Source/JavaScriptCore/heap/
MarkStack.h 243 // this class to mark direct heap roots that are marked during every GC pass.
  /external/webkit/Tools/Scripts/
new-run-webkit-websocketserver 50 '(overrides layout test roots).')
  /sdk/files/
android.el 10 "history of project roots supplied to `android-jdb'")
  /tools/motodev/src/plugins/android.codeutils/src/com/motorola/studio/android/codeutils/wizards/
SourcePackageChooserPartWizard.java 110 // get all possible roots
  /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...]
  /external/chromium/chrome/browser/resources/
filebrowse.html 762 currentSavedPath = 'roots';
763 getDataForPath('roots');
785 currentSavedPath = 'roots';
930 if (path == 'roots') {
980 if (currentPath == 'roots') {
    [all...]
  /frameworks/av/media/libstagefright/codecs/amrnb/common/src/
az_lsp.cpp 359 The roots of F1(z) and F2(z) are found using Chebyshev polynomial evaluation.
364 If less than 10 roots are found, the LSPs from the past frame are used.
382 Word16 old_lsp[] // (i) : old lsp[] (in case not found 10 roots) (M)
524 // Check if M roots found
563 Word16 old_lsp[], /* (i) : old lsp[] (in case not found 10 roots) (M) */
720 /* Check if M roots found */
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
GrammarAST.java 446 // check roots first.
448 // if roots match, do full list match test on children.
  /external/freetype/src/base/
ftbbox.c 88 /* doesn't need square roots. */
198 /* don't want to use square roots and extra accuracy. */
  /bootable/recovery/
bootloader.cpp 20 #include "roots.h"
roots.cpp 27 #include "roots.h"
  /dalvik/dx/src/com/android/dx/ssa/
Dominators.java 181 * numbering the dfs tree roots.
  /dalvik/hit/src/com/android/hit/
Queries.java 56 * the roots.
  /external/apache-xml/src/main/java/org/apache/xalan/transformer/
KeyTable.java 49 * whose Document roots match this key.
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/digests/
LongDigest.java 330 * cube roots of the first sixty-four prime numbers)
  /external/dexmaker/src/dx/java/com/android/dx/ssa/
Dominators.java 181 * numbering the dfs tree roots.
  /external/jmonkeyengine/engine/src/core/com/jme3/animation/
Skeleton.java 266 sb.append("Skeleton - ").append(boneList.length).append(" bones, ").append(rootBones.length).append(" roots\n");
  /external/libvpx/examples/includes/geshi/geshi/
matlab.php 126 'roots','rose','rot90','rotate','rotate3d','round','rref',
  /external/llvm/include/llvm/CodeGen/
MachineDominators.h 28 this->Roots.push_back(MBB);
  /external/llvm/lib/CodeGen/
GCMetadata.cpp 159 OS << "GC roots for " << FD->getFunction().getName() << ":\n";
  /external/skia/src/core/
SkStrokerPriv.cpp 192 /* Before we enter the world of square-roots and divides,
  /external/v8/src/mips/
frames-mips.h 73 1 << 22 | // s6 (roots in Javascript code)
  /external/valgrind/main/include/
pub_tool_machine.h 122 // This is very Memcheck-specific -- it's used to find the roots when
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/refactoring/
UnwrapRefactoring.java 141 + "which would result in multiple new roots");
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
TreeWizard.cs 356 * Patterns with wildcard roots are also not allowed.
420 // check roots (wildcard matches anything)
506 // check roots

Completed in 987 milliseconds

1 2 3 45 6 7 8 91011>>