                                              {
    Link &l = links[idx];
    if (l.prev)
      links[l.prev].next = l.next;
    else
      first = l.next;
    if (l.next)
      links[l.next].prev = l.prev;
    else
      last = l.prev;
  }

◆ enqueue()

void CaDiCaL::Queue::enqueue	(	Links &	links,
		int	idx )

inline

Definition at line 55 of file queue.hpp.

                                              {
    Link &l = links[idx];
    if ((l.prev = last))
      links[last].next = idx;
    else
      first = idx;
    last = idx;
    l.next = 0;
  }

Member Data Documentation

◆ bumped

int64_t CaDiCaL::Queue::bumped

Definition at line 33 of file queue.hpp.

◆ first

int CaDiCaL::Queue::first

Definition at line 31 of file queue.hpp.

◆ last

int CaDiCaL::Queue::last

Definition at line 31 of file queue.hpp.

◆ unassigned

int CaDiCaL::Queue::unassigned

Definition at line 32 of file queue.hpp.

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

src/sat/cadical/queue.hpp

Public Member Functions

Public Attributes

Detailed Description

Constructor & Destructor Documentation

◆ Queue()