wasm_split_cli_support 0.2.0-rc.2

Split a WASM module into lazily loadable chunks
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

//! Single-use range map
//!
//! Items can be inserted once, never removed or replaced and then be queried.
//! 0-length ranges are not supported.
//! Used to keep track of data relocations.
use std::{collections::BTreeMap, ops::Range};

pub type Key = usize;

#[derive(Debug)]
struct Value<V> {
    end: Key,
    value: V,
}

#[derive(Debug)]
pub struct OffsetRangeMap<V> {
    rm: BTreeMap<Key, Value<V>>,
}

impl<V> OffsetRangeMap<V> {
    pub fn new() -> Self {
        Self {
            rm: BTreeMap::default(),
        }
    }
    pub fn get(&self, offset: &Key) -> Option<&V> {
        let range_query = ..=offset;
        let (_candidate_start, candidate_info) = self.rm.range(range_query).last()?;
        if &candidate_info.end <= offset {
            None
        } else {
            Some(&candidate_info.value)
        }
    }
    pub fn insert(&mut self, range: Range<Key>, value: V) {
        assert!(!range.is_empty(), "empty ranges are not supported");
        if let Some(lap) = self.rm.range(..range.end).last() {
            let existing = *lap.0..lap.1.end;
            assert!(
                lap.1.end <= range.start,
                "overlapping ranges or replacements are not supported. already at {existing:?}, inserting {range:?}"
            );
        }
        self.rm.insert(
            range.start,
            Value {
                end: range.end,
                value,
            },
        );
    }
}