var searchIndex = {};
searchIndex["hamt"] = {"doc":"","items":[[0,"rc","hamt","",null,null],[3,"HamtRc","hamt::rc","A persistent hash array mapped trie implementation using reference counting.",null,null],[3,"Iter","","A key value iterator that iterates in an unspecified order.",null,null],[3,"Keys","","Key iterator",null,null],[3,"Values","","Value iterator",null,null],[3,"HamtSetRc","","",null,null],[11,"fmt","","",0,null],[11,"clone","","",0,null],[11,"clone","","",1,null],[11,"clone","","",2,null],[11,"clone","","",3,null],[11,"next","","",2,null],[11,"next","","",3,null],[11,"eq","","",0,null],[11,"next","","",1,null],[11,"size_hint","","",1,null],[11,"from_iter","","",0,{"inputs":[{"name":"t"}],"output":{"name":"self"}}],[11,"from_iter","","",0,{"inputs":[{"name":"t"}],"output":{"name":"self"}}],[11,"index","","",0,null],[11,"new","","Creates an empty map.",0,{"inputs":[],"output":{"name":"self"}}],[11,"len","","Returns how many key value pairs are in the map.",0,null],[11,"is_empty","","Returns true if there are no key value pairs in the map, false otherwise.",0,null],[11,"iter","","Returns a key value iterator.",0,null],[11,"keys","","Returns an iterator that visits every key in an unspecified order.",0,null],[11,"values","","Returns an iterator that visits every value in an unspecified order.",0,null],[11,"get","","Returns a reference to the value corresponding to the given key, or None if there\nis no value associated with the key.",0,null],[11,"contains_key","","Returns true if the map contains the given key.",0,null],[11,"insert","","Returns a new map that includes the given key value pair, replacing the old value\nif the key was already in the map.",0,null],[11,"remove","","Returns a new map without an entry corresponding to the given key.",0,null],[11,"adjust","","Modifies the value tied to the given key with the function `f`. Otherwise, the map returned is identical.",0,null],[11,"update","","Updates the value at the given key using `f`. If `f` returns None, then the entry\nis removed.",0,null],[11,"alter","","Updates the value at the given key using `f` as in `Self::update`. If no value exists for\nthe given key, then `f` is passed `None`.",0,null],[11,"fmt","","",4,null],[11,"clone","","",4,null],[11,"eq","","",4,null],[11,"from_iter","","",4,{"inputs":[{"name":"t"}],"output":{"name":"self"}}],[11,"from_iter","","",4,{"inputs":[{"name":"t"}],"output":{"name":"self"}}],[11,"new","","Returns an empty set.",4,{"inputs":[],"output":{"name":"self"}}],[11,"len","","Returns how many items are in the set.",4,null],[11,"is_empty","","Returns true if the set is empty, false otherwise.",4,null],[11,"insert","","Inserts an item into the set.",4,null],[11,"contains","","Returns true if the set contains the given item, false otherwise.",4,null],[11,"remove","","Removes the given item from the set.",4,null],[11,"iter","","Iterates over each item in the set in an unspecified order.",4,null],[0,"arc","hamt","",null,null],[3,"HamtArc","hamt::arc","A persistent hash array mapped trie implementation using reference counting.",null,null],[3,"Iter","","A key value iterator that iterates in an unspecified order.",null,null],[3,"Keys","","Key iterator",null,null],[3,"Values","","Value iterator",null,null],[3,"HamtSetArc","","",null,null],[11,"fmt","","",5,null],[11,"clone","","",5,null],[11,"clone","","",6,null],[11,"clone","","",7,null],[11,"clone","","",8,null],[11,"next","","",7,null],[11,"next","","",8,null],[11,"eq","","",5,null],[11,"next","","",6,null],[11,"size_hint","","",6,null],[11,"from_iter","","",5,{"inputs":[{"name":"t"}],"output":{"name":"self"}}],[11,"from_iter","","",5,{"inputs":[{"name":"t"}],"output":{"name":"self"}}],[11,"index","","",5,null],[11,"new","","Creates an empty map.",5,{"inputs":[],"output":{"name":"self"}}],[11,"len","","Returns how many key value pairs are in the map.",5,null],[11,"is_empty","","Returns true if there are no key value pairs in the map, false otherwise.",5,null],[11,"iter","","Returns a key value iterator.",5,null],[11,"keys","","Returns an iterator that visits every key in an unspecified order.",5,null],[11,"values","","Returns an iterator that visits every value in an unspecified order.",5,null],[11,"get","","Returns a reference to the value corresponding to the given key, or None if there\nis no value associated with the key.",5,null],[11,"contains_key","","Returns true if the map contains the given key.",5,null],[11,"insert","","Returns a new map that includes the given key value pair, replacing the old value\nif the key was already in the map.",5,null],[11,"remove","","Returns a new map without an entry corresponding to the given key.",5,null],[11,"adjust","","Modifies the value tied to the given key with the function `f`. Otherwise, the map returned is identical.",5,null],[11,"update","","Updates the value at the given key using `f`. If `f` returns None, then the entry\nis removed.",5,null],[11,"alter","","Updates the value at the given key using `f` as in `Self::update`. If no value exists for\nthe given key, then `f` is passed `None`.",5,null],[11,"fmt","","",9,null],[11,"clone","","",9,null],[11,"eq","","",9,null],[11,"from_iter","","",9,{"inputs":[{"name":"t"}],"output":{"name":"self"}}],[11,"from_iter","","",9,{"inputs":[{"name":"t"}],"output":{"name":"self"}}],[11,"new","","Returns an empty set.",9,{"inputs":[],"output":{"name":"self"}}],[11,"len","","Returns how many items are in the set.",9,null],[11,"is_empty","","Returns true if the set is empty, false otherwise.",9,null],[11,"insert","","Inserts an item into the set.",9,null],[11,"contains","","Returns true if the set contains the given item, false otherwise.",9,null],[11,"remove","","Removes the given item from the set.",9,null],[11,"iter","","Iterates over each item in the set in an unspecified order.",9,null]],"paths":[[3,"HamtRc"],[3,"Iter"],[3,"Keys"],[3,"Values"],[3,"HamtSetRc"],[3,"HamtArc"],[3,"Iter"],[3,"Keys"],[3,"Values"],[3,"HamtSetArc"]]};
initSearch(searchIndex);