Searched refs:graph_ (Results 1 - 4 of 4) sorted by relevance

/gem5/ext/dsent/model/optical_graph/
H A DOpticalGraph.h66 OpticalGraph(const OpticalGraph& graph_);
/gem5/ext/dsent/model/timing_graph/
H A DElectricalTimingTree.h73 ElectricalTimingTree(const ElectricalTimingTree& graph_);
/gem5/ext/googletest/googlemock/src/
H A Dgmock-matchers.cc201 : graph_(&graph),
202 left_(graph_->LhsSize(), kUnused),
203 right_(graph_->RhsSize(), kUnused) {
222 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
227 // 'seen' initialized to 'graph_->RhsSize()' copies of 0.
228 seen.assign(graph_->RhsSize(), 0);
260 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) {
263 if (!graph_->HasEdge(ilhs, irhs))
287 const MatchMatrix* graph_; // not owned member in class:testing::internal::MaxBipartiteMatchState
/gem5/ext/googletest/googlemock/test/
H A Dgmock-matchers_test.cc5016 explicit BacktrackingMaxBPMState(const Graph* g) : graph_(g) { }
5019 if (graph_->LhsSize() == 0 || graph_->RhsSize() == 0) {
5022 lhs_used_.assign(graph_->LhsSize(), kUnused);
5023 rhs_used_.assign(graph_->RhsSize(), kUnused);
5024 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) {
5027 if (best_so_far_.size() == graph_->RhsSize())
5056 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
5060 if (!graph_->HasEdge(ilhs, irhs)) {
5064 if (best_so_far_.size() == graph_
5075 const Graph* graph_; // not owned member in class:testing::gmock_matchers_test::__anon19::BacktrackingMaxBPMState
[all...]

Completed in 29 milliseconds