Struct Queue 

pub struct Queue {
    pub path: PathBuf,
}

Fields

path: PathBuf

Implementations

impl Queue

pub fn new(path: PathBuf) -> Self

pub fn push( &self, sources: Vec<Source>, title: Option<String>, description: Option<String>, priority: Option<u8>, metadata: Value, blocked_by: Vec<String>, ) -> Result<Item>

Add a new item to the queue. Returns the created Item.

pub fn push_many_with_description( &self, items: Vec<NewItem>, ) -> Result<Vec<Item>>

Add many new items to the queue under a single lock.

pub fn all(&self) -> Vec<Item>

Get all items, skipping corrupt lines with warnings.

pub fn find(&self, id: &str) -> Option<Item>

Find an item by ID.

pub fn open_ids(&self) -> HashSet<String>

Return IDs for all non-closed items currently in the queue.

pub fn item_with_computed_status(&self, item: Item) -> Item

Apply computed/display status semantics to a single item.

pub fn items_with_computed_status(&self, items: Vec<Item>) -> Vec<Item>

Apply computed/display status semantics to a collection of items.

pub fn all_with_computed_status(&self) -> Vec<Item>

Load all items and apply computed/display status semantics.

pub fn find_with_computed_status(&self, id: &str) -> Option<Item>

Find an item by ID and apply computed/display status semantics.

pub fn filter(&self, status: Option<&str>) -> Vec<Item>

Filter items by persisted lifecycle status (optional).

This method intentionally does not apply computed/display status semantics. Callers that want view-oriented filtering (for example, treating blocked as a visible status in list/show output) should load items, call with_computed_status(...), and then filter those results.

pub fn ready(&self) -> Vec<Item>

Return pending items that are not blocked by any non-closed item.

pub fn update(&self, id: &str, attrs: UpdateAttrs) -> Result<Option<Item>>

Update an item by ID. Returns the updated Item or None.

pub fn remove(&self, id: &str) -> Result<Option<Item>>

Remove an item by ID. Returns the removed Item or None.