This is the complete list of members for gtsam::Scheduler, including all inherited members.
| accumulateStats(const DiscreteValues &assignment, std::vector< size_t > &stats) const | gtsam::Scheduler | |
| add(Args &&... args) | gtsam::DiscreteFactorGraph | inline |
| FactorGraph< DiscreteFactor >::add(std::shared_ptr< DERIVEDFACTOR > factor) | gtsam::FactorGraph< DiscreteFactor > | inline |
| FactorGraph< DiscreteFactor >::add(const FACTOR_OR_CONTAINER &factorOrContainer) | gtsam::FactorGraph< DiscreteFactor > | inline |
| add_factors(const CONTAINER &factors, bool useEmptySlots=false) | gtsam::FactorGraph< DiscreteFactor > | |
| addAllDiff(const DiscreteKey &key1, const DiscreteKey &key2) | gtsam::CSP | inline |
| addAllDiff(const DiscreteKeys &dkeys) | gtsam::CSP | inline |
| addArea(const std::string &facultyName, const std::string &areaName) | gtsam::Scheduler | inline |
| addFaculty(const std::string &facultyName) | gtsam::Scheduler | inline |
| addSingleValue(const DiscreteKey &dkey, size_t value) | gtsam::CSP | inline |
| addSlot(const std::string &slotName) | gtsam::Scheduler | inline |
| addStudent(const std::string &studentName, const std::string &area1, const std::string &area2, const std::string &area3, const std::string &advisor) | gtsam::Scheduler | |
| addStudentSpecificConstraints(size_t i, std::optional< size_t > slot={}) | gtsam::Scheduler | |
| areaName_ | gtsam::Scheduler | private |
| at(size_t i) const | gtsam::FactorGraph< DiscreteFactor > | inline |
| at(size_t i) | gtsam::FactorGraph< DiscreteFactor > | inline |
| available_ | gtsam::Scheduler | private |
| back() const | gtsam::FactorGraph< DiscreteFactor > | inline |
| Base typedef | gtsam::DiscreteFactorGraph | |
| BaseEliminateable typedef | gtsam::DiscreteFactorGraph | |
| BayesNetType typedef | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| BayesTreeType typedef | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| begin() const | gtsam::FactorGraph< DiscreteFactor > | inline |
| begin() | gtsam::FactorGraph< DiscreteFactor > | inline |
| bestAssignment(const DiscreteValues &bestSchedule) const | gtsam::Scheduler | |
| bestSchedule() const | gtsam::Scheduler | |
| buildGraph(size_t mutexBound=7) | gtsam::Scheduler | |
| ConditionalType typedef | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| const_iterator typedef | gtsam::FactorGraph< DiscreteFactor > | |
| DiscreteFactorGraph() | gtsam::DiscreteFactorGraph | inline |
| DiscreteFactorGraph(ITERATOR firstFactor, ITERATOR lastFactor) | gtsam::DiscreteFactorGraph | inline |
| DiscreteFactorGraph(const CONTAINER &factors) | gtsam::DiscreteFactorGraph | inlineexplicit |
| DiscreteFactorGraph(const FactorGraph< DERIVEDFACTOR > &graph) | gtsam::DiscreteFactorGraph | inline |
| discreteKeys() const | gtsam::DiscreteFactorGraph | |
| dot(std::ostream &os, const KeyFormatter &keyFormatter=DefaultKeyFormatter, const DotWriter &writer=DotWriter()) const | gtsam::FactorGraph< DiscreteFactor > | |
| dot(const KeyFormatter &keyFormatter=DefaultKeyFormatter, const DotWriter &writer=DotWriter()) const | gtsam::FactorGraph< DiscreteFactor > | |
| eliminate() const | gtsam::Scheduler | |
| Eliminate typedef | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| eliminateMultifrontal(OptionalOrderingType orderingType={}, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| eliminateMultifrontal(const Ordering &ordering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| eliminatePartialMultifrontal(const Ordering &ordering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| eliminatePartialMultifrontal(const KeyVector &variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| eliminatePartialSequential(const Ordering &ordering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| eliminatePartialSequential(const KeyVector &variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| eliminateSequential(OptionalOrderingType orderingType={}, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| eliminateSequential(const Ordering &ordering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| EliminationResult typedef | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| EliminationTraitsType typedef | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| EliminationTreeType typedef | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| emplace_shared(Args &&... args) | gtsam::FactorGraph< DiscreteFactor > | inline |
| empty() const | gtsam::FactorGraph< DiscreteFactor > | inline |
| end() const | gtsam::FactorGraph< DiscreteFactor > | inline |
| end() | gtsam::FactorGraph< DiscreteFactor > | inline |
| equals(const This &fg, double tol=1e-9) const | gtsam::DiscreteFactorGraph | |
| FactorGraph< DiscreteFactor >::equals(const This &fg, double tol=1e-9) const | gtsam::FactorGraph< DiscreteFactor > | |
| erase(iterator item) | gtsam::FactorGraph< DiscreteFactor > | inline |
| erase(iterator first, iterator last) | gtsam::FactorGraph< DiscreteFactor > | inline |
| error(const HybridValues &values) const | gtsam::FactorGraph< DiscreteFactor > | |
| exists(size_t idx) const | gtsam::FactorGraph< DiscreteFactor > | inline |
| FactorGraph() | gtsam::FactorGraph< DiscreteFactor > | inlineprotected |
| FactorGraph(ITERATOR firstFactor, ITERATOR lastFactor) | gtsam::FactorGraph< DiscreteFactor > | inlineprotected |
| FactorGraph(const CONTAINER &factors) | gtsam::FactorGraph< DiscreteFactor > | inlineexplicitprotected |
| FactorGraph(std::initializer_list< std::shared_ptr< DERIVEDFACTOR >> sharedFactors) | gtsam::FactorGraph< DiscreteFactor > | inline |
| factors_ | gtsam::FactorGraph< DiscreteFactor > | protected |
| FactorType typedef | gtsam::FactorGraph< DiscreteFactor > | |
| FacultyInArea typedef | gtsam::Scheduler | private |
| facultyInArea_ | gtsam::Scheduler | private |
| facultyIndex_ | gtsam::Scheduler | private |
| facultyName_ | gtsam::Scheduler | private |
| front() const | gtsam::FactorGraph< DiscreteFactor > | inline |
| html(const KeyFormatter &keyFormatter=DefaultKeyFormatter, const DiscreteFactor::Names &names={}) const | gtsam::DiscreteFactorGraph | |
| Indices typedef | gtsam::DiscreteFactorGraph | |
| isEqual(const FactorGraph &other) const | gtsam::FactorGraph< DiscreteFactor > | inlineprotected |
| iterator typedef | gtsam::FactorGraph< DiscreteFactor > | |
| JunctionTreeType typedef | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| key(size_t s, std::optional< size_t > area={}) const | gtsam::Scheduler | |
| keys() const | gtsam::DiscreteFactorGraph | |
| keyVector() const | gtsam::FactorGraph< DiscreteFactor > | |
| marginal(const KeyVector &variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| marginalMultifrontalBayesNet(const Ordering &variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| marginalMultifrontalBayesNet(const KeyVector &variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| marginalMultifrontalBayesNet(const Ordering &variables, const Ordering &marginalizedVariableOrdering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| marginalMultifrontalBayesNet(const KeyVector &variables, const Ordering &marginalizedVariableOrdering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| marginalMultifrontalBayesTree(const Ordering &variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| marginalMultifrontalBayesTree(const KeyVector &variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| marginalMultifrontalBayesTree(const Ordering &variables, const Ordering &marginalizedVariableOrdering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| marginalMultifrontalBayesTree(const KeyVector &variables, const Ordering &marginalizedVariableOrdering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex={}) const | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| markdown(const KeyFormatter &keyFormatter=DefaultKeyFormatter, const DiscreteFactor::Names &names={}) const | gtsam::DiscreteFactorGraph | |
| maxNrStudents_ | gtsam::Scheduler | private |
| maxProduct(OptionalOrderingType orderingType={}) const | gtsam::DiscreteFactorGraph | |
| maxProduct(const Ordering &ordering) const | gtsam::DiscreteFactorGraph | |
| nrFactors() const | gtsam::FactorGraph< DiscreteFactor > | |
| nrFaculty() const | gtsam::Scheduler | inline |
| nrStudents() const | gtsam::Scheduler | inline |
| nrTimeSlots() const | gtsam::Scheduler | inline |
| operator()(const DiscreteValues &values) const | gtsam::DiscreteFactorGraph | |
| operator[](size_t i) const | gtsam::FactorGraph< DiscreteFactor > | inline |
| operator[](size_t i) | gtsam::FactorGraph< DiscreteFactor > | inline |
| optimize(OptionalOrderingType orderingType={}) const | gtsam::DiscreteFactorGraph | |
| optimize(const Ordering &ordering) const | gtsam::DiscreteFactorGraph | |
| OptionalOrderingType typedef | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| OptionalVariableIndex typedef | gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| partiallyApply(const Domains &domains) const | gtsam::CSP | |
| print(const std::string &s="Scheduler", const KeyFormatter &formatter=DefaultKeyFormatter) const override | gtsam::Scheduler | virtual |
| printAssignment(const DiscreteValues &assignment) const | gtsam::Scheduler | |
| printSpecial(const DiscreteValues &assignment) const | gtsam::Scheduler | |
| product() const | gtsam::DiscreteFactorGraph | |
| push_back(std::shared_ptr< DERIVEDFACTOR > factor) | gtsam::FactorGraph< DiscreteFactor > | inline |
| push_back(const DERIVEDFACTOR &factor) | gtsam::FactorGraph< DiscreteFactor > | inline |
| push_back(ITERATOR firstFactor, ITERATOR lastFactor) | gtsam::FactorGraph< DiscreteFactor > | inline |
| push_back(ITERATOR firstFactor, ITERATOR lastFactor) | gtsam::FactorGraph< DiscreteFactor > | inline |
| push_back(const CONTAINER &container) | gtsam::FactorGraph< DiscreteFactor > | inline |
| push_back(const CONTAINER &container) | gtsam::FactorGraph< DiscreteFactor > | inline |
| push_back(const BayesTree< CLIQUE > &bayesTree) | gtsam::FactorGraph< DiscreteFactor > | inline |
| remove(size_t i) | gtsam::FactorGraph< DiscreteFactor > | inline |
| replace(size_t index, sharedFactor factor) | gtsam::FactorGraph< DiscreteFactor > | inline |
| reserve(size_t size) | gtsam::FactorGraph< DiscreteFactor > | inline |
| resize(size_t size) | gtsam::FactorGraph< DiscreteFactor > | inlinevirtual |
| runArcConsistency(size_t cardinality, size_t maxIterations=10) const | gtsam::CSP | |
| runArcConsistency(const VariableIndex &index, Domains *domains) const | gtsam::CSP | |
| saveGraph(const std::string &filename, const KeyFormatter &keyFormatter=DefaultKeyFormatter, const DotWriter &writer=DotWriter()) const | gtsam::FactorGraph< DiscreteFactor > | |
| Scheduler(size_t maxNrStudents) | gtsam::Scheduler | inline |
| Scheduler(size_t maxNrStudents, const std::string &filename) | gtsam::Scheduler | |
| setAvailability(const std::string &available) | gtsam::Scheduler | inline |
| setSlotsAvailable(const std::vector< double > &slotsAvailable) | gtsam::Scheduler | inline |
| shared_ptr typedef | gtsam::DiscreteFactorGraph | |
| sharedFactor typedef | gtsam::FactorGraph< DiscreteFactor > | |
| size() const | gtsam::FactorGraph< DiscreteFactor > | inline |
| slotName(size_t s) const | gtsam::Scheduler | inline |
| slotName_ | gtsam::Scheduler | private |
| slotsAvailable_ | gtsam::Scheduler | private |
| studentArea(size_t i, size_t area) const | gtsam::Scheduler | |
| studentKey(size_t i) const | gtsam::Scheduler | |
| studentName(size_t i) const | gtsam::Scheduler | |
| students_ | gtsam::Scheduler | private |
| sumProduct(OptionalOrderingType orderingType={}) const | gtsam::DiscreteFactorGraph | |
| sumProduct(const Ordering &ordering) const | gtsam::DiscreteFactorGraph | |
| This typedef | gtsam::DiscreteFactorGraph | |
| value_type typedef | gtsam::FactorGraph< DiscreteFactor > | |
| Values typedef | gtsam::CSP | |
| ~FactorGraph()=default | gtsam::FactorGraph< DiscreteFactor > | virtual |
| ~Scheduler() | gtsam::Scheduler | inlinevirtual |