Searched refs:m_data (Results 1 - 25 of 98) sorted by relevance

1234

/external/testng/src/test/java/test/dataprovider/
H A DMyIterator.java7 private Object[][] m_data; field in class:MyIterator
10 m_data = data;
15 return m_count < m_data.length;
21 return m_data[m_count++];
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/utils/ui/
H A DGridDataFactory.java104 private final GridData m_data; field in class:GridDataFactory
115 m_data = gridData;
116 if (m_control.getLayoutData() != m_data) {
117 m_control.setLayoutData(m_data);
160 m_data.horizontalSpan = hSpan;
161 m_data.verticalSpan = vSpan;
173 m_data.horizontalSpan = hSpan;
185 m_data.verticalSpan = vSpan;
205 m_data.widthHint = xHint;
206 m_data
[all...]
/external/deqp/framework/common/
H A DtcuArray.hpp41 inline T operator[] (int ndx) const { return m_data[ndx]; }
42 inline T& operator[] (int ndx) { return m_data[ndx]; }
44 inline const T* getPtr (void) const { return m_data; }
45 inline T* getPtr (void) { return m_data; }
48 T m_data[Size]; member in class:tcu::Array
H A DtcuVector.hpp87 m_vector.m_data[m_index[i]] = v.m_data[i];
102 T m_data[Size]; member in class:tcu::Vector
113 const T* getPtr (void) const { return &m_data[0]; }
114 T* getPtr (void) { return &m_data[0]; }
117 T x (void) const { return m_data[0]; }
118 T y (void) const { DE_STATIC_ASSERT(Size >= 2); return m_data[1]; }
119 T z (void) const { DE_STATIC_ASSERT(Size >= 3); return m_data[2]; }
120 T w (void) const { DE_STATIC_ASSERT(Size >= 4); return m_data[3]; }
123 T& x (void) { return m_data[
[all...]
H A DtcuMaybe.hpp57 deUint8 m_data[sizeof(T)]; member in union:tcu::Maybe::__anon4073
91 m_ptr = new(m_data)T(val);
100 m_ptr = new(m_data)T(val);
110 m_ptr = new(m_data)T(*other.m_ptr);
123 m_ptr = new(m_data)T(*other.m_ptr);
H A DtcuVectorUtil.hpp130 res += a.m_data[i] * b.m_data[i];
139 sqSum += a.m_data[i] * a.m_data[i];
177 res.m_data[i] = ooLen * a.m_data[i];
209 res.m_data[i] = deFloatMix(x.m_data[i], y.m_data[i], a);
218 res.m_data[
[all...]
H A DtcuCompressedTexture.hpp124 int getDataSize (void) const { return (int)m_data.size(); }
125 const void* getData (void) const { return &m_data[0]; }
126 void* getData (void) { return &m_data[0]; }
135 std::vector<deUint8> m_data; member in class:tcu::CompressedTexture
/external/eigen/unsupported/Eigen/src/Skyline/
H A DSkylineMatrix.h70 SkylineStorage<Scalar> m_data; member in class:Eigen::SkylineMatrix
91 return m_data.upperSize();
95 return m_data.lowerSize();
107 return &m_data.diag(0);
111 return &m_data.diag(0);
115 return &m_data.upper(0);
119 return &m_data.upper(0);
123 return &m_data.lower(0);
127 return &m_data.lower(0);
131 return &m_data
235 eigen_assert(idx < outerSize()); eigen_assert(idx < innerSize()); return this->m_data.diag(idx); } inline Scalar coeffLower(Index row, Index col) const { const Index outer = IsRowMajor ? row : col; const Index inner = IsRowMajor ? col : row; eigen_assert(outer < outerSize()); eigen_assert(inner < innerSize()); eigen_assert(inner != outer); if (IsRowMajor) { const Index minInnerIndex = outer - m_data.lowerProfile(outer); if (inner >= minInnerIndex) return this->m_data.lower(m_rowStartIndex[outer] + inner - (outer - m_data.lowerProfile(outer))); else return Scalar(0); } else { const Index maxInnerIndex = outer + m_data.lowerProfile(outer); if (inner <= maxInnerIndex) return this->m_data.lower(m_rowStartIndex[outer] + (inner - outer)); else return Scalar(0); } } inline Scalar coeffUpper(Index row, Index col) const { const Index outer = IsRowMajor ? row : col; const Index inner = IsRowMajor ? col : row; eigen_assert(outer < outerSize()); eigen_assert(inner < innerSize()); eigen_assert(inner != outer); if (IsRowMajor) { const Index minOuterIndex = inner - m_data.upperProfile(inner); if (outer >= minOuterIndex) return this->m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner))); else return Scalar(0); } else { const Index maxOuterIndex = inner + m_data.upperProfile(inner); if (outer <= maxOuterIndex) return this->m_data.upper(m_colStartIndex[inner] + (outer - inner)); else return Scalar(0); } } inline Scalar& coeffRefDiag(Index idx) { eigen_assert(idx < outerSize()); eigen_assert(idx < innerSize()); return this->m_data.diag(idx); } inline Scalar& coeffRefLower(Index row, Index col) { const Index outer = IsRowMajor ? row : col; const Index inner = IsRowMajor ? col : row; eigen_assert(outer < outerSize()); eigen_assert(inner < innerSize()); eigen_assert(inner != outer); if (IsRowMajor) { const Index minInnerIndex = outer - m_data.lowerProfile(outer); eigen_assert(inner >= minInnerIndex && �); return this->m_data.lower(m_rowStartIndex[outer] + inner - (outer - m_data.lowerProfile(outer))); } else { const Index maxInnerIndex = outer + m_data.lowerProfile(outer); eigen_assert(inner <= maxInnerIndex && �); return this->m_data.lower(m_rowStartIndex[outer] + (inner - outer)); } } inline bool coeffExistLower(Index row, Index col) { const Index outer = IsRowMajor ? row : col; const Index inner = IsRowMajor ? col : row; eigen_assert(outer < outerSize()); eigen_assert(inner < innerSize()); eigen_assert(inner != outer); if (IsRowMajor) { const Index minInnerIndex = outer - m_data.lowerProfile(outer); return inner >= minInnerIndex; } else { const Index maxInnerIndex = outer + m_data.lowerProfile(outer); return inner <= maxInnerIndex; } } inline Scalar& coeffRefUpper(Index row, Index col) { const Index outer = IsRowMajor ? row : col; const Index inner = IsRowMajor ? col : row; eigen_assert(outer < outerSize()); eigen_assert(inner < innerSize()); eigen_assert(inner != outer); if (IsRowMajor) { const Index minOuterIndex = inner - m_data.upperProfile(inner); eigen_assert(outer >= minOuterIndex && �); return this->m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner))); } else { const Index maxOuterIndex = inner + m_data.upperProfile(inner); eigen_assert(outer <= maxOuterIndex && �); return this->m_data.upper(m_colStartIndex[inner] + (outer - inner)); } } inline bool coeffExistUpper(Index row, Index col) { const Index outer = IsRowMajor ? row : col; const Index inner = IsRowMajor ? col : row; eigen_assert(outer < outerSize()); eigen_assert(inner < innerSize()); eigen_assert(inner != outer); if (IsRowMajor) { const Index minOuterIndex = inner - m_data.upperProfile(inner); return outer >= minOuterIndex; } else { const Index maxOuterIndex = inner + m_data.upperProfile(inner); return outer <= maxOuterIndex; } } protected: public: class InnerUpperIterator; class InnerLowerIterator; class OuterUpperIterator; class OuterLowerIterator; inline void setZero() { m_data.clear(); memset(m_colStartIndex, 0, (m_outerSize + 1) * sizeof (Index)); memset(m_rowStartIndex, 0, (m_outerSize + 1) * sizeof (Index)); } inline Index nonZeros() const { return m_data.diagSize() + m_data.upperSize() + m_data.lowerSize(); } inline void reserve(Index reserveSize, Index reserveUpperSize, Index reserveLowerSize) { m_data.reserve(reserveSize, reserveUpperSize, reserveLowerSize); } EIGEN_DONT_INLINE Scalar & insert(Index row, Index col) { const Index outer = IsRowMajor ? row : col; const Index inner = IsRowMajor ? col : row; eigen_assert(outer < outerSize()); eigen_assert(inner < innerSize()); if (outer == inner) return m_data.diag(col); if (IsRowMajor) { if (outer < inner) { Index minOuterIndex = 0; minOuterIndex = inner - m_data.upperProfile(inner); if (outer < minOuterIndex) { const Index previousProfile = m_data.upperProfile(inner); m_data.upperProfile(inner) = inner - outer; const Index bandIncrement = m_data.upperProfile(inner) - previousProfile; const Index stop = m_colStartIndex[cols()]; const Index start = m_colStartIndex[inner]; for (Index innerIdx = stop; innerIdx >= start; innerIdx--) { m_data.upper(innerIdx + bandIncrement) = m_data.upper(innerIdx); } for (Index innerIdx = cols(); innerIdx > inner; innerIdx--) { m_colStartIndex[innerIdx] += bandIncrement; } memset(this->_upperPtr() + start, 0, (bandIncrement - 1) * sizeof (Scalar)); return m_data.upper(m_colStartIndex[inner]); } else { return m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner))); } } if (outer > inner) { const Index minInnerIndex = outer - m_data.lowerProfile(outer); if (inner < minInnerIndex) { const Index previousProfile = m_data.lowerProfile(outer); m_data.lowerProfile(outer) = outer - inner; const Index bandIncrement = m_data.lowerProfile(outer) - previousProfile; const Index stop = m_rowStartIndex[rows()]; const Index start = m_rowStartIndex[outer]; for (Index innerIdx = stop; innerIdx >= start; innerIdx--) { m_data.lower(innerIdx + bandIncrement) = m_data.lower(innerIdx); } for (Index innerIdx = rows(); innerIdx > outer; innerIdx--) { m_rowStartIndex[innerIdx] += bandIncrement; } memset(this->_lowerPtr() + start, 0, (bandIncrement - 1) * sizeof (Scalar)); return m_data.lower(m_rowStartIndex[outer]); } else { return m_data.lower(m_rowStartIndex[outer] + inner - (outer - m_data.lowerProfile(outer))); } } } else { if (outer > inner) { const Index maxOuterIndex = inner + m_data.upperProfile(inner); if (outer > maxOuterIndex) { const Index previousProfile = m_data.upperProfile(inner); m_data.upperProfile(inner) = outer - inner; const Index bandIncrement = m_data.upperProfile(inner) - previousProfile; const Index stop = m_rowStartIndex[rows()]; const Index start = m_rowStartIndex[inner + 1]; for (Index innerIdx = stop; innerIdx >= start; innerIdx--) { m_data.upper(innerIdx + bandIncrement) = m_data.upper(innerIdx); } for (Index innerIdx = inner + 1; innerIdx < outerSize() + 1; innerIdx++) { m_rowStartIndex[innerIdx] += bandIncrement; } memset(this->_upperPtr() + m_rowStartIndex[inner] + previousProfile + 1, 0, (bandIncrement - 1) * sizeof (Scalar)); return m_data.upper(m_rowStartIndex[inner] + m_data.upperProfile(inner)); } else { return m_data.upper(m_rowStartIndex[inner] + (outer - inner)); } } if (outer < inner) { const Index maxInnerIndex = outer + m_data.lowerProfile(outer); if (inner > maxInnerIndex) { const Index previousProfile = m_data.lowerProfile(outer); m_data.lowerProfile(outer) = inner - outer; const Index bandIncrement = m_data.lowerProfile(outer) - previousProfile; const Index stop = m_colStartIndex[cols()]; const Index start = m_colStartIndex[outer + 1]; for (Index innerIdx = stop; innerIdx >= start; innerIdx--) argument
[all...]
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/
H A DTensorStorage.h46 EIGEN_ALIGN_MAX T m_data[MinSize]; member in class:Eigen::TensorStorage
56 EIGEN_STRONG_INLINE T *data() { return m_data; }
58 EIGEN_STRONG_INLINE const T *data() const { return m_data; }
77 EIGEN_DEVICE_FUNC TensorStorage() : m_data(0), m_dimensions() {
79 m_data = internal::conditional_aligned_new_auto<T,(Options_&DontAlign)==0>(1);
83 : m_data(0), m_dimensions(internal::template repeat<NumIndices_, Index>(0)) {}
85 : m_data(internal::conditional_aligned_new_auto<T,(Options_&DontAlign)==0>(size)), m_dimensions(dimensions)
91 m_data = internal::conditional_aligned_new_auto<T,(Options_&DontAlign)==0>(internal::array_prod(m_dimensions));
96 : m_data(internal::conditional_aligned_new_auto<T,(Options_&DontAlign)==0>(internal::array_prod(other.m_dimensions)))
99 internal::smart_copy(other.m_data, othe
140 T *m_data; member in class:Eigen::TensorStorage
[all...]
H A DTensorMap.h60 EIGEN_STRONG_INLINE TensorMap(PointerArgType dataPtr) : m_data(dataPtr), m_dimensions() {
67 EIGEN_STRONG_INLINE TensorMap(PointerArgType dataPtr, Index firstDimension, IndexTypes... otherDimensions) : m_data(dataPtr), m_dimensions(firstDimension, otherDimensions...) {
73 EIGEN_STRONG_INLINE TensorMap(PointerArgType dataPtr, Index firstDimension) : m_data(dataPtr), m_dimensions(firstDimension) {
78 EIGEN_STRONG_INLINE TensorMap(PointerArgType dataPtr, Index dim1, Index dim2) : m_data(dataPtr), m_dimensions(dim1, dim2) {
82 EIGEN_STRONG_INLINE TensorMap(PointerArgType dataPtr, Index dim1, Index dim2, Index dim3) : m_data(dataPtr), m_dimensions(dim1, dim2, dim3) {
86 EIGEN_STRONG_INLINE TensorMap(PointerArgType dataPtr, Index dim1, Index dim2, Index dim3, Index dim4) : m_data(dataPtr), m_dimensions(dim1, dim2, dim3, dim4) {
90 EIGEN_STRONG_INLINE TensorMap(PointerArgType dataPtr, Index dim1, Index dim2, Index dim3, Index dim4, Index dim5) : m_data(dataPtr), m_dimensions(dim1, dim2, dim3, dim4, dim5) {
96 : m_data(dataPtr), m_dimensions(dimensions)
101 : m_data(dataPtr), m_dimensions(dimensions)
105 : m_data(tenso
315 typename MakePointer_<Scalar>::Type m_data; member in class:Eigen::TensorMap
[all...]
/external/deqp/executor/
H A DxeBatchResult.hpp58 size_t getSize (void) const { return m_data.size(); }
59 const deUint8* getBytes (void) const { return !m_data.empty() ? &m_data[0] : DE_NULL; }
67 std::vector<deUint8> m_data; member in class:xe::InfoLog
83 int getDataSize (void) const { return (int)m_data.size(); }
84 void setDataSize (int size) { m_data.resize(size); }
86 const deUint8* getData (void) const { return !m_data.empty() ? &m_data[0] : DE_NULL; }
87 deUint8* getData (void) { return !m_data.empty() ? &m_data[
96 std::vector<deUint8> m_data; member in class:xe::TestCaseResultData
[all...]
H A DxeCallQueue.hpp58 size_t getDataSize (void) const { return m_data.size(); }
59 void setDataSize (size_t size) { m_data.resize(size); }
61 const deUint8* getData (void) const { return m_data.empty() ? DE_NULL : &m_data[0]; }
62 deUint8* getData (void) { return m_data.empty() ? DE_NULL : &m_data[0]; }
66 std::vector<deUint8> m_data; member in class:xe::Call
H A DxeBatchResult.cpp43 const size_t oldSize = m_data.size();
44 m_data.resize(oldSize+numBytes);
45 deMemcpy(&m_data[oldSize], bytes, numBytes);
71 m_data.clear();
/external/svox/pico/tts/
H A Dsvox_ssml_parser.cpp59 m_data = new char[m_datasize];
60 m_data[0] = '\0';
68 if (m_data)
69 delete [] m_data;
78 return (mParser && m_data);
95 return m_data;
112 if (strlen(m_data) > 0)
115 delete m_data;
116 m_data = NULL;
118 m_data
[all...]
/external/eigen/Eigen/src/Core/
H A DDenseStorage.h185 internal::plain_array<T,Size,_Options> m_data; member in class:Eigen::DenseStorage
192 : m_data(internal::constructor_without_unaligned_array_assert()) {}
194 DenseStorage(const DenseStorage& other) : m_data(other.m_data) {
200 if (this != &other) m_data = other.m_data;
210 EIGEN_DEVICE_FUNC void swap(DenseStorage& other) { std::swap(m_data,other.m_data); }
215 EIGEN_DEVICE_FUNC const T *data() const { return m_data.array; }
216 EIGEN_DEVICE_FUNC T *data() { return m_data
250 internal::plain_array<T,Size,_Options> m_data; member in class:Eigen::DenseStorage
282 internal::plain_array<T,Size,_Options> m_data; member in class:Eigen::DenseStorage
311 internal::plain_array<T,Size,_Options> m_data; member in class:Eigen::DenseStorage
340 T *m_data; member in class:Eigen::DenseStorage
423 T *m_data; member in class:Eigen::DenseStorage
497 T *m_data; member in class:Eigen::DenseStorage
[all...]
H A DMapBase.h99 EIGEN_DEVICE_FUNC inline const Scalar* data() const { return m_data; }
105 return m_data[colId * colStride() + rowId * rowStride()];
113 return m_data[index * innerStride()];
120 return this->m_data[colId * colStride() + rowId * rowStride()];
128 return this->m_data[index * innerStride()];
136 (m_data + (colId * colStride() + rowId * rowStride()));
144 return internal::ploadt<PacketScalar, LoadMode>(m_data + index * innerStride());
149 explicit inline MapBase(PointerType dataPtr) : m_data(dataPtr), m_rows(RowsAtCompileTime), m_cols(ColsAtCompileTime)
158 : m_data(dataPtr),
171 : m_data(dataPt
200 PointerType m_data; member in class:Eigen::MapBase
[all...]
/external/eigen/Eigen/src/SparseCore/
H A DSparseVector.h86 EIGEN_STRONG_INLINE const Scalar* valuePtr() const { return m_data.valuePtr(); }
87 EIGEN_STRONG_INLINE Scalar* valuePtr() { return m_data.valuePtr(); }
89 EIGEN_STRONG_INLINE const StorageIndex* innerIndexPtr() const { return m_data.indexPtr(); }
90 EIGEN_STRONG_INLINE StorageIndex* innerIndexPtr() { return m_data.indexPtr(); }
98 inline Storage& data() { return m_data; }
100 inline const Storage& data() const { return m_data; }
110 return m_data.at(StorageIndex(i));
129 return m_data.atWithInsertion(StorageIndex(i));
137 inline void setZero() { m_data.clear(); }
140 inline Index nonZeros() const { return m_data
403 Storage m_data; member in class:Eigen::SparseVector
[all...]
H A DSparseMatrix.h131 Storage m_data; member in class:Eigen::SparseMatrix
148 inline const Scalar* valuePtr() const { return m_data.valuePtr(); }
152 inline Scalar* valuePtr() { return m_data.valuePtr(); }
157 inline const StorageIndex* innerIndexPtr() const { return m_data.indexPtr(); }
161 inline StorageIndex* innerIndexPtr() { return m_data.indexPtr(); }
182 inline Storage& data() { return m_data; }
184 inline const Storage& data() const { return m_data; }
195 return m_data.atInRange(m_outerIndex[outer], end, StorageIndex(inner));
218 const Index p = m_data.searchLowerIndex(start,end-1,StorageIndex(inner));
219 if((p<end) && (m_data
[all...]
H A DSparseRedux.h34 return Matrix<Scalar,1,Dynamic>::Map(m_data.valuePtr(), m_data.size()).sum();
44 return Matrix<Scalar,1,Dynamic>::Map(m_data.valuePtr(), m_data.size()).sum();
/external/deqp/framework/opengl/
H A DgluVarType.cpp45 m_data.basic.type = basicType;
46 m_data.basic.precision = precision;
53 m_data.array.size = arraySize;
54 m_data.array.elementType = new VarType(elementType);
60 m_data.structPtr = structPtr;
66 delete m_data.array.elementType;
75 delete m_data.array.elementType;
78 m_data = Data();
82 m_data.array.elementType = new VarType(*other.m_data
[all...]
/external/eigen/unsupported/Eigen/src/SparseExtra/
H A DDynamicSparseMatrix.h78 std::vector<internal::CompressedStorage<Scalar,StorageIndex> > m_data; member in class:Eigen::DynamicSparseMatrix
85 inline Index outerSize() const { return convert_index(m_data.size()); }
86 inline Index innerNonZeros(Index j) const { return m_data[j].size(); }
88 std::vector<internal::CompressedStorage<Scalar,StorageIndex> >& _data() { return m_data; }
89 const std::vector<internal::CompressedStorage<Scalar,StorageIndex> >& _data() const { return m_data; }
98 return m_data[outer].at(inner);
109 return m_data[outer].atWithInsertion(inner);
118 m_data[j].clear();
126 res += m_data[j].size();
139 m_data[
[all...]
/external/deqp/modules/gles31/functional/
H A Des31fProgramInterfaceDefinitionUtil.hpp46 VariablePathComponent (const glu::VarType* type) :m_type(TYPE_TYPE) { m_data.type = type; }
47 VariablePathComponent (const glu::InterfaceBlock* block) :m_type(TYPE_INTERFACEBLOCK) { m_data.block = block; }
48 VariablePathComponent (const glu::VariableDeclaration* decl) :m_type(TYPE_DECLARATION) { m_data.declaration = decl; }
50 VariablePathComponent (const VariablePathComponent& other) : m_data(other.m_data), m_type(other.m_type) { }
51 VariablePathComponent& operator= (const VariablePathComponent& other) { m_type = other.m_type; m_data = other.m_data; return *this; }
57 const glu::VarType* getVariableType (void) const { DE_ASSERT(isVariableType()); return m_data.type; }
58 const glu::InterfaceBlock* getInterfaceBlock (void) const { DE_ASSERT(isInterfaceBlock()); return m_data.block; }
59 const glu::VariableDeclaration* getDeclaration (void) const { DE_ASSERT(isDeclaration()); return m_data
78 } m_data; member in class:deqp::gles31::Functional::ProgramInterfaceDefinition::VariablePathComponent
[all...]
/external/deqp/external/vulkancts/modules/vulkan/draw/
H A DvktBasicDrawTests.cpp283 DrawParamsBase m_data; member in class:vkt::Draw::__anon3776::DrawTestInstanceBase
317 m_data = data;
398 const vk::VkDeviceSize dataSize = m_data.vertices.size() * sizeof(PositionColorVertex);
403 deMemcpy(ptr, &(m_data.vertices[0]), static_cast<size_t>(dataSize));
452 pipelineCreateInfo.addState(PipelineCreateInfo::InputAssemblerState(m_data.topology));
514 rr::PrimitiveList(mapVkPrimitiveTopology(m_data.topology), (deUint32)vertices.size(), 0)));
526 T m_data; member in class:vkt::Draw::__anon3776::DrawTestInstance
532 , m_data (data)
535 initialize(m_data);
567 T m_data; member in class:vkt::Draw::__anon3776::DrawTestCase
[all...]
/external/deqp/framework/delibs/decpp/
H A DdeUniquePtr.hpp60 T* get (void) const throw() { return m_data.ptr; } //!< Get stored pointer.
61 D getDeleter (void) const throw() { return m_data.deleter; }
67 UniqueBase (T* ptr, D deleter) : m_data(ptr, deleter) {}
68 UniqueBase (PtrData<T, D> data) : m_data(data) {}
76 PtrData<T, D> m_data; member in class:de::details::UniqueBase
88 if (m_data.ptr != DE_NULL)
90 m_data.deleter(m_data.ptr);
91 m_data.ptr = DE_NULL;
98 PtrData<T, D> data = m_data;
[all...]
/external/pdfium/testing/libfuzzer/
H A Dxfa_codec_fuzzer.h54 Reader(const uint8_t* data, size_t size) : m_data(data), m_size(size) {}
65 memcpy(buffer, m_data + offset, size);
72 const uint8_t* const m_data; member in class:XFACodecFuzzer::Reader

Completed in 574 milliseconds

1234