PermutationStrategy::node_type Struct Reference

Entry in the priority queue. More...

#include "PermutationStrategy.h"

Public Member Functions
bool	operator< (const node_type &a) const
	Compare two entries; lower val (or lower id on tie) wins.

Public Attributes
unsigned long	id
	Node identifier.
unsigned long	val
	Priority statistic (smaller ⇒ higher priority)

Detailed Description

Entry in the priority queue.

Nodes with a smaller val are eliminated first. Ties are broken by node ID (smaller ID first) to ensure a deterministic ordering.

Definition at line 46 of file PermutationStrategy.h.

Member Function Documentation

operator<()

bool PermutationStrategy::node_type::operator< ( const node_type &  a ) const

inline

Compare two entries; lower val (or lower id on tie) wins.

Parameters

a	Other entry to compare against.

Returns

true if this entry has higher priority (smaller val or id).

Definition at line 54 of file PermutationStrategy.h.

Member Data Documentation

id

unsigned long PermutationStrategy::node_type::id

Node identifier.

Definition at line 47 of file PermutationStrategy.h.

val

unsigned long PermutationStrategy::node_type::val

Priority statistic (smaller ⇒ higher priority)

Definition at line 48 of file PermutationStrategy.h.

---

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

• /home/pierre/git/software/provsql/src/PermutationStrategy.h