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

1 2 3 4 56 7 8 91011>>

  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
TreeWizard.cs 410 * Patterns with wildcard roots are also not allowed.
480 // check roots (wildcard matches anything)
578 // check roots
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
TreeWizard.java 271 * Patterns with wildcard roots are also not allowed.
337 // check roots (wildcard matches anything)
410 // check roots
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/
ANTLRTreeWizard.m 439 * Patterns with wildcard roots are also not allowed.
532 // check roots (wildcard matches anything)
610 // check roots
  /external/antlr/antlr-3.4/runtime/Python/antlr3/
treewizard.py 463 Patterns with wildcard roots are also not allowed.
552 # check roots (wildcard matches anything)
600 # check roots
  /external/clang/lib/ARCMigrate/
Transforms.cpp 331 bool TraverseStmt(Stmt *rootS) {
332 if (!rootS)
335 BodyContext BodyCtx(MigrateCtx, rootS);
  /tools/motodev/src/plugins/android.codeutils/src/com/motorola/studio/android/wizards/buildingblocks/
NewBuildingBlocksWizardPage.java 955 IPackageFragmentRoot[] roots = getJavaProject().getPackageFragmentRoots(); local
    [all...]
  /external/speex/libspeex/
sb_celp.c 307 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) {
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
GraphicalEditorPart.java 2664 IPackageFragmentRoot[] roots = javaProject.getPackageFragmentRoots(); local
    [all...]
  /external/llvm/lib/Target/Hexagon/
HexagonMachineScheduler.cpp 315 // Release all DAG roots for scheduling.
328 // Release bottom roots in reverse order so the higher priority nodes appear
381 // Release all DAG roots for scheduling.
  /bootable/recovery/
install.cpp 33 #include "roots.h"
  /dalvik/vm/alloc/
CardTable.cpp 363 * processing. We treat objects marked from the roots and weak
  /external/clang/lib/Analysis/
ReachableCode.cpp 305 // blocks as roots.
  /external/clang/test/
lit.cfg 121 # Get the source and object roots.
  /external/llvm/include/llvm/
MDBuilder.h 117 /// name. This may be identified (uniqued) with other roots with the same
  /external/llvm/lib/Analysis/
TypeBasedAliasAnalysis.cpp 203 // If they have different roots, they're part of different potentially
  /external/llvm/test/
lit.cfg 121 # Get the source and object roots.
  /external/openssl/crypto/bn/
expspeed.c 68 * modular inverse, or modular square roots */
  /external/openssl/crypto/ec/
ecp_oct.c 98 * so y is one of the square roots of x^3 + a*x + b.
  /external/v8/src/
heap.h 48 // Defines all the roots in Heap.
81 /* The first 32 roots above this line should be boring from a GC point of */ \
    [all...]
  /external/webkit/Tools/Scripts/webkitpy/layout_tests/port/
apache_http_server.py 138 Cygwin root paths to what it thinks the correct roots are. So paths
  /libcore/json/src/main/java/org/json/
JSONStringer.java 176 throw new JSONException("Nesting problem: multiple top-level roots");
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/
ExpandableDictionary.java 420 * @param roots node whose children have to be search for matches
434 protected void getWordsRec(NodeArray roots, final WordComposer codes, final char[] word,
437 final int count = roots.mLength;
451 final Node node = roots.mData[i];
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1/
legendre_function.tcc 152 // Two square roots seem more accurate more of the time
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/
legendre_function.tcc 152 // Two square roots seem more accurate more of the time
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/
legendre_function.tcc 152 // Two square roots seem more accurate more of the time

Completed in 1984 milliseconds

1 2 3 4 56 7 8 91011>>