| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| sparsemap.go | 17 dense []sparseEntry
24 return &sparseMap{dense: nil, sparse: make([]int32, n)}
28 return len(s.dense)
33 return i < int32(len(s.dense)) && s.dense[i].key == k
40 if i < int32(len(s.dense)) && s.dense[i].key == k {
41 return s.dense[i].val
48 if i < int32(len(s.dense)) && s.dense[i].key == k
[all...] |
| sparseset.go | 11 dense []ID
18 return &sparseSet{dense: nil, sparse: make([]int32, n)}
26 return len(s.dense)
31 return i < int32(len(s.dense)) && s.dense[i] == x
36 if i < int32(len(s.dense)) && s.dense[i] == x {
39 s.dense = append(s.dense, x)
40 s.sparse[x] = int32(len(s.dense)) -
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| sparsemap.go | 17 dense []sparseEntry
24 return &sparseMap{dense: nil, sparse: make([]int32, n)}
28 return len(s.dense)
33 return i < int32(len(s.dense)) && s.dense[i].key == k
40 if i < int32(len(s.dense)) && s.dense[i].key == k {
41 return s.dense[i].val
48 if i < int32(len(s.dense)) && s.dense[i].key == k
[all...] |
| sparseset.go | 11 dense []ID
18 return &sparseSet{dense: nil, sparse: make([]int32, n)}
26 return len(s.dense)
31 return i < int32(len(s.dense)) && s.dense[i] == x
36 if i < int32(len(s.dense)) && s.dense[i] == x {
39 s.dense = append(s.dense, x)
40 s.sparse[x] = int32(len(s.dense)) -
[all...] |
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_kernel_bmod.h | 23 * \param[in,out] dense Packed values of the original matrix
33 static EIGEN_DONT_INLINE void run(const Index segsize, BlockScalarVector& dense, ScalarVector& tempv, ScalarVector& lusup, Index& luptr, const Index lda,
39 EIGEN_DONT_INLINE void LU_kernel_bmod<SegSizeAtCompileTime>::run(const Index segsize, BlockScalarVector& dense, ScalarVector& tempv, ScalarVector& lusup, Index& luptr, const Index lda,
43 // First, copy U[*,j] segment from dense(*) to tempv(*)
45 // The result of matric-vector update is in dense[*]
52 tempv(i) = dense(irow);
55 // Dense triangular solve -- start effective triangle
63 // Dense matrix-vector product y <-- B*x
75 // Scatter tempv[] into SPA dense[] as a temporary storage
80 dense(irow) = tempv(i)
[all...] |
| SparseLU_copy_to_ucol.h | 43 * \param dense Store the full representation of the column
51 BlockIndexVector repfnz ,IndexVector& perm_r, BlockScalarVector dense, GlobalLU_t& glu)
89 glu.ucol(nextu) = dense(irow);
90 dense(irow) = Scalar(0.0);
|
| SparseLUImpl.h | 42 Index snode_bmod (const Index jcol, const Index fsupc, ScalarVector& dense, GlobalLU_t& glu);
49 void panel_dfs(const Index m, const Index w, const Index jcol, MatrixType& A, IndexVector& perm_r, Index& nseg, ScalarVector& dense, IndexVector& panel_lsub, IndexVector& segrep, IndexVector& repfnz, IndexVector& xprune, IndexVector& marker, IndexVector& parent, IndexVector& xplore, GlobalLU_t& glu);
51 void panel_bmod(const Index m, const Index w, const Index jcol, const Index nseg, ScalarVector& dense, ScalarVector& tempv, IndexVector& segrep, IndexVector& repfnz, GlobalLU_t& glu);
53 Index column_bmod(const Index jcol, const Index nseg, BlockScalarVector dense, ScalarVector& tempv, BlockIndexVector segrep, BlockIndexVector repfnz, Index fpanelc, GlobalLU_t& glu);
54 Index copy_to_ucol(const Index jcol, const Index nseg, IndexVector& segrep, BlockIndexVector repfnz ,IndexVector& perm_r, BlockScalarVector dense, GlobalLU_t& glu);
|
| SparseLU_column_bmod.h | 42 * \param dense Store the full representation of the column
53 Index SparseLUImpl<Scalar,StorageIndex>::column_bmod(const Index jcol, const Index nseg, BlockScalarVector dense, ScalarVector& tempv,
103 // then scatter the result of sup-col update to dense
106 LU_kernel_bmod<1>::run(segsize, dense, tempv, glu.lusup, luptr, lda, nrow, glu.lsub, lptr, no_zeros);
108 LU_kernel_bmod<Dynamic>::run(segsize, dense, tempv, glu.lusup, luptr, lda, nrow, glu.lsub, lptr, no_zeros);
116 // copy the SPA dense into L\U[*,j]
131 glu.lusup(nextlu) = dense(irow);
132 dense(irow) = Scalar(0.0);
|
| SparseLU_panel_bmod.h | 47 * \param dense Store the full representation of the panel
57 const Index nseg, ScalarVector& dense, ScalarVector& tempv,
113 VectorBlock<ScalarVector> dense_col(dense, nextl_col, m); // Scatter/gather entire matrix column from/to here
160 VectorBlock<ScalarVector> dense_col(dense, nextl_col, m); // Scatter/gather entire matrix column from/to here
178 // Scatter l into SPA dense[]
195 VectorBlock<ScalarVector> dense_col(dense, nextl_col, m); // Scatter/gather entire matrix column from/to here
207 // then scatter the result of sup-col update to dense[]
|
| SparseLU_panel_dfs.h | 206 * \param[out] dense Accumulate the column vectors of the panel
219 void SparseLUImpl<Scalar,StorageIndex>::panel_dfs(const Index m, const Index w, const Index jcol, MatrixType& A, IndexVector& perm_r, Index& nseg, ScalarVector& dense, IndexVector& panel_lsub, IndexVector& segrep, IndexVector& repfnz, IndexVector& xprune, IndexVector& marker, IndexVector& parent, IndexVector& xplore, GlobalLU_t& glu)
235 VectorBlock<ScalarVector> dense_col(dense,nextl_col, m); // Accumulate a column vector here
|
| SparseLU.h | 562 ScalarVector dense; local
563 dense.setZero(maxpanel);
612 Base::panel_dfs(m, panel_size, jcol, m_mat, m_perm_r.indices(), nseg1, dense, panel_lsub, segrep, repfnz, xprune, marker, parent, xplore, m_glu);
615 Base::panel_bmod(m, panel_size, jcol, nseg1, dense, tempv, segrep, repfnz, m_glu);
635 VectorBlock<ScalarVector> dense_k(dense, k, m);
|
| /prebuilts/go/darwin-x86/src/regexp/ |
| exec.go | 16 dense []entry
136 if len(runq.dense) == 0 {
185 for _, d := range q.dense {
190 q.dense = q.dense[:0]
200 for j := 0; j < len(runq.dense); j++ {
201 d := &runq.dense[j]
223 for _, d := range runq.dense[j+1:] {
228 runq.dense = runq.dense[:0
[all...] |
| onepass.go | 97 dense []uint32
106 n = q.dense[q.nextIndex]
120 return q.sparse[u] < q.size && q.dense[q.sparse[u]] == u
134 q.dense[q.size] = u
141 dense: make([]uint32, size),
|
| /prebuilts/go/linux-x86/src/regexp/ |
| exec.go | 16 dense []entry
136 if len(runq.dense) == 0 {
185 for _, d := range q.dense {
190 q.dense = q.dense[:0]
200 for j := 0; j < len(runq.dense); j++ {
201 d := &runq.dense[j]
223 for _, d := range runq.dense[j+1:] {
228 runq.dense = runq.dense[:0
[all...] |
| onepass.go | 97 dense []uint32
106 n = q.dense[q.nextIndex]
120 return q.sparse[u] < q.size && q.dense[q.sparse[u]] == u
134 q.dense[q.size] = u
141 dense: make([]uint32, size),
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
| phi.go | 396 dense []ssa.ID
403 return &sparseSet{dense: nil, sparse: make([]int32, n)}
408 return i < int32(len(s.dense)) && s.dense[i] == x
413 if i < int32(len(s.dense)) && s.dense[i] == x {
416 s.dense = append(s.dense, x)
417 s.sparse[x] = int32(len(s.dense)) - 1
421 s.dense = s.dense[:0
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| phi.go | 396 dense []ssa.ID
403 return &sparseSet{dense: nil, sparse: make([]int32, n)}
408 return i < int32(len(s.dense)) && s.dense[i] == x
413 if i < int32(len(s.dense)) && s.dense[i] == x {
416 s.dense = append(s.dense, x)
417 s.sparse[x] = int32(len(s.dense)) - 1
421 s.dense = s.dense[:0
[all...] |
| /external/eigen/Eigen/src/OrderingMethods/ |
| Amd.h | 99 k2, k3, jlast, ln, dense, nzmax, mindeg = 0, nvi, nvj, nvk, mark, wnvi,
103 dense = std::max<StorageIndex> (16, StorageIndex(10 * sqrt(double(n)))); /* find dense threshold */
104 dense = (std::min)(n-2, dense);
163 else if(d > dense || !has_diag) /* node i is dense or has no structural diagonal element */
|
| /prebuilts/go/darwin-x86/src/encoding/binary/ |
| varint.go | 20 // be more dense: a full 64-bit value needs an extra byte just to hold bit 63.
|
| /prebuilts/go/linux-x86/src/encoding/binary/ |
| varint.go | 20 // be more dense: a full 64-bit value needs an extra byte just to hold bit 63.
|
| /external/opencv/cv/src/ |
| cvhistogram.cpp | 1415 CvMatND dense; local
[all...] |
| /prebuilts/go/darwin-x86/src/strings/ |
| replace.go | 121 // remapping that byte through genericReplacer.mapping to create a dense
236 // mapping maps from key bytes to a dense index for trieNode.table.
|
| /prebuilts/go/linux-x86/src/strings/ |
| replace.go | 121 // remapping that byte through genericReplacer.mapping to create a dense
236 // mapping maps from key bytes to a dense index for trieNode.table.
|
| /prebuilts/go/darwin-x86/src/cmd/link/ |
| link_test.go | 13 The raw afternoon is rawest, and the dense fog is densest, and the muddy streets are muddiest near that leaden-headed old obstruction, appropriate ornament for the threshold of a leaden-headed old corporation, Temple Bar. And hard by Temple Bar, in Lincoln?s Inn Hall, at the very heart of the fog, sits the Lord High Chancellor in his High Court of Chancery.`
|
| /prebuilts/go/darwin-x86/src/cmd/vendor/golang.org/x/arch/arm/armasm/ |
| inst.go | 36 // are not a dense packing from 0 to N, although the
|
