HomeSort by relevance Sort by last modified time
    Searched full:recursion (Results 51 - 75 of 864) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/apache-xml/src/main/java/org/apache/xalan/templates/
ElemExsltFuncResult.java 58 // element. Recursion is allowed: intermediate results are cleared
  /external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.ref/
p5-cxx03-extra-copy.cpp 43 // Check for "dangerous" default arguments that could cause recursion.
  /external/dropbear/libtommath/
bn_mp_dr_reduce.c 82 * Each successive "recursion" makes the input smaller and smaller.
  /external/junit/src/org/junit/runners/model/
RunnerBuilder.java 75 * {@code children}. Care is taken to avoid infinite recursion:
  /external/libxslt/libxslt/
imports.c 120 "xsl:import : recursion detected on imported URL %s\n", URI);
214 * in order to detect recursion, we check all previously included
221 "xsl:include : recursion detected on included URL %s\n", URI);
245 /* chain to stylesheet for recursion checking */
  /external/valgrind/main/drd/tests/
tc23_bogus_condwait.stderr.exp-linux-x86 16 Mutex not locked: mutex 0x........, recursion count 0, owner 0.
56 Mutex not locked by calling thread: mutex 0x........, recursion count 1, owner 2.
76 The impossible happened: mutex is locked simultaneously by two threads: mutex 0x........, recursion count 1, owner 2.
84 Mutex not locked by calling thread: mutex 0x........, recursion count 2, owner 1.
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1/
legendre_function.tcc 62 * @brief Return the Legendre polynomial by recursion on order
115 * @brief Return the associated Legendre function by recursion
243 // Starting value for recursion.
281 // Compute Y_l^m, l > m+1, upward recursion on l.
exp_integral.tcc 228 * by recursion. Use upward recursion for @f$ x < n @f$
229 * and downward recursion (Miller's algorithm) otherwise.
248 // Forward recursion is stable only for n < x.
255 // Backward recursion is stable only for n >= x.
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/
legendre_function.tcc 62 * @brief Return the Legendre polynomial by recursion on order
115 * @brief Return the associated Legendre function by recursion
243 // Starting value for recursion.
281 // Compute Y_l^m, l > m+1, upward recursion on l.
exp_integral.tcc 228 * by recursion. Use upward recursion for @f$ x < n @f$
229 * and downward recursion (Miller's algorithm) otherwise.
248 // Forward recursion is stable only for n < x.
255 // Backward recursion is stable only for n >= x.
  /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 62 * @brief Return the Legendre polynomial by recursion on order
115 * @brief Return the associated Legendre function by recursion
243 // Starting value for recursion.
281 // Compute Y_l^m, l > m+1, upward recursion on l.
exp_integral.tcc 228 * by recursion. Use upward recursion for @f$ x < n @f$
229 * and downward recursion (Miller's algorithm) otherwise.
248 // Forward recursion is stable only for n < x.
255 // Backward recursion is stable only for n >= x.
  /prebuilts/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/tr1/
legendre_function.tcc 62 * @brief Return the Legendre polynomial by recursion on order
115 * @brief Return the associated Legendre function by recursion
243 // Starting value for recursion.
281 // Compute Y_l^m, l > m+1, upward recursion on l.
exp_integral.tcc 228 * by recursion. Use upward recursion for @f$ x < n @f$
229 * and downward recursion (Miller's algorithm) otherwise.
248 // Forward recursion is stable only for n < x.
255 // Backward recursion is stable only for n >= x.
  /prebuilts/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/tr1/
legendre_function.tcc 62 * @brief Return the Legendre polynomial by recursion on order
115 * @brief Return the associated Legendre function by recursion
243 // Starting value for recursion.
281 // Compute Y_l^m, l > m+1, upward recursion on l.
exp_integral.tcc 228 * by recursion. Use upward recursion for @f$ x < n @f$
229 * and downward recursion (Miller's algorithm) otherwise.
248 // Forward recursion is stable only for n < x.
255 // Backward recursion is stable only for n >= x.
  /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/gnu-libstdc++/include/tr1/
legendre_function.tcc 62 * @brief Return the Legendre polynomial by recursion on order
115 * @brief Return the associated Legendre function by recursion
243 // Starting value for recursion.
281 // Compute Y_l^m, l > m+1, upward recursion on l.
exp_integral.tcc 228 * by recursion. Use upward recursion for @f$ x < n @f$
229 * and downward recursion (Miller's algorithm) otherwise.
248 // Forward recursion is stable only for n < x.
255 // Backward recursion is stable only for n >= x.
  /external/chromium/base/threading/
thread_collision_warner.h 217 // calls this multiple time (recursion allowed).
220 // Same as EnterSelf but recursion is not allowed.
  /external/icu4c/common/
ucnv_cb.c 31 /* Note: Recursion may occur in the cb functions, be sure to update the offsets correctly
61 This is a fun one. Recursion can occur - we're basically going to
  /external/valgrind/main/include/
pub_tool_seqmatch.h 42 This routine is recursive. The recursion depth is equal to the
44 excessive recursion. This function has no global state and so is
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
GrammarSanity.java 44 * visited to track infinite recursion.
53 /** Check all rules for infinite left recursion before analysis. Return list
85 * we can avoid epsilon-loop-induced infinite recursion here. Keep
  /external/chromium/base/
message_pump_mac.h 166 // The recursion depth of the currently-executing CFRunLoopRun loop on the
171 // The recursion depth (calculated in the same way as nesting_level_) of the
175 // The deepest (numerically highest) recursion depth encountered since the
  /external/fdlibm/
e_jn.c 25 * for n<x, forward recursion us used starting
29 * recursion is used starting from a supposed value
35 * that forward recursion is used for all
  /external/libgsm/src/
lpc.c 189 /* Schur recursion with 16 bits arithmetic.
205 /* Initialize array P[..] and K[..] for the recursion.
229 /* Schur recursion

Completed in 824 milliseconds

1 23 4 5 6 7 8 91011>>