style: include redundant_pub_crate (TheAlgorithms#753)

Cargo.toml

@@ -159,7 +159,6 @@ missing_const_for_fn = { level = "allow", priority = 1 }
 nonstandard_macro_braces = { level = "allow", priority = 1 }
 option_if_let_else = { level = "allow", priority = 1 }
 redundant_clone = { level = "allow", priority = 1 }
-redundant_pub_crate = { level = "allow", priority = 1 }
 suboptimal_flops = { level = "allow", priority = 1 }
 suspicious_operation_groupings = { level = "allow", priority = 1 }
 use_self = { level = "allow", priority = 1 }

src/general/permutations/mod.rs

@@ -11,7 +11,7 @@ mod tests {
     use quickcheck::{Arbitrary, Gen};
     use std::collections::HashMap;
 
-    pub(crate) fn assert_permutations(original: &[i32], permutations: &[Vec<i32>]) {
+    pub fn assert_permutations(original: &[i32], permutations: &[Vec<i32>]) {
         if original.is_empty() {
             assert_eq!(vec![vec![] as Vec<i32>], permutations);
             return;
@@ -23,7 +23,7 @@ mod tests {
         }
     }
 
-    pub(crate) fn assert_valid_permutation(original: &[i32], permuted: &[i32]) {
+    pub fn assert_valid_permutation(original: &[i32], permuted: &[i32]) {
         assert_eq!(original.len(), permuted.len());
         let mut indices = HashMap::with_capacity(original.len());
         for value in original {
@@ -78,7 +78,7 @@ mod tests {
     /// A Data Structure for testing permutations
     /// Holds a Vec<i32> with just a few items, so that it's not too long to compute permutations
     #[derive(Debug, Clone)]
-    pub(crate) struct NotTooBigVec {
+    pub struct NotTooBigVec {
         pub(crate) inner: Vec<i32>, // opaque type alias so that we can implement Arbitrary
     }