masstree 0.9.5

A high-performance concurrent ordered map (trie of B+trees)
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

use super::*;

#[test]
fn sentinel_is_consistent() {
    let ptr1: *mut u8 = InlineSentinel::inline_sentinel_ptr();
    let ptr2: *mut u8 = InlineSentinel::inline_sentinel_ptr();

    assert!(StdPtr::eq(ptr1, ptr2));
}

#[test]
fn sentinel_is_non_null() {
    let ptr: *mut u8 = InlineSentinel::inline_sentinel_ptr();

    assert!(!ptr.is_null());
}

#[test]
fn sentinel_detection_works() {
    let sentinel: *mut u8 = InlineSentinel::inline_sentinel_ptr();
    assert!(InlineSentinel::is_inline_sentinel(sentinel));

    let non_sentinel: &u8 = &42u8;
    assert!(!InlineSentinel::is_inline_sentinel(non_sentinel));

    let null: *const u8 = StdPtr::null();
    assert!(!InlineSentinel::is_inline_sentinel(null));
}