| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| D | Companion.h | 110 bool balanced( Scalar colNorm, Scalar rowNorm,
142 bool companion<_Scalar,_Deg>::balanced( Scalar colNorm, Scalar rowNorm, in balanced() function
231 if( !balanced( colNorm, rowNorm, hasConverged, colB, rowB ) ) in balance()
248 if( !balanced( colNorm, rowNorm, hasConverged, colB, rowB ) ) in balance()
264 if( !balanced( colNorm, rowNorm, hasConverged, colB, rowB ) ) in balance()
|
| /external/iptables/extensions/ |
| D | libxt_NFQUEUE.man | 16 This specifies a range of queues to use. Packets are then balanced across the given queues.
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| D | FastQueue.m | 39 * it resets to start filling at 0 again. If adds/removes are balanced, the
|
| /external/llvm/test/CodeGen/X86/ |
| D | switch-bt.ll | 141 ; The balanced binary switch here would start with a comparison against 39, but
|
| D | misched-balance.ll | 232 ; balanced heuristics are interesting here because we have resource,
|
| D | machine-combiner.ll | 87 ; Verify that we reassociate some of these ops. The optimal balanced tree of adds is not
|
| D | switch.ll | 687 ; If the tree were balanced based on number of clusters, {0-3,100} would go on
|
| /external/llvm/test/CodeGen/PowerPC/ |
| D | machine-combiner.ll | 65 ; Verify that we reassociate some of these ops. The optimal balanced tree of adds is not
|
| /external/opencv3/modules/ml/include/opencv2/ |
| D | ml.hpp | 672 bool balanced=false) = 0;
|
| /external/opencv3/apps/traincascade/ |
| D | old_ml.hpp | 489 bool balanced=false );
511 bool balanced=false);
|
| /external/freetype/src/autofit/ |
| D | afblue.dat | 43 // - Data blocks enclosed in balanced braces, which get copied verbatim and
|
| /external/icu/icu4c/source/test/testdata/ |
| D | re_tests.txt | 487 a(?{)b - c - Sequence (?{...}) not terminated or not {}-balanced
488 a(?{{})b - c - Sequence (?{...}) not terminated or not {}-balanced
490 a(?{"{"})b - c - Sequence (?{...}) not terminated or not {}-balanced
|
| /external/libxml2/ |
| D | TODO | 169 - Parsing of a well balanced chunk xmlParseBalancedChunkMemory()
|
| D | NEWS | 2548 - adding APIs to parse a well balanced chunk of XML (production [43] content of the
|
| /external/llvm/test/Transforms/ObjCARC/ |
| D | cfg-hazards.ll | 364 ; Don't delete anything if they're not balanced.
|
| /external/valgrind/docs/internals/ |
| D | xml-output.txt | 82 All tags are balanced: a <foo> tag is always closed by </foo>. Hence
|
| /external/opencv3/modules/ml/src/ |
| D | svm.cpp | 1628 bool balanced ) in trainAuto() argument
1715 if( is_classification && class_count == 2 && balanced ) in trainAuto()
|
| /external/vulkan-validation-layers/tests/gtest-1.7.0/include/gtest/internal/ |
| D | gtest-port.h.orig | 1073 // doesn't expand to a balanced 'if' statement, so enclose the macro
|
| /external/mksh/src/ |
| D | check.t | 2642 balanced=$(cat <<EOF
2645 echo = $balanced =
2653 balanced=$(cat <<EOF
2656 echo = $balanced =
|
| /external/llvm/lib/Target/ |
| D | README.txt | 51 into llvm.powi calls, allowing the code generator to produce balanced
|
| /external/clang/docs/ |
| D | LanguageExtensions.rst | 1254 +1 retain count, which will be balanced in some way by the function or method.
|
| D | AutomaticReferenceCounting.rst | 665 balanced out in this way.
|
| /external/bison/data/m4sugar/ |
| D | m4sugar.m4 | 894 # something with balanced quotes (use quadrigraphs to get around
|
| /external/v8/test/cctest/ |
| D | test-api.cc | 18706 Local<String> balanced = String::Concat(left, base); in TEST() local
18707 balanced = String::Concat(balanced, right); in TEST()
18708 Local<String> cons_strings[] = {left, balanced, right}; in TEST()
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/en-GB/ |
| D | en-GB_lexpos.utf | 1439 ADJ^V "balanced" :G2P
|