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

use std::ops::{Deref, DerefMut};

/// Intermediate Node representation. Same as Node, but without the `.hash`
/// field.
#[derive(Debug, Eq, Ord, PartialEq, PartialOrd, Clone)]
pub struct PartialNode {
  /// Reference to this node's parent node.
  pub parent: usize,
  /// Data if it's a leaf node, nothing if it's a parent node.
  pub(crate) data: Option<Vec<u8>>,
  /// Total size of all its child nodes combined.
  pub(crate) length: usize,
  /// Offset into the flat-tree data structure.
  pub(crate) index: usize,
}

impl PartialNode {
  /// Returns the number of elements in the Node, also referred to as its
  /// 'length'.
  pub fn len(&self) -> usize {
    self.length
  }

  /// Returns true if the Node contains no elements.
  pub fn is_empty(&self) -> bool {
    self.length == 0
  }

  /// Get the current index into the stream.
  pub fn index(&self) -> usize {
    self.index
  }
  /// Get the data from the thingy.
  pub fn data(&self) -> &Option<Vec<u8>> {
    &self.data
  }
}

impl Deref for PartialNode {
  type Target = Option<Vec<u8>>;
  fn deref(&self) -> &Self::Target {
    &self.data
  }
}

impl DerefMut for PartialNode {
  fn deref_mut(&mut self) -> &mut Self::Target {
    &mut self.data
  }
}