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

//! Key search algorithms for `MassTree`.
//!
//! Provides scalar ikey matching for internode routing.

use crate::ksearch::scalar::Scalar;
use crate::leaf_trait::TreeInternode;

pub mod scalar;

// ============================================================================
//  Internode Search
// ============================================================================

/// Upper bound search for internode routing.
///
/// Returns child index (0 to nkeys) to follow for the given ikey.
#[inline(always)]
pub fn upper_bound_internode_generic<I: TreeInternode>(search_ikey: u64, node: &I) -> usize {
    Scalar::upper_bound_internode_scalar(search_ikey, node)
}