var searchIndex = {};
searchIndex["concurrent_hash_map"] = {"doc":"","items":[[3,"ConcurrentHashMap","concurrent_hash_map","This is a simple concurrent hash map. It uses a design that's lock free on gets,\nand locking on inserts/removals. In order to maintain concurrency on insert/removal\noperations, the map is segmented into several sub-maps, each of which has its own\nwrite lock.",null,null],[11,"clone","","",0,null],[11,"new","","Creates a new HashMap with default options (segment count = 8, capacity = 16, load factor = 0.8)",0,{"inputs":[],"output":{"name":"concurrenthashmap"}}],[11,"new_with_options","","Creates a new HashMap.  There are three tuning options: capacity, segment count, and load factor.\nLoad factor and capacity are pretty much what you'd expect: load factor describes the level of table\nfull-ness of the table at which we grow to avoid excess collisions.  Capacity is simply initial capacity.",0,{"inputs":[{"name":"u32"},{"name":"u32"},{"name":"f32"}],"output":{"name":"concurrenthashmap"}}],[11,"insert","","Inserts a key-value pair into the map. If the key was already present, the previous\nvalue is returned.  Otherwise, None is returned.",0,null],[11,"get","","Gets a value from the map. If it's not present, None is returned.",0,null],[11,"remove","","Removes a key-value pair from the map. If the key was found, the value associated with\nit is returned. Otherwise, None is returned.",0,null],[11,"len","","Returns the size of the map. Note that this size is a best-effort approximation, as\nconcurrent activity may lead to an inaccurate count.",0,null]],"paths":[[3,"ConcurrentHashMap"]]};
initSearch(searchIndex);