Definition at line 272 of file Requirement.h.
§ Compound()
| Arbiter::Requirement::Compound::Compound |
( |
std::vector< std::shared_ptr< ArbiterRequirement >> |
requirements | ) |
|
|
explicit |
§ clone()
| std::unique_ptr<Base> Arbiter::Requirement::Compound::clone |
( |
| ) |
const |
|
overridevirtual |
§ cloneRequirement()
§ describe()
| std::ostream& Arbiter::Requirement::Compound::describe |
( |
std::ostream & |
os | ) |
const |
|
overridevirtual |
§ hash()
| size_t Arbiter::Requirement::Compound::hash |
( |
| ) |
const |
|
overridevirtualnoexcept |
§ intersect()
Attempts to create a requirement which expresses the intersection of this requirement and the given one.
In other words, this attempts to find the loosest possible requirement which is a superset of the two inputs. Any version which passes the intersected requirement would also pass either one of the original inputs.
Returns nullptr if no intersection is possible.
Implements ArbiterRequirement.
§ operator!=()
| bool Arbiter::Base::operator!= |
( |
const Base & |
other | ) |
const |
|
inherited |
§ operator==()
| bool Arbiter::Requirement::Compound::operator== |
( |
const Arbiter::Base & |
other | ) |
const |
|
overridevirtual |
§ priority()
| int Arbiter::Requirement::Compound::priority |
( |
| ) |
const |
|
overridevirtualnoexcept |
Returns the minimum priority index of all the requirements held by this compound requirement.
Reimplemented from ArbiterRequirement.
§ satisfiedBy()
Returns whether this requirement would be satisfied by using the given selected version.
Implements ArbiterRequirement.
§ visit()
| void Arbiter::Requirement::Compound::visit |
( |
Visitor & |
visitor | ) |
const |
|
overridevirtual |
Visits the requirement, then any child requirements.
The default implementation simply visits this requirement.
Reimplemented from ArbiterRequirement.
§ _requirements
| std::vector<std::shared_ptr<ArbiterRequirement> > Arbiter::Requirement::Compound::_requirements |
The documentation for this class was generated from the following file:
