Searched refs:vectors (Results 1 - 25 of 68) sorted by relevance

123

/external/eigen/Eigen/src/Householder/
H A DBlockHouseholder.h22 void make_block_householder_triangular_factor(TriangularFactorType& triFactor, const VectorsType& vectors, const CoeffsType& hCoeffs) argument
26 const Index nbVecs = vectors.cols();
27 eigen_assert(triFactor.rows() == nbVecs && triFactor.cols() == nbVecs && vectors.rows()>=nbVecs);
31 Index rs = vectors.rows() - i;
32 Scalar Vii = vectors(i,i);
33 vectors.const_cast_derived().coeffRef(i,i) = Scalar(1);
34 triFactor.col(i).head(i).noalias() = -hCoeffs(i) * vectors.block(i, 0, rs, i).adjoint()
35 * vectors.col(i).tail(rs);
36 vectors.const_cast_derived().coeffRef(i, i) = Vii;
46 void apply_block_householder_on_the_left(MatrixType& mat, const VectorsType& vectors, cons argument
[all...]
/external/chromium_org/chrome/browser/history/
H A Dvisit_filter.cc246 TimeVector vectors[3]; local
247 GetTimesOnTheDayOfTheWeek(1, week, max_results, &vectors[0]);
249 GetTimesOnTheDayOfTheWeek(i, week, max_results, &vectors[(i - 1) % 3]);
250 UniteTimeVectors(vectors[(i - 2) % 3], vectors[(i - 1) % 3],
251 &vectors[i % 3]);
252 if (max_results && vectors[i % 3].size() > max_results)
253 vectors[i % 3].resize(max_results);
254 vectors[i % 3].swap(vectors[(
274 const TimeVector* vectors[2] = { &vector1, &vector2 }; local
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/main/
H A Duniform_query.cpp480 const unsigned vectors = MAX2(1, uni->type->matrix_columns); local
491 store->element_stride - (vectors * store->vector_stride);
493 (uint8_t *) (&uni->storage[array_index * (components * vectors)].i);
496 printf("%s: %p[%d] components=%u vectors=%u count=%u vector_stride=%u "
499 vectors, count, store->vector_stride, extra_stride);
511 for (v = 0; v < vectors; v++) {
530 for (v = 0; v < vectors; v++) {
551 for (v = 0; v < vectors; v++) {
834 unsigned vectors; local
853 vectors
[all...]
/external/mesa3d/src/mesa/main/
H A Duniform_query.cpp480 const unsigned vectors = MAX2(1, uni->type->matrix_columns); local
491 store->element_stride - (vectors * store->vector_stride);
493 (uint8_t *) (&uni->storage[array_index * (components * vectors)].i);
496 printf("%s: %p[%d] components=%u vectors=%u count=%u vector_stride=%u "
499 vectors, count, store->vector_stride, extra_stride);
511 for (v = 0; v < vectors; v++) {
530 for (v = 0; v < vectors; v++) {
551 for (v = 0; v < vectors; v++) {
834 unsigned vectors; local
853 vectors
[all...]
/external/libvorbis/doc/
H A D08-residue.tex16 residue vectors into the bitstream packet, and then reconstructs the
17 vectors during decode. Vorbis makes use of three different encoding
33 A set of coded residue vectors are all of the same length. High level
41 of \emph{ch} residue vectors, the total number of partitioned chunks
50 illustration below. Just as the residue vectors are coded in grouped
140 Rather than encoding multiple passed-in vectors as in residue type 1,
141 the \emph{ch} passed in vectors of length \emph{n} are first
172 the unpacked vectors are zeroed. Note that for residue type 2, these
174 the interleaved vector, not the individual vectors before interleave.
249 is passed the number of vectors i
[all...]
H A D01-introduction.tex174 'submaps' that bundle sets of channel vectors together for grouped
179 floor and residue vectors within a mapping. The submap functions as a
181 settings can be applied not only to all the vectors in a given mode,
182 but also specific vectors in a specific mode. Each submap specifies
184 submap's spectral floor and spectral residue vectors.
245 offset into an index of output value vectors, returning the indicated
298 \item decode residue into residue vectors
299 \item inverse channel coupling of residue vectors
346 independent vectors and these frame sizes are in samples per channel.
397 Although the number of residue vectors equal
[all...]
H A D05-comment.tex33 The comment header is logically a list of eight-bit-clean vectors; the
34 number of vectors is bounded to $2^{32}-1$ and the length of each vector
41 The vector lengths and number of vectors are stored lsb first, according
66 The comment vectors are structured similarly to a UNIX environment variable.
H A D04-codec.tex407 decode zeroing all channel output vectors and skipping to the
417 coded in the stream, save for one complication. If some vectors are
419 zeroed and nonzeroed vector to produce two nonzeroed vectors.
438 Unlike floors, which are decoded in channel order, the residue vectors
464 \item decode \varname{[ch]} vectors using residue \varname{[residue_number]}, according to type \varname{[residue_type]}, also passing vector \varname{[do_not_decode_flag]} to indicate which vectors in the bundle should not be decoded. Correct per-vector decode length is \varname{[n]}/2.
537 product of the floor and residue vectors for each channel; the produced
538 vectors are the length \varname{[n]}/2 audio spectrum for each
546 multiplication of the vectors is sufficient for acceptable spectral
H A D07-floor1.tex342 \varname{[floor1_step2_flag]} vectors, as well as [floor1_multiplier]
345 Decode begins by sorting the scalars from vectors
347 \varname{[floor1_step2_flag]} together into new vectors
352 elements of the other two vectors so that the X, Y and step2_flag
/external/chromium_org/third_party/opus/src/tests/
H A Drun_vectors.sh52 echo Test vectors found in $VECTOR_PATH
54 echo No test vectors found
55 #Don't make the test fail here because the test vectors
/external/libopus/tests/
H A Drun_vectors.sh52 echo Test vectors found in $VECTOR_PATH
54 echo No test vectors found
55 #Don't make the test fail here because the test vectors
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/r200/
H A Dr200_sanity.c616 static struct reg vectors[512*4+1]; variable in typeref:struct:reg
638 for (i = 0, tmp = vector_names ; i < Elements(vectors) ; i++) {
640 vectors[i].idx = i;
641 vectors[i].closest = tmp;
642 vectors[i].flags = ISFLOAT|ISVEC;
647 vectors[Elements(vectors)-1].idx = -1;
798 for (i = 0 ; i < Elements(vectors) ; i++)
799 print_reg( &vectors[i] );
906 int sz = header.vectors
[all...]
H A Dr200_state_init.c175 h.vectors.cmd_type = RADEON_CMD_VECTORS;
176 h.vectors.offset = offset;
177 h.vectors.stride = stride;
178 h.vectors.count = count;
284 OUT_BATCH(h.vectors.offset | (h.vectors.stride << RADEON_VEC_INDX_OCTWORD_STRIDE_SHIFT)); \
285 OUT_BATCH(CP_PACKET0_ONE(R200_SE_TCL_VECTOR_DATA_REG, h.vectors.count - 1)); \
286 OUT_BATCH_TABLE((data), h.vectors.count); \
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/radeon/
H A Dradeon_sanity.c338 static struct reg vectors[512*4+1]; variable in typeref:struct:reg
360 for (i = 0, tmp = vector_names ; i < Elements(vectors) ; i++) {
362 vectors[i].idx = i;
363 vectors[i].closest = tmp;
364 vectors[i].flags = ISFLOAT|ISVEC;
369 vectors[Elements(vectors)-1].idx = -1;
520 for (i = 0 ; i < Elements(vectors) ; i++)
521 print_reg( &vectors[i] );
628 int sz = header.vectors
[all...]
H A Dradeon_state_init.c170 h.vectors.cmd_type = RADEON_CMD_VECTORS;
171 h.vectors.offset = offset;
172 h.vectors.stride = stride;
173 h.vectors.count = count;
246 OUT_BATCH(h.vectors.offset | (h.vectors.stride << RADEON_VEC_INDX_OCTWORD_STRIDE_SHIFT)); \
247 OUT_BATCH(CP_PACKET0_ONE(R200_SE_TCL_VECTOR_DATA_REG, h.vectors.count - 1)); \
248 OUT_BATCH_TABLE((data), h.vectors.count); \
/external/mesa3d/src/mesa/drivers/dri/r200/
H A Dr200_sanity.c616 static struct reg vectors[512*4+1]; variable in typeref:struct:reg
638 for (i = 0, tmp = vector_names ; i < Elements(vectors) ; i++) {
640 vectors[i].idx = i;
641 vectors[i].closest = tmp;
642 vectors[i].flags = ISFLOAT|ISVEC;
647 vectors[Elements(vectors)-1].idx = -1;
798 for (i = 0 ; i < Elements(vectors) ; i++)
799 print_reg( &vectors[i] );
906 int sz = header.vectors
[all...]
/external/mesa3d/src/mesa/drivers/dri/radeon/
H A Dradeon_sanity.c338 static struct reg vectors[512*4+1]; variable in typeref:struct:reg
360 for (i = 0, tmp = vector_names ; i < Elements(vectors) ; i++) {
362 vectors[i].idx = i;
363 vectors[i].closest = tmp;
364 vectors[i].flags = ISFLOAT|ISVEC;
369 vectors[Elements(vectors)-1].idx = -1;
520 for (i = 0 ; i < Elements(vectors) ; i++)
521 print_reg( &vectors[i] );
628 int sz = header.vectors
[all...]
H A Dradeon_state_init.c170 h.vectors.cmd_type = RADEON_CMD_VECTORS;
171 h.vectors.offset = offset;
172 h.vectors.stride = stride;
173 h.vectors.count = count;
246 OUT_BATCH(h.vectors.offset | (h.vectors.stride << RADEON_VEC_INDX_OCTWORD_STRIDE_SHIFT)); \
247 OUT_BATCH(CP_PACKET0_ONE(R200_SE_TCL_VECTOR_DATA_REG, h.vectors.count - 1)); \
248 OUT_BATCH_TABLE((data), h.vectors.count); \
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/
H A DAST.stg35 pANTLR3_VECTOR_FACTORY vectors;
46 ctx->vectors = antlr3VectorFactoryNew(0);
50 ctx->vectors->close(ctx->vectors);
207 list_<label>=ctx->vectors->newVector(ctx->vectors);
230 list_<label>=ctx->vectors->newVector(ctx->vectors);
/external/chromium_org/third_party/skia/tests/
H A DMatrixTest.cpp217 // test a bunch of vectors. All should be scaled by between minScale and maxScale
222 SkVector vectors[1000]; local
223 for (size_t i = 0; i < SK_ARRAY_COUNT(vectors); ++i) {
224 vectors[i].fX = rand.nextSScalar1();
225 vectors[i].fY = rand.nextSScalar1();
226 if (!vectors[i].normalize()) {
231 mat.mapVectors(vectors, SK_ARRAY_COUNT(vectors));
232 for (size_t i = 0; i < SK_ARRAY_COUNT(vectors); ++i) {
233 SkScalar d = vectors[
[all...]
/external/skia/tests/
H A DMatrixTest.cpp217 // test a bunch of vectors. All should be scaled by between minScale and maxScale
222 SkVector vectors[1000]; local
223 for (size_t i = 0; i < SK_ARRAY_COUNT(vectors); ++i) {
224 vectors[i].fX = rand.nextSScalar1();
225 vectors[i].fY = rand.nextSScalar1();
226 if (!vectors[i].normalize()) {
231 mat.mapVectors(vectors, SK_ARRAY_COUNT(vectors));
232 for (size_t i = 0; i < SK_ARRAY_COUNT(vectors); ++i) {
233 SkScalar d = vectors[
[all...]
/external/compiler-rt/test/builtins/Unit/
H A Dcomparedf2_test.c145 static const struct TestVector vectors[] = { variable in typeref:struct:TestVector
473 const int numVectors = sizeof vectors / sizeof vectors[0];
476 if (test__cmpdf2(&vectors[i])) return 1;
/external/chromium_org/net/third_party/nss/ssl/
H A Dsslsock.c2565 ssl_WriteV(PRFileDesc *fd, const PRIOVec *iov, PRInt32 vectors, argument
2578 if (vectors > PR_MAX_IOVECTOR_SIZE) {
2585 #define KILL_VECTORS while (vectors && !iov->iov_len) { ++iov; --vectors; }
2586 #define GET_VECTOR do { myIov = *iov++; --vectors; KILL_VECTORS } while (0)
2611 if (!vectors)
2614 if (!vectors) {
2621 while (vectors && left) {
2634 while (vectors || myIov.iov_len) {
2647 if (!vectors || myIo
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ppc/
H A Dfilter_bilinear_altivec.asm34 ;# index to the next set of vectors in the row.
112 ;# input will can span three vectors if not aligned correctly.
463 ;# input will can span three vectors if not aligned correctly.
503 ;# input will can span three vectors if not aligned correctly.
/external/libvpx/libvpx/vp8/common/ppc/
H A Dfilter_bilinear_altivec.asm34 ;# index to the next set of vectors in the row.
112 ;# input will can span three vectors if not aligned correctly.
463 ;# input will can span three vectors if not aligned correctly.
503 ;# input will can span three vectors if not aligned correctly.

Completed in 562 milliseconds

123