Minisat::LSet Class Reference

#include <SolverTypes.h>

Inheritance diagram for Minisat::LSet:

Collaboration diagram for Minisat::LSet:

Public Member Functions
int	size (void) const
void	clear (bool free=false)
const vec< Lit > &	toVec () const
Lit	operator[] (int index) const
void	insert (Litk)
bool	has (Litk)

Detailed Description

Definition at line 84 of file SolverTypes.h.

Member Function Documentation

void Minisat::IntSet< Lit , MkIndexLit >::clear ( bool  free = false )

inlineinherited

Definition at line 67 of file IntMap.h.

                                                {
            if (free)
                in_set.clear(true); 
            else
                for (int i = 0; i < xs.size(); i++)
                    in_set[xs[i]] = 0;
            xs.clear(free);
        }

Here is the call graph for this function:

bool Minisat::IntSet< Lit , MkIndexLit >::has ( Lit  k )

inlineinherited

Definition at line 85 of file IntMap.h.

{ in_set.reserve(k, 0); return in_set[k]; }

Here is the call graph for this function:

void Minisat::IntSet< Lit , MkIndexLit >::insert ( Lit  k )

inlineinherited

Definition at line 84 of file IntMap.h.

{ in_set.reserve(k, 0); if (!in_set[k]) { in_set[k] = 1; xs.push(k); } }

Here is the call graph for this function:

Lit Minisat::IntSet< Lit , MkIndexLit >::operator[] ( int  index ) const

inlineinherited

Definition at line 81 of file IntMap.h.

{ return xs[index]; }

int Minisat::IntSet< Lit , MkIndexLit >::size ( void  ) const

inlineinherited

Definition at line 66 of file IntMap.h.

{ return xs.size(); }

Here is the call graph for this function:

const vec<Lit >& Minisat::IntSet< Lit , MkIndexLit >::toVec ( ) const

inlineinherited

Definition at line 78 of file IntMap.h.

{ return xs; }

---

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

• SolverTypes.h