Home
last modified time | relevance | path

Searched refs:m_values (Results 1 – 25 of 43) sorted by relevance

12

/external/emma/core/java12/com/vladium/util/
DIntVector.java27 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/
DCompressedStorage.h36 : 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 …]
DSparseCompressedBase.h140 : 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 …]
DSparseMap.h73 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/llvm-project/lldb/include/lldb/Interpreter/
DOptionValueArray.h21 : m_type_mask(type_mask), m_values(), m_raw_value_dump(raw_value_dump) {} in m_type_mask()
40 m_values.clear(); in Clear()
54 size_t GetSize() const { return m_values.size(); } in GetSize()
58 if (idx < m_values.size())
59 value_sp = m_values[idx];
65 if (idx < m_values.size()) in GetValueAtIndex()
66 value_sp = m_values[idx]; in GetValueAtIndex()
74 m_values.push_back(value_sp); in AppendValue()
84 if (idx < m_values.size()) in InsertValue()
85 m_values.insert(m_values.begin() + idx, value_sp); in InsertValue()
[all …]
DOptionValueDictionary.h22 : OptionValue(), m_type_mask(type_mask), m_values(), in OptionValue()
39 m_values.clear(); in Clear()
53 size_t GetNumValues() const { return m_values.size(); } in GetNumValues()
77 collection m_values; variable
/external/eigen/unsupported/Eigen/src/AutoDiff/
DAutoDiffVector.h46 : 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/
DBoolStack.java32 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 …]
DStringToIntTable.java42 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/llvm-project/lldb/source/Interpreter/
DOptionValueArray.cpp30 const uint32_t size = m_values.size(); in DumpValue()
32 strm.Printf(" =%s", (m_values.size() > 0 && !one_line) ? "\n" : ""); in DumpValue()
48 m_values[i]->DumpValue(exe_ctx, strm, dump_mask | extra_dump_options); in DumpValue()
62 m_values[i]->DumpValue(exe_ctx, strm, (dump_mask & (~eDumpOptionType)) | in DumpValue()
108 const size_t array_count = m_values.size(); in GetSubValue()
123 if (m_values[new_idx]) { in GetSubValue()
125 return m_values[new_idx]->GetSubValue(exe_ctx, sub_value, in GetSubValue()
128 return m_values[new_idx]; in GetSubValue()
149 const uint32_t size = m_values.size(); in GetArgs()
151 llvm::StringRef string_value = m_values[i]->GetStringValue(); in GetArgs()
[all …]
DOptionValueDictionary.cpp35 collection::iterator pos, end = m_values.end(); in DumpValue()
40 for (pos = m_values.begin(); pos != end; ++pos) { in DumpValue()
87 collection::const_iterator pos, end = m_values.end(); in GetArgs()
88 for (pos = m_values.begin(); pos != end; ++pos) { in GetArgs()
282 collection::const_iterator pos = m_values.find(key); in GetValueForKey()
283 if (pos != m_values.end()) in GetValueForKey()
295 collection::const_iterator pos = m_values.find(key); in SetValueForKey()
296 if (pos != m_values.end()) in SetValueForKey()
299 m_values[key] = value_sp; in SetValueForKey()
306 collection::iterator pos = m_values.find(key); in DeleteValueForKey()
[all …]
/external/deqp/external/vulkancts/modules/vulkan/shaderrender/
DvktShaderRenderDerivateTests.cpp597 DerivateCaseValues getDerivateCaseValues (void) { return m_values; } in getDerivateCaseValues()
605 const DerivateCaseValues& m_values; member in vkt::sr::__anon7f93c3b80111::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()
777 mutable DerivateCaseValues m_values; member in vkt::sr::__anon7f93c3b80111::TriangleDerivateCase
851 const tcu::Vec4 threshold = getSurfaceThreshold() / abs(m_values.derivScale); in verify()
854 reference, threshold, m_values.derivScale, m_values.derivBias); in verify()
[all …]
/external/apache-xml/src/main/java/org/apache/xml/serializer/utils/
DStringToIntTable.java49 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/llvm-project/lldb/source/API/
DSBValueList.cpp22 ValueListImpl() : m_values() {} in ValueListImpl()
24 ValueListImpl(const ValueListImpl &rhs) : m_values(rhs.m_values) {} in ValueListImpl()
29 m_values = rhs.m_values; in operator =()
33 uint32_t GetSize() { return m_values.size(); } in GetSize()
35 void Append(const lldb::SBValue &sb_value) { m_values.push_back(sb_value); } in Append()
38 for (auto val : list.m_values) in Append()
45 return m_values[index]; in GetValueAtIndex()
49 for (auto val : m_values) { in FindValueByUID()
58 for (auto val : m_values) { in GetFirstValueByName()
67 std::vector<lldb::SBValue> m_values; member in ValueListImpl
/external/mesa3d/src/gallium/drivers/r600/sfn/
Dsfn_value_gpr.cpp279 m_values.resize(size); in GPRArray()
283 m_values[i].set_reg_i(j, PValue(new GPRValue(base + i, j))); in GPRArray()
296 os << "ARRAY[R" << sel() << "..R" << sel() + m_values.size() - 1 << "]."; in do_print()
307 o.m_values.size() == m_values.size() && in is_equal_to()
318 assert(index < m_values.size()); in get_indirect()
323 PValue v = m_values[index].reg_i(component + m_frac); in get_indirect()
333 v = m_values[lv.value()].reg_i(component + m_frac); in get_indirect()
351 for (auto& v: m_values) in record_read()
357 for (auto& v: m_values) in record_write()
363 for (auto& v: m_values) { in collect_registers()
Dsfn_instruction_base.cpp40 m_values(values) in ValueRemapper()
78 v.set_reg_i(i,m_values.get_or_inject(ns_idx.new_reg, v.reg_i(i)->chan())); in remap()
88 reg = m_values.get_or_inject(new_index.new_reg, reg->chan()); in remap_one_registers()
/external/eigen/unsupported/test/
DNumericalDiff.cpp24 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()
Dforward_adolc.cpp35 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()
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
DLevenbergMarquardt.h53 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/
DBlockSparseMatrix.h311 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/
Dcatch_enum_values_registry.cpp47 for( auto const& valueToName : m_values ) { in lookup()
57 enumInfo->m_values.reserve( values.size() ); in makeEnumInfo()
63 enumInfo->m_values.emplace_back(value, valueNames[i++]); in makeEnumInfo()
Dcatch_generators.hpp75 std::vector<T> m_values; member in Catch::Generators::FixedValuesGenerator
78 FixedValuesGenerator( std::initializer_list<T> values ) : m_values( values ) {} in FixedValuesGenerator()
81 return m_values[m_idx]; in get()
85 return m_idx < m_values.size(); in next()
/external/llvm-project/lldb/source/Core/
DValue.cpp665 ValueList::ValueList(const ValueList &rhs) { m_values = rhs.m_values; } in ValueList()
668 m_values = rhs.m_values; in operator =()
672 void ValueList::PushValue(const Value &value) { m_values.push_back(value); } in PushValue()
674 size_t ValueList::GetSize() { return m_values.size(); } in GetSize()
678 return &(m_values[idx]); in GetValueAtIndex()
683 void ValueList::Clear() { m_values.clear(); } in Clear()
/external/emma/core/java12/com/vladium/util/args/
DOptsParser.java520 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/
DrsgProgramExecutor.cpp82 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()

12