Struct WeightedIndex
pub struct WeightedIndex<X: SampleUniform + PartialOrd> { /* private fields */ }
A distribution using weighted sampling of discrete items.
Sampling a WeightedIndex distribution returns the index of a randomly
selected element from the iterator used when the WeightedIndex was
created. The chance of a given element being picked is proportional to the
weight of the element. The weights can use any type X for which an
implementation of Uniform<X> exists. The implementation guarantees that
elements with zero weight are never picked, even when the weights are
floating point numbers.
Performance
Time complexity of sampling from WeightedIndex is O(log N) where
N is the number of weights.
See also rand_distr::weighted for alternative implementations supporting
potentially-faster sampling or a more easily modifiable tree structure.
A WeightedIndex<X> contains a Vec<X> and a Uniform<X> and so its
size is the sum of the size of those objects, possibly plus some alignment.
Creating a WeightedIndex<X> will allocate enough space to hold N - 1
weights of type X, where N is the number of weights. However, since
Vec doesn't guarantee a particular growth strategy, additional memory
might be allocated but not used. Since the WeightedIndex object also
contains an instance of X::Sampler, this might cause additional allocations,
though for primitive types, Uniform<X> doesn't allocate any memory.
Sampling from WeightedIndex will result in a single call to
Uniform<X>::sample (method of the Distribution trait), which typically
will request a single value from the underlying Rng, though the
exact number depends on the implementation of Uniform<X>::sample.
Example
use *;
use WeightedIndex;
let choices = ;
let weights = ;
let dist = new.unwrap;
let mut rng = rng;
for _ in 0..100
let items = ;
let dist2 = new.unwrap;
for _ in 0..100
Implementations
impl<X: SampleUniform + PartialOrd + Clone> WeightedIndex<X>
fn weight(&self, index: usize) -> Option<X> where X: for<'a> SubAssign<&'a X>,Returns the weight at the given index, if it exists.
If the index is out of bounds, this will return
None.Example
use WeightedIndex; let weights = ; let dist = new.unwrap; assert_eq!; assert_eq!; assert_eq!; assert_eq!;fn weights(&self) -> WeightedIndexIter<'_, X> where X: for<'a> SubAssign<&'a X>,Returns a lazy-loading iterator containing the current weights of this distribution.
If this distribution has not been updated since its creation, this will return the same weights as were passed to
new.Example
use WeightedIndex; let weights = ; let mut dist = new.unwrap; assert_eq!; dist.update_weights.unwrap; assert_eq!;fn total_weight(&self) -> XReturns the sum of all weights in this distribution.
impl<X: SampleUniform + PartialOrd> WeightedIndex<X>
fn new<I>(weights: I) -> Result<WeightedIndex<X>, Error> where I: IntoIterator, I::Item: SampleBorrow<X>, X: Weight,Creates a new a
WeightedIndexDistributionusing the values inweights. The weights can use any typeXfor which an implementation ofUniform<X>exists.Error cases:
Error::InvalidInputwhen the iteratorweightsis empty.Error::InvalidWeightwhen a weight is not-a-number or negative.Error::InsufficientNonZerowhen the sum of all weights is zero.Error::Overflowwhen the sum of all weights overflows.
fn update_weights(&mut self, new_weights: &[(usize, &X)]) -> Result<(), Error> where X: for<'a> AddAssign<&'a X> + for<'a> SubAssign<&'a X> + Clone + Default,Update a subset of weights, without changing the number of weights.
new_weightsmust be sorted by the index.Using this method instead of
newmight be more efficient if only a small number of weights is modified. No allocations are performed, unless the weight typeXuses allocation internally.In case of error,
selfis not modified. Error cases:Error::InvalidInputwhennew_weightsare not ordered by index or an index is too large.Error::InvalidWeightwhen a weight is not-a-number or negative.Error::InsufficientNonZerowhen the sum of all weights is zero. Note that due to floating-point loss of precision, this case is not always correctly detected; usage of a fixed-point weight type may be preferred.
Updates take
O(N)time. If you need to frequently update weights, considerrand_distr::weighted_treeas an alternative where an update isO(log N).
Trait Implementations
impl<'de, X> Deserialize<'de> for WeightedIndex<X>
where
X: Deserialize<'de> + SampleUniform + PartialOrd,
X::Sampler: Deserialize<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where __D: Deserializer<'de>,
impl<X> Distribution<usize> for WeightedIndex<X>
where
X: SampleUniform + PartialOrd,
fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> usize
impl<X> Serialize for WeightedIndex<X>
where
X: Serialize + SampleUniform + PartialOrd,
X::Sampler: Serialize,
fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where __S: Serializer,
impl<X: Clone + SampleUniform + PartialOrd> Clone for WeightedIndex<X>
where
X::Sampler: Clone,
fn clone(&self) -> WeightedIndex<X>
impl<X: Debug + SampleUniform + PartialOrd> Debug for WeightedIndex<X>
where
X::Sampler: Debug,
fn fmt(&self, f: &mut Formatter<'_>) -> Result
impl<X: PartialEq + SampleUniform + PartialOrd> PartialEq for WeightedIndex<X>
where
X::Sampler: PartialEq,
fn eq(&self, other: &WeightedIndex<X>) -> bool
impl<X: PartialEq + SampleUniform + PartialOrd> StructuralPartialEq for WeightedIndex<X>
where
X::Sampler: PartialEq,
Auto Trait Implementations
impl<X> Freeze for WeightedIndex<X>
where
Vec<X>: Freeze,
X: Freeze,
<X as SampleUniform>::Sampler: Freeze,
impl<X> RefUnwindSafe for WeightedIndex<X>
where
Vec<X>: RefUnwindSafe,
X: RefUnwindSafe,
<X as SampleUniform>::Sampler: RefUnwindSafe,
impl<X> Send for WeightedIndex<X>
where
Vec<X>: Send,
X: Send,
<X as SampleUniform>::Sampler: Send,
impl<X> Sync for WeightedIndex<X>
where
Vec<X>: Sync,
X: Sync,
<X as SampleUniform>::Sampler: Sync,
impl<X> Unpin for WeightedIndex<X>
where
Vec<X>: Unpin,
X: Unpin,
<X as SampleUniform>::Sampler: Unpin,
impl<X> UnsafeUnpin for WeightedIndex<X>
where
Vec<X>: UnsafeUnpin,
X: UnsafeUnpin,
<X as SampleUniform>::Sampler: UnsafeUnpin,
impl<X> UnwindSafe for WeightedIndex<X>
where
Vec<X>: UnwindSafe,
X: UnwindSafe,
<X as SampleUniform>::Sampler: UnwindSafe,
Blanket Implementations
impl<T> Any for WeightedIndex<X>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for WeightedIndex<X>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for WeightedIndex<X>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> CloneToUninit for WeightedIndex<X>
where
T: Clone,
unsafe fn clone_to_uninit(&self, dest: *mut u8)
impl<T> DeserializeOwned for WeightedIndex<X>
where
T: for<'de> Deserialize<'de>,
impl<T> From<T> for WeightedIndex<X>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> ToOwned for WeightedIndex<X>
where
T: Clone,
type Owned = T;fn to_owned(&self) -> Tfn clone_into(&self, target: &mut T)
impl<T, U> Into<U> for WeightedIndex<X>
where
U: From<T>,
fn into(self) -> UCalls
U::from(self).That is, this conversion is whatever the implementation of
[From]<T> for Uchooses to do.
impl<T, U> TryFrom<U> for WeightedIndex<X>
where
U: Into<T>,
type Error = Infallible;fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
impl<T, U> TryInto<U> for WeightedIndex<X>
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error;fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>