souffle::ast::MaxRatioSips Class Reference

Goal: prioritise max ratio of bound args. More...

#include <SipsMetric.h>

Inheritance diagram for souffle::ast::MaxRatioSips:

Collaboration diagram for souffle::ast::MaxRatioSips:

Public Member Functions
	MaxRatioSips ()=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 max ratio of bound args.

Definition at line 104 of file SipsMetric.h.

Constructor & Destructor Documentation

MaxRatioSips()

souffle::ast::MaxRatioSips::MaxRatioSips ( )

default

Member Function Documentation

evaluateCosts()

std::vector< double > souffle::ast::MaxRatioSips::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 178 of file SipsMetric.cpp.

                        {
            // Always better than anything else
            cost.push_back(0);
        } else if (numBound == 0) {
            // Always worse than anything else
            cost.push_back(2);
        } else {
            // Between 0 and 1, decreasing as the ratio increases
            cost.push_back(1 - numBound / arity);
        }
    }
    assert(atoms.size() == cost.size() && "each atom should have exactly one cost");
    return cost;
}
 
std::vector<double> LeastFreeSips::evaluateCosts(
        const std::vector<Atom*> atoms, const BindingStore& bindingStore) const {
    // Goal: choose the atom with the least number of unbound arguments
    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