| /external/ceres-solver/internal/ceres/ |
| block_random_access_dense_matrix.h | 83 const double* values() const { return values_.get(); }
84 double* mutable_values() { return values_.get(); }
89 scoped_array<double> values_; member in class:ceres::internal::BlockRandomAccessDenseMatrix
|
| triplet_sparse_matrix.cc | 51 values_(NULL) {}
64 values_(NULL) {
80 values_(NULL) {
120 new_values[i] = values_[i];
125 values_.reset(new_values);
131 fill(values_.get(), values_.get() + max_num_nonzeros_, 0.0);
144 values_.reset(new double[max_num_nonzeros_]);
151 values_[i] = orig.values_[i]
[all...] |
| block_random_access_dense_matrix.cc | 51 values_.reset(new double[num_rows_ * num_rows_]);
55 cell_infos_[i].values = values_.get();
83 VectorRef(values_.get(), num_rows_ * num_rows_).setZero();
|
| block_sparse_matrix.h | 81 virtual const double* values() const { return values_.get(); }
82 virtual double* mutable_values() { return values_.get(); }
92 scoped_array<double> values_; member in class:ceres::internal::BlockSparseMatrix
|
| compressed_row_sparse_matrix.cc | 78 values_.resize(max_num_nonzeros, 0.0);
96 values_.resize(m.max_num_nonzeros(), 0.0);
122 values_[i] = m.values()[idx];
141 values_.resize(num_rows);
146 values_[i] = diagonal[i];
157 fill(values_.begin(), values_.end(), 0);
167 y[r] += values_[idx] * x[cols_[idx]];
178 y[cols_[idx]] += values_[idx] * x[r];
188 x[cols_[idx]] += values_[idx] * values_[idx]
[all...] |
| compressed_row_sparse_matrix.h | 92 virtual const double* values() const { return &values_[0]; }
93 virtual double* mutable_values() { return &values_[0]; }
136 vector<double> values_; member in class:ceres::internal::CompressedRowSparseMatrix
|
| triplet_sparse_matrix.h | 67 virtual const double* values() const { return values_.get(); }
68 virtual double* mutable_values() { return values_.get(); }
72 // of rows_, cols_ and values_. If new_max_num_nonzeros is smaller
117 // The data is stored as three arrays. For each i, values_[i] is
119 // multiple entries with the same (rows_[i], cols_[i]), the values_
123 scoped_array<double> values_; member in class:ceres::internal::TripletSparseMatrix
|
| block_sparse_matrix.cc | 52 values_(NULL),
80 values_.reset(new double[num_nonzeros_]);
81 CHECK_NOTNULL(values_.get());
85 fill(values_.get(), values_.get() + num_nonzeros_, 0.0);
101 values_.get() + cells[j].position, row_block_size, col_block_size,
121 values_.get() + cells[j].position, row_block_size, col_block_size,
138 const MatrixRef m(values_.get() + cells[j].position,
155 MatrixRef m(values_.get() + cells[j].position,
179 += MatrixRef(values_.get() + jac_pos, row_block_size, col_block_size)
[all...] |
| /external/chromium_org/content/common/dom_storage/ |
| dom_storage_map.cc | 39 return values_.size();
43 if (index >= values_.size())
58 DOMStorageValuesMap::const_iterator found = values_.find(key);
59 if (found == values_.end())
67 DOMStorageValuesMap::const_iterator found = values_.find(key);
68 if (found == values_.end())
83 values_[key] = base::NullableString16(value, false);
92 DOMStorageValuesMap::iterator found = values_.find(key);
93 if (found == values_.end())
96 values_.erase(found)
[all...] |
| dom_storage_map.h | 33 // Swaps this instances values_ with |map|.
38 // Writes a copy of the current set of values_ to the |map|.
39 void ExtractValues(DOMStorageValuesMap* map) const { *map = values_; }
42 // a deep copy of values_.
55 DOMStorageValuesMap values_; member in class:content::DOMStorageMap
|
| /external/v8/src/ |
| arguments.h | 94 values_[2] = self;
95 values_[1] = holder;
96 values_[0] = data;
101 for (size_t i = 0; i < ARRAY_SIZE(values_); i++) {
102 values_[i] = reinterpret_cast<Object*>(kZapValue);
108 Object** end() { return values_ + ARRAY_SIZE(values_) - 1; }
110 Object* values_[3]; member in class:v8::internal::CustomArguments
|
| /external/chromium_org/chrome_frame/ |
| registry_list_preferences_holder.cc | 21 values_.push_back(string_list.Name());
28 std::vector<string16>::const_iterator iter(values_.begin());
29 for (; iter != values_.end(); ++iter) {
39 values_.push_back(string);
43 values_.clear();
|
| registry_list_preferences_holder.h | 31 // Returns true iff |string| matches any of the strings in values_, using the
35 // Manually add a string to values_ for testing purposes.
44 std::vector<string16> values_; member in class:RegistryListPreferencesHolder
|
| /external/chromium_org/chrome/browser/chromeos/settings/ |
| stub_cros_settings_provider.cc | 34 if (values_.GetValue(path, &value))
51 values_.SetValue(path, value.DeepCopy());
56 values_.SetBoolean(kAccountsPrefAllowGuest, true);
57 values_.SetBoolean(kAccountsPrefAllowNewUser, true);
58 values_.SetBoolean(kAccountsPrefShowUserNamesOnSignIn, true);
59 values_.SetValue(kAccountsPrefDeviceLocalAccounts, new base::ListValue);
|
| stub_cros_settings_provider.h | 39 PrefValueMap values_; member in class:chromeos::StubCrosSettingsProvider
|
| /external/chromium_org/remoting/host/ |
| in_memory_host_config.cc | 13 : values_(new base::DictionaryValue()) {
21 return values_->GetString(path, out_value);
27 return values_->GetBoolean(path, out_value);
39 values_->SetString(path, in_value);
44 values_->SetBoolean(path, in_value);
|
| in_memory_host_config.h | 42 scoped_ptr<base::DictionaryValue> values_; member in class:remoting::InMemoryHostConfig
|
| /external/chromium/chrome/browser/ |
| preferences_mock_mac.cc | 8 values_.reset(CFDictionaryCreateMutable(kCFAllocatorDefault,
27 Boolean found = CFDictionaryGetValueIfPresent(values_,
44 CFDictionarySetValue(values_, key, value);
|
| preferences_mock_mac.h | 29 base::mac::ScopedCFTypeRef<CFMutableDictionaryRef> values_; member in class:MockPreferences
|
| /external/chromium_org/chrome/browser/policy/ |
| preferences_mock_mac.cc | 8 values_.reset(CFDictionaryCreateMutable(kCFAllocatorDefault,
27 Boolean found = CFDictionaryGetValueIfPresent(values_,
44 CFDictionarySetValue(values_, key, value);
|
| preferences_mock_mac.h | 29 base::ScopedCFTypeRef<CFMutableDictionaryRef> values_; member in class:MockPreferences
|
| /external/chromium_org/tools/gn/ |
| scope.cc | 57 RecordMap::iterator found = values_.find(ident);
58 if (found != values_.end()) {
74 RecordMap::iterator found = values_.find(ident);
75 if (found != values_.end())
90 RecordMap::const_iterator found = values_.find(ident);
91 if (found != values_.end())
101 Record& r = values_[ident]; // Clears any existing value.
124 RecordMap::iterator found = values_.find(ident);
125 if (found == values_.end()) {
133 RecordMap::iterator found = values_.find(ident)
[all...] |
| /external/openfst/src/include/fst/ |
| tuple-weight.h | 50 values_[i] = w.values_[i];
56 values_[iter - begin] = *iter;
61 values_[i] = w;
85 values_[i].Read(strm);
91 values_[i].Write(strm);
97 values_[i] = w.values_[i];
104 member = member && values_[i].Member();
111 hash = 5 * hash + values_[i].Hash()
240 W values_[n]; member in class:fst::TupleWeight
[all...] |
| /external/chromium_org/ppapi/shared_impl/private/ |
| ppb_x509_certificate_private_shared.cc | 18 scoped_ptr<base::ListValue> new_values(fields.values_.DeepCopy());
19 values_.Swap(new_values.get());
26 bool success = values_.Set(index, value);
34 bool success = values_.Get(index, &value);
|
| /external/chromium_org/sync/internal_api/public/base/ |
| node_ordinal_unittest.cc | 82 IndexedLessThan(const T* values) : values_(values) {}
85 return less_than_(values_[i1], values_[i2]);
89 const T* values_; member in class:syncer::__anon12414::IndexedLessThan
|
