var searchIndex = {};
searchIndex["libreal"] = {"doc":"","items":[[0,"heap","libreal","",null,null],[3,"Heap","libreal::heap","",null,null],[0,"slice","","",null,null],[5,"push","libreal::heap::slice","Given a slice `xs` which is all but the last element already a heap, extend\nthe heap to include the last element.\n`f(x,y)` is whether `x` must be nearer to the root than `y`.\n`xs` being empty is an error.",null,null],[5,"pop","","Given a slice `xs` which is already a heap, move the root to the end of the\nslice and retract the heap to exclude it.\n`f(x,y)` is whether `x` must be nearer to the root than `y`.\n`xs` being empty is an error.",null,null],[5,"build","","Make `xs` a heap.\n`f(x,y)` is whether `x` must be nearer to the root than `y`.",null,null],[5,"sort","","Given a slice `xs` which is already a heap, sort the elements.",null,null],[5,"replace_root","","Given a slice `xs` which is already a heap, replace the root.\n`f(x,y)` is whether `x` must be nearer to the root than `y`.\n`xs` being empty is an error.",null,null],[5,"is_heap","","",null,null],[11,"new","libreal::heap","",0,{"inputs":[],"output":{"name":"self"}}],[11,"with_capacity","","",0,{"inputs":[{"name":"usize"}],"output":{"name":"option"}}],[11,"length","","",0,null],[11,"capacity","","",0,null],[11,"reserve","","",0,null],[11,"from_vec","","",0,{"inputs":[{"name":"vec"}],"output":{"name":"self"}}],[11,"push","","",0,null],[11,"pop","","",0,null],[11,"peek","","",0,null],[11,"push_pop","","Pops the root and inserts the given value.\n`xs` being empty is an error.",0,null],[11,"into_vec","","",0,null],[11,"into_sorted_vec","","",0,null],[0,"b_tree","libreal","",null,null],[3,"BTree","libreal::b_tree","A B-node has `m` key-value pairs, and `m+1` children if it is a stem, with the keys between\nthe children so each key is greater than all keys in its left subtree and less than all keys\nin its right subtree.\nA node other than the root has `b-1 ≤ m ≤ 2b-1`, where `b` is the branching parametre of the\ntree; the root may have fewer.",null,null],[11,"new","","Make a new tree.",1,{"inputs":[],"output":{"name":"option"}}],[11,"find","","Find value with given key `k`.\nReturn `None` if tree empty.",1,null],[11,"find_mut","","Find value with given key `k`.\nReturn `None` if tree empty.",1,null],[11,"min","","Find value with minimum key.\nReturn `None` if tree empty.",1,null],[11,"max","","Find value with maximum key.\nReturn `None` if tree empty.",1,null],[11,"min_mut","","Find value with minimum key.\nReturn `None` if tree empty.",1,null],[11,"max_mut","","Find value with maximum key.\nReturn `None` if tree empty.",1,null],[11,"insert_with","","Seek `k`; if not found, insert `f(None)` there; if found, modify the value there from `x` to `f(Some(x))`.",1,null],[11,"replace","","Insert `x` at `k` and return `Some(x)` if there was already a value `x` there.",1,null],[11,"delete","","Seek `k`; if found, delete it and value `x` there and return `Some((k, x))`.",1,null],[11,"fold_with_key","","Fold elements in order.",1,null],[11,"drop","","",1,null],[0,"rel","libreal","",null,null],[0,"ord","libreal::rel","",null,null],[3,"Dual","libreal::rel::ord","",null,null],[4,"Ord","","",null,null],[8,"TotalOrderRelation","","",null,null],[10,"cmp","","",2,{"inputs":[{"name":"a"},{"name":"a"}],"output":{"name":"ordering"}}],[11,"less","","",2,{"inputs":[{"name":"a"},{"name":"a"}],"output":{"name":"bool"}}],[11,"less_or_equal","","",2,{"inputs":[{"name":"a"},{"name":"a"}],"output":{"name":"bool"}}],[11,"cmp","","",3,{"inputs":[{"name":"a"},{"name":"a"}],"output":{"name":"ordering"}}],[11,"cmp","","",4,{"inputs":[{"name":"a"},{"name":"a"}],"output":{"name":"ordering"}}],[0,"vec","libreal","",null,null],[3,"Vec","libreal::vec","Growable array",null,null],[3,"IntoIter","","",null,null],[11,"new","","Make a new array.",5,{"inputs":[],"output":{"name":"vec"}}],[11,"with_capacity","","Make a new array with enough room to hold at least `cap` elements.",5,{"inputs":[{"name":"usize"}],"output":{"name":"option"}}],[11,"length","","Return number of elements in array.",5,null],[11,"capacity","","Return number of elements array can hold before reallocation.",5,null],[11,"reserve","","Make sure the array has enough room for at least `n_more` more elements, reallocating if need be.",5,null],[11,"relinquish","","Relinquish memory so capacity = length.",5,null],[11,"insert","","Insert element `x` at position `k`, shifting elements after `k` aftward one position to make room.",5,null],[11,"delete","","Delete element at position `k` and return it, shifting elements after `k` forward one position to fill the gap.",5,null],[11,"delete_swap_last","","Delete element at position `k` and move the last element into the gap.",5,null],[11,"push","","Push `x` onto aft end of array.",5,null],[11,"pop","","Pop last element off end of array.\nReturn `None` if array empty.",5,null],[11,"append","","Append `xs` to the array.",5,null],[11,"split_off","","Split off and return the segment of the array from `k` to the aft end, inclusive.",5,null],[11,"extend","","Add elements of `xs` to aft end of array.",5,null],[11,"from_iter","","Add elements of `xs` to aft end of array.",5,{"inputs":[{"name":"ts"}],"output":{"name":"result"}}],[11,"truncate","","Shorten array to `len` and drop elements beyond.",5,null],[11,"drop","","",5,null],[11,"default","","",5,{"inputs":[],"output":{"name":"vec"}}],[11,"eq","","",5,null],[11,"partial_cmp","","",5,null],[11,"cmp","","",5,null],[11,"index","","",5,null],[11,"index_mut","","",5,null],[11,"index","","",5,null],[11,"index_mut","","",5,null],[11,"index","","",5,null],[11,"index_mut","","",5,null],[11,"index","","",5,null],[11,"index_mut","","",5,null],[11,"index","","",5,null],[11,"index_mut","","",5,null],[11,"deref","","",5,null],[11,"deref_mut","","",5,null],[11,"hash","","",5,null],[11,"fmt","","",5,null],[11,"into_iter","","",5,null],[11,"drop","","",6,null],[11,"next","","",6,null],[11,"size_hint","","",6,null]],"paths":[[3,"Heap"],[3,"BTree"],[8,"TotalOrderRelation"],[4,"Ord"],[3,"Dual"],[3,"Vec"],[3,"IntoIter"]]};
initSearch(searchIndex);