Searched refs:m_indices (Results 1 - 8 of 8) sorted by relevance

/external/eigen/Eigen/src/SparseCore/
H A DCompressedStorage.h36 : m_values(0), m_indices(0), m_size(0), m_allocatedSize(0)
40 : m_values(0), m_indices(0), m_size(0), m_allocatedSize(0)
46 : m_values(0), m_indices(0), m_size(0), m_allocatedSize(0)
55 memcpy(m_indices, other.m_indices, m_size * sizeof(Index));
62 std::swap(m_indices, other.m_indices);
70 delete[] m_indices;
98 m_indices[id] = i;
108 inline Index& index(size_t i) { return m_indices[
223 Index* m_indices; member in class:Eigen::internal::CompressedStorage
[all...]
H A DSparseMatrix.h937 : m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(outer), m_id(mat.m_outerIndex[outer])
950 inline Index index() const { return m_indices[m_id]; }
959 const Index* m_indices; member in class:Eigen::SparseMatrix::InnerIterator
970 : m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(outer), m_start(mat.m_outerIndex[outer])
983 inline Index index() const { return m_indices[m_id-1]; }
992 const Index* m_indices; member in class:Eigen::SparseMatrix::ReverseInnerIterator
/external/eigen/Eigen/src/Core/
H A DTranspositions.h122 if(m_indices(k)!=k)
123 mat.row(k).swap(mat.row(m_indices(k)));
130 if(m_indices(k)!=k)
131 mat.row(k).swap(mat.row(m_indices(k)));
170 : m_indices(other.indices()) {}
175 inline Transpositions(const Transpositions& other) : m_indices(other.indices()) {}
180 explicit inline Transpositions(const MatrixBase<Other>& indices) : m_indices(indices)
196 m_indices = other.m_indices;
203 inline Transpositions(Index size) : m_indices(siz
213 IndicesType m_indices; member in class:Eigen::Transpositions
271 IndicesType m_indices; member in class:Eigen::Map
324 const typename IndicesType::Nested m_indices; member in class:Eigen::TranspositionsWrapper
[all...]
H A DPermutationMatrix.h298 inline PermutationMatrix(int size) : m_indices(size)
304 : m_indices(other.indices()) {}
309 inline PermutationMatrix(const PermutationMatrix& other) : m_indices(other.indices()) {}
320 explicit inline PermutationMatrix(const MatrixBase<Other>& indices) : m_indices(indices)
326 : m_indices(tr.size())
335 m_indices = other.indices();
352 m_indices = other.m_indices;
358 const IndicesType& indices() const { return m_indices; }
360 IndicesType& indices() { return m_indices; }
382 IndicesType m_indices; member in class:Eigen::PermutationMatrix
445 IndicesType m_indices; member in class:Eigen::Map
503 typename IndicesType::Nested m_indices; member in class:Eigen::PermutationWrapper
[all...]
/external/chromium_org/third_party/WebKit/Source/core/platform/graphics/filters/custom/
H A DCustomFilterMeshGenerator.cpp56 // * m_indices is a buffer that will have 3 indices per triangle. Each index will point inside
59 m_indices.reserveCapacity(indicesCount());
80 m_indices.append((quadY + triangleY) * m_points.width() + (quadX + triangleX));
99 m_indices.append(m_indices.size());
167 for (unsigned i = 0; i < m_indices.size(); ++i)
168 printf("%d ", m_indices.at(i));
H A DCustomFilterMeshGenerator.h48 const Vector<uint16_t>& indices() const { return m_indices; }
109 Vector<uint16_t> m_indices; member in class:WebCore::CustomFilterMeshGenerator
/external/chromium_org/third_party/WebKit/Source/core/dom/shadow/
H A DContentDistributor.h57 void clear() { m_nodes.clear(); m_indices.clear(); }
59 bool contains(const Node* node) const { return m_indices.contains(node); }
70 HashMap<const Node*, size_t> m_indices; member in class:WebCore::ContentDistribution
H A DContentDistributor.cpp42 m_indices.swap(other.m_indices);
48 m_indices.set(node.get(), size);
54 HashMap<const Node*, size_t>::const_iterator it = m_indices.find(node);
55 if (it == m_indices.end())

Completed in 1501 milliseconds