Home
last modified time | relevance | path

Searched refs:table_ (Results 1 – 25 of 39) sorted by relevance

12

/third_party/googletest/googletest/samples/
Dsample6_unittest.cc60 PrimeTableTest() : table_(CreatePrimeTable<T>()) {} in PrimeTableTest()
62 ~PrimeTableTest() override { delete table_; } in ~PrimeTableTest()
71 PrimeTable* const table_; member in __anon4de2e3760111::PrimeTableTest
103 EXPECT_FALSE(this->table_->IsPrime(-5)); in TYPED_TEST()
104 EXPECT_FALSE(this->table_->IsPrime(0)); in TYPED_TEST()
105 EXPECT_FALSE(this->table_->IsPrime(1)); in TYPED_TEST()
106 EXPECT_FALSE(this->table_->IsPrime(4)); in TYPED_TEST()
107 EXPECT_FALSE(this->table_->IsPrime(6)); in TYPED_TEST()
108 EXPECT_FALSE(this->table_->IsPrime(100)); in TYPED_TEST()
112 EXPECT_TRUE(this->table_->IsPrime(2)); in TYPED_TEST()
[all …]
Dsample7_unittest.cc64 ~PrimeTableTestSmpl7() override { delete table_; } in ~PrimeTableTestSmpl7()
65 void SetUp() override { table_ = (*GetParam())(); } in SetUp()
67 delete table_; in TearDown()
68 table_ = nullptr; in TearDown()
72 PrimeTable* table_; member in __anon9d41ecf70111::PrimeTableTestSmpl7
76 EXPECT_FALSE(table_->IsPrime(-5)); in TEST_P()
77 EXPECT_FALSE(table_->IsPrime(0)); in TEST_P()
78 EXPECT_FALSE(table_->IsPrime(1)); in TEST_P()
79 EXPECT_FALSE(table_->IsPrime(4)); in TEST_P()
80 EXPECT_FALSE(table_->IsPrime(6)); in TEST_P()
[all …]
Dsample8_unittest.cc96 table_ = new HybridPrimeTable(force_on_the_fly, max_precalculated); in SetUp()
99 delete table_; in TearDown()
100 table_ = nullptr; in TearDown()
102 HybridPrimeTable* table_; member in __anoneca0f6780111::PrimeTableTest
112 EXPECT_FALSE(table_->IsPrime(-5)); in TEST_P()
113 EXPECT_FALSE(table_->IsPrime(0)); in TEST_P()
114 EXPECT_FALSE(table_->IsPrime(1)); in TEST_P()
115 EXPECT_FALSE(table_->IsPrime(4)); in TEST_P()
116 EXPECT_FALSE(table_->IsPrime(6)); in TEST_P()
117 EXPECT_FALSE(table_->IsPrime(100)); in TEST_P()
[all …]
/third_party/protobuf/src/google/protobuf/
Dmap.h396 table_(nullptr),
399 table_ = CreateEmptyTable(n);
404 if (table_ != nullptr) {
406 Dealloc<void*>(table_, num_buckets_);
476 m_->table_[m_->index_of_first_non_null_] != nullptr);
481 node_ = static_cast<Node*>(m_->table_[bucket_index_]);
484 Tree* tree = static_cast<Tree*>(m_->table_[bucket_index_]);
510 Tree* tree = static_cast<Tree*>(m_->table_[bucket_index_]);
538 if (m_->table_[bucket_index_] == static_cast<void*>(node_)) return true;
542 Node* l = static_cast<Node*>(m_->table_[bucket_index_]);
[all …]
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc166 bool contains(int32_t v) const { return table_[FindIndex(v)] == v; } in contains()
170 if (table_[i] == v) { in insert()
173 if (table_[i] == kEmpty) { in insert()
178 table_[i] = v; in insert()
180 if (occupied_ >= table_.size() - table_.size()/4) Grow(); in insert()
186 if (static_cast<uint32_t>(table_[i]) == v) { in erase()
187 table_[i] = kDel; in erase()
197 while (static_cast<uint32_t>(*cursor) < table_.size()) { in Next()
198 int32_t v = table_[*cursor]; in Next()
210 Vec<int32_t> table_; member in absl::synchronization_internal::__anon7265cd7a0111::NodeSet
[all …]
/third_party/node/deps/v8/src/heap/cppgc/
Dgc-info-table.cc63 table_(static_cast<decltype(table_)>(page_allocator_->AllocatePages( in GCInfoTable()
66 read_only_table_end_(reinterpret_cast<uint8_t*>(table_)) { in GCInfoTable()
67 CHECK(table_); in GCInfoTable()
72 page_allocator_->ReleasePages(const_cast<GCInfo*>(table_), MaxTableSize(), 0); in ~GCInfoTable()
96 CHECK(table_); in Resize()
101 reinterpret_cast<uint8_t*>(table_) + old_committed_size; in Resize()
148 table_[new_index] = info; in RegisterNewGCInfo()
Dcaged-heap-local-data.cc33 std::fill(table_.begin(), table_.end(), Age::kOld); in Reset()
34 const uintptr_t begin = RoundUp(reinterpret_cast<uintptr_t>(table_.data()), in Reset()
37 RoundDown(reinterpret_cast<uintptr_t>(table_.data() + table_.size()), in Reset()
Dgc-info-table.h62 DCHECK(table_); in GCInfoFromIndex()
63 return table_[index]; in GCInfoFromIndex()
69 GCInfo& TableSlotForTesting(GCInfoIndex index) { return table_[index]; } in TableSlotForTesting()
84 GCInfo* table_; variable
/third_party/skia/third_party/externals/sfntly/cpp/src/sfntly/table/
Dtable_based_table_builder.cc40 table_ = NULL; in SubDataSet()
63 if (!table_) { in GetTable()
66 table_.Attach(down_cast<Table*>(SubBuildTable(data))); in GetTable()
68 return table_; in GetTable()
Dtable_based_table_builder.h43 TablePtr table_; variable
/third_party/node/deps/v8/include/cppgc/internal/
Dcaged-heap-local-data.h41 table_[card(cage_offset)] = age; in SetAge()
44 return table_[card(cage_offset)]; in GetAge()
54 CPPGC_DCHECK(table_.size() > entry); in card()
58 std::array<Age, kRequiredSize> table_; variable
/third_party/node/deps/v8/src/compiler/
Dcompiler-source-position-table.cc31 table_(graph->zone()) {} in SourcePositionTable()
46 return table_.Get(node); in GetSourcePosition()
51 table_.Set(node, position); in SetSourcePosition()
57 for (auto i : table_) { in PrintJson()
Dnode-origin-table.cc46 table_(graph->zone()) {} in NodeOriginTable()
61 return table_.Get(node); in GetNodeOrigin()
65 table_.Set(node, no); in SetNodeOrigin()
71 for (auto i : table_) { in PrintJson()
Descape-analysis.cc130 Node* Get(Variable var, Node* effect) { return table_.Get(effect).Get(var); } in Get()
160 SparseSidetable<State> table_; member in v8::internal::compiler::VariableTracker
373 table_(zone, State(zone)), in VariableTracker()
391 states_->table_.Get(NodeProperties::GetEffectInput(node, 0)); in Scope()
400 states_->table_.Get(current_node()) != current_state_) { in ~Scope()
403 states_->table_.Set(current_node(), current_state_); in ~Scope()
422 State first_input = table_.Get(NodeProperties::GetEffectInput(effect_phi, 0)); in MergeInputs()
436 table_.Get(NodeProperties::GetEffectInput(effect_phi, i)).Get(var); in MergeInputs()
448 Node* old_value = table_.Get(effect_phi).Get(var); in MergeInputs()
Dcompiler-source-position-table.h72 NodeAuxData<SourcePosition, UnknownSourcePosition> table_; in NON_EXPORTED_BASE() local
/third_party/spirv-tools/source/diff/
Dlcs.h40 table_(src.size(), std::vector<DiffMatchEntry>(dst.size())) {} in LongestCommonSubsequence()
65 return table_[index.src_offset][index.dst_offset].valid; in IsCalculated()
75 return table_[index.src_offset][index.dst_offset].best_match_length; in GetMemoizedLength()
79 return table_[index.src_offset][index.dst_offset].matched; in IsMatched()
84 DiffMatchEntry& entry = table_[index.src_offset][index.dst_offset]; in MarkMatched()
108 std::vector<std::vector<DiffMatchEntry>> table_; variable
/third_party/node/deps/v8/src/logging/
Druntime-call-stats.cc328 table_ = reinterpret_cast<RuntimeCallStats*>( in WorkerThreadRuntimeCallStatsScope()
330 if (table_ == nullptr) { in WorkerThreadRuntimeCallStatsScope()
331 table_ = worker_stats->NewTable(); in WorkerThreadRuntimeCallStatsScope()
332 base::Thread::SetThreadLocal(worker_stats->GetKey(), table_); in WorkerThreadRuntimeCallStatsScope()
337 table_->Reset(); in WorkerThreadRuntimeCallStatsScope()
342 if (V8_LIKELY(table_ == nullptr)) return; in ~WorkerThreadRuntimeCallStatsScope()
347 table_->Dump(value.get()); in ~WorkerThreadRuntimeCallStatsScope()
/third_party/node/deps/v8/src/codegen/
Dsafepoint-table.h240 entry_->stack_indexes->Add(index, table_->zone_); in DefineTaggedStackSlot()
241 table_->UpdateMinMaxStackIndex(index); in DefineTaggedStackSlot()
253 : entry_(entry), table_(table) {} in Safepoint()
255 SafepointTableBuilder* const table_; variable
Dsource-position-table.cc243 : table_(byte_array), in SourcePositionTableIterator()
268 table_.is_null() ? raw_table_ : VectorFromByteArray(*table_); in Advance()
Dsource-position-table.h156 Handle<ByteArray> table_; variable
/third_party/skia/third_party/externals/harfbuzz/src/
Dhb-aat-layout-kerx-table.hh125 accelerator_t (const KerxSubTableFormat0 &table_, in accelerator_t()
127 table (table_), c (c_) {} in accelerator_t()
219 driver_context_t (const KerxSubTableFormat1 *table_, in driver_context_t()
222 table (table_), in driver_context_t()
418 accelerator_t (const KerxSubTableFormat2 &table_, in accelerator_t()
420 table (table_), c (c_) {} in accelerator_t()
696 accelerator_t (const KerxSubTableFormat6 &table_, in accelerator_t()
698 table (table_), c (c_) {} in accelerator_t()
Dhb-aat-layout-morx-table.hh215 driver_context_t (const ContextualSubtable *table_, in driver_context_t()
223 table (table_), in driver_context_t()
452 driver_context_t (const LigatureSubtable *table_, in driver_context_t()
456 table (table_), in driver_context_t()
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/
Dstring_view.cc48 table_[Index(c)] = true; in LookupTable()
51 bool operator[](char c) const { return table_[Index(c)]; } in operator []()
55 bool table_[UCHAR_MAX + 1] = {}; member in absl::__anona4d5fc820111::LookupTable
/third_party/skia/third_party/externals/sfntly/cpp/src/sfntly/table/core/
Dcmap_table.cc157 : table_index_(0), filter_(filter), table_(table) { in CMapIterator()
162 if (table_index_ < table_->NumCMaps()) { in HasNext()
168 for (; table_index_ < table_->NumCMaps(); ++table_index_) { in HasNext()
169 if (filter_->accept(table_->GetCMapId(table_index_))) { in HasNext()
185 next_cmap.Attach(table_->GetCMap(table_index_++)); in Next()
/third_party/littlefs/scripts/
Dperf.py852 table_ = {
855 names_ = list(table_.keys())
864 (getattr(table_[n], k),)
865 if getattr(table_.get(n), k, None) is not None
872 r = table_[name]

12