MichaelBradley/pyority_queue
1
0
Fork 0
Code Issues Pull requests Activity Actions

Simplify IndexedQueue API

Browse source 
Although similar to PureQueue, it doesn't make sense to use the exact
same signatures. Also don't make API users use Pair<D, P>.
This commit is contained in:
Michael Bradley 2025-01-13 22:07:43 +13:00
parent 16c1a4d390
commit 63515e2314
Signed by: MichaelBradley
SSH key fingerprint: SHA256:cj/YZ5VT+QOKncqSkx+ibKTIn0Obg7OIzwzl9BL8EO8
3 changed files with 40 additions and 56 deletions
Download patch file Download diff file Expand all files Collapse all files

40
src/backing/indexed/binary_heap.rs
View file

@ -1,6 +1,6 @@
use std::{collections::HashMap, hash::Hash};
use crate::backing::{containers::Pair, indexed::IndexedBacking, pure::PureBacking};
use crate::backing::{containers::Pair, indexed::IndexedBacking};
pub struct IndexedBinaryHeap<D: Hash + Clone + Send + Sync, P: PartialOrd + Clone + Send + Sync> {
data: Vec<Pair<D, P>>,
@ -16,26 +16,10 @@ impl<D: Hash + Clone + Send + Sync, P: PartialOrd + Clone + Send + Sync> Indexed
}
}
impl<D: Hash + Clone + Send + Sync, P: PartialOrd + Clone + Send + Sync> FromIterator<Pair<D, P>>
impl<D: Hash + Clone + Send + Sync, P: PartialOrd + Clone + Send + Sync> FromIterator<(D, P)>
for IndexedBinaryHeap<D, P>
{
fn from_iter<T: IntoIterator<Item = Pair<D, P>>>(iter: T) -> Self {
todo!()
}
}
impl<D: Hash + Clone + Send + Sync, P: PartialOrd + Clone + Send + Sync> PureBacking<Pair<D, P>>
for IndexedBinaryHeap<D, P>
{
fn add(&mut self, item: Pair<D, P>) {
todo!()
}
fn pop(&mut self) -> Option<Pair<D, P>> {
todo!()
}
fn len(&self) -> usize {
fn from_iter<T: IntoIterator<Item = (D, P)>>(iter: T) -> Self {
todo!()
}
}
@ -43,15 +27,23 @@ impl<D: Hash + Clone + Send + Sync, P: PartialOrd + Clone + Send + Sync> PureBac
impl<D: Hash + Clone + Send + Sync, P: PartialOrd + Clone + Send + Sync> IndexedBacking<D, P>
for IndexedBinaryHeap<D, P>
{
fn update(&mut self, data: D, priority: P) -> bool {
todo!()
}
fn remove(&mut self, data: D) -> bool {
fn len(&self) -> usize {
todo!()
}
fn contains(&self, data: &D) -> bool {
todo!()
}
fn set(&mut self, data: D, priority: P) {
todo!()
}
fn remove(&mut self, data: D) -> Option<P> {
todo!()
}
fn pop(&mut self) -> Option<D> {
todo!()
}
}