var searchIndex = {};
searchIndex["accumulator"] = {"doc":"An accumulator container based on an Lru cach (time and size controlled)\nThis container accumulate keys *until* a number of entries is reached.\nAfter this quaorum has been reached the container will continue to accept values for such keys\nthis allows users to test merge functions until they are happy they have a good value.\nOtherwise a hacker could pass a single bad value and break all quorums","items":[[3,"Accumulator","accumulator","Accumulator for various message types",null,null],[11,"with_capacity","","Construct an accumulator and pass size to accumulate unil",0,{"inputs":[{"name":"usize"},{"name":"usize"}],"output":{"name":"accumulator"}}],[11,"with_duration","","Construct an accumulator and pass duration to accumulate until",0,{"inputs":[{"name":"usize"},{"name":"duration"}],"output":{"name":"accumulator"}}],[11,"contains_key","","Check for existence of any key",0,null],[11,"is_quorum_reached","","Check if requested size is accumulated",0,null],[11,"add","","Add a key / value pair, returns key and vector of values if size reached\nif already reached then keep adding to this value (we cannot tell values are all valid)",0,null],[11,"get","","Retrieve a ky/value from the store",0,null],[11,"delete","","Remove an entry (all values for a key will be removed)",0,null],[11,"cache_size","","Return size of container",0,null],[11,"set_quorum_size","","Sets new size for quorum",0,null]],"paths":[[3,"Accumulator"]]};
initSearch(searchIndex);