chore(deps): update rand requirement from 0.9 to 0.10

Author: AliAlimohammadi

Cargo.toml

@@ -7,7 +7,7 @@ authors = ["Anshul Malik <[email protected]>"]
 [dependencies]
 num-bigint = { version = "0.4", optional = true }
 num-traits = { version = "0.2", optional = true }
-rand = "0.9"
+rand = "0.10"
 nalgebra = "0.34.0"
 ndarray = "0.17.2"
 

DIRECTORY.md

@@ -92,7 +92,7 @@
     * [RGB-HSV Conversion](https://github.com/TheAlgorithms/Rust/blob/master/src/conversions/rgb_hsv_conversion.rs)
     * [Roman Numerals](https://github.com/TheAlgorithms/Rust/blob/master/src/conversions/roman_numerals.rs)
     * [Speed](https://github.com/TheAlgorithms/Rust/blob/master/src/conversions/speed.rs)
-    * [Time Units](https://github.com/TheAlgorithms/Rust/blob/master/src/conversions/time_units.rs)
+    * [Time](https://github.com/TheAlgorithms/Rust/blob/master/src/conversions/time.rs)
     * [Temperature](https://github.com/TheAlgorithms/Rust/blob/master/src/conversions/temperature.rs)
     * [Volume](https://github.com/TheAlgorithms/Rust/blob/master/src/conversions/volume.rs)
     * [Weight](https://github.com/TheAlgorithms/Rust/blob/master/src/conversions/weight.rs)
@@ -179,8 +179,8 @@
     * [Ramer Douglas Peucker](https://github.com/TheAlgorithms/Rust/blob/master/src/geometry/ramer_douglas_peucker.rs)
     * [Segment](https://github.com/TheAlgorithms/Rust/blob/master/src/geometry/segment.rs)
   * Graph
-    * [Ant Colony Optimization](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/ant_colony_optimization.rs)
     * [A*](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/astar.rs)
+    * [Ant Colony Optimization](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/ant_colony_optimization.rs)
     * [Bellman-Ford](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/bellman_ford.rs)
     * [Bipartite Matching](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/bipartite_matching.rs)
     * [Breadth First Search](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/breadth_first_search.rs)
@@ -204,7 +204,7 @@
     * [Prim](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/prim.rs)
     * [Prufer Code](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/prufer_code.rs)
     * [Strongly Connected Components](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/strongly_connected_components.rs)
-    * [Tarjans Ssc](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/tarjans_ssc.rs)
+    * [Tarjans Strongly Connected Components](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/tarjans_ssc.rs)
     * [Topological Sort](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/topological_sort.rs)
     * [Two Satisfiability](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/two_satisfiability.rs)
   * Greedy
@@ -239,7 +239,7 @@
     * [Absolute](https://github.com/TheAlgorithms/Rust/blob/master/src/math/abs.rs)
     * [Aliquot Sum](https://github.com/TheAlgorithms/Rust/blob/master/src/math/aliquot_sum.rs)
     * [Amicable Numbers](https://github.com/TheAlgorithms/Rust/blob/master/src/math/amicable_numbers.rs)
-    * [Area Of Polygon](https://github.com/TheAlgorithms/Rust/blob/master/src/math/area_of_polygon.rs)
+    * [Area of Polygon](https://github.com/TheAlgorithms/Rust/blob/master/src/math/area_of_polygon.rs)
     * [Area Under Curve](https://github.com/TheAlgorithms/Rust/blob/master/src/math/area_under_curve.rs)
     * [Armstrong Number](https://github.com/TheAlgorithms/Rust/blob/master/src/math/armstrong_number.rs)
     * [Average](https://github.com/TheAlgorithms/Rust/blob/master/src/math/average.rs)
@@ -253,7 +253,7 @@
     * [Collatz Sequence](https://github.com/TheAlgorithms/Rust/blob/master/src/math/collatz_sequence.rs)
     * [Combinations](https://github.com/TheAlgorithms/Rust/blob/master/src/math/combinations.rs)
     * [Cross Entropy Loss](https://github.com/TheAlgorithms/Rust/blob/master/src/math/cross_entropy_loss.rs)
-    * [Decimal To Fraction](https://github.com/TheAlgorithms/Rust/blob/master/src/math/decimal_to_fraction.rs)
+    * [Decimal to Fraction](https://github.com/TheAlgorithms/Rust/blob/master/src/math/decimal_to_fraction.rs)
     * [Doomsday](https://github.com/TheAlgorithms/Rust/blob/master/src/math/doomsday.rs)
     * [Elliptic Curve](https://github.com/TheAlgorithms/Rust/blob/master/src/math/elliptic_curve.rs)
     * [Euclidean Distance](https://github.com/TheAlgorithms/Rust/blob/master/src/math/euclidean_distance.rs)
@@ -268,7 +268,7 @@
     * [Frizzy Number](https://github.com/TheAlgorithms/Rust/blob/master/src/math/frizzy_number.rs)
     * [Gaussian Elimination](https://github.com/TheAlgorithms/Rust/blob/master/src/math/gaussian_elimination.rs)
     * [Gaussian Error Linear Unit](https://github.com/TheAlgorithms/Rust/blob/master/src/math/gaussian_error_linear_unit.rs)
-    * [GCD Of N Numbers](https://github.com/TheAlgorithms/Rust/blob/master/src/math/gcd_of_n_numbers.rs)
+    * [GCD of N Numbers](https://github.com/TheAlgorithms/Rust/blob/master/src/math/gcd_of_n_numbers.rs)
     * [Geometric Series](https://github.com/TheAlgorithms/Rust/blob/master/src/math/geometric_series.rs)
     * [Greatest Common Divisor](https://github.com/TheAlgorithms/Rust/blob/master/src/math/greatest_common_divisor.rs)
     * [Huber Loss](https://github.com/TheAlgorithms/Rust/blob/master/src/math/huber_loss.rs)

src/ciphers/affine_cipher.rs

@@ -244,7 +244,7 @@ pub fn affine_decrypt(key: usize, message: &str) -> Result<String, String> {
 /// assert!(key >= 2);
 /// ```
 pub fn affine_generate_key() -> usize {
-    use rand::Rng;
+    use rand::RngExt;
     let mut rng = rand::rng();
     let symbols_len = SYMBOLS.len();
 

src/conversions/mod.rs

@@ -21,7 +21,7 @@ mod rgb_hsv_conversion;
 mod roman_numerals;
 mod speed;
 mod temperature;
-mod time_units;
+mod time;
 mod volume;
 mod weight;
 
@@ -50,6 +50,6 @@ pub use self::rgb_hsv_conversion::{hsv_to_rgb, rgb_to_hsv, ColorError, Hsv, Rgb}
 pub use self::roman_numerals::{int_to_roman, roman_to_int};
 pub use self::speed::{convert_speed, SpeedUnit};
 pub use self::temperature::{convert_temperature, TemperatureUnit};
-pub use self::time_units::convert_time;
+pub use self::time::convert_time;
 pub use self::volume::{convert_volume, VolumeUnit};
 pub use self::weight::{convert_weight, WeightUnit};

src/conversions/time_units.rs src/conversions/time.rssrc/conversions/time_units.rs renamed to src/conversions/time.rs

@@ -235,7 +235,7 @@ impl Iterator for VebTreeIter<'_> {
 #[cfg(test)]
 mod test {
     use super::VebTree;
-    use rand::{rngs::StdRng, Rng, SeedableRng};
+    use rand::{rngs::StdRng, RngExt, SeedableRng};
 
     fn test_veb_tree(size: u32, mut elements: Vec<u32>, exclude: Vec<u32>) {
         // Insert elements

src/data_structures/veb_tree.rs

@@ -10,7 +10,7 @@ use std::fmt::Debug;
 /// It is generic over:
 /// * Eval, which could be a float, or any other totally ordered type, so that we can rank solutions to our problem
 /// * Rng: a random number generator (could be thread rng, etc.)
-pub trait Chromosome<Rng: rand::Rng, Eval> {
+pub trait Chromosome<Rng: rand::RngExt, Eval> {
     /// Mutates this Chromosome, changing its genes
     fn mutate(&mut self, rng: &mut Rng);
 
@@ -22,7 +22,7 @@ pub trait Chromosome<Rng: rand::Rng, Eval> {
     fn fitness(&self) -> Eval;
 }
 
-pub trait SelectionStrategy<Rng: rand::Rng> {
+pub trait SelectionStrategy<Rng: rand::RngExt> {
     fn new(rng: Rng) -> Self;
 
     /// Selects a portion of the population for reproduction
@@ -37,10 +37,10 @@ pub trait SelectionStrategy<Rng: rand::Rng> {
 /// A roulette wheel selection strategy
 /// https://en.wikipedia.org/wiki/Fitness_proportionate_selection
 #[allow(dead_code)]
-pub struct RouletteWheel<Rng: rand::Rng> {
+pub struct RouletteWheel<Rng: rand::RngExt> {
     rng: Rng,
 }
-impl<Rng: rand::Rng> SelectionStrategy<Rng> for RouletteWheel<Rng> {
+impl<Rng: rand::RngExt> SelectionStrategy<Rng> for RouletteWheel<Rng> {
     fn new(rng: Rng) -> Self {
         Self { rng }
     }
@@ -86,10 +86,10 @@ impl<Rng: rand::Rng> SelectionStrategy<Rng> for RouletteWheel<Rng> {
 }
 
 #[allow(dead_code)]
-pub struct Tournament<const K: usize, Rng: rand::Rng> {
+pub struct Tournament<const K: usize, Rng: rand::RngExt> {
     rng: Rng,
 }
-impl<const K: usize, Rng: rand::Rng> SelectionStrategy<Rng> for Tournament<K, Rng> {
+impl<const K: usize, Rng: rand::RngExt> SelectionStrategy<Rng> for Tournament<K, Rng> {
     fn new(rng: Rng) -> Self {
         Self { rng }
     }
@@ -118,7 +118,7 @@ impl<const K: usize, Rng: rand::Rng> SelectionStrategy<Rng> for Tournament<K, Rn
 
 type Comparator<T> = Box<dyn FnMut(&T, &T) -> Ordering>;
 pub struct GeneticAlgorithm<
-    Rng: rand::Rng,
+    Rng: rand::RngExt,
     Eval: PartialOrd,
     C: Chromosome<Rng, Eval>,
     Selection: SelectionStrategy<Rng>,
@@ -140,7 +140,7 @@ pub struct GenericAlgorithmParams {
 }
 
 impl<
-        Rng: rand::Rng,
+        Rng: rand::RngExt,
         Eval: Into<f64> + PartialOrd + Debug,
         C: Chromosome<Rng, Eval> + Clone + Debug,
         Selection: SelectionStrategy<Rng>,
@@ -222,7 +222,7 @@ mod tests {
         Tournament,
     };
     use rand::rngs::ThreadRng;
-    use rand::{rng, Rng};
+    use rand::{rng, RngExt};
     use std::collections::HashMap;
     use std::fmt::{Debug, Formatter};
     use std::ops::RangeInclusive;

src/general/genetic.rs

@@ -14,7 +14,7 @@
 //! - [Ant Colony Optimization Algorithms](https://en.wikipedia.org/wiki/Ant_colony_optimization_algorithms)
 //! - [Travelling Salesman Problem](https://en.wikipedia.org/wiki/Travelling_salesman_problem)
 
-use rand::Rng;
+use rand::RngExt;
 use std::collections::HashSet;
 
 /// Represents a 2D city with coordinates

src/graph/ant_colony_optimization.rs

@@ -1,5 +1,5 @@
 use rand::seq::SliceRandom;
-use rand::Rng;
+use rand::RngExt;
 
 /// Train a single decision tree on a bootstrap sample with random feature subset
 #[allow(dead_code)]

src/machine_learning/random_forest.rs

@@ -10,7 +10,7 @@
 use std::rc::Rc;
 use std::time::{SystemTime, UNIX_EPOCH};
 
-use rand::Rng;
+use rand::RngExt;
 
 use super::{fast_power, PCG32};