wtx 0.28.0

A collection of different transport implementations and related tools focused primarily on web technologies.
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

use crate::misc::Deque;
use core::{borrow::Borrow, hash::Hash};
use hashbrown::HashMap;

#[derive(Debug)]
pub(crate) struct IndexMap<K, V> {
  cursor: usize,
  elements: HashMap<K, V>,
  keys: Deque<K>,
}

impl<K, V> IndexMap<K, V>
where
  K: Clone + Copy + Eq + Hash,
{
  #[inline]
  pub(crate) fn new() -> Self {
    Self { cursor: 0, elements: HashMap::new(), keys: Deque::new() }
  }

  #[inline]
  pub(crate) fn clear(&mut self) {
    self.cursor = 0;
    self.elements.clear();
    self.keys.clear();
  }

  #[inline]
  pub(crate) fn decrease_cursor(&mut self) {
    self.cursor = self.cursor.saturating_sub(1);
  }

  #[inline]
  pub(crate) fn front_mut(&mut self) -> Option<&mut V> {
    if self.cursor >= self.elements.len() {
      return None;
    }
    let key = self.keys.get(0)?;
    let value = self.elements.get_mut(key)?;
    Some(value)
  }

  #[inline]
  pub(crate) fn increase_cursor(&mut self) {
    self.cursor = self.cursor.saturating_add(1);
  }

  #[inline]
  pub(crate) fn iter(&self) -> impl Iterator<Item = (&K, &V)> {
    self.elements.iter()
  }

  #[inline]
  pub(crate) fn push_back(&mut self, key: K, value: V) -> Option<V> {
    let prev_value = self.elements.insert(key, value);
    if prev_value.is_none() {
      self.keys.push_back(key).ok()?;
    }
    prev_value
  }

  #[inline]
  pub(crate) fn remove<Q>(&mut self, key: &Q) -> Option<V>
  where
    K: Borrow<Q>,
    Q: Eq + Hash + ?Sized,
  {
    let value = self.elements.remove(key)?;
    if self.elements.is_empty() {
      self.keys.clear();
    }
    Some(value)
  }
}