qubit 1.0.0-beta.2

Seamless RPC for Rust & TypeScript
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

use std::collections::BTreeMap;

/// Utility structure for a linked-list like structure, where edges are strings.
pub struct Node<V> {
    /// All items present on this node.
    pub items: BTreeMap<String, V>,
    /// All child nodes.
    pub children: BTreeMap<String, Node<V>>,
}

impl<V> Node<V> {
    /// Create a new node with no items or children.
    pub fn new() -> Self {
        Self {
            items: BTreeMap::new(),
            children: BTreeMap::new(),
        }
    }

    /// Insert a new value at the provided path. Intermediary nodes will automatically be created.
    pub fn insert(&mut self, path: &[&str], value: V) {
        assert!(!path.is_empty());

        if path.len() == 1 {
            self.items.insert(path[0].to_string(), value);
            return;
        }

        self.children
            .entry(path[0].to_string())
            .or_default()
            .insert(&path[1..], value);
    }
}

impl<V> Default for Node<V> {
    fn default() -> Self {
        Self::new()
    }
}