HomeSort by relevance Sort by last modified time
    Searched full:upward (Results 76 - 100 of 230) sorted by null

1 2 34 5 6 7 8 910

  /external/mesa3d/src/mesa/swrast/
s_linetemp.h 42 * Y==0 at bottom of screen and increases upward.
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/
legendre_function.tcc 278 // Compute Y_l^m, l > m+1, upward recursion on l.
exp_integral.tcc 229 * by recursion. Use upward recursion for @f$ x < n @f$
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/
legendre_function.tcc 278 // Compute Y_l^m, l > m+1, upward recursion on l.
exp_integral.tcc 229 * by recursion. Use upward recursion for @f$ x < n @f$
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/
legendre_function.tcc 278 // Compute Y_l^m, l > m+1, upward recursion on l.
exp_integral.tcc 229 * by recursion. Use upward recursion for @f$ x < n @f$
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/
legendre_function.tcc 278 // Compute Y_l^m, l > m+1, upward recursion on l.
exp_integral.tcc 229 * by recursion. Use upward recursion for @f$ x < n @f$
  /external/ImageMagick/ImageMagick/api/
quantize.html 90 <p>Reduction repeatedly prunes the tree until the number of nodes with n2 &gt; 0 is less than or equal to the maximum number of colors allowed in the output image. On any given iteration over the tree, it selects those nodes whose E count is minimal for pruning and merges their color statistics upward. It uses a pruning threshold, Ep, to govern node selection as follows:</p>
99 <dd> When a node to be pruned has offspring, the pruning procedure invokes itself recursively in order to prune the tree from the leaves upward. n2, Sr, Sg, and Sb in a node being pruned are always added to the corresponding data in that node's parent. This retains the pruned node's color characteristics for later averaging. </dd>
  /external/ImageMagick/ImageMagick/script/
quantize.html 122 <p>Reduction repeatedly prunes the tree until the number of nodes with <var>n2</var> &gt; <var>0</var> is less than or equal to the maximum number of colors allowed in the output image. On any given iteration over the tree, it selects those nodes whose <var>E</var> value is minimal for pruning and merges their color statistics upward. It uses a pruning threshold, <var>Ep</var>, to govern node selection as follows:</p>
133 <p>When a node to be pruned has offspring, the pruning procedure invokes itself recursively in order to prune the tree from the leaves upward. The values of <var>n2</var>, <var>Sr</var>, <var>Sg</var>, and <var>Sb</var> in a node being pruned are always added to the corresponding data in that node's parent. This retains the pruned node's color characteristics for later averaging.</p>
  /external/ImageMagick/www/api/
quantize.html 94 <p>Reduction repeatedly prunes the tree until the number of nodes with n2 &gt; 0 is less than or equal to the maximum number of colors allowed in the output image. On any given iteration over the tree, it selects those nodes whose E count is minimal for pruning and merges their color statistics upward. It uses a pruning threshold, Ep, to govern node selection as follows:</p>
103 <dd> When a node to be pruned has offspring, the pruning procedure invokes itself recursively in order to prune the tree from the leaves upward. n2, Sr, Sg, and Sb in a node being pruned are always added to the corresponding data in that node's parent. This retains the pruned node's color characteristics for later averaging. </dd>
quantize.php 90 <p>Reduction repeatedly prunes the tree until the number of nodes with n2 &gt; 0 is less than or equal to the maximum number of colors allowed in the output image. On any given iteration over the tree, it selects those nodes whose E count is minimal for pruning and merges their color statistics upward. It uses a pruning threshold, Ep, to govern node selection as follows:</p>
99 <dd> When a node to be pruned has offspring, the pruning procedure invokes itself recursively in order to prune the tree from the leaves upward. n2, Sr, Sg, and Sb in a node being pruned are always added to the corresponding data in that node's parent. This retains the pruned node's color characteristics for later averaging. </dd>
  /external/ImageMagick/www/
quantize.html 126 <p>Reduction repeatedly prunes the tree until the number of nodes with <var>n2</var> &gt; <var>0</var> is less than or equal to the maximum number of colors allowed in the output image. On any given iteration over the tree, it selects those nodes whose <var>E</var> value is minimal for pruning and merges their color statistics upward. It uses a pruning threshold, <var>Ep</var>, to govern node selection as follows:</p>
137 <p>When a node to be pruned has offspring, the pruning procedure invokes itself recursively in order to prune the tree from the leaves upward. The values of <var>n2</var>, <var>Sr</var>, <var>Sg</var>, and <var>Sb</var> in a node being pruned are always added to the corresponding data in that node's parent. This retains the pruned node's color characteristics for later averaging.</p>
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletDynamics/Featherstone/
btMultiBody.cpp 758 // First 'upward' loop.
    [all...]
  /frameworks/support/design/src/android/support/design/widget/
BottomSheetBehavior.java 78 * increases as this bottom sheet is moving upward. From 0 to 1 the sheet
354 if (dy > 0) { // Upward
  /development/samples/devbytes/animation/ListViewDraggingAnimation/src/com/example/android/listviewdragginganimation/
DynamicListView.java 480 * upward or downward smooth scroll so as to reveal new items.
  /external/apache-xml/src/main/java/org/apache/xml/utils/
SuballocatedIntVector.java 247 * the specified index is shifted upward to have an index one greater
  /external/apache-xml/src/main/java/org/apache/xpath/axes/
AxesWalker.java 348 * to step upward from the TreeWalker's root node, returns
  /external/autotest/server/site_tests/firmware_PDDataSwap/
firmware_PDDataSwap.py 29 # Upward facing port data role
  /external/chromium-trace/catapult/third_party/mapreduce/mapreduce/
status.py 188 start: the path to start in and work upward from
  /external/webrtc/webrtc/modules/audio_processing/agc/
agc_manager_direct.cc 372 // this adjusts our target gain upward by the same amount and rms_error
  /frameworks/base/docs/html/design/patterns/
navigation.jd 106 task's back stack the complete upward navigation path to the app's topmost screen. This allows users
  /ndk/sources/host-tools/make-3.81/
alloca.c 132 stack_dir = 1; /* Stack grew upward. */
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/suggestions/
SuggestionStripView.java 376 // upward. Further {@link MotionEvent}s will be delivered to

Completed in 4039 milliseconds

1 2 34 5 6 7 8 910