241a3e4689
The algorithm implemented here is linear in the size of the two b-trees. It firsts creates a `MergeIter` from the two b-trees and then builds a new b-tree by pushing key-value pairs from the `MergeIter` into nodes at the right heights. Three functions for stealing have been added to the implementation of `Handle` as well as a getter for the height of a `NodeRef`. The docs have been updated with performance information about `BTreeMap::append` and the remark about B has been removed now that it is the same for all instances of `BTreeMap`.
60 lines
1.4 KiB
Rust
60 lines
1.4 KiB
Rust
// Copyright 2015 The Rust Project Developers. See the COPYRIGHT
|
|
// file at the top-level directory of this distribution and at
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
// option. This file may not be copied, modified, or distributed
|
|
// except according to those terms.
|
|
|
|
#![deny(warnings)]
|
|
|
|
#![feature(binary_heap_extras)]
|
|
#![feature(binary_heap_append)]
|
|
#![feature(box_syntax)]
|
|
#![feature(btree_append)]
|
|
#![feature(btree_range)]
|
|
#![feature(collections)]
|
|
#![feature(collections_bound)]
|
|
#![feature(const_fn)]
|
|
#![feature(fn_traits)]
|
|
#![feature(enumset)]
|
|
#![feature(iter_arith)]
|
|
#![feature(linked_list_contains)]
|
|
#![feature(map_entry_keys)]
|
|
#![feature(map_values_mut)]
|
|
#![feature(pattern)]
|
|
#![feature(rand)]
|
|
#![feature(step_by)]
|
|
#![feature(str_char)]
|
|
#![feature(str_escape)]
|
|
#![feature(test)]
|
|
#![feature(unboxed_closures)]
|
|
#![feature(unicode)]
|
|
#![feature(vec_deque_contains)]
|
|
|
|
extern crate collections;
|
|
extern crate test;
|
|
extern crate rustc_unicode;
|
|
|
|
use std::hash::{Hash, Hasher, SipHasher};
|
|
|
|
#[cfg(test)] #[macro_use] mod bench;
|
|
|
|
mod binary_heap;
|
|
mod btree;
|
|
mod enum_set;
|
|
mod fmt;
|
|
mod linked_list;
|
|
mod slice;
|
|
mod str;
|
|
mod string;
|
|
mod vec_deque;
|
|
mod vec;
|
|
|
|
fn hash<T: Hash>(t: &T) -> u64 {
|
|
let mut s = SipHasher::new();
|
|
t.hash(&mut s);
|
|
s.finish()
|
|
}
|