souffle::ast::NaiveSips Class Reference

Goal: Prioritise (1) all bound, then (2) atoms with at least one bound argument, then (3) left-most. More...

#include <SipsMetric.h>

Inheritance diagram for souffle::ast::NaiveSips:

Collaboration diagram for souffle::ast::NaiveSips:

Public Member Functions
	NaiveSips ()=default
Public Member Functions inherited from souffle::ast::SipsMetric
std::vector< unsigned int >	getReordering (const Clause *clause) const
	Determines the new ordering of a clause after the SIPS is applied. More...
virtual	~SipsMetric ()=default

Protected Member Functions
std::vector< double >	evaluateCosts (const std::vector< Atom * > atoms, const BindingStore &bindingStore) const override
	Evaluates the cost of choosing each atom next in the current schedule. More...

Additional Inherited Members
Static Public Member Functions inherited from souffle::ast::SipsMetric
static std::unique_ptr< SipsMetric >	create (const std::string &heuristic, const TranslationUnit &tu)
	Create a SIPS metric based on a given heuristic. More...

Detailed Description

Goal: Prioritise (1) all bound, then (2) atoms with at least one bound argument, then (3) left-most.

Definition at line 84 of file SipsMetric.h.

Constructor & Destructor Documentation

NaiveSips()

souffle::ast::NaiveSips::NaiveSips ( )

default

Member Function Documentation

evaluateCosts()

std::vector< double > souffle::ast::NaiveSips::evaluateCosts ( const std::vector< Atom * >  atoms, const BindingStore &  bindingStore  ) const

overrideprotectedvirtual

Evaluates the cost of choosing each atom next in the current schedule.

Parameters

atoms	atoms to choose from; may be nullptr
bindingStore	the variables already bound to a value

Implements souffle::ast::SipsMetric.

Definition at line 127 of file SipsMetric.cpp.

                               {
            cost.push_back(0);
        } else if (numBound >= 1) {
            cost.push_back(1);
        } else {
            cost.push_back(2);
        }
    }
    assert(atoms.size() == cost.size() && "each atom should have exactly one cost");
    return cost;
}
 
std::vector<double> MaxBoundSips::evaluateCosts(
        const std::vector<Atom*> atoms, const BindingStore& bindingStore) const {
    // Goal: prioritise (1) all-bound, then (2) max number of bound vars, then (3) left-most
    std::vector<double> cost;
    for (const auto* atom : atoms) {

---

The documentation for this class was generated from the following files:

• ast/utility/SipsMetric.h
• ast/utility/SipsMetric.cpp