rspack_util 0.7.11

rspack util
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

use std::{collections::VecDeque, hash::Hash};

use rustc_hash::FxHashSet as HashSet;

pub struct Queue<T: Hash + PartialEq + Eq + Clone> {
  q: VecDeque<T>,
  set: HashSet<T>,
}

impl<T: Hash + PartialEq + Eq + Clone> Default for Queue<T> {
  fn default() -> Self {
    Self::new()
  }
}

impl<T: Hash + PartialEq + Eq + Clone> Queue<T> {
  pub fn new() -> Self {
    Self {
      q: VecDeque::default(),
      set: HashSet::default(),
    }
  }

  pub fn enqueue(&mut self, item: T) {
    if !self.set.contains(&item) {
      self.q.push_back(item.clone());
      self.set.insert(item);
    }
  }

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

  pub fn dequeue(&mut self) -> Option<T> {
    if let Some(item) = self.q.pop_front() {
      self.set.remove(&item);
      return Some(item);
    }
    None
  }
}