Struct PriorityQueue 

pub struct PriorityQueue { /* private fields */ }

Priority queue for knowledge gaps

Provides efficient access to highest priority gaps using BinaryHeap.

Implementations

impl PriorityQueue

pub fn new() -> Self

Create empty priority queue

pub fn push(&mut self, gap: KnowledgeGap)

Push a gap into the queue

pub fn pop(&mut self) -> Option<KnowledgeGap>

Pop highest priority gap

Returns None if queue is empty.

pub fn peek(&self) -> Option<&KnowledgeGap>

Peek at highest priority gap without removing

pub fn len(&self) -> usize

Get number of gaps in queue

pub fn is_empty(&self) -> bool

Check if queue is empty

Trait Implementations

impl Default for PriorityQueue

fn default() -> Self

Returns the “default value” for a type.