var searchIndex = {};
searchIndex["monster"] = {"doc":"","items":[[0,"incubation","monster","This module includes new utilities\nwhich are being matured and tested for permanent inclusion.\nItems in this module should be considered unstable and thus\nmay change or get removed completely at any time.",null,null],[0,"swap_tuple","monster::incubation","",null,null],[8,"SwapTupleExt","monster::incubation::swap_tuple","",null,null],[16,"Result","","",0,null],[10,"swap","","Swap the two tuple elements",0,null],[0,"map_ref_mut","monster::incubation","",null,null],[5,"map_ref_mut","monster::incubation::map_ref_mut","Map the value of a mutable reference.\nUseful if you want to apply a `Fn(T) -> T` to a `&mut T`.\nThis function is unsafe because panicking in `f`\nwould leave the pointee uninitialized.",null,{"inputs":[{"name":"t"},{"name":"f"}],"output":null}],[8,"MapRefMutExt","","",null,null],[11,"map_ref_mut","","Map the value of a mutable reference.\nUseful if you want to apply a `Fn(T) -> T` to a `&mut T`.\nThis function is unsafe because panicking in `f`\nwould leave the pointee uninitialized.",1,null],[0,"zip_ends","monster::incubation","",null,null],[3,"ZipEnds","monster::incubation::zip_ends","An iterator adaptor to iterate over pairs of starting and ending elements.",null,null],[8,"ZipEndsIterExt","","",null,null],[16,"Iter","","",2,null],[10,"zip_ends","","Create a new `ZipEnds` adaptor.\nSee the structs' documentation for more.",2,null],[11,"next","","",3,null],[0,"fmt","monster::incubation","",null,null],[5,"format","monster::incubation::fmt","Format a string.\nThe format syntax is similar to the one used by `std::fmt`,\nbut very limited at the moment.",null,null],[5,"write_format","","Same as `format` but writes to a generic buffer instead.",null,null],[0,"error","","",null,null],[4,"Error","monster::incubation::fmt::error","",null,null],[13,"NotEnoughArgs","","",4,null],[13,"UnexpectedChar","","",4,null],[13,"UnexpectedRightBrace","","",4,null],[13,"Unkown","","",4,null],[6,"Result","","",null,null],[11,"hash","","",4,null],[11,"clone","","",4,null],[11,"eq","","",4,null],[11,"fmt","","",4,null],[11,"fmt","","",4,null],[11,"description","","",4,null],[11,"from","","",4,{"inputs":[{"name":"error"}],"output":{"name":"error"}}],[0,"some_if","monster::incubation","",null,null],[5,"some_if","monster::incubation::some_if","Returns `None` if `pred` is `false`, otherwise\nit returns `Some(result_of_calling_f)`.",null,{"inputs":[{"name":"bool"},{"name":"f"}],"output":{"name":"option"}}],[0,"tuple_indexing","monster::incubation","",null,null],[8,"TupleIndexingExt","monster::incubation::tuple_indexing","",null,null],[10,"get","","",5,null],[0,"tuple_iter","monster::incubation","",null,null],[3,"Iter","monster::incubation::tuple_iter","",null,null],[8,"TupleIterExt","","",null,null],[10,"iter","","",6,null],[11,"next","","",7,null],[11,"next","","",7,null],[11,"next","","",7,null],[11,"next","","",7,null],[11,"next","","",7,null],[11,"next","","",7,null],[11,"next","","",7,null],[11,"next","","",7,null],[11,"next","","",7,null],[11,"next","","",7,null],[0,"ref_eq","monster::incubation","",null,null],[8,"RefEq","monster::incubation::ref_eq","",null,null],[11,"ref_eq","","",8,null],[0,"global_init_cleanup","monster::incubation","",null,null],[3,"InitHandle","monster::incubation::global_init_cleanup","",null,null],[6,"GlobalInitHandle","","",null,null],[6,"LocalInitHandle","","",null,null],[8,"InitCleanup","","",null,null],[10,"init","","",9,{"inputs":[],"output":null}],[10,"cleanup","","",9,{"inputs":[],"output":null}],[11,"new_global","","",10,{"inputs":[],"output":{"name":"globalinithandle"}}],[11,"from_global","","",10,{"inputs":[{"name":"mutex"}],"output":{"name":"localinithandle"}}],[11,"drop","","",10,null],[0,"with_lock","monster::incubation","",null,null],[8,"WithLock","monster::incubation::with_lock","",null,null],[10,"with_lock","","Conveniently access mutexes.",11,null],[0,"find_and_take","monster::incubation","",null,null],[8,"FindAndTake","monster::incubation::find_and_take","",null,null],[16,"Item","","",12,null],[10,"find_and_take","","",12,null],[0,"slice_drop_last","monster::incubation","",null,null],[8,"SliceDropLast","monster::incubation::slice_drop_last","",null,null],[10,"drop_last","","Drop the last `n` elements from the slice.\nIf `n` is bigger than the slice's length\nan empty slice will be returned.",13,null],[14,"mutate!","monster","Temporarily rebind variables as mutable",null,null],[14,"anon!","","Create an anonymous struct.",null,null]],"paths":[[8,"SwapTupleExt"],[8,"MapRefMutExt"],[8,"ZipEndsIterExt"],[3,"ZipEnds"],[4,"Error"],[8,"TupleIndexingExt"],[8,"TupleIterExt"],[3,"Iter"],[8,"RefEq"],[8,"InitCleanup"],[3,"InitHandle"],[8,"WithLock"],[8,"FindAndTake"],[8,"SliceDropLast"]]};
initSearch(searchIndex);