var searchIndex = {};
searchIndex["splay_tree"] = {"doc":"Splay tree based data structures","items":[[0,"map","splay_tree","A map based on a B-Tree.",null,null],[3,"SplayMap","splay_tree::map","A map based on a splay tree.",null,null],[3,"Iter","","An iterator over a SplayMap's entries.",null,null],[3,"IterMut","","A mutable iterator over a SplayMap's entries.",null,null],[3,"IntoIter","","An owning iterator over a SplayMap's entries.",null,null],[3,"Keys","","An iterator over a SplayMap's keys.",null,null],[3,"Values","","An iterator over a SplayMap's values.",null,null],[3,"ValuesMut","","A mutable iterator over a SplayMap's values.",null,null],[3,"OccupiedEntry","","An occupied Entry.",null,null],[3,"VacantEntry","","A vacant Entry.",null,null],[4,"Entry","","A view into a single entry in a map, which may either be vacant or occupied.",null,null],[13,"Occupied","","",0,null],[13,"Vacant","","",0,null],[11,"cmp","","",1,null],[11,"partial_cmp","","",1,null],[11,"lt","","",1,null],[11,"le","","",1,null],[11,"gt","","",1,null],[11,"ge","","",1,null],[11,"eq","","",1,null],[11,"ne","","",1,null],[11,"hash","","",1,null],[11,"clone","","",1,null],[11,"fmt","","",1,null],[11,"new","","Makes a new empty `SplayMap`.",1,{"inputs":[],"output":{"name":"self"}}],[11,"clear","","Clears the map, removing all values.",1,null],[11,"contains_key","","Returns true if the map contains a value for the specified key.",1,null],[11,"get","","Returns a reference to the value corresponding to the key.",1,null],[11,"get_mut","","Returns a mutable reference to the value corresponding to the key.",1,null],[11,"find_lower_bound_key","","Finds a minimum key which satisfies "greater than or equal to `key`" condition in the map.",1,null],[11,"find_upper_bound_key","","Finds a minimum key which satisfies "greater than `key`" condition in the map.",1,null],[11,"insert","","Inserts a key-value pair into the map.",1,null],[11,"remove","","Removes a key from the map,\nreturning the value at the key if the key was previously in the map.",1,null],[11,"entry","","Gets the given key's corresponding entry in the map for in-place manipulation.",1,null],[11,"len","","Returns the number of elements in the map.",1,null],[11,"is_empty","","Returns true if the map contains no elements.",1,null],[11,"iter","","Gets an iterator over the entries of the map, sorted by key.",1,null],[11,"iter_mut","","Gets a mutable iterator over the entries of the map, soretd by key.",1,null],[11,"keys","","Gets an iterator over the keys of the map, in sorted order.",1,null],[11,"values","","Gets an iterator over the values of the map, in order by key.",1,null],[11,"values_mut","","Gets a mutable iterator over the values of the map, in order by key.",1,null],[11,"default","","",1,{"inputs":[],"output":{"name":"self"}}],[11,"from_iter","","",1,{"inputs":[{"name":"i"}],"output":{"name":"self"}}],[11,"into_iter","","",1,null],[11,"extend","","",1,null],[11,"extend","","",1,null],[11,"next","","",2,null],[11,"next","","",3,null],[11,"next","","",4,null],[11,"next","","",5,null],[11,"next","","",6,null],[11,"next","","",7,null],[11,"key","","Returns a reference to this entry's key.",0,null],[11,"or_insert","","Ensures a value is in the entry by inserting the default if empty,\nand returns a mutable reference to the value in the entry.",0,null],[11,"or_insert_with","","Ensures a value is in the entry by inserting the result of the default function if empty,\nand returns a mutable reference to the value in the entry.",0,null],[11,"key","","Gets a reference to the key in the entry.",8,null],[11,"get","","Gets a reference to the value in the entry.",8,null],[11,"get_mut","","Gets a mutable reference to the value in the entry.",8,null],[11,"into_mut","","Converts the entry into a mutable reference to its value.",8,null],[11,"insert","","Sets the value of the entry with the OccupiedEntry's key,\nand returns the entry's old value.",8,null],[11,"remove","","Takes the value of the entry out of the map, and returns it.",8,null],[11,"key","","Gets a reference to the key that would be used\nwhen inserting a value through the VacantEntry.",9,null],[11,"insert","","Sets the value of the entry with the VacantEntry's key,\nand returns a mutable reference to it.",9,null],[0,"set","splay_tree","A set based on splay tree.",null,null],[3,"SplaySet","splay_tree::set","A set based on splay tree.",null,null],[3,"Iter","","An Iterator over a SplaySet items.",null,null],[3,"IntoIter","","An owning iterator over a SplaySet's items.",null,null],[3,"Difference","","A lazy iterator producing elements in the set difference (in-order).",null,null],[3,"SymmetricDifference","","A lazy iterator producing elements in the set symmetric difference (in-order).",null,null],[3,"Intersection","","A lazy iterator producing elements in the set intersection (in-order).",null,null],[3,"Union","","A lazy iterator producing elements in the set union (in-order).",null,null],[11,"cmp","","",10,null],[11,"partial_cmp","","",10,null],[11,"lt","","",10,null],[11,"le","","",10,null],[11,"gt","","",10,null],[11,"ge","","",10,null],[11,"eq","","",10,null],[11,"ne","","",10,null],[11,"hash","","",10,null],[11,"clone","","",10,null],[11,"fmt","","",10,null],[11,"new","","Makes a new SplaySet",10,{"inputs":[],"output":{"name":"self"}}],[11,"clear","","Clears the set, removing all values.",10,null],[11,"contains","","Returns true if the set contains a value.",10,null],[11,"get","","Returns a reference to the value in the set, if any, that is equal to the given value.",10,null],[11,"find_lower_bound","","Finds a minimum element which\nsatisfies "greater than or equal to `value`" condition in the set.",10,null],[11,"find_upper_bound","","Finds a minimum element which satisfies "greater than `value`" condition in the set.",10,null],[11,"insert","","Adds a value to the set.",10,null],[11,"replace","","Adds a value to the set, replacing the existing value, if any,\nthat is equal to the given one.\nReturns the replaced value.",10,null],[11,"remove","","Removes a value from the set. Returns `true` is the value was present in the set.",10,null],[11,"take","","Removes and returns the value in the set, if any, that is equal to the given one.",10,null],[11,"difference","","Visits the values representing the difference, in ascending order.",10,null],[11,"symmetric_difference","","Visits the values representing the symmetric difference, in ascending order.",10,null],[11,"intersection","","Visits the values representing the intersection, in ascending order.",10,null],[11,"union","","Visits the values representing the union, in ascending order.",10,null],[11,"is_disjoint","","Returns `true` if the set has no elements in common with `other`.\nThis is equivalent to checking for an empty intersection.",10,null],[11,"is_subset","","Returns `true` if the set is a subset of another.",10,null],[11,"is_superset","","Returns `true` if the set is a superset of another.",10,null],[11,"len","","Returns the number of elements in the set.",10,null],[11,"is_empty","","Returns true if the set contains no elements.",10,null],[11,"iter","","Gets an iterator over the SplaySet's contents, in sorted order.",10,null],[11,"default","","",10,{"inputs":[],"output":{"name":"self"}}],[11,"from_iter","","",10,{"inputs":[{"name":"i"}],"output":{"name":"self"}}],[11,"into_iter","","",10,null],[11,"extend","","",10,null],[11,"extend","","",10,null],[11,"next","","",11,null],[11,"next","","",12,null],[11,"next","","",13,null],[11,"next","","",14,null],[11,"next","","",15,null],[11,"next","","",16,null],[0,"heap","splay_tree","A priority queue implemented with a splay tree.",null,null],[3,"Iter","splay_tree::heap","`SplayHeap` iterator.",null,null],[3,"IntoIter","","An iterator that moves out of a `SplayHeap`.",null,null],[3,"SplayHeap","","A priority queue implemented with a splay tree.",null,null],[11,"next","","",17,null],[11,"next","","",18,null],[11,"clone","","",19,null],[11,"fmt","","",19,null],[11,"new","","Creates an empty `SplayHeap` as a max-heap.",19,{"inputs":[],"output":{"name":"self"}}],[11,"peek","","Returns the greatest item in the heap, or `None` if it is empty.",19,null],[11,"pop","","Removes the greatest item from the heap and returns it, or `None` if it is empty.",19,null],[11,"push","","Pushes an item onto the heap.",19,null],[11,"clear","","Drops all items from the heap.",19,null],[11,"iter","","Returns an iterator visiting all items in sorted (descending) order.",19,null],[11,"len","","Returns the length of the heap.",19,null],[11,"is_empty","","Checkes if the heap is empty.",19,null],[11,"default","","",19,{"inputs":[],"output":{"name":"self"}}],[11,"from_iter","","",19,{"inputs":[{"name":"i"}],"output":{"name":"self"}}],[11,"into_iter","","",19,null],[11,"extend","","",19,null],[11,"extend","","",19,null]],"paths":[[4,"Entry"],[3,"SplayMap"],[3,"Iter"],[3,"IterMut"],[3,"IntoIter"],[3,"Keys"],[3,"Values"],[3,"ValuesMut"],[3,"OccupiedEntry"],[3,"VacantEntry"],[3,"SplaySet"],[3,"Iter"],[3,"IntoIter"],[3,"Difference"],[3,"SymmetricDifference"],[3,"Intersection"],[3,"Union"],[3,"Iter"],[3,"IntoIter"],[3,"SplayHeap"]]};
initSearch(searchIndex);