baby-mimalloc 0.2.1

Mimalloc implemented in Rust (not a binding to the C library) with only basic features.
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

#![no_std]

extern crate alloc;

use alloc::collections::BTreeMap;
use alloc::vec;
use alloc::vec::Vec;
use baby_mimalloc::{new_mimalloc_mmap_mutex, MimallocMmapMutex};
use rand::distributions::{DistString, Standard};
use rand::prelude::*;

#[global_allocator]
static ALLOCATOR: MimallocMmapMutex = new_mimalloc_mmap_mutex();

#[test]
fn vec_test() {
    for _ in 0..10 {
        let mut vec = Vec::new();
        let mut rng = thread_rng();
        for _ in 0..10_000 {
            let len = rng.gen_range(1..100_000);
            let val = vec![42; len];
            vec.push(val);
        }
    }
}

#[test]
fn btree_map_test() {
    const N: usize = 100_000;
    let mut map = BTreeMap::new();
    let mut rng = thread_rng();
    for _ in 0..N {
        let key_len = rng.gen_range(1..10);
        let key = Standard.sample_string(&mut rng, key_len);
        let val_len = rng.gen_range(1..10000);
        let val = Standard.sample_string(&mut rng, val_len);
        map.insert(key, val);
    }
    let map_len = map.len();
    assert!(map_len < N);
    let vec = map.into_iter().collect::<Vec<_>>();
    assert_eq!(map_len, vec.len());
}