var searchIndex = {};
searchIndex["binomial_iter"] = {"doc":"This crate provides tools to iteratively compute the binomial coefficient.","items":[[3,"BinomialIter","binomial_iter","Provides methods to calculate the binomial coefficient for the next\nhigher/lower `n`/`k`.",null,null],[3,"IncNIter","","An iterator which wraps a `BinomialIter` and returns the result of it's\n`inc_n` method when `next` is called.",null,null],[3,"DecNIter","","An iterator which wraps a `BinomialIter` and returns the result of it's\n`dec_n` method when `next` is called.",null,null],[3,"IncKIter","","An iterator which wraps a `BinomialIter` and returns the result of it's\n`inc_k` method when `next` is called.",null,null],[3,"DecKIter","","An iterator which wraps a `BinomialIter` and returns the result of it's\n`dec_k` method when `next` is called.",null,null],[11,"eq","","",0,null],[11,"ne","","",0,null],[11,"clone","","",0,null],[11,"new","","Create a new `BinomialIter`. This will calculate the binomial\ncoefficient once using the recursive definition.",0,{"inputs":[{"name":"u32"},{"name":"u32"}],"output":{"name":"binomialiter"}}],[11,"n","","Access the current value of `n`.",0,null],[11,"k","","Access the current value of `k`.",0,null],[11,"binom","","Access the current value of `n` choose `k`.",0,null],[11,"inc_n","","Increase `n` by one and update the internal state accordingly.",0,null],[11,"dec_n","","Decrease `n` by one and update the internal state accordingly.",0,null],[11,"inc_k","","Increase `k` by one and update the internal state accordingly.",0,null],[11,"dec_k","","Decrease `k` by one and update the internal state accordingly.",0,null],[11,"iter_inc_n","","Returns an iterator which wraps this `BinomialIter`, returns the current\nvalue of `n` and `binom` on the first call to `next` and the result of\ncalling `inc_n` on the underlying `BinominalIter` for subsequent calls\nto next.",0,null],[11,"next","","",1,null],[11,"deref","","",1,null],[11,"deref_mut","","",1,null],[11,"iter_dec_n","","Returns an iterator which wraps this `BinomialIter`, returns the current\nvalue of `n` and `binom` on the first call to `next` and the result of\ncalling `dec_n` on the underlying `BinominalIter` for subsequent calls\nto next.",0,null],[11,"next","","",2,null],[11,"deref","","",2,null],[11,"deref_mut","","",2,null],[11,"iter_inc_k","","Returns an iterator which wraps this `BinomialIter`, returns the current\nvalue of `k` and `binom` on the first call to `next` and the result of\ncalling `inc_k` on the underlying `BinominalIter` for subsequent calls\nto next.",0,null],[11,"next","","",3,null],[11,"deref","","",3,null],[11,"deref_mut","","",3,null],[11,"iter_dec_k","","Returns an iterator which wraps this `BinomialIter`, returns the current\nvalue of `k` and `binom` on the first call to `next` and the result of\ncalling `dec_k` on the underlying `BinominalIter` for subsequent calls\nto next.",0,null],[11,"next","","",4,null],[11,"deref","","",4,null],[11,"deref_mut","","",4,null]],"paths":[[3,"BinomialIter"],[3,"IncNIter"],[3,"DecNIter"],[3,"IncKIter"],[3,"DecKIter"]]};
initSearch(searchIndex);