CaDiCaL::heap< C > Class Template Reference

#include <heap.hpp>

Public Types
typedef vector< unsigned >::iterator	iterator
typedef vector< unsigned >::const_iterator	const_iterator

Public Member Functions
	heap (const C &c)
size_t	size () const
bool	empty () const
bool	contains (unsigned e) const
void	push_back (unsigned e)
unsigned	front () const
unsigned	pop_front ()
void	update (unsigned e)
void	clear ()
void	erase ()
void	shrink ()
iterator	begin ()
iterator	end ()
const_iterator	begin () const
const_iterator	end () const

Detailed Description

template<class C>
class CaDiCaL::heap< C >

Definition at line 28 of file heap.hpp.

Member Typedef Documentation

const_iterator

template<class C>

typedef vector<unsigned>::const_iterator CaDiCaL::heap< C >::const_iterator

Definition at line 207 of file heap.hpp.

iterator

template<class C>

typedef vector<unsigned>::iterator CaDiCaL::heap< C >::iterator

Definition at line 206 of file heap.hpp.

Constructor & Destructor Documentation

heap()

template<class C>

CaDiCaL::heap< C >::heap ( const C & c )

inline

Definition at line 127 of file heap.hpp.

: less (c) {}

Member Function Documentation

begin() [1/2]

template<class C>

iterator CaDiCaL::heap< C >::begin ( )

inline

Definition at line 208 of file heap.hpp.

{ return array.begin (); }

begin() [2/2]

template<class C>

const_iterator CaDiCaL::heap< C >::begin ( ) const

inline

Definition at line 210 of file heap.hpp.

{ return array.begin (); }

clear()

template<class C>

void CaDiCaL::heap< C >::clear ( )

inline

Definition at line 189 of file heap.hpp.

                {
    array.clear ();
    pos.clear ();
  }

contains()

template<class C>

bool CaDiCaL::heap< C >::contains ( unsigned e ) const

inline

Definition at line 139 of file heap.hpp.

                                   {
    if ((size_t) e >= pos.size ())
      return false;
    return pos[e] != invalid_heap_position;
  }

Here is the caller graph for this function:

empty()

template<class C>

bool CaDiCaL::heap< C >::empty ( ) const

inline

Definition at line 135 of file heap.hpp.

{ return array.empty (); }

Here is the caller graph for this function:

end() [1/2]

template<class C>

iterator CaDiCaL::heap< C >::end ( )

inline

Definition at line 209 of file heap.hpp.

{ return array.end (); }

end() [2/2]

template<class C>

const_iterator CaDiCaL::heap< C >::end ( ) const

inline

Definition at line 211 of file heap.hpp.

{ return array.end (); }

erase()

template<class C>

void CaDiCaL::heap< C >::erase ( )

inline

Definition at line 194 of file heap.hpp.

                {
    erase_vector (array);
    erase_vector (pos);
  }

Here is the caller graph for this function:

front()

template<class C>

unsigned CaDiCaL::heap< C >::front ( ) const

inline

Definition at line 160 of file heap.hpp.

                          {
    CADICAL_assert (!empty ());
    return array[0];
  }

Here is the caller graph for this function:

pop_front()

template<class C>

unsigned CaDiCaL::heap< C >::pop_front ( )

inline

Definition at line 167 of file heap.hpp.

                        {
    CADICAL_assert (!empty ());
    unsigned res = array[0], last = array.back ();
    if (size () > 1)
      exchange (res, last);
    index (res) = invalid_heap_position;
    array.pop_back ();
    if (size () > 1)
      down (last);
    check ();
    return res;
  }

Here is the caller graph for this function:

push_back()

template<class C>

void CaDiCaL::heap< C >::push_back ( unsigned e )

inline

Definition at line 147 of file heap.hpp.

                              {
    CADICAL_assert (!contains (e));
    size_t i = array.size ();
    CADICAL_assert (i < (size_t) invalid_heap_position);
    array.push_back (e);
    index (e) = (unsigned) i;
    up (e);
    down (e);
    check ();
  }

Here is the caller graph for this function:

shrink()

template<class C>

void CaDiCaL::heap< C >::shrink ( )

inline

Definition at line 199 of file heap.hpp.

                 {
    shrink_vector (array);
    shrink_vector (pos);
  }

Here is the caller graph for this function:

size()

template<class C>

size_t CaDiCaL::heap< C >::size ( ) const

inline

Definition at line 131 of file heap.hpp.

{ return array.size (); }

Here is the caller graph for this function:

update()

template<class C>

void CaDiCaL::heap< C >::update ( unsigned e )

inline

Definition at line 182 of file heap.hpp.

                           {
    CADICAL_assert (contains (e));
    up (e);
    down (e);
    check ();
  }

Here is the caller graph for this function:

---

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

• src/sat/cadical/heap.hpp