/external/emma/core/java12/com/vladium/util/ |
D | IntVector.java | 27 m_values = new int [initCapacity]; in IntVector() 37 return m_values [index]; in get() 51 for (int i = 0; i < size; ++ i) result [i] = m_values [i]; in values() 55 System.arraycopy (m_values, 0, result, 0, size); in values() 81 _clone.m_values = new int [m_values.length]; in clone() 82 final int [] _clone_values = _clone.m_values; in clone() 83 for (int i = 0; i < m_size; ++ i) _clone_values [i] = m_values [i]; in clone() 87 _clone.m_values = (int []) m_values.clone (); in clone() 104 s.append (m_values [i]); in toString() 117 final int current_value = m_values [index]; in set() [all …]
|
/external/eigen/Eigen/src/SparseCore/ |
D | CompressedStorage.h | 36 : m_values(0), m_indices(0), m_size(0), m_allocatedSize(0) in CompressedStorage() 40 : m_values(0), m_indices(0), m_size(0), m_allocatedSize(0) in CompressedStorage() 46 : m_values(0), m_indices(0), m_size(0), m_allocatedSize(0) in CompressedStorage() 56 internal::smart_copy(other.m_values, other.m_values + m_size, m_values); 64 std::swap(m_values, other.m_values); in swap() 72 delete[] m_values; in ~CompressedStorage() 105 m_values[id] = v; in append() 113 const Scalar* valuePtr() const { return m_values; } in valuePtr() 114 Scalar* valuePtr() { return m_values; } in valuePtr() 118 inline Scalar& value(Index i) { eigen_internal_assert(m_values!=0); return m_values[i]; } in value() [all …]
|
D | SparseCompressedBase.h | 140 : m_values(0), m_indices(0), m_outer(0), m_id(0), m_end(0) 144 …: m_values(other.m_values), m_indices(other.m_indices), m_outer(other.m_outer), m_id(other.m_id), … 149 m_values = other.m_values; 158 : m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(outer) 176 …: m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(0), m_id(0), m_end(mat.nonZero… 182 … : m_values(data.valuePtr()), m_indices(data.indexPtr()), m_outer(0), m_id(0), m_end(data.size()) 189 inline const Scalar& value() const { return m_values[m_id]; } 190 inline Scalar& valueRef() { return const_cast<Scalar&>(m_values[m_id]); } 200 const Scalar* m_values; 218 : m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(outer) [all …]
|
D | SparseMap.h | 73 ScalarPointer m_values; 95 inline const Scalar* valuePtr() const { return m_values; } 115 return m_values[end-1]; 121 return ((*r==inner) && (id<end)) ? m_values[id] : Scalar(0); 127 m_innerIndices(innerIndexPtr), m_values(valuePtr), m_innerNonZeros(innerNonZerosPtr) 133 m_innerIndices(innerIndexPtr), m_values(valuePtr), m_innerNonZeros(0) 170 inline Scalar* valuePtr() { return Base::m_values; } 192 return const_cast<Scalar*>(Base::m_values)[id];
|
/external/eigen/unsupported/Eigen/src/AutoDiff/ |
D | AutoDiffVector.h | 46 : m_values(values) in AutoDiffVector() 52 CoeffType operator[] (Index i) { return CoeffType(m_values[i], m_jacobian.col(i)); } 53 const CoeffType operator[] (Index i) const { return CoeffType(m_values[i], m_jacobian.col(i)); } 55 CoeffType operator() (Index i) { return CoeffType(m_values[i], m_jacobian.col(i)); } in operator() 56 const CoeffType operator() (Index i) const { return CoeffType(m_values[i], m_jacobian.col(i)); } in operator() 58 CoeffType coeffRef(Index i) { return CoeffType(m_values[i], m_jacobian.col(i)); } in coeffRef() 59 const CoeffType coeffRef(Index i) const { return CoeffType(m_values[i], m_jacobian.col(i)); } in coeffRef() 61 Index size() const { return m_values.size(); } in size() 64 …*/ /*std::cerr << m_jacobian.rowwise().sum() << "\n\n";*/ return Scalar(m_values.sum(), m_jacobian… in sum() 68 : m_values(values), m_jacobian(jac) in AutoDiffVector() [all …]
|
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
D | BoolStack.java | 32 private boolean m_values[]; field in BoolStack 58 m_values = new boolean[size]; in BoolStack() 94 return (m_values[++m_index] = val); in push() 106 return m_values[m_index--]; in pop() 121 return (m_index >= 0) ? m_values[m_index] : false; in popAndTop() 132 m_values[m_index] = b; in setTop() 144 return m_values[m_index]; in peek() 155 return (m_index > -1) ? m_values[m_index] : false; in peekOrFalse() 166 return (m_index > -1) ? m_values[m_index] : true; in peekOrTrue() 191 System.arraycopy(m_values, 0, newVector, 0, m_index + 1); in grow() [all …]
|
D | StringToIntTable.java | 42 private int m_values[]; field in StringToIntTable 60 m_values = new int[m_blocksize]; in StringToIntTable() 74 m_values = new int[m_blocksize]; in StringToIntTable() 108 System.arraycopy(m_values, 0, newValues, 0, m_firstFree + 1); in put() 110 m_values = newValues; in put() 114 m_values[m_firstFree] = value; in put() 133 return m_values[i]; in get() 155 return m_values[i]; in getIgnoreCase()
|
/external/deqp/external/vulkancts/modules/vulkan/shaderrender/ |
D | vktShaderRenderDerivateTests.cpp | 597 DerivateCaseValues getDerivateCaseValues (void) { return m_values; } in getDerivateCaseValues() 605 const DerivateCaseValues& m_values; member in vkt::sr::__anon6be423a10111::TriangleDerivateCaseInstance 627 , m_values (values) in TriangleDerivateCaseInstance() 663 m_values.coordMin.x(), m_values.coordMin.y(), m_values.coordMin.z(), m_values.coordMax.w(), in setupDefaultInputs() 664 …m_values.coordMin.x(), m_values.coordMax.y(), (m_values.coordMin.z()+m_values.coordMax.z())*0.5f, … in setupDefaultInputs() 665 …m_values.coordMax.x(), m_values.coordMin.y(), (m_values.coordMin.z()+m_values.coordMax.z())*0.5f, … in setupDefaultInputs() 666 m_values.coordMax.x(), m_values.coordMax.y(), m_values.coordMax.z(), m_values.coordMin.w() in setupDefaultInputs() 774 mutable DerivateCaseValues m_values; member in vkt::sr::__anon6be423a10111::TriangleDerivateCase 848 const tcu::Vec4 threshold = getSurfaceThreshold() / abs(m_values.derivScale); in verify() 851 reference, threshold, m_values.derivScale, m_values.derivBias); in verify() [all …]
|
/external/apache-xml/src/main/java/org/apache/xml/serializer/utils/ |
D | StringToIntTable.java | 49 private int m_values[]; field in StringToIntTable 67 m_values = new int[m_blocksize]; in StringToIntTable() 81 m_values = new int[m_blocksize]; in StringToIntTable() 115 System.arraycopy(m_values, 0, newValues, 0, m_firstFree + 1); in put() 117 m_values = newValues; in put() 121 m_values[m_firstFree] = value; in put() 140 return m_values[i]; in get() 162 return m_values[i]; in getIgnoreCase()
|
/external/eigen/unsupported/test/ |
D | NumericalDiff.cpp | 24 int m_inputs, m_values; member 26 Functor() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {} in Functor() 27 Functor(int inputs, int values) : m_inputs(inputs), m_values(values) {} in Functor() 30 int values() const { return m_values; } in values()
|
D | forward_adolc.cpp | 35 int m_inputs, m_values; member 37 TestFunc1() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {} in TestFunc1() 38 TestFunc1(int inputs, int values) : m_inputs(inputs), m_values(values) {} in TestFunc1() 41 int values() const { return m_values; } in values()
|
D | autodiff.cpp | 44 int m_inputs, m_values; member 46 TestFunc1() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {} in TestFunc1() 47 TestFunc1(int inputs, int values) : m_inputs(inputs), m_values(values) {} in TestFunc1() 50 int values() const { return m_values; } in values()
|
D | NonLinearOptimization.cpp | 119 const int m_inputs, m_values; member 121 Functor() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {} in Functor() 122 Functor(int inputs, int values) : m_inputs(inputs), m_values(values) {} in Functor() 125 int values() const { return m_values; } in values()
|
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
D | LevenbergMarquardt.h | 53 const int m_inputs, m_values; member 55 DenseFunctor() : m_inputs(InputsAtCompileTime), m_values(ValuesAtCompileTime) {} in DenseFunctor() 56 DenseFunctor(int inputs, int values) : m_inputs(inputs), m_values(values) {} in DenseFunctor() 59 int values() const { return m_values; } in values() 82 SparseFunctor(int inputs, int values) : m_inputs(inputs), m_values(values) {} in SparseFunctor() 85 int values() const { return m_values; } in values() 87 const int m_inputs, m_values; member
|
/external/eigen/unsupported/Eigen/src/SparseExtra/ |
D | BlockSparseMatrix.h | 311 m_nonzerosblocks(0),m_values(0),m_blockPtr(0),m_indices(0), 324 m_values(0),m_blockPtr(0),m_indices(0), 341 std::copy(other.m_values, other.m_values+m_nonzeros, m_values); 358 std::swap(first.m_values, second.m_values); 380 delete[] m_values; 442 for(StorageIndex nz = 0; nz < m_nonzeros; ++nz) m_values[nz] = Scalar(0); 472 m_values[idxVal] = it_spmat.value(); 506 for(StorageIndex nz = 0; nz < m_nonzeros; ++nz) m_values[nz] = Scalar(0); 616 m_values = new Scalar[m_nonzeros]; 699 memcpy(&(m_values[nz_marker]), it->value().data(), block_size * sizeof(Scalar)); [all …]
|
/external/catch2/include/internal/ |
D | catch_generators.hpp | 73 std::vector<T> m_values; member in Catch::Generators::FixedValuesGenerator 76 FixedValuesGenerator( std::initializer_list<T> values ) : m_values( values ) {} in FixedValuesGenerator() 79 return m_values[m_idx]; in get() 83 return m_idx < m_values.size(); in next()
|
/external/emma/core/java12/com/vladium/util/args/ |
D | OptsParser.java | 520 if (m_values == null) return 0; in getValueCount() 522 return m_values.size (); in getValueCount() 527 if (m_values == null) return null; in getFirstValue() 529 return (String) m_values.get (0); in getFirstValue() 534 if (m_values == null) return IConstants.EMPTY_STRING_ARRAY; in getValues() 536 final String [] result = new String [m_values.size ()]; in getValues() 537 m_values.toArray (result); in getValues() 552 if (m_values != null) in toString() 555 s.append (m_values); in toString() 572 if (m_values == null) m_values = new ArrayList (); in addValue() [all …]
|
/external/deqp/framework/randomshaders/ |
D | rsgProgramExecutor.cpp | 82 std::map<std::string, VaryingStorage*> m_values; member in rsg::VaryingStore 92 for (map<string, VaryingStorage*>::iterator i = m_values.begin(); i != m_values.end(); i++) in ~VaryingStore() 94 m_values.clear(); in ~VaryingStore() 99 VaryingStorage* storage = m_values[name]; in getStorage() 104 m_values[name] = storage; in getStorage()
|
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/sax2dtm/ |
D | SAX2DTM2.java | 1802 protected Vector m_values; field in SAX2DTM2 1884 m_values = new Vector(32, 512); in SAX2DTM2() 2049 int index = m_values.indexOf(uri); in getIdForNamespace() 2052 m_values.addElement(uri); in getIdForNamespace() 2111 m_values.addElement(declURL); in startElement() 2129 m_values.addElement(declURL); in startElement() 2170 m_values.addElement(valString); in startElement() 2268 m_values.addElement(new String(ch, start, length)); in comment() 2468 m_values.addElement(data); in processingInstruction() 2866 return m_xstrf.newstr((String)m_values.elementAt(dataIndex)); in getStringValue() [all …]
|
/external/deqp/framework/common/ |
D | tcuTestLog.hpp | 211 SampleBuilder& operator<< (int v) { m_values.push_back(Value((deInt64)v)); return *this; } in operator <<() 212 SampleBuilder& operator<< (deInt64 v) { m_values.push_back(Value(v)); return *this; } in operator <<() 213 SampleBuilder& operator<< (float v) { m_values.push_back(Value((double)v)); return *this; } in operator <<() 214 SampleBuilder& operator<< (double v) { m_values.push_back(Value(v)); return *this; } in operator <<() 236 std::vector<Value> m_values; member in tcu::SampleBuilder
|
D | tcuTestLog.cpp | 166 for (std::vector<Value>::const_iterator val = m_values.begin(); val != m_values.end(); ++val) in operator <<()
|
/external/apache-xml/src/main/java/org/apache/xml/serializer/ |
D | ToStream.java | 3317 private boolean m_values[]; field in ToStream.BoolStack 3343 m_values = new boolean[size]; in BoolStack() 3379 return (m_values[++m_index] = val); in push() 3391 return m_values[m_index--]; in pop() 3406 return (m_index >= 0) ? m_values[m_index] : false; in popAndTop() 3417 m_values[m_index] = b; in setTop() 3429 return m_values[m_index]; in peek() 3440 return (m_index > -1) ? m_values[m_index] : false; in peekOrFalse() 3451 return (m_index > -1) ? m_values[m_index] : true; in peekOrTrue() 3476 System.arraycopy(m_values, 0, newVector, 0, m_index + 1); in grow() [all …]
|
/external/bcc/tests/cc/ |
D | catch.hpp | 2371 m_values.push_back( value ); in add() 2375 return m_values[index]; in getValue() 2379 return m_values.size(); in size() 2383 std::vector<T> m_values; member in Catch::ValuesGenerator
|
/external/catch2/single_include/catch2/ |
D | catch.hpp | 3559 std::vector<T> m_values; member in Catch::Generators::FixedValuesGenerator 3562 FixedValuesGenerator( std::initializer_list<T> values ) : m_values( values ) {} in FixedValuesGenerator() 3565 return m_values[m_idx]; in get() 3569 return m_idx < m_values.size(); in next()
|