wtx 0.44.2

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

use crate::collection::Vector;

/// A heap-allocated matrix where each row is a contiguous block of variable size.
///
/// Can be seen as a middle ground between dense matrices and CSRs.
#[derive(Debug)]
pub struct CompressedRows<T> {
  pub(crate) data: Vector<T>,
  pub(crate) offsets: Vector<usize>,
}

impl<T> CompressedRows<T> {
  /// Empty instance.
  #[inline]
  pub const fn new() -> Self {
    Self { data: Vector::new(), offsets: Vector::new() }
  }

  /// Row iterator
  #[inline]
  pub fn iter_rows(&self) -> impl Iterator<Item = &[T]> {
    let Self { data, offsets, .. } = self;
    offsets.iter().scan(0usize, |idx, offset| {
      let begin = *idx;
      let end = idx.wrapping_add(*offset);
      *idx = end;
      data.get(begin..end)
    })
  }

  /// Appends a new row from an copyable element.
  #[inline]
  pub fn push_row_from_copyable_slice(&mut self, slice: &[T]) -> crate::Result<()>
  where
    T: Copy,
  {
    let Self { data, offsets } = self;
    data.extend_from_copyable_slice(slice)?;
    offsets.push(slice.len())?;
    Ok(())
  }

  /// The number of rows
  #[inline]
  pub fn rows(&self) -> usize {
    self.offsets.len()
  }
}

impl<T> Default for CompressedRows<T> {
  #[inline]
  fn default() -> Self {
    Self { data: Vector::default(), offsets: Vector::default() }
  }
}