Generated on for Gecode by doxygen 1.18.0
Gecode::Search::Entries Class Reference

Stack of entries owning their spaces. More...

#include <gecode/search/heuristic.hh>

Public Member Functions

 Entries (void)
 Initialize.
void clear (void)
 Delete all entries.
 ~Entries (void)
 Release memory.
void sort (const Priority &p)
 Sort such that the preferred entry is on top.
Public Member Functions inherited from Gecode::Support::DynamicStack< Entry, Heap >
 DynamicStack (Heap &a, int n=64)
 Initialize stack with n elements.
 ~DynamicStack (void)
 Release memory.
bool empty (void) const
 Test whether stack is empty.
int entries (void) const
 Return number of entries currently on stack.
Entry pop (void)
 Pop topmost element from stack and return it.
Entry & top (void) const
 Return element on top of stack.
Entry & last (void) const
 Return element that has just been popped.
void push (const Entry &x)
 Push element x on top of stack.
Entry & operator[] (int i)
 Return entry at position i.
const DynamicStack & operator= (const DynamicStack &)=delete
 Assignment operator (disabled).

Additional Inherited Members

Static Public Member Functions inherited from Gecode::Support::DynamicStack< Entry, Heap >
static void * operator new (size_t s)=delete
 Allocate memory from heap (disabled).
static void operator delete (void *p)=delete
 Free memory allocated from heap (disabled).

Detailed Description

Stack of entries owning their spaces.

Definition at line 115 of file heuristic.hh.

Constructor & Destructor Documentation

◆ Entries()

Gecode::Search::Entries::Entries ( void )
inline

Initialize.

Definition at line 118 of file heuristic.hh.

◆ ~Entries()

Gecode::Search::Entries::~Entries ( void )
inline

Release memory.

Definition at line 125 of file heuristic.hh.

Member Function Documentation

◆ clear()

void Gecode::Search::Entries::clear ( void )
inline

Delete all entries.

Definition at line 120 of file heuristic.hh.

◆ sort()

void Gecode::Search::Entries::sort ( const Priority & p)
inline

Sort such that the preferred entry is on top.

Definition at line 127 of file heuristic.hh.


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