redges 0.3.0

A radial edge is a data structure for topological operations.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84

use std::hash::Hash;

use ordered_float::OrderedFloat;
use priority_queue::PriorityQueue;

/// Max priority queue that can poperly handle floats.
#[derive(Debug)]
pub struct PQueue<T, W>
where
    T: Eq + Hash,
    W: ordered_float::FloatCore,
{
    queue: PriorityQueue<T, OrderedFloat<W>>,
}

impl<T, W> PQueue<T, W>
where
    T: Eq + Hash,
    W: ordered_float::FloatCore,
{
    // pub fn new() -> Self {
    //     PQueue {
    //         queue: PriorityQueue::new(),
    //     }
    // }

    pub fn with_capacity(capacity: usize) -> Self {
        PQueue {
            queue: PriorityQueue::with_capacity(capacity),
        }
    }

    // pub fn from_iter<I>(iter: I) -> Self
    // where
    //     I: Iterator<Item = (T, W)>,
    // {
    //     let mut res = PQueue {
    //         queue: PriorityQueue::new(),
    //     };

    //     for (item, weight) in iter {
    //         res.push(-weight, item);
    //     }

    //     res
    // }

    pub fn push(&mut self, weight: W, item: T) -> Option<OrderedFloat<W>> {
        self.queue.push(item, OrderedFloat(-weight))
    }

    pub fn pop(&mut self) -> Option<(W, T)> {
        if let Some(item) = self.queue.pop() {
            Some((-item.1 .0, item.0))
        } else {
            None
        }
    }

    pub fn remove(&mut self, item: T) -> Option<(T, W)> {
        self.queue.remove(&item).map(|(i, OrderedFloat(w))| (i, w))
    }

    // pub fn contains(&self, item: &T) -> bool {
    //     self.queue.get(item).is_some()
    // }

    pub fn is_empty(&self) -> bool {
        self.queue.is_empty()
    }

    // pub fn len(&self) -> usize {
    //     self.queue.len()
    // }

    // pub fn iter(&self) -> impl Iterator<Item = (T, W)> + '_
    // where
    //     T: Clone,
    // {
    //     self.queue
    //         .iter()
    //         .map(|(item, ord_weight)| (item.clone(), ord_weight.0))
    // }
}