var searchIndex = {};
searchIndex["range_map"] = {"doc":"","items":[[3,"Range","range_map","A range of elements, including the endpoints.",null,null],[12,"start","","",0,null],[12,"end","","",0,null],[3,"RangeMap","","A set of characters. Optionally, each character in the set may be associated with some data.",null,null],[3,"PairIter","","",null,null],[3,"RangeSet","","A set of integers, implemented as a sorted list of (inclusive) ranges.",null,null],[3,"RangeIter","","",null,null],[3,"EltIter","","",null,null],[3,"RangeMultiMap","","A multi-valued mapping from primitive integers to other data.",null,null],[11,"cmp","","",0,null],[11,"partial_cmp","","",0,null],[11,"lt","","",0,null],[11,"le","","",0,null],[11,"gt","","",0,null],[11,"ge","","",0,null],[11,"eq","","",0,null],[11,"ne","","",0,null],[11,"hash","","",0,null],[11,"clone","","",0,null],[11,"fmt","","",0,null],[11,"new","","Creates a new range with the given start and endpoints (inclusive).",0,{"inputs":[{"name":"t"},{"name":"t"}],"output":{"name":"range"}}],[11,"full","","Creates a new range containing everything.",0,{"inputs":[],"output":{"name":"range"}}],[11,"single","","Creates a new range containing a single thing.",0,{"inputs":[{"name":"t"}],"output":{"name":"range"}}],[11,"contains","","Tests whether a given element belongs to this range.",0,null],[11,"intersects","","Checks whether the intersections overlap.",0,null],[11,"intersection","","Computes the intersection between two ranges. Returns none if the intersection is empty.",0,null],[11,"cover","","Returns the smallest range that covers `self` and `other`.",0,null],[11,"eq","","",0,null],[11,"partial_cmp","","",0,null],[11,"eq","","",1,null],[11,"ne","","",1,null],[11,"hash","","",1,null],[11,"clone","","",1,null],[11,"fmt","","",1,null],[11,"from_iter","","Builds a `RangeMap` from an iterator over pairs. If any ranges overlap, they must map to\nthe same value.",1,{"inputs":[{"name":"i"}],"output":{"name":"self"}}],[11,"new","","Creates a new empty `RangeMap`.",1,{"inputs":[],"output":{"name":"rangemap"}}],[11,"num_ranges","","Returns the number of mapped ranges.",1,null],[11,"is_empty","","Tests whether this map is empty.",1,null],[11,"is_full","","Tests whether this `CharMap` maps every value.",1,null],[11,"ranges_values","","Iterates over all the mapped ranges and values.",1,null],[11,"keys_values","","Iterates over all mappings.",1,null],[11,"get","","Finds the value that `x` maps to, if it exists.",1,null],[11,"intersection","","Returns those mappings whose keys belong to the given set.",1,null],[11,"num_keys","","Counts the number of mapped keys.",1,null],[11,"to_range_set","","Returns the set of mapped chars, forgetting what they are mapped to.",1,null],[11,"map_values","","Modifies the values in place.",1,null],[11,"retain_values","","Modifies this map to contain only those mappings with values `v` satisfying `f(v)`.",1,null],[11,"fmt","","",2,null],[11,"clone","","",2,null],[11,"next","","",2,null],[11,"eq","","",3,null],[11,"ne","","",3,null],[11,"hash","","",3,null],[11,"clone","","",3,null],[11,"eq","","",4,null],[11,"ne","","",4,null],[11,"hash","","",4,null],[11,"fmt","","",4,null],[11,"clone","","",4,null],[11,"next","","",4,null],[11,"fmt","","",5,null],[11,"clone","","",5,null],[11,"next","","",5,null],[11,"fmt","","",3,null],[11,"from_iter","","Builds a `RangeSet` from an iterator over `Range`s.",3,{"inputs":[{"name":"i"}],"output":{"name":"self"}}],[11,"new","","Creates a new empty `RangeSet`.",3,{"inputs":[],"output":{"name":"rangeset"}}],[11,"is_empty","","Tests if this set is empty.",3,null],[11,"is_full","","Tests whether this set contains every valid value of `T`.",3,null],[11,"num_ranges","","Returns the number of ranges used to represent this set.",3,null],[11,"num_elements","","Returns the number of elements in the set.",3,null],[11,"ranges","","Returns an iterator over all ranges in this set.",3,null],[11,"elements","","Returns an iterator over all elements in this set.",3,null],[11,"contains","","Checks if this set contains a value.",3,null],[11,"union","","Returns the union between `self` and `other`.",3,null],[11,"full","","Creates a set that contains every value of `T`.",3,{"inputs":[],"output":{"name":"rangeset"}}],[11,"single","","Creates a set containing a single element.",3,{"inputs":[{"name":"t"}],"output":{"name":"rangeset"}}],[11,"except","","Creates a set containing all elements except the given ones.",3,{"inputs":[{"name":"i"}],"output":{"name":"rangeset"}}],[11,"intersection","","Finds the intersection between this set and `other`.",3,null],[11,"negated","","Returns the set of all characters that are not in this set.",3,null],[11,"eq","","",6,null],[11,"ne","","",6,null],[11,"hash","","",6,null],[11,"clone","","",6,null],[11,"fmt","","",6,null],[11,"new","","Creates a new empty map.",6,{"inputs":[],"output":{"name":"rangemultimap"}}],[11,"num_ranges","","Returns the number of mapped ranges.",6,null],[11,"is_empty","","Checks if the map is empty.",6,null],[11,"insert","","Adds a new mapping from a range of characters to `value`.",6,null],[11,"from_vec","","Creates a map from a vector of pairs.",6,{"inputs":[{"name":"vec"}],"output":{"name":"rangemultimap"}}],[11,"intersection","","Returns a new `RangeMultiMap` containing only the mappings for keys that belong to the\ngiven set.",6,null],[11,"map_values","","",6,null],[11,"retain_values","","Modifies this map in place to only contain mappings whose values `v` satisfy `f(v)`.",6,null],[11,"into_vec","","Returns the underlying `Vec`.",6,null],[11,"ranges_values","","Iterates over all the mapped ranges and values.",6,null],[11,"group","","Makes the ranges sorted and non-overlapping. The data associated with each range will\nbe a sorted `Vec<T>` instead of a single `T`.",6,null]],"paths":[[3,"Range"],[3,"RangeMap"],[3,"PairIter"],[3,"RangeSet"],[3,"RangeIter"],[3,"EltIter"],[3,"RangeMultiMap"]]};
initSearch(searchIndex);