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

Author: AliAlimohammadi

Cargo.toml

@@ -1,15 +1,15 @@
 [package]
 name = "the_algorithms_rust"
-edition = "2021"
 version = "0.1.0"
+edition = "2021"
 authors = ["Anshul Malik <malikanshul29@gmail.com>"]
 
 [dependencies]
-num-bigint = { version = "0.4", optional = true }
-num-traits = { version = "0.2", optional = true }
-rand = "0.9"
 nalgebra = "0.34.0"
 ndarray = "0.17.2"
+num-bigint = { version = "0.4", optional = true }
+num-traits = { version = "0.2", optional = true }
+rand = "0.10"
 
 [dev-dependencies]
 quickcheck = "1.0"
@@ -20,10 +20,31 @@ default = ["big-math"]
 big-math = ["dep:num-bigint", "dep:num-traits"]
 
 [lints.clippy]
+cargo = "warn"
+nursery = "warn"
 pedantic = "warn"
 restriction = "warn"
-nursery = "warn"
-cargo = "warn"
+# cargo-lints:
+cargo_common_metadata = { level = "allow", priority = 1 }
+multiple_crate_versions = { level = "allow", priority = 1 }
+# complexity-lints:
+manual_div_ceil = { level = "allow", priority = 1 }
+precedence = { level = "allow", priority = 1 }
+# nursery-lints:
+branches_sharing_code = { level = "allow", priority = 1 }
+cognitive_complexity = { level = "allow", priority = 1 }
+derive_partial_eq_without_eq = { level = "allow", priority = 1 }
+empty_line_after_doc_comments = { level = "allow", priority = 1 }
+fallible_impl_from = { level = "allow", priority = 1 }
+imprecise_flops = { level = "allow", priority = 1 }
+missing_const_for_fn = { level = "allow", priority = 1 }
+nonstandard_macro_braces = { level = "allow", priority = 1 }
+option_if_let_else = { level = "allow", priority = 1 }
+suboptimal_flops = { level = "allow", priority = 1 }
+suspicious_operation_groupings = { level = "allow", priority = 1 }
+too_long_first_doc_paragraph = { level = "allow", priority = 1 }
+use_self = { level = "allow", priority = 1 }
+while_float = { level = "allow", priority = 1 }
 # pedantic-lints:
 cast_lossless = { level = "allow", priority = 1 }
 cast_possible_truncation = { level = "allow", priority = 1 }
@@ -35,10 +56,12 @@ doc_markdown = { level = "allow", priority = 1 }
 explicit_deref_methods = { level = "allow", priority = 1 }
 explicit_iter_loop = { level = "allow", priority = 1 }
 float_cmp = { level = "allow", priority = 1 }
+ignore_without_reason = { level = "allow", priority = 1 }
 implicit_clone = { level = "allow", priority = 1 }
 implicit_hasher = { level = "allow", priority = 1 }
 items_after_statements = { level = "allow", priority = 1 }
 iter_without_into_iter = { level = "allow", priority = 1 }
+large_stack_arrays = { level = "allow", priority = 1 }
 linkedlist = { level = "allow", priority = 1 }
 manual_assert = { level = "allow", priority = 1 }
 manual_let_else = { level = "allow", priority = 1 }
@@ -52,6 +75,7 @@ module_name_repetitions = { level = "allow", priority = 1 }
 must_use_candidate = { level = "allow", priority = 1 }
 needless_pass_by_value = { level = "allow", priority = 1 }
 redundant_closure_for_method_calls = { level = "allow", priority = 1 }
+ref_option = { level = "allow", priority = 1 }
 return_self_not_must_use = { level = "allow", priority = 1 }
 semicolon_if_nothing_returned = { level = "allow", priority = 1 }
 should_panic_without_expect = { level = "allow", priority = 1 }
@@ -61,20 +85,21 @@ stable_sort_primitive = { level = "allow", priority = 1 }
 too_many_lines = { level = "allow", priority = 1 }
 trivially_copy_pass_by_ref = { level = "allow", priority = 1 }
 unnecessary_box_returns = { level = "allow", priority = 1 }
+unnecessary_semicolon = { level = "allow", priority = 1 }
 unnested_or_patterns = { level = "allow", priority = 1 }
 unreadable_literal = { level = "allow", priority = 1 }
 unused_self = { level = "allow", priority = 1 }
 used_underscore_binding = { level = "allow", priority = 1 }
-ref_option = { level = "allow", priority = 1 }
-unnecessary_semicolon = { level = "allow", priority = 1 }
-ignore_without_reason = { level = "allow", priority = 1 }
-large_stack_arrays = { level = "allow", priority = 1 }
 # restriction-lints:
 absolute_paths = { level = "allow", priority = 1 }
+allow_attributes = { level = "allow", priority = 1 }
+allow_attributes_without_reason = { level = "allow", priority = 1 }
+arbitrary_source_item_ordering = { level = "allow", priority = 1 }
 arithmetic_side_effects = { level = "allow", priority = 1 }
 as_conversions = { level = "allow", priority = 1 }
 assertions_on_result_states = { level = "allow", priority = 1 }
 blanket_clippy_restriction_lints = { level = "allow", priority = 1 }
+cfg_not_test = { level = "allow", priority = 1 }
 clone_on_ref_ptr = { level = "allow", priority = 1 }
 dbg_macro = { level = "allow", priority = 1 }
 decimal_literal_representation = { level = "allow", priority = 1 }
@@ -84,6 +109,7 @@ else_if_without_else = { level = "allow", priority = 1 }
 exhaustive_enums = { level = "allow", priority = 1 }
 exhaustive_structs = { level = "allow", priority = 1 }
 expect_used = { level = "allow", priority = 1 }
+field_scoped_visibility_modifiers = { level = "allow", priority = 1 }
 float_arithmetic = { level = "allow", priority = 1 }
 float_cmp_const = { level = "allow", priority = 1 }
 if_then_some_else_none = { level = "allow", priority = 1 }
@@ -95,6 +121,7 @@ integer_division_remainder_used = { level = "allow", priority = 1 }
 iter_over_hash_type = { level = "allow", priority = 1 }
 little_endian_bytes = { level = "allow", priority = 1 }
 map_err_ignore = { level = "allow", priority = 1 }
+map_with_unused_argument_over_ranges = { level = "allow", priority = 1 }
 min_ident_chars = { level = "allow", priority = 1 }
 missing_assert_message = { level = "allow", priority = 1 }
 missing_asserts_for_indexing = { level = "allow", priority = 1 }
@@ -108,11 +135,14 @@ non_ascii_literal = { level = "allow", priority = 1 }
 panic = { level = "allow", priority = 1 }
 partial_pub_fields = { level = "allow", priority = 1 }
 pattern_type_mismatch = { level = "allow", priority = 1 }
+precedence_bits = { level = "allow", priority = 1 }
 print_stderr = { level = "allow", priority = 1 }
 print_stdout = { level = "allow", priority = 1 }
 pub_use = { level = "allow", priority = 1 }
 pub_with_shorthand = { level = "allow", priority = 1 }
 question_mark_used = { level = "allow", priority = 1 }
+redundant_test_prefix = { level = "allow", priority = 1 }
+renamed_function_params = { level = "allow", priority = 1 }
 same_name_method = { level = "allow", priority = 1 }
 semicolon_outside_block = { level = "allow", priority = 1 }
 separated_literal_suffix = { level = "allow", priority = 1 }
@@ -130,44 +160,15 @@ undocumented_unsafe_blocks = { level = "allow", priority = 1 }
 unnecessary_safety_comment = { level = "allow", priority = 1 }
 unreachable = { level = "allow", priority = 1 }
 unseparated_literal_suffix = { level = "allow", priority = 1 }
+unused_trait_names = { level = "allow", priority = 1 }
 unwrap_in_result = { level = "allow", priority = 1 }
 unwrap_used = { level = "allow", priority = 1 }
 use_debug = { level = "allow", priority = 1 }
-wildcard_enum_match_arm = { level = "allow", priority = 1 }
-renamed_function_params = { level = "allow", priority = 1 }
-allow_attributes_without_reason = { level = "allow", priority = 1 }
-allow_attributes = { level = "allow", priority = 1 }
-cfg_not_test = { level = "allow", priority = 1 }
-field_scoped_visibility_modifiers = { level = "allow", priority = 1 }
-unused_trait_names = { level = "allow", priority = 1 }
 used_underscore_items = { level = "allow", priority = 1 }
-arbitrary_source_item_ordering = { level = "allow", priority = 1 }
-map_with_unused_argument_over_ranges = { level = "allow", priority = 1 }
-precedence_bits = { level = "allow", priority = 1 }
-redundant_test_prefix = { level = "allow", priority = 1 }
-# nursery-lints:
-branches_sharing_code = { level = "allow", priority = 1 }
-cognitive_complexity = { level = "allow", priority = 1 }
-derive_partial_eq_without_eq = { level = "allow", priority = 1 }
-empty_line_after_doc_comments = { level = "allow", priority = 1 }
-fallible_impl_from = { level = "allow", priority = 1 }
-imprecise_flops = { level = "allow", priority = 1 }
-missing_const_for_fn = { level = "allow", priority = 1 }
-nonstandard_macro_braces = { level = "allow", priority = 1 }
-option_if_let_else = { level = "allow", priority = 1 }
-suboptimal_flops = { level = "allow", priority = 1 }
-suspicious_operation_groupings = { level = "allow", priority = 1 }
-use_self = { level = "allow", priority = 1 }
-while_float = { level = "allow", priority = 1 }
-too_long_first_doc_paragraph = { level = "allow", priority = 1 }
-# cargo-lints:
-cargo_common_metadata = { level = "allow", priority = 1 }
+wildcard_enum_match_arm = { level = "allow", priority = 1 }
 # style-lints:
 doc_lazy_continuation = { level = "allow", priority = 1 }
-needless_return = { level = "allow", priority = 1 }
 doc_overindented_list_items = { level = "allow", priority = 1 }
-needless_range_loop = { level = "allow", priority = 1 }
 doc_paragraphs_missing_punctuation = { level = "allow", priority = 1 }
-# complexity-lints
-precedence = { level = "allow", priority = 1 }
-manual_div_ceil = { level = "allow", priority = 1 }
+needless_range_loop = { level = "allow", priority = 1 }
+needless_return = { level = "allow", priority = 1 }

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};