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

1 2 34 5 6 7 8 91011>>

  /external/eigen/test/
pastix_support.cpp 19 PastixLLT< SparseMatrix<T, ColMajor>, Eigen::Upper > pastix_llt_upper;
20 PastixLDLT< SparseMatrix<T, ColMajor>, Eigen::Upper > pastix_ldlt_upper;
product_symm.cpp 42 m2 = m1.template triangularView<Upper>(); rhs12.setRandom(); rhs13 = rhs12;
43 m3 = m2.template selfadjointView<Upper>();
45 VERIFY_IS_APPROX(rhs12 += (s1*m2).template selfadjointView<Upper>() * (s2*rhs1),
52 m2 = m1.template triangularView<Upper>();
53 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Upper>() * (s2*rhs2.adjoint()),
56 m2 = m1.template triangularView<Upper>();
65 m2 = m1.template triangularView<Upper>();
70 m2 = m1.template triangularView<Upper>(); rhs13 = rhs12;
product_trmv.cpp 35 m3 = m1.template triangularView<Eigen::Upper>();
36 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Upper>() * v1, largerEps));
45 m3 = m1.template triangularView<Eigen::Upper>();
46 VERIFY((m3.conjugate() * v1.conjugate()).isApprox(m1.conjugate().template triangularView<Eigen::Upper>() * v1.conjugate(), largerEps));
49 m3 = m1.template triangularView<Eigen::Upper>();
52 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Upper>() * v1, largerEps));
59 m3 = m1.template triangularView<Eigen::Upper>();
62 VERIFY((m3.adjoint() * (s1*v1.conjugate())).isApprox(m1.adjoint().template triangularView<Eigen::Upper>() * (s1*v1.conjugate()), largerEps));
product_trsolve.cpp 48 VERIFY_TRSM(cmLhs .template triangularView<Upper>(), cmRhs);
50 VERIFY_TRSM(cmLhs.conjugate().template triangularView<Upper>(), rmRhs);
51 VERIFY_TRSM(cmLhs.adjoint() .template triangularView<Upper>(), rmRhs);
61 VERIFY_TRSM_ONTHERIGHT(cmLhs .template triangularView<Upper>(), cmRhs);
63 VERIFY_TRSM_ONTHERIGHT(cmLhs.conjugate().template triangularView<Upper>(), rmRhs);
  /external/eigen/unsupported/Eigen/src/Skyline/
SkylineStorage.h 17 * The upper elements
144 inline Scalar& upper(Index i) { function in class:Eigen::SkylineStorage
148 inline const Scalar& upper(Index i) const { function in class:Eigen::SkylineStorage
176 static SkylineStorage Map(Index* upperProfile, Index* lowerProfile, Scalar* diag, Scalar* upper, Scalar* lower, Index size, Index upperSize, Index lowerSize) {
181 res.m_upper = upper;
206 Scalar* upper = new Scalar[upperSize]; local
219 memcpy(upper, m_upper, copyUpperSize * sizeof (Scalar));
233 m_upper = upper;
SkylineMatrix.h 115 return &m_data.upper(0);
119 return &m_data.upper(0);
157 if (inner > outer) //upper matrix
161 return this->m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner)));
173 return m_data.upper(m_colStartIndex[inner] + outer - inner);
175 if (outer > inner) //upper matrix
179 return this->m_data.upper(m_colStartIndex[inner] + (outer - inner));
206 if (col > row) //upper matrix
210 return this->m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner)));
219 if (outer > inner) //upper matri
    [all...]
  /external/iptables/extensions/
libip6t_ipv6header.man 1 This module matches IPv6 extension headers and/or upper layer header.
35 which matches any upper layer protocol header. A protocol name from
  /external/iptables/include/linux/netfilter/
xt_hashlimit.h 29 __u32 burst; /* Period multiplier for upper limit. */
53 __u32 burst; /* Period multiplier for upper limit. */
  /external/kernel-headers/original/uapi/linux/netfilter/
xt_hashlimit.h 30 __u32 burst; /* Period multiplier for upper limit. */
54 __u32 burst; /* Period multiplier for upper limit. */
  /external/libnfc-nci/halimpl/pn54x/hal/
phNxpNciHal_Kovio.c 80 * send kovio deactivated ntf to upper layer.
82 NXPLOG_NCIHAL_D(">> send kovio deactivated ntf to upper layer.");
120 NXPLOG_NCIHAL_D("Send the Core Reset NTF to upper layer, which will trigger the recovery\n");
121 //Send the Core Reset NTF to upper layer, which will trigger the recovery.
139 ** passed on to upper layer. for every NTF, DH send a deactivated
142 ** stops coming and this is indicated to upper layer with a HAL
246 * send kovio deactivated ntf to upper layer.
248 NXPLOG_NCIHAL_D(">> send kovio deactivated ntf to upper layer.");
  /external/llvm/test/Transforms/IndVarSimplify/
strengthen-overflow.ll 6 %upper = icmp slt i32 %init, %length
7 br i1 %upper, label %loop, label %exit
32 %upper = icmp sle i32 %init, %length
33 br i1 %upper, label %loop, label %exit
58 %upper = icmp ult i32 %init, %length
59 br i1 %upper, label %loop, label %exit
84 %upper = icmp ule i32 %init, %length
85 br i1 %upper, label %loop, label %exit
  /external/mesa3d/src/gallium/docs/source/exts/
formatting.py 11 envvar = envvar.strip().upper()
21 opcode = opcode.strip().upper()
  /external/webrtc/src/modules/audio_coding/codecs/isac/main/source/
filterbank_tables.c 21 /* The upper channel all-pass filter factors */
29 /* The matrix for transforming the backward composite state to upper channel state */
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/netfilter/
xt_hashlimit.h 25 __u32 burst; /* Period multiplier for upper limit. */
49 __u32 burst; /* Period multiplier for upper limit. */
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/netfilter/
xt_hashlimit.h 25 __u32 burst; /* Period multiplier for upper limit. */
49 __u32 burst; /* Period multiplier for upper limit. */
  /external/libcxx/test/std/localization/locale.categories/category.ctype/locale.ctype.byname/
is_many.pass.cpp 43 assert( (m[0] & F::upper));
57 assert(!(m[1] & F::upper));
71 assert( (m[2] & F::upper));
85 assert(!(m[3] & F::upper));
99 assert(!(m[4] & F::upper));
113 assert(!(m[5] & F::upper));
127 assert(!(m[6] & F::upper));
152 assert(!(m[0] & F::upper));
166 assert(!(m[1] & F::upper));
180 assert( (m[2] & F::upper));
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.ctype/locale.ctype.byname/
is_many.pass.cpp 41 assert( (m[0] & F::upper));
55 assert(!(m[1] & F::upper));
69 assert( (m[2] & F::upper));
83 assert(!(m[3] & F::upper));
97 assert(!(m[4] & F::upper));
111 assert(!(m[5] & F::upper));
125 assert(!(m[6] & F::upper));
150 assert(!(m[0] & F::upper));
164 assert(!(m[1] & F::upper));
178 assert( (m[2] & F::upper));
    [all...]
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
util.rb 128 # within the given lower and upper bounds,
140 def bound( lower, upper=nil )
142 return self unless upper
143 return upper if self > upper
  /external/google-breakpad/src/processor/
binarystream.cc 80 uint32_t lower, upper; local
81 *this >> lower >> upper; local
83 u64 = static_cast<uint64_t>(lower) | (static_cast<uint64_t>(upper) << 32);
119 uint32_t upper = static_cast<uint32_t>(u64 >> 32); local
120 *this << lower << upper; local
  /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
CollationWeights.java 294 // printf("length of upper limit 0x%08lx is %ld\n", upperLimit, upperLength);
296 // Permit upperLength<middleLength: The upper limit for secondaries is 0x10000.
299 // printf("error: no space between lower & upper limits\n");
306 // printf("error: lower limit 0x%08lx is a prefix of upper limit 0x%08lx\n", lowerLimit, upperLimit);
310 /* if the upper limit is a prefix of the lower limit then the earlier test lowerLimit>=upperLimit has caught it */
314 WeightRange[] upper = new WeightRange[5]; local
323 * upper[2] 2
324 * upper[3] 3
325 * upper[4] 4
354 upper[length] = new WeightRange()
    [all...]
  /external/apache-commons-math/src/main/java/org/apache/commons/math/random/
RandomDataImpl.java 190 * <code>lower</code> and <code>upper</code>, inclusive.
194 * @param upper
195 * the upper bound.
197 * @throws NumberIsTooLargeException if {@code lower >= upper}.
199 public int nextInt(int lower, int upper) {
200 if (lower >= upper) {
202 lower, upper, false);
205 return (int) ((r * upper) + ((1.0 - r) * lower) + r);
210 * <code>lower</code> and <code>upper</code>, inclusive.
214 * @param upper
    [all...]
  /external/icu/icu4c/source/data/unidata/
ppucd.txt 103 property;Binary;Upper;Uppercase
846 value;SB;UP;Upper
    [all...]
  /external/icu/icu4c/source/i18n/
collationweights.cpp 219 printf("length of upper limit 0x%08lx is %ld\n", upperLimit, upperLength);
222 // Permit upperLength<middleLength: The upper limit for secondaries is 0x10000.
226 printf("error: no space between lower & upper limits\n");
235 printf("error: lower limit 0x%08lx is a prefix of upper limit 0x%08lx\n", lowerLimit, upperLimit);
240 /* if the upper limit is a prefix of the lower limit then the earlier test lowerLimit>=upperLimit has caught it */
242 WeightRange lower[5], middle, upper[5]; /* [0] and [1] are not used - this simplifies indexing */ local
245 uprv_memset(upper, 0, sizeof(upper));
254 * upper[2] 2
255 * upper[3]
    [all...]
  /cts/tools/signature-tools/src/signature/model/util/
ITypeFactory.java 88 * are equal if they have the same lower bound and have the same upper
89 * bounds. The order of the upper bounds is irrelevant except for the first
97 * the upper bounds
  /external/eigen/lapack/
cholesky.cpp 29 if(UPLO(*uplo)==UP) ret = int(internal::llt_inplace<Scalar, Upper>::blocked(A));
62 A.triangularView<Upper>().adjoint().solveInPlace(B);
63 A.triangularView<Upper>().solveInPlace(B);

Completed in 1283 milliseconds

1 2 34 5 6 7 8 91011>>