souffle::ram::analysis::SearchSignature Class Reference

search signature of a RAM operation; each bit represents an attribute of a relation. More...

#include <Index.h>

Collaboration diagram for souffle::ram::analysis::SearchSignature:

Data Structures
class	Hasher

Public Member Functions
size_t	arity () const
bool	containsEquality () const
bool	empty () const
bool	operator!= (const SearchSignature &other) const
bool	operator< (const SearchSignature &other) const
bool	operator== (const SearchSignature &other) const
AttributeConstraint &	operator[] (std::size_t pos)
const AttributeConstraint &	operator[] (std::size_t pos) const
	SearchSignature (size_t arity)

Static Public Member Functions
static SearchSignature	getDelta (const SearchSignature &lhs, const SearchSignature &rhs)
static SearchSignature	getDischarged (const SearchSignature &signature)
static SearchSignature	getFullSearchSignature (size_t arity)
static bool	isComparable (const SearchSignature &lhs, const SearchSignature &rhs)
static bool	isSubset (const SearchSignature &lhs, const SearchSignature &rhs)

Private Attributes
std::vector< AttributeConstraint >	constraints

Friends
std::ostream &	operator<< (std::ostream &out, const SearchSignature &signature)

Detailed Description

search signature of a RAM operation; each bit represents an attribute of a relation.

A one represents that the attribute has an assigned value; a zero represents that no value exists (i.e. attribute is unbounded) in the search.

Definition at line 52 of file Index.h.

Constructor & Destructor Documentation

SearchSignature()

souffle::ram::analysis::SearchSignature::SearchSignature ( size_t  arity )

explicit

Definition at line 45 of file Index.cpp.

Member Function Documentation

arity()

size_t souffle::ram::analysis::SearchSignature::arity

(

)

const

Definition at line 47 of file Index.cpp.

Referenced by souffle::ram::analysis::MinIndexSelection::card(), souffle::interpreter::NodeGenerator::encodeIndexPos(), souffle::ram::analysis::MinIndexSelection::insertIndex(), and souffle::ram::analysis::SearchSignature::Hasher::operator()().

containsEquality()

bool souffle::ram::analysis::SearchSignature::containsEquality

(

)

const

Definition at line 87 of file Index.cpp.

                                                                                         {
    assert(lhs.arity() == rhs.arity());
    if (lhs == rhs) {

empty()

bool souffle::ram::analysis::SearchSignature::empty

(

)

const

Definition at line 77 of file Index.cpp.

                                             {
    for (auto constraint : constraints) {
        if (constraint == AttributeConstraint::Equal) {
            return true;
        }

Referenced by souffle::ram::analysis::MinIndexSelection::addSearch().

getDelta()

SearchSignature souffle::ram::analysis::SearchSignature::getDelta ( const SearchSignature &  lhs, const SearchSignature &  rhs  )

static

Definition at line 126 of file Index.cpp.

               {
            delta.constraints[i] = AttributeConstraint::None;
        }
    }
    return delta;
}
 
SearchSignature SearchSignature::getFullSearchSignature(size_t arity) {
    SearchSignature res(arity);
    for (size_t i = 0; i < arity; ++i) {
        res.constraints[i] = AttributeConstraint::Equal;
    }

getDischarged()

SearchSignature souffle::ram::analysis::SearchSignature::getDischarged ( const SearchSignature &  signature )

static

Definition at line 148 of file Index.cpp.

                                                                          {
    size_t len = signature.constraints.size();
    for (size_t i = 0; i < len; ++i) {
        switch (signature.constraints[i]) {
            case AttributeConstraint::None: out << 0; break;

getFullSearchSignature()

SearchSignature souffle::ram::analysis::SearchSignature::getFullSearchSignature ( size_t  arity )

static

Definition at line 140 of file Index.cpp.

                                                                               {
    SearchSignature res = signature;  // copy original
    for (size_t i = 0; i < res.arity(); ++i) {
        if (res[i] == AttributeConstraint::Inequal) {
            res[i] = AttributeConstraint::None;

Referenced by souffle::interpreter::NodeGenerator::encodeIndexPos(), and souffle::ram::analysis::MinIndexSelection::insertDefaultTotalIndex().

isComparable()

bool souffle::ram::analysis::SearchSignature::isComparable ( const SearchSignature &  lhs, const SearchSignature &  rhs  )

static

Definition at line 98 of file Index.cpp.

                                             {
        if (rhs[i] == AttributeConstraint::Inequal) {
            if (lhs[i] != AttributeConstraint::None) {
                withinDelta = false;
            }
        }
    }
    return withinDelta;
}
 
bool SearchSignature::isSubset(const SearchSignature& lhs, const SearchSignature& rhs) {
    assert(lhs.arity() == rhs.arity());
    size_t len = lhs.arity();
    for (size_t i = 0; i < len; ++i) {
        if (lhs[i] != AttributeConstraint::None && rhs[i] == AttributeConstraint::None) {

References i, souffle::ram::analysis::Inequal, lhs, souffle::ram::analysis::None, and rhs.

Referenced by operator[]().

isSubset()

bool souffle::ram::analysis::SearchSignature::isSubset ( const SearchSignature &  lhs, const SearchSignature &  rhs  )

static

Definition at line 115 of file Index.cpp.

                                                                                                {
    assert(lhs.arity() == rhs.arity());
    SearchSignature delta(lhs.arity());
    for (size_t i = 0; i < lhs.arity(); ++i) {
        // if constraints are the same then delta is nothing

Referenced by operator[]().

operator!=()

bool souffle::ram::analysis::SearchSignature::operator!=

(

const SearchSignature &

other

)

const

Definition at line 73 of file Index.cpp.

                                     {
        if (constraints[i] != AttributeConstraint::None) {
            return false;

References constraints, i, and souffle::ram::analysis::None.

operator<()

bool souffle::ram::analysis::SearchSignature::operator<

(

const SearchSignature &

other

)

const

Definition at line 63 of file Index.cpp.

operator==()

bool souffle::ram::analysis::SearchSignature::operator==

(

const SearchSignature &

other

)

const

Definition at line 68 of file Index.cpp.

                                  {

operator[]() [1/2]

AttributeConstraint & souffle::ram::analysis::SearchSignature::operator[]

(

std::size_t

pos

)

Definition at line 52 of file Index.cpp.

operator[]() [2/2]

const AttributeConstraint & souffle::ram::analysis::SearchSignature::operator[]

(

std::size_t

pos

)

const

Definition at line 57 of file Index.cpp.

                                                                  {
    assert(constraints.size() == other.constraints.size());
    return isComparable(*this, other) && isSubset(*this, other);
}

References constraints, isComparable(), and isSubset().

Here is the call graph for this function:

Friends And Related Function Documentation

operator<<

std::ostream& operator<< ( std::ostream &  out, const SearchSignature &  signature  )

friend

Definition at line 158 of file Index.cpp.

                                           : out << 2; break;
        }
    }
    return out;
}
 
void MaxMatching::addEdge(Node u, Node v) {
    assert(u >= 1 && v >= 1 && "Nodes must be greater than or equal to 1");
    if (graph.find(u) == graph.end()) {
        Edges vals;
        vals.insert(v);

Field Documentation

constraints

std::vector<AttributeConstraint> souffle::ram::analysis::SearchSignature::constraints

private

Definition at line 90 of file Index.h.

Referenced by operator!=(), souffle::ram::analysis::SearchSignature::Hasher::operator()(), and operator[]().

---

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

• ram/analysis/Index.h
• ram/analysis/Index.cpp