| /frameworks/base/packages/CtsShim/build/ |
| README | 4 must specify the singular APK that can be used to upgrade it.
|
| /external/ImageMagick/MagickCore/ |
| resample.c | 705 % Reference: "We Recommend Singular Value Decomposition", David Austin
786 * the singular values are not clamped; for example, the minor axis
803 * DETAILS: Find the singular values and (unit) left singular
804 * vectors of Jinv, clampling up the singular values to 1, and
805 * multiply the unit left singular vectors by the new singular
[all...] |
| /external/python/cpython2/Doc/library/ |
| gettext.rst | 94 .. function:: ngettext(singular, plural, n)
99 *singular* if *n* is 1; return *plural* otherwise.
110 .. function:: lngettext(singular, plural, n)
119 .. function:: dngettext(domain, singular, plural, n)
126 .. function:: ldngettext(domain, singular, plural, n)
292 .. method:: ngettext(singular, plural, n)
301 .. method:: lngettext(singular, plural, n)
310 .. method:: ungettext(singular, plural, n)
436 .. method:: GNUTranslations.ngettext(singular, plural, n)
438 Do a plural-forms lookup of a message id. *singular* is used as the message i
[all...] |
| /external/protobuf/src/google/protobuf/ |
| extension_set.h | 227 // singular fields -------------------------------------------------
431 // Interface of a lazily parsed singular message extension.
493 // For singular types, indicates if the extension is "cleared". This
501 // For singular message types, indicates whether lazy parsing is enabled
503 // and !is_repeated because we only support lazy parsing for singular
573 // Like ParseField(), but this method may parse singular message extensions
647 // // TypeTraits for singular fields and repeated fields will define the
648 // // symbol "Singular" or "Repeated" respectively. These two symbols will
649 // // be used in extension accessors to distinguish between singular
652 // // user is passing a repeated extension to a singular accessor, or th
[all...] |
| unittest_proto3_arena.proto | 39 // This proto includes every type of field in both singular and repeated
57 // Singular
|
| unittest_proto3_arena_lite.proto | 40 // This proto includes every type of field in both singular and repeated
58 // Singular
|
| unittest_proto3_lite.proto | 39 // This proto includes every type of field in both singular and repeated
57 // Singular
|
| /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/ |
| extension_set.h | 227 // singular fields -------------------------------------------------
431 // Interface of a lazily parsed singular message extension.
493 // For singular types, indicates if the extension is "cleared". This
501 // For singular message types, indicates whether lazy parsing is enabled
503 // and !is_repeated because we only support lazy parsing for singular
573 // Like ParseField(), but this method may parse singular message extensions
647 // // TypeTraits for singular fields and repeated fields will define the
648 // // symbol "Singular" or "Repeated" respectively. These two symbols will
649 // // be used in extension accessors to distinguish between singular
652 // // user is passing a repeated extension to a singular accessor, or th
[all...] |
| /external/eigen/lapack/ |
| svd.cpp | 13 // computes the singular values/vectors a general M-by-N matrix A using divide-and-conquer
84 // computes the singular values/vectors a general M-by-N matrix A using two sided jacobi algorithm
|
| /external/protobuf/javanano/src/test/java/com/google/protobuf/nano/ |
| unittest_nano.proto | 53 // Singular
125 // Singular with defaults
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/debug/ |
| safe_sequence.h | 115 are not singular, and for which @c __pred(x) returns @c
123 are not singular, and for which @c __pred(x) returns @c
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/debug/ |
| safe_sequence.h | 115 are not singular, and for which @c __pred(x) returns @c
123 are not singular, and for which @c __pred(x) returns @c
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/debug/ |
| safe_sequence.h | 115 are not singular, and for which @c __pred(x) returns @c
123 are not singular, and for which @c __pred(x) returns @c
|
| /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/debug/ |
| safe_sequence.h | 115 are not singular, and for which @c __pred(x) returns @c
123 are not singular, and for which @c __pred(x) returns @c
|
| /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/debug/ |
| safe_sequence.h | 115 are not singular, and for which @c __pred(x) returns @c
123 are not singular, and for which @c __pred(x) returns @c
|
| /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/debug/ |
| safe_sequence.h | 115 are not singular, and for which @c __pred(x) returns @c
123 are not singular, and for which @c __pred(x) returns @c
|
| /external/eigen/Eigen/src/SVD/ |
| JacobiSVD.h | 448 * the diagonal entries of S are known as the \em singular \em values of \a A and the columns of \a U and \a V are known as the left
449 * and right \em singular \em vectors of \a A respectively.
451 * Singular values are always sorted in decreasing order.
453 * This JacobiSVD decomposition computes only the singular values by default. If you want \a U or \a V, you need to ask for them explicitly.
456 * smaller value among \a n and \a p, there are only \a m singular vectors; the remaining columns of \a U and \a V do not correspond to actual
457 * singular vectors. Asking for \em thin \a U or \a V means asking for only their \a m first columns to be formed. So \a U is then a n-by-m matrix,
739 /*** step 3. The work matrix is now diagonal, so ensure it's positive so its diagonal entries are the singular values ***/
763 /*** step 4. Sort singular values in descending order and compute the number of nonzero singular values ***/
790 * \return the singular value decomposition of \c *this computed by two-side
[all...] |
| BDCSVD.h | 280 //**** step 3 - Copy singular values and vectors
517 // Second part: try to deflate singular values in combined matrix
565 // that if m_compV is false, then V is not computed. Singular values are sorted in decreasing order.
580 // Allocate space for singular values and vectors
590 // Many singular values might have been deflated, the zero ones have been moved to the end,
664 // Because of deflation, the singular values might not be completely sorted.
677 // Reverse order so that singular values in increased order
678 // Because of deflation, the zeros singular-values are already at the end
720 // if col0(k) == 0, then entry is deflated, so singular value is on diagonal
728 // otherwise, use secular equation to find singular valu
[all...] |
| JacobiSVD_LAPACKE.h | 29 * Singular Value Decomposition - SVD.
|
| /external/nanopb-c/generator/google/protobuf/ |
| message.py | 98 message. Singular fields that are set in the specified message overwrite
100 appended. Singular sub-messages and groups are recursively merged.
225 fields in the message which are not empty. A singular field is non-empty
|
| /external/protobuf/python/google/protobuf/ |
| message.py | 97 message. Singular fields that are set in the specified message overwrite
99 appended. Singular sub-messages and groups are recursively merged.
228 fields in the message which are not empty. A singular field is non-empty
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/estimation/ |
| Estimator.java | 77 * cannot be computed (singular problem)
|
| /external/e2fsprogs/e2fsck/ |
| e2fsck.h | 51 #define P_(singular, plural, n) (ngettext (singular, plural, n))
61 #define P_(singular, plural, n) ((n) == 1 ? (singular) : (plural))
|
| /external/e2fsprogs/intl/ |
| plural-exp.c | 146 /* By default we are using the Germanic form: singular form only
|
| /external/eigen/test/ |
| bdcsvd.cpp | 51 // compare the Singular values returned with Jacobi and Bdc
|
