95  |    /// Reads a block from the save media.  |  
96  |    #[allow(clippy::needless_range_loop)]  |  
97  |    fn read_sector(&self, word: usize) -> [u8; 8] {   |  
120  |    /// Writes a sector directly.  |  
121  |    #[allow(clippy::needless_range_loop)]  |  
122  |    fn write_sector_raw(  |  
357  |    /// Writes an entire buffer to the save media.  |  
358  |    #[allow(clippy::needless_range_loop)]  |  
359  |    fn write_buffer(&self, offset: usize, buf: &[u8], timeout: &mut Timeout) -> Result<(), Error> {   |  
371  |    /// Erases and writes an entire 128b sector on Atmel devices.  |  
372  |    #[allow(clippy::needless_range_loop)]  |  
373  |    fn write_atmel_sector_raw(  |  
32  |   #[allow(clippy::needless_range_loop)]  |  
33  |   fn do_test(  |  
392  |    // Ignore the lint for this loop as the range needs to be 0 to table_size  |  
393  |    #[allow(clippy::needless_range_loop)]  |  
394  |    for i in 0..table_size {  |  
207  |   impl WeightedAdjacencyMatrix {  |  
208  |    #[allow(clippy::needless_range_loop)]  |  
209  |    pub fn with_size(n: usize) -> Self {  |  
3  |   #[allow(clippy::needless_range_loop)]  |  
4  |   pub fn edit_distance(s1: &[u8], s2: &[u8]) -> u32 {  |  
21  |   impl TspSolver {  |  
22  |    #[allow(clippy::needless_range_loop)]  |  
23  |    pub fn solve(distance: &WeightedAdjacencyMatrix, start: usize) -> (f64, Vec<usize>) {  |  
4  |   #[allow(clippy::many_single_char_names)]  |  
5  |   #[allow(clippy::needless_range_loop)]  |  
6  |   pub fn mice_and_owls<S: MaxFlowSolver>(mice: &[Mouse], holes: &[Hole], radius: f64) -> i32 {  |  
62  |    #[allow(clippy::needless_range_loop)]  |  
63  |    for k in 0..params.num_limbs {  |  
62  |    #[allow(clippy::needless_range_loop)]  |  
63  |    for k in 0..params.num_limbs {  |  
289  |    /// Implements addition of the 'rhs' sequence of words to this number.  |  
290  |    #[allow(clippy::needless_range_loop)]  |  
291  |    fn inplace_add_slice(&mut self, rhs: &[u64]) {   |  
321  |    /// that shifts the divisor.  |  
322  |    #[allow(clippy::needless_range_loop)]  |  
323  |    fn inplace_sub_slice(&mut self, rhs: &[u64], bottom_zeros: usize) -> bool {  |  
323  |    // Iterate over fields  |  
324  |    #[allow(clippy::needless_range_loop)]  |  
325  |    for index in 0..column_count {  |  
23  |    #[allow(clippy::needless_range_loop)]  |  
24  |    fn inner_write_sample<S: hound::Sample>(  |  
62  |    // This lint is no good  |  
63  |    #[allow(clippy::needless_range_loop)]  |  
64  |    for i in 0..power_of_change_frames.len() {  |  
212  |    for sample in 0..num_samples {  |  
213  |    #[allow(clippy::needless_range_loop)]  |  
214  |    for channel in 0..num_channels {  |  
197  |    #[allow(clippy::needless_range_loop)]  |  
198  |    pub(crate) fn firmware_info_list(&mut self) -> Result<Vec<FirmwareInfo>, Box<dyn Error>> {  |  
1098  |    let dx = 255f64 / self.num_bins as f64;  |  
1099  |    #[allow(clippy::needless_range_loop)]  |  
1100  |    for i in start.max(1)..end.min(lut.points.len() - 1) {  |  
107  |    #[allow(clippy::needless_range_loop)]  |  
108  |    for i in 0..events.read {  |  
376  |    #[cfg_attr(feature = "cargo-clippy",  |  
377  |    allow(needless_range_loop))]  |  
378  |    for i in out_block..j+1 {  |  
188  |    let mut buf = [0u8; 100000];  |  
189  |    #[allow(clippy::needless_range_loop)]  |  
190  |    for index in 0..len {  |  
290  |    #[allow(clippy::needless_range_loop)]  |  
291  |    #[test]  |  
47  |   impl From<Capsule> for Mesh {  |  
48  |    #[allow(clippy::needless_range_loop)]  |  
49  |    fn from(capsule: Capsule) -> Self {  |  
39  |    let agents: Vec<&Actor> = player_query.iter().collect();  |  
40  |    #[allow(clippy::needless_range_loop)]  |  
41  |    for i in 0..agents.len() {  |  
527  |    #[inline]  |  
528  |    #[allow(clippy::needless_range_loop)]  |  
529  |    pub fn from_external(mut pages: Vec<Page<'p>>) -> Self {  |  
136  |    mapped_values[i] = ISO_3_MAP_COEFFICIENTS[i][last];  |  
137  |    #[allow(clippy::needless_range_loop)]  |  
138  |    for j in 0..last {  |  
17  |   impl<T: Copy + Default + Parse, const N: usize> Parse for [T; N] {  |  
18  |    #[allow(clippy::needless_range_loop)]  |  
19  |    fn parse(src: &str) -> ParseResult<Self> {  |  
161  |   #[inline]  |  
162  |   #[allow(clippy::needless_range_loop)] // The loop is not "needless" here!  |  
163  |   pub fn decode_delta(b: &[u8]) -> Result<(i32, &[u8]), DecodeError> {  |  
36  |    // Not sure if I can actually mutate like clippy is suggesting  |  
37  |    #[allow(clippy::needless_range_loop)]  |  
38  |    for i in 0..uv_ids.len() {  |  
119  |   #[allow(clippy::needless_range_loop)]  |  
120  |   #[cfg(test)]  |  
918  |   #[allow(clippy::needless_range_loop)]  |  
919  |   #[cfg(all(test, feature = "std"))]  |  
96  |    let nb_pos = slots.len();  |  
97  |    #[allow(clippy::needless_range_loop)]  |  
98  |    for slot_idx in 0..nb_pos {  |  
154  |   #[cfg(test)]  |  
155  |   #[allow(clippy::needless_range_loop)]  |  
156  |   mod tests {  |  
90  |   #[cfg(test)]  |  
91  |   #[allow(clippy::needless_range_loop)]  |  
92  |   mod tests {  |  
82  |    let n = self.count.min(N);  |  
83  |    #[allow(clippy::needless_range_loop)]  |  
84  |    for i in 0..n {  |  
57  |    // Ed and Henry prefer this idiom  |  
58  |    #[allow(clippy::needless_range_loop)]  |  
59  |    for i in 0..LOCKED_AMOUNTS_LENGTH - 1 {  |  
1124  |    }  |  
1125  |    #[allow(clippy::needless_range_loop)] // cleaner this way  |  
1126  |    for x in 0..val.len() {  |  
162  |    for x in &aggs {  |  
163  |    #[allow(clippy::needless_range_loop)]  |  
164  |    for i in 0..agg.len() {   |  
226  |    }  |  
227  |    #[allow(clippy::needless_range_loop)]  |  
228  |    for i in 0..agg.len() {  |  
277  |    // any terminal padding  |  
278  |    #[allow(clippy::needless_range_loop)]  |  
279  |    for i in (elts.len() + 1)..arity {  |  
474  |    #[allow(clippy::needless_range_loop)]  |  
475  |    #[cfg(any(feature = "cuda", feature = "opencl"))]  |  
276  |    #[inline(always)]  |  
277  |    #[allow(clippy::needless_range_loop)]  |  
278  |    fn call<B: StreamBackend<BlockSize = BS>>(self, backend: &mut B) {  |  
827  |    let mut nodes = empty_children();  |  
828  |    #[allow(clippy::needless_range_loop)]  |  
829  |    for i in 0..nodes.len() {  |  
11  |   impl Rc4 {  |  
12  |    #[allow(clippy::needless_range_loop)]  |  
13  |    pub fn new(key: &[u8]) -> Self {  |  
150  |    #[allow(clippy::needless_range_loop)]  |  
151  |    for j in (i + 1)..3 {   |  
333  |    let mut m = Matrix33::<T>::new([T::zero(); 9]);  |  
334  |    #[allow(clippy::needless_range_loop)]  |  
335  |    for i in 0..3 {  |  
34  |   if other.len() > self.len() {  |  
35  |   #[allow(clippy::needless_range_loop)]  |  
36  |   for i in self.len()..other.len() {  |  
135  |    for _ in 0..n {  |  
136  |    #[allow(clippy::needless_range_loop)]  |  
137  |    for col in 0..dst.ncols() {   |  
154  |    dst.aquire_row(n)?;  |  
155  |    #[allow(clippy::needless_range_loop)]  |  
156  |    for col in 0..dst.ncols() {  |  
191  |    fns.sort();  |  
192  |    #[allow(clippy::needless_range_loop)]  |  
193  |    for i in 0..5 {  |  
1819  |    let mut delay = 1500;  |  
1820  |    #[allow(clippy::needless_range_loop)]  |  
1821  |    for i in 0..2 {   |  
2217  |    let mut delay = 500;  |  
2218  |    #[allow(clippy::needless_range_loop)]  |  
2219  |    for i in 0..2 {  |  
1  |   #![allow(clippy::needless_range_loop)]   |  
192  |    /// Double the width (usefull for chuncky conversions)  |  
193  |    #[allow(clippy::needless_range_loop, clippy::identity_op)]  |  
194  |    pub fn double_horizontally(&mut self) {  |  
56  |    odd[0] = 0x82F63B78; /* CRC-32c polynomial */  |  
57  |    #[allow(clippy::needless_range_loop)]  |  
58  |    for n in 1..GF2_DIM {  |  
63  |    // Note that we have to capture `tree` by value to avoid borrow checker trouble.  |  
64  |    #[cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
65  |    for i in 0..usize::from(size + 1) {  |  
15  |   impl Scalar {  |  
16  |    #[allow(clippy::needless_range_loop)]  |  
17  |    pub(crate) fn slide(&self) -> [i8; 256] {  |  
68  |   // Code based on Keccak-compact64.c from ref implementation.  |  
69  |   #[allow(clippy::needless_range_loop)]  |  
70  |   fn keccak_f(state: &mut [u8; B]) {  |  
197  |    #[allow(clippy::needless_range_loop)]  |  
198  |    for i in 0..want {  |  
829  |    // Cleanup the CStrings we allocated so far and return -1  |  
830  |    #[allow(clippy::needless_range_loop)]  |  
831  |    for j in 0..i {  |  
101  |    #[allow(clippy::needless_range_loop)]  |  
102  |    for i in 0..sp {  |  
345  |    let low_26_bits = (1 << 26) - 1;  |  
346  |    #[allow(clippy::needless_range_loop)]  |  
347  |    for i in 0..5 {  |  
98  |    #[allow(clippy::needless_range_loop)]  |  
99  |    for i in 0..sp {  |  
427  |    let mut bytes = [0u8; 32];  |  
428  |    #[allow(clippy::needless_range_loop)]  |  
429  |    for i in 0..32 {   |  
1100  |    let digits_count = (256 + w - 1) / w;  |  
1101  |    #[allow(clippy::needless_range_loop)]  |  
1102  |    for i in 0..digits_count {  |  
273  |    #[allow(clippy::needless_range_loop)]  |  
274  |    for d in 1..f.len() {  |  
66  |    let mut mt: Vec<Vec<u8>> = vec![vec![0; Kprime + S]; H];  |  
67  |    #[allow(clippy::needless_range_loop)]  |  
68  |    for i in 0..H {  |  
69  |    #[allow(clippy::needless_range_loop)]  |  
70  |    for j in 0..=(Kprime + S - 2) {   |  
82  |    // We only create the last row of the GAMMA matrix, as all preceding rows are just a shift left  |  
83  |    #[allow(clippy::needless_range_loop)]  |  
84  |    for j in 0..(Kprime + S) {   |  
90  |    }  |  
91  |    #[allow(clippy::needless_range_loop)]  |  
92  |    for i in 0..H {   |  
111  |    }  |  
112  |    #[allow(clippy::needless_range_loop)]  |  
113  |    for j in 0..(Kprime + S) {  |  
223  |    let mut temp = vec![vec![0; DenseBinaryMatrix::bit_position(self.width).0 + 1]; rows];  |  
224  |    #[allow(clippy::needless_range_loop)]  |  
225  |    for row in 0..rows {  |  
1129  |    let mut result = Vec::with_capacity(self.L);  |  
1130  |    #[allow(clippy::needless_range_loop)]  |  
1131  |    for i in 0..self.L {  |  
90  |    let mut row_mapping = vec![0; height];  |  
91  |    #[allow(clippy::needless_range_loop)]  |  
92  |    for i in 0..height {   |  
94  |    }  |  
95  |    #[allow(clippy::needless_range_loop)]  |  
96  |    for i in 0..width {  |  
25  |    let mut res = [T::zero(); N];  |  
26  |    #[allow(clippy::needless_range_loop)]  |  
27  |    for i in 0..N {  |  
4  |   #[test]  |  
5  |   #[allow(clippy::too_many_lines, clippy::needless_range_loop)]  |  
6  |   fn bon_test() {  |  
109  |   /// ```  |  
110  |   #[allow(clippy::iter_count, clippy::needless_range_loop)]  |  
111  |   pub fn edit_distance(search_chars: &[char], known_term: &str) -> usize {  |  
16  |   #[allow(unused_must_use)]  |  
17  |   #[cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
18  |   fn main() {  |  
173  |    let mut e = Self::nonces(transcript.clone(), (R0_0, R1_0));  |  
174  |    #[allow(clippy::needless_range_loop)]  |  
175  |    for i in 0 .. (RING_LEN - 1) {   |  
189  |    let mut e = None;  |  
190  |    #[allow(clippy::needless_range_loop)]  |  
191  |    for i in 0 .. RING_LEN {  |  
61  |   /// sudoku clue.  |  
62  |   #[cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
63  |   fn rows_from_line(line: &str) -> Vec<Row> {  |  
136  |   #[allow(clippy::many_single_char_names)]  |  
137  |   #[allow(clippy::needless_range_loop)]  |  
138  |   impl fmt::Display for Ipv6Addr {  |  
239  |    let mut tx_unlockable_on = 0;  |  
240  |    #[allow(clippy::needless_range_loop)]  |  
241  |    for i in 0..self.inputs.len() {  |  
44  |    }  |  
45  |    #[allow(clippy::needless_range_loop)]  |  
46  |    for i in 0..delta {  |  
229  |    #[allow(clippy::needless_range_loop)]  |  
230  |    /// Evaluate all the lagrange polynomials defined by this domain at the  |  
144  |    #[allow(clippy::needless_range_loop)]  |  
145  |    for i in start.0..=end.0 {  |  
67  |    ) {  |  
68  |    #[allow(clippy::needless_range_loop)]  |  
69  |    for i in 0..layer.len() - if is_last { 0 } else { 1 } {  |  
739  |    #[allow(clippy::needless_range_loop)]  |  
740  |    for i in begin..end {  |  
95  |    // doesn't make sense here.  |  
96  |    #[allow(clippy::needless_range_loop)]  |  
97  |    for i in 0..N {  |  
156  |    /// Init_Init packets are ignored  |  
157  |    #[allow(clippy::needless_range_loop)]  |  
158  |    pub fn encode(&self, bytes: &mut [EOByte]) {  |  
20  |    for i1 in 0..l_len {  |  
21  |    #[allow(clippy::needless_range_loop)]  |  
22  |    for i2 in 0..r_len {  |  
66  |    let mut bytes = [0u8; 32];  |  
67  |    #[allow(clippy::needless_range_loop)]  |  
68  |    #[allow(clippy::unwrap_used)]  |  
462  |    };  |  
463  |    #[allow(clippy::needless_range_loop)]  |  
464  |    for i in column + 1..parent_column {  |  
894  |    let mut nodes = empty_children();  |  
895  |    #[allow(clippy::needless_range_loop)]  |  
896  |    for i in 0..nodes.len() {  |  
262  |    #[allow(clippy::needless_range_loop)]  |  
263  |    for d in 1..f.len() {  |  
66  |    // with the lower right 1 in GAMMA  |  
67  |    #[allow(clippy::needless_range_loop)]  |  
68  |    for i in 0..H {   |  
76  |    for j in (0..=(Kprime + S - 2)).rev() {  |  
77  |    #[allow(clippy::needless_range_loop)]  |  
78  |    for i in 0..H {   |  
89  |    // Copy G_HDPC into matrix  |  
90  |    #[allow(clippy::needless_range_loop)]  |  
91  |    for i in 0..H {  |  
92  |    #[allow(clippy::needless_range_loop)]  |  
93  |    for j in 0..(Kprime + S) {   |  
190  |    let mut mt: Vec<Vec<u8>> = vec![vec![0; Kprime + S]; H];  |  
191  |    #[allow(clippy::needless_range_loop)]  |  
192  |    for i in 0..H {  |  
1301  |    let mut result = Vec::with_capacity(self.L);  |  
1302  |    #[allow(clippy::needless_range_loop)]  |  
1303  |    for i in 0..self.L {  |  
107  |    let mut row_mapping = vec![0; height];  |  
108  |    #[allow(clippy::needless_range_loop)]  |  
109  |    for i in 0..height {   |  
111  |    }  |  
112  |    #[allow(clippy::needless_range_loop)]  |  
113  |    for i in 0..width {  |  
448  |   // I think this is useless at this point  |  
449  |   #[allow(clippy::needless_range_loop)]  |  
450  |   fn transpose(state: &mut [[u8; 4]; 4])  |  
31  |   let mut load = [0u8; 32];  |  
32  |   #[allow(clippy::needless_range_loop)]  |  
33  |   for i in 0..32 {  |  
86  |   #[allow(clippy::needless_range_loop)]  |  
87  |   for index in 0..size {  |  
396  |    type Item = (&'a [u8], [u8; 16]);  |  
397  |    #[allow(clippy::needless_range_loop)]  |  
398  |    fn next(&mut self) -> Option<Self::Item> {  |  
24  |    /// "highest" tier, i.e., the tier with the next lowest index.  |  
25  |    #[allow(clippy::needless_range_loop)]  |  
26  |    pub fn new_tiered_full_mesh(tier_sizes: &[usize]) -> Self {   |  
205  |    /// Simplified page rank (no dampening, fixed maximum number of runs, fixed epsilon)  |  
206  |    #[allow(clippy::needless_range_loop)]  |  
207  |    pub fn get_rank_scores(&self) -> Vec<RankScore> {  |  
294  |    let mut out = [LookupId::Empty; N];  |  
295  |    #[allow(clippy::needless_range_loop)]  |  
296  |    for i in 0..N {  |  
93  |    #[allow(clippy::needless_range_loop)]  |  
94  |    for i in s..e {  |  
774  |    #[cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
775  |    fn complete_binary_tree()  |  
25  |    let mut b: u32 = 1;  |  
26  |    #[allow(clippy::needless_range_loop)]  |  
27  |    for i in 0..len {  |  
271  |    // any terminal padding  |  
272  |    #[allow(clippy::needless_range_loop)]  |  
273  |    for i in (elts.len() + 1)..arity {  |  
654  |   #[cfg(test)]  |  
655  |   #[allow(clippy::pedantic, clippy::nursery, clippy::needless_range_loop)]  |  
656  |   mod tests {  |  
294  |   #[cfg(test)]  |  
295  |   #[allow(clippy::pedantic, clippy::nursery, clippy::needless_range_loop)]  |  
296  |   mod tests {  |  
7  |   /// Takes a u8 array of bytes and converts to hex dump  |  
8  |   #[allow(clippy::needless_range_loop)]  |  
9  |   pub fn bytes_to_hex_dump(record: &[u8]) -> String {  |  
7  |   /// Takes a u8 array of bytes and converts to hex dump  |  
8  |   #[allow(clippy::needless_range_loop)]  |  
9  |   pub fn bytes_to_hex_dump(record: &[u8]) -> String {  |  
202  |    #[allow(clippy::needless_range_loop)]  |  
203  |    /// Evaluate all the lagrange polynomials defined by this domain at the  |  
76  |    // NOTE: this clippy attribute can be removed once we can `collect` into `[usize; K]`.  |  
77  |    #[allow(clippy::needless_range_loop)]  |  
78  |    for (i, el) in this.elems.iter_mut().enumerate() {  |  
70  |    // NOTE: this clippy attribute can be removed once we can `collect` into `[usize; K]`.  |  
71  |    #[allow(clippy::needless_range_loop)]  |  
72  |    for (i, el) in this.elems.iter_mut().enumerate() {  |  
309  |    #[allow(clippy::needless_range_loop)]  |  
310  |    for i in 0..8 {  |  
7951  |    #[allow(clippy::needless_range_loop)]  |  
7952  |    fn modify_accounts(  |  
124  |    // elements of the Vec we would have mutable reference problems.  |  
125  |    #[allow(clippy::needless_range_loop)]  |  
126  |    for i in 0..config.length {  |  
57  |   /// iteration around the vertex.  |  
58  |   #[allow(clippy::needless_range_loop)] // Check has false positive here  |  
59  |   fn precompute_iteration_order<T, I, L>(data: &[T], is_identical: I, is_left: L) -> Vec<usize>  |  
702  |    #[allow(clippy::needless_range_loop)]  |  
703  |    fn mul_bits(a: &[i64], b: &[i64]) -> GF2Slow {  |  
63  |   impl event::EventHandler<ggez::GameError> for MainState {  |  
64  |    #[allow(clippy::needless_range_loop)]  |  
65  |    fn update(&mut self, ctx: &mut Context) -> GameResult {  |  
66  |   impl event::EventHandler<ggez::GameError> for MainState {  |  
67  |    #[allow(clippy::needless_range_loop)]  |  
68  |    fn update(  |  
23  |    #[allow(clippy::needless_range_loop)]  |  
24  |    for i in 0..8 {   |  
37  |   #[allow(clippy::needless_range_loop)]  |  
38  |   fn encrypt(msg: &mut [u8], key: Block, sbox: &SBox) {  |  
788  |    };  |  
789  |    #[allow(clippy::needless_range_loop)] // clippy does not understand this loop correctly  |  
790  |    for i in 0..n {  |  
14  |    #[allow(clippy::needless_range_loop)]  |  
15  |    for j in i + 1..sol.len() {  |  
2199  |    #[allow(clippy::needless_range_loop)]  |  
2200  |    for i in (0..min_len).rev() {  |  
257  |    #[allow(clippy::needless_range_loop)]  |  
258  |    fn verify_compatible_numbers(  |  
1176  |    let mut input = input;  |  
1177  |    #[allow(clippy::needless_range_loop)]  |  
1178  |    for i in 0..MAX_SEGMENTS {  |  
130  |    #[allow(clippy::needless_range_loop)]  |  
131  |    for i in 0..characters.len() {  |  
51  |    let mut mds = [[F::zero(); T]; T];  |  
52  |    #[allow(clippy::needless_range_loop)]  |  
53  |    for i in 0..T {   |  
111  |    // Verify that MDS * MDS^-1 = I.  |  
112  |    #[allow(clippy::needless_range_loop)]  |  
113  |    for i in 0..T {  |  
89  |    // Matrix multiplication  |  
90  |    #[allow(clippy::needless_range_loop)]  |  
91  |    for i in 0..T {  |  
65  |    #[allow(clippy::needless_range_loop)]  |  
66  |    for group in 0..GROUPS {  |  
44  |    pub fn from_parts(mut hashes: Hs, elems: Es, hasher: H) -> Self {  |  
45  |    #[allow(clippy::needless_range_loop)]  |  
46  |    for k in 0..hashes[..].len() { hashes[k] = 0; }  |  
18  |    let mut building: [V; SIZE] = mem::uninitialized();  |  
19  |    #[allow(clippy::needless_range_loop)]  |  
20  |    for i in 0..SIZE {  |  
32  |   #[cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
33  |   pub fn hexdump_8(data: &[u8]) -> String {   |  
66  |   #[cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
67  |   pub fn hexdump_16be(data: &[u16]) -> String {  |  
86  |    /// Create map from given string  |  
87  |    #[allow(clippy::needless_range_loop)]  |  
88  |    pub fn from_string(map_string: &str) -> Map<D> {  |  
4058  |    // do for each PermissionType  |  
4059  |    #[allow(clippy::needless_range_loop)]  |  
4060  |    for i in 0..num_perm_types {  |  
136  |    #[inline(always)]  |  
137  |    #[allow(clippy::needless_range_loop)]  |  
138  |    pub fn xor_in2out(&mut self, data: &GenericArray<u8, N>) {   |  
160  |    #[inline(always)]  |  
161  |    #[allow(clippy::needless_range_loop)]  |  
162  |    pub fn xor_in2out(&mut self, data: &GenericArray<GenericArray<u8, N>, M>) {  |  
245  |    #[inline(always)]  |  
246  |    #[allow(clippy::needless_range_loop)]  |  
247  |    pub fn xor_in2out(&mut self, data: &[u8]) {  |  
180  |    #[allow(clippy::needless_range_loop)]  |  
181  |    for i in 0..count {  |  
53  |    let len = min(buf.len(), self.buffer.len());  |  
54  |    #[allow(clippy::needless_range_loop)]  |  
55  |    for i in 0..len {  |  
58  |    for digest in hash_digests {  |  
59  |    #[allow(clippy::needless_range_loop)]  |  
60  |    for i in 0..64 {  |  
195  |   // intervening exclusives.  |  
196  |   #[allow(clippy::needless_range_loop)]  |  
197  |   pub fn rmw_dep<B: BV>(from: usize, to: usize, instrs: &[B], footprints: &HashMap<B, Footprint>) -> bool {   |  
218  |   /// first instruction before reaching the second.  |  
219  |   #[allow(clippy::needless_range_loop)]  |  
220  |   fn touched_by<B: BV>(   |  
307  |   /// See `addr_dep`  |  
308  |   #[allow(clippy::needless_range_loop)]  |  
309  |   pub fn ctrl_dep<B: BV>(from: usize, to: usize, instrs: &[B], footprints: &HashMap<B, Footprint>) -> bool {  |  
61  |   #[allow(clippy::needless_range_loop)]  |  
62  |   pub fn smt_i128(i: i128) -> Exp {   |  
80  |   #[allow(clippy::needless_range_loop)]  |  
81  |   fn smt_mask_lower(len: usize, mask_width: usize) -> Exp {  |  
119  |   #[allow(clippy::needless_range_loop)]  |  
120  |   pub fn bits64(bits: u64, size: u32) -> Exp {  |  
927  |    #[allow(clippy::needless_range_loop)]  |  
928  |    fn get_large_bv(&mut self, ast: Ast, size: u32) -> Result<Vec<bool>, ExecError> {  |  
97  |    /// Generates an optimized huffman table as described in Section K.2  |  
98  |    #[allow(clippy::needless_range_loop)]  |  
99  |    pub fn new_optimized(mut freq: [u32; 257]) -> HuffmanTable {  |  
93  |    #[allow(clippy::needless_range_loop)]  |  
94  |    for round in 0..12 {  |  
165  |    #[allow(clippy::needless_range_loop)]  |  
166  |    for i in 0..n - 1 {  |  
390  |    let mut res = [LookupTable::default(); 33];  |  
391  |    #[allow(clippy::needless_range_loop)]  |  
392  |    for i in 0..33 {  |  
1034  |    #[allow(clippy::needless_range_loop)]  |  
1035  |    pub fn transpose(x: KalkValue) -> Result<KalkValue, KalkError> {  |  
370  |    clippy::comparison_chain,  |  
371  |    clippy::needless_range_loop,  |  
372  |    clippy::needless_return  |  
139  |    #[allow(clippy::needless_range_loop)]  |  
140  |    fn get_align(&self, input: &str) -> Vec<i32> {  |  
57  |    #[allow(clippy::needless_range_loop)]  |  
58  |    for col in 0..table.headers.len() {  |  
95  |    // For each element in the result  |  
96  |    #[allow(clippy::needless_range_loop)]  |  
97  |    for i in 0..M {   |  
235  |    // For each element  |  
236  |    #[allow(clippy::needless_range_loop)]  |  
237  |    for row in 0..M {   |  
257  |    // For each element  |  
258  |    #[allow(clippy::needless_range_loop)]  |  
259  |    for row in 0..M {  |  
231  |   #[test]  |  
232  |   #[allow(clippy::needless_range_loop)]  |  
233  |   /// Test the properties of generators  |  
1133  |   /// In short, Karatsuba multiplication is never worthwhile for out use-case.  |  
1134  |   #[allow(clippy::needless_range_loop)]  |  
1135  |   pub fn long_mul<const SIZE: usize>(x: &[Limb], y: &[Limb]) -> Option<StackVec<SIZE>> {  |  
441  |    #[allow(clippy::wrong_self_convention)]  |  
442  |    #[allow(clippy::needless_range_loop)]  |  
443  |    fn is_interesting<EM, OT>(   |  
661  |    #[allow(clippy::wrong_self_convention)]  |  
662  |    #[allow(clippy::needless_range_loop)]  |  
663  |    #[allow(clippy::trivially_copy_pass_by_ref)]  |  
97  |   #[allow(clippy::needless_range_loop, clippy::too_many_arguments)]  |  
98  |   impl<'a, F: Float, K: 'a + Permutable<F>> SolverState<'a, F, K> {  |  
104  |   /// Best Segments. This value is also the value that is being returned.  |  
105  |   #[allow(clippy::needless_range_loop)]  |  
106  |   pub fn calculate(  |  
86  |   /// Sum of Worst Segments. This value is also the value that is being returned.  |  
87  |   #[allow(clippy::needless_range_loop)]  |  
88  |   pub fn calculate(  |  
244  |   #[allow(clippy::needless_range_loop)]  |  
245  |   for i in 0..5 {   |  
280  |   #[allow(clippy::needless_range_loop)]  |  
281  |   for i in 0..5 {  |  
122  |   #[allow(clippy::needless_range_loop)]  |  
123  |   for i in 0..4 {  |  
73  |    // Using a manual loop results in 2% less instructions.  |  
74  |    #[allow(clippy::needless_range_loop)]  |  
75  |    for i in 0..gates.len() {   |  
114  |    // Using a manual loop results in 2% less instructions.  |  
115  |    #[allow(clippy::needless_range_loop)]  |  
116  |    for i in 0..node.dependencies.len() {  |  
238  |    #[allow(clippy::needless_range_loop)]  |  
239  |    for i in 0..48 {  |  
198  |    #[allow(clippy::needless_range_loop)]  |  
199  |    for i in 0..64 {  |  
104  |    // different lengths  |  
105  |    #[allow(clippy::needless_range_loop)]  |  
106  |    fn fmt_row(  |  
48  |    #[allow(clippy::needless_range_loop)]  |  
49  |    for row in 0..self.image_height {  |  
147  |    #[allow(clippy::needless_range_loop)]  |  
148  |    #[test]  |  
368  |    // Sandwich, incremental literals.  |  
369  |    #[allow(clippy::needless_range_loop)]  |  
370  |    #[test]  |  
473  |    #[allow(clippy::needless_range_loop)]  |  
474  |    #[test]  |  
194  |   #[allow(arithmetic_overflow)]  |  
195  |   #[allow(clippy::needless_range_loop)]  |  
196  |   pub fn build_v_table(   |  
238  |   #[allow(arithmetic_overflow)]  |  
239  |   #[allow(clippy::needless_range_loop)]  |  
240  |   pub fn build_u_table(weights: &[u16], table: &mut [UEntry]) {  |  
223  |   #[allow(arithmetic_overflow)]  |  
224  |   #[allow(clippy::needless_range_loop)]  |  
225  |   #[inline(always)]  |  
113  |    #[allow(clippy::needless_range_loop)]  |  
114  |    pub fn store_v1(&self, dst: &mut [u8]) {  |  
107  |    #[allow(clippy::needless_range_loop)]  |  
108  |    #[test]  |  
111  |    #[allow(clippy::needless_range_loop)]  |  
112  |    #[test]  |  
51  |    #[allow(clippy::needless_range_loop)]  |  
52  |    #[test]  |  
17  |    /// Generate expanded version of S-box.  |  
18  |    #[allow(clippy::needless_range_loop)]  |  
19  |    fn gen_exp_sbox() -> ExpSbox {  |  
51  |    /// Create map from given string  |  
52  |    #[allow(clippy::needless_range_loop)]  |  
53  |    pub fn from_string(map_string: &str) -> MapBuffer {  |  
43  |    // needed because clippy suggests using an iterator which looks worse  |  
44  |    #[allow(clippy::needless_range_loop)]  |  
45  |    fn read_array<const COUNT: usize>(&self, offset: u32) -> [u8; COUNT] {   |  
54  |    // needed because clippy suggests using an iterator which looks worse  |  
55  |    #[allow(clippy::needless_range_loop)]  |  
56  |    fn read_vec(&self, offset: u32, size: u32) -> Vec<u8> {  |  
238  |   /// SuperSet. It only tests combinations that include `extra`.  |  
239  |   #[allow(clippy::needless_range_loop)]  |  
240  |   fn contains_superset(hand: &[usize], extra: usize) -> bool {  |  
254  |   /// ```  |  
255  |   #[allow(clippy::needless_range_loop)]  |  
256  |   pub fn transpose_single_display_data(data: &SingleDisplayData) -> SingleDisplayData {  |  
208  |    #[allow(clippy::needless_range_loop)]  |  
209  |    for row in 0..ROW {  |  
218  |    #[allow(clippy::needless_range_loop)]  |  
219  |    for row in 0..ROW {  |  
232  |    #[allow(clippy::needless_range_loop)]  |  
233  |    for row in 0..ROW {  |  
15  |    #[allow(clippy::needless_range_loop)]  |  
16  |    for i in 0..N {  |  
15  |    #[allow(clippy::needless_range_loop)]  |  
16  |    for row in 0..ROW {  |  
90  |    #[cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
91  |    for j in i + 1..max_size {  |  
59  |    _ => {  |  
60  |    #[allow(clippy::needless_range_loop)] // clippy bug  |  
61  |    for n in 0..D {  |  
114  |   #[test]  |  
115  |   #[allow(clippy::needless_range_loop)]  |  
116  |   fn test_u256_mod_neg() {  |  
603  |    #[allow(clippy::needless_range_loop)]  |  
604  |    for i in 0..HASH_CYCLE_LEN - 1 {  |  
159  |    // enforces constraint on the ith element in the stack in the next trace.  |  
160  |    #[allow(clippy::needless_range_loop)]  |  
161  |    for i in 1..NUM_GENERAL_CONSTRAINTS - 2 {  |  
204  |   /// ZERO.  |  
205  |   #[allow(clippy::needless_range_loop)]  |  
206  |   pub fn enforce_swapwx_constraints<E: FieldElement>(   |  
280  |   /// element is 0.  |  
281  |   #[allow(clippy::needless_range_loop)]  |  
282  |   pub fn enforce_cswapx_constraints<E: FieldElement>(  |  
20  |   #[test]  |  
21  |   #[allow(clippy::needless_range_loop)]  |  
22  |   fn decoder_p1_span_with_respan() {   |  
64  |   #[test]  |  
65  |   #[allow(clippy::needless_range_loop)]  |  
66  |   fn decoder_p1_join() {   |  
124  |   #[test]  |  
125  |   #[allow(clippy::needless_range_loop)]  |  
126  |   fn decoder_p1_split() {   |  
171  |   #[test]  |  
172  |   #[allow(clippy::needless_range_loop)]  |  
173  |   fn decoder_p1_loop_with_repeat() {   |  
288  |   #[test]  |  
289  |   #[allow(clippy::needless_range_loop)]  |  
290  |   fn decoder_p2_span_with_respan() {  |  
19  |   #[test]  |  
20  |   #[allow(clippy::needless_range_loop)]  |  
21  |   fn b_aux_trace_bitwise() {  |  
38  |   #[test]  |  
39  |   #[allow(clippy::needless_range_loop)]  |  
40  |   pub fn b_chip_span() {   |  
109  |   #[test]  |  
110  |   #[allow(clippy::needless_range_loop)]  |  
111  |   pub fn b_chip_span_with_respan() {   |  
213  |   #[test]  |  
214  |   #[allow(clippy::needless_range_loop)]  |  
215  |   pub fn b_chip_merge() {   |  
328  |   #[test]  |  
329  |   #[allow(clippy::needless_range_loop)]  |  
330  |   pub fn b_chip_permutation() {  |  
60  |   // Write the BETWEEN array to the specified file.  |  
61  |   #[allow(clippy::needless_range_loop)]  |  
62  |   pub fn write_between(f: &mut File) {  |  
68  |   // Write the KING_MOVES array to the specified file.  |  
69  |   #[allow(clippy::needless_range_loop)]  |  
70  |   pub fn write_king_moves(f: &mut File) {  |  
30  |   // Write the KNIGHT_MOVES array to the specified file.  |  
31  |   #[allow(clippy::needless_range_loop)]  |  
32  |   pub fn write_knight_moves(f: &mut File) {  |  
49  |   // Write the LINE array to the specified file.  |  
50  |   #[allow(clippy::needless_range_loop)]  |  
51  |   pub fn write_lines(f: &mut File) {  |  
137  |   // Write the MAGIC_NUMBERS and MOVES arrays to the specified file.  |  
138  |   #[allow(clippy::needless_range_loop)]  |  
139  |   pub fn write_magic(f: &mut File) {  |  
88  |   // Write the PAWN_MOVES array to the specified file.  |  
89  |   #[allow(clippy::needless_range_loop)]  |  
90  |   pub fn write_pawn_moves(f: &mut File) {   |  
103  |   // Write the PAWN_ATTACKS array to the specified file.  |  
104  |   #[allow(clippy::needless_range_loop)]  |  
105  |   pub fn write_pawn_attacks(f: &mut File) {  |  
57  |   // Write the FILES array to the specified file.  |  
58  |   #[allow(clippy::needless_range_loop)]  |  
59  |   pub fn write_bitboard_data(f: &mut File) {  |  
54  |   // Write the RAYS array to the specified file.  |  
55  |   #[allow(clippy::needless_range_loop)]  |  
56  |   pub fn write_rays(f: &mut File) {  |  
115  |    let n = read_nonzero(reader, buf, patch)?;  |  
116  |    #[allow(clippy::needless_range_loop)]  |  
117  |    for i in 0..n {  |  
65  |    #[allow(clippy::needless_range_loop)]  |  
66  |    for x in 0..5 {  |  
48  |    // replace the trailing zeros filled in above with padding  |  
49  |    #[allow(clippy::needless_range_loop)]  |  
50  |    for idx in data_len + 1..output_len {  |  
1175  |   /// Parses math functions, returning the evaluated value.  |  
1176  |   #[allow(clippy::needless_range_loop)]  |  
1177  |   fn expr_math_func(interp: &mut Interp, info: &mut ExprInfo, func_name: &str) -> DatumResult {  |  
1175  |   /// Parses math functions, returning the evaluated value.  |  
1176  |   #[allow(clippy::needless_range_loop)]  |  
1177  |   fn expr_math_func(interp: &mut Interp, info: &mut ExprInfo, func_name: &str) -> DatumResult {  |  
221  |    .expect("Unable to unwrap array");  |  
222  |    #[allow(clippy::needless_range_loop)]  |  
223  |    for i in 0..len {   |  
239  |    .expect("Unable to unwrap array");  |  
240  |    #[allow(clippy::needless_range_loop)]  |  
241  |    for i in 0..len {   |  
252  |    .expect("Unable to unwrap array");  |  
253  |    #[allow(clippy::needless_range_loop)]  |  
254  |    for i in 0..len {   |  
265  |    .expect("Unable to unwrap array");  |  
266  |    #[allow(clippy::needless_range_loop)]  |  
267  |    for i in 0..len {   |  
277  |    .expect("Unable to unwrap array");  |  
278  |    #[allow(clippy::needless_range_loop)]  |  
279  |    for i in 0..len {  |  
329  |    let mut queries: Vec<Document> = Vec::new();  |  
330  |    #[allow(clippy::needless_range_loop)]  |  
331  |    for i in 0..keys.len() {  |  
332  |    let mut query = query_doc.clone();  |  
333  |    #[allow(clippy::needless_range_loop)]  |  
334  |    for j in 0..i {  |  
255  |    /// for the deltas associated with this region.  |  
256  |    #[allow(clippy::needless_range_loop)]  |  
257  |    fn compute_scalar(&self, coords: &[i16]) -> Fixed {  |  
853  |    #[allow(clippy::needless_range_loop)]  |  
854  |    for i in 4..4 + MAX_NAME_LENGTH {   |  
861  |    #[allow(clippy::needless_range_loop)]  |  
862  |    for i in 8 + MAX_NAME_LENGTH..8 + MAX_NAME_LENGTH + MAX_URI_LENGTH {  |  
227  |    #[allow(clippy::needless_range_loop)]  |  
228  |    for i in 0..allocations.len() {  |  
41  |    // a[31] <= 127  |  
42  |    #[allow(clippy::needless_range_loop)]  |  
43  |    pub fn ge_scalar_mult_base(&mut self, a: [u8; 32]) {  |  
33  |   #[allow(clippy::needless_range_loop)]  |  
34  |   pub fn main() {  |  
28  |   #[cfg(not(tarpaulin_include))]  |  
29  |   #[allow(clippy::needless_range_loop)] // Ignoring this, as it is a false positive  |  
30  |   fn main() -> Result<(), anyhow::Error> {  |  
435  |    #[allow(clippy::needless_range_loop)]  |  
436  |    for index in 0..size {  |  
31  |    let mut conv = F::zero();  |  
32  |    #[allow(clippy::needless_range_loop)]  |  
33  |    for k in 0..3 {  |  
154  |   #[allow(clippy::needless_range_loop)]  |  
155  |   pub fn transpose<F: PrimeField>(matrix: &Matrix<F>) -> Matrix<F> {   |  
168  |   #[allow(clippy::needless_range_loop)]  |  
169  |   pub fn make_identity<F: PrimeField>(size: usize) -> Matrix<F> {  |  
161  |    let mut offset = 0;  |  
162  |    #[allow(clippy::needless_range_loop)]  |  
163  |    for m in (n + 1)..num_levels {  |  
130  |    // Now enforce that the limbs are all equal to the constants  |  
131  |    #[allow(clippy::needless_range_loop)]  |  
132  |    for i in 0..n_limbs {  |  
202  |    #[allow(clippy::needless_range_loop)]  |  
203  |    fn sort(&self, pop: Vec<Candidate<S>>) -> Vec<Candidate<S>> {  |  
559  |    {  |  
560  |    #[allow(clippy::needless_range_loop)]  |  
561  |    for span_idx in spans_idx..spans.len() {  |  
157  |    // to differentiate 0-indexed (usize) from 1-indexed (newtypes).  |  
158  |    #[allow(clippy::needless_range_loop)]  |  
159  |    for doses_per_stew in 1..=MAX_DOSES {  |  
605  |    // Output content.  |  
606  |    #[allow(clippy::needless_range_loop)]  |  
607  |    for y in 0..FLDSIZE_Y {  |  
96  |    #[allow(clippy::needless_range_loop)]  |  
97  |    for i in 0..(len - 1) {  |  
367  |    // Loop through layers  |  
368  |    #[allow(clippy::needless_range_loop)]  |  
369  |    for layer in 0..2 {   |  
486  |    #[allow(clippy::needless_range_loop)]  |  
487  |    for y in 0..192 {  |  
202  |    #[allow(clippy::needless_range_loop)]  |  
203  |    /// Evaluate all the lagrange polynomials defined by this domain at the  |  
664  |    #[allow(clippy::needless_range_loop)]  |  
665  |    for pi in 0..productions.len() {  |  
8  |   #[allow(clippy::type_complexity, clippy::needless_range_loop)]  |  
9  |   /// \[Generic\] [Floyd–Warshall algorithm](https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm) is an algorithm for all pairs shortest path problem  |  
207  |    #[allow(clippy::needless_range_loop)]  |  
208  |    /// Evaluate all the lagrange polynomials defined by this domain at the  |  
126  |    let mut flags = [0; 4];  |  
127  |    #[allow(clippy::needless_range_loop)]  |  
128  |    for flag_id in 0..4 {  |  
97  |    /// ```  |  
98  |    #[allow(clippy::needless_range_loop)]  |  
99  |    pub fn from_reader(  |  
400  |    let bytes = s.as_bytes();  |  
401  |    #[allow(clippy::needless_range_loop)]  |  
402  |    for i in 1..bytes.len() {  |  
394  |    #[allow(clippy::needless_range_loop)]  |  
395  |    for i in 0..len {  |  
123  |    let mut col_width = vec![0usize; colnum];  |  
124  |    #[allow(clippy::needless_range_loop)]  |  
125  |    for i in 0..colnum {  |  
123  |    let mut col_width = vec![0usize; colnum];  |  
124  |    #[allow(clippy::needless_range_loop)]  |  
125  |    for i in 0..colnum {  |  
223  |    // set g_i = f_i - 1  |  
224  |    #[allow(clippy::needless_range_loop)]  |  
225  |    for i in 0..dimension {  |  
50  |    #[allow(clippy::needless_range_loop)]  |  
51  |    for i in 0..size {   |  
199  |    // every odd element is set to 0.  |  
200  |    #[allow(clippy::needless_range_loop)]  |  
201  |    for i in 0..len {  |  
218  |    /// * `joint_rand` is the randomness shared by the prover and verifier.  |  
219  |    #[allow(clippy::needless_range_loop)]  |  
220  |    fn prove(   |  
469  |    /// Returns true if the verifier message indicates that the input from which it was generated is valid.  |  
470  |    #[allow(clippy::needless_range_loop)]  |  
471  |    fn decide(&self, verifier: &[Self::Field]) -> Result<bool, FlpError> {   |  
583  |    #[allow(clippy::needless_range_loop)]  |  
584  |    for wire in 0..f_vals.len() {   |  
598  |    fn call(&mut self, inp: &[F]) -> Result<F, FlpError> {  |  
599  |    #[allow(clippy::needless_range_loop)]  |  
600  |    for wire in 0..inp.len() {   |  
689  |    fn call(&mut self, inp: &[F]) -> Result<F, FlpError> {  |  
690  |    #[allow(clippy::needless_range_loop)]  |  
691  |    for wire in 0..inp.len() {  |  
149  |    let n_inverse = F::from(F::Integer::try_from(n_points).unwrap()).inv();  |  
150  |    #[allow(clippy::needless_range_loop)]  |  
151  |    for i in 0..n_points {   |  
376  |    #[allow(clippy::needless_range_loop)]  |  
377  |    for i in 0..count {  |  
176  |    if dep_start != 0 {  |  
177  |    #[allow(clippy::needless_range_loop)]  |  
178  |    for i in dep_start..=dep_end {   |  
187  |    if dev_dep_start != 0 {  |  
188  |    #[allow(clippy::needless_range_loop)]  |  
189  |    for i in dev_dep_start..=dev_dep_end {  |  
18  |    #[allow(clippy::needless_range_loop)]  |  
19  |    for i in 0..6 {  |  
14  |    let mut data = [0; 28];  |  
15  |    #[allow(clippy::needless_range_loop)] // for whatever reason didn't work with an iterator  |  
16  |    for i in 0..28 {  |  
200  |    };  |  
201  |    #[allow(clippy::needless_range_loop)]  |  
202  |    for i in 0..num_sheets {  |  
126  |   ) {  |  
127  |    #[cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
128  |    for i in start..end {   |  
576  |    feature = "cargo-clippy",  |  
577  |    allow(needless_range_loop)  |  
578  |    )]   |  
610  |    feature = "cargo-clippy",  |  
611  |    allow(needless_range_loop)  |  
612  |    )]  |  
173  |    fn counter_update(&mut self) {  |  
174  |    #[allow(unused_mut, clippy::needless_range_loop)]  |  
175  |    for j in 0..8 {   |  
188  |    #[allow(clippy::needless_range_loop)]  |  
189  |    for j in 0..8 {  |  
1059  |    total_shift += shift;  |  
1060  |    #[allow(clippy::needless_range_loop)]  |  
1061  |    for i in 0..n {  |  
401  |    /// `input` is an array of a sequence of u8 to be hashed.  |  
402  |    #[allow(clippy::needless_range_loop)] // Range loop is not only for indexing `input`  |  
403  |    pub fn calculate_hash_set(&self, input: &[&[u8]]) -> Result<Vec<Vec<u8>>, RandomXError> {  |  
253  |   #[allow(clippy::needless_range_loop)]  |  
254  |   pub fn oxford_join(vm: &mut VM, (comma, conj, comma_conj, list): (RantValue, RantValue, RantValue, Vec<RantValue>)) -> RantStdResult {  |  
262  |    #[allow(clippy::needless_range_loop)]  |  
263  |    for d in 1..f.len() {  |  
66  |    // with the lower right 1 in GAMMA  |  
67  |    #[allow(clippy::needless_range_loop)]  |  
68  |    for i in 0..H {   |  
76  |    for j in (0..=(Kprime + S - 2)).rev() {  |  
77  |    #[allow(clippy::needless_range_loop)]  |  
78  |    for i in 0..H {   |  
89  |    // Copy G_HDPC into matrix  |  
90  |    #[allow(clippy::needless_range_loop)]  |  
91  |    for i in 0..H {  |  
92  |    #[allow(clippy::needless_range_loop)]  |  
93  |    for j in 0..(Kprime + S) {   |  
190  |    let mut mt: Vec<Vec<u8>> = vec![vec![0; Kprime + S]; H];  |  
191  |    #[allow(clippy::needless_range_loop)]  |  
192  |    for i in 0..H {  |  
1301  |    let mut result = Vec::with_capacity(self.L);  |  
1302  |    #[allow(clippy::needless_range_loop)]  |  
1303  |    for i in 0..self.L {  |  
107  |    let mut row_mapping = vec![0; height];  |  
108  |    #[allow(clippy::needless_range_loop)]  |  
109  |    for i in 0..height {   |  
111  |    }  |  
112  |    #[allow(clippy::needless_range_loop)]  |  
113  |    for i in 0..width {  |  
81  |   /// Initializes and returns [`Exp`] and [`Log`] tables.  |  
82  |   #[allow(clippy::needless_range_loop)]  |  
83  |   pub fn initialize_exp_log() -> (&'static Exp, &'static Log) {   |  
162  |   /// Initializes and returns [`Skew`] table.  |  
163  |   #[allow(clippy::needless_range_loop)]  |  
164  |   pub fn initialize_skew() -> &'static Skew {  |  
400  |    #[allow(clippy::needless_range_loop)]  |  
401  |    for i in 1..heights.len() {  |  
69  |    {  |  
70  |    #[allow(clippy::needless_range_loop)]  |  
71  |    for i in 0..batch::NSHARES {  |  
260  |    } else {  |  
261  |    #[allow(clippy::needless_range_loop)]  |  
262  |    for b in 0..more_comprehensive_in_prefix_lengths.len() {  |  
284  |    #[allow(clippy::needless_range_loop)]  |  
285  |    pub fn combined_info(&self) -> TextInfo {  |  
658  |    let mut result = [false; 32];  |  
659  |    #[allow(clippy::needless_range_loop)]  |  
660  |    for i in 0..32 {  |  
61  |    /// pan mono to stereo  |  
62  |    #[allow(clippy::needless_range_loop)]  |  
63  |    pub fn process_block(  |  
100  |   #[allow(clippy::collapsible_if)]  |  
101  |   #[allow(clippy::needless_range_loop)]  |  
102  |   #[allow(clippy::too_many_arguments)]   |  
107  |   #[allow(clippy::collapsible_if)]  |  
108  |   #[allow(clippy::needless_range_loop)]  |  
109  |   #[allow(clippy::too_many_arguments)]  |  
61  |    #[allow(clippy::needless_range_loop)]  |  
62  |    for i in 0..=index {  |  
418  |   // They are not rusty. Please feel free to make them rusty 😘  |  
419  |   #[allow(clippy::needless_range_loop)]  |  
420  |   #[allow(clippy::many_single_char_names)]  |  
32  |    let mut out = vec![Scalar::zero(); n];  |  
33  |    #[allow(clippy::needless_range_loop)]  |  
34  |    for i in 0..n {  |  
448  |   #[allow(clippy::needless_range_loop)]  |  
449  |   fn conditional_select_ristretto(  |  
10336  |    #[allow(clippy::needless_range_loop)]  |  
10337  |    fn modify_accounts(  |  
332  |    if small_shift == 0 {  |  
333  |    #[allow(clippy::needless_range_loop)]  |  
334  |    #[allow(clippy::manual_memcpy)]   |  
338  |    } else {  |  
339  |    #[allow(clippy::needless_range_loop)]  |  
340  |    for i in 0..(4 - full_shifts) {  |  
446  |    if small_shift == 0 {  |  
447  |    #[allow(clippy::needless_range_loop)]  |  
448  |    #[allow(clippy::manual_memcpy)]   |  
452  |    } else {  |  
453  |    #[allow(clippy::needless_range_loop)]  |  
454  |    for i in 0..(8 - full_shifts) {  |  
341  |    if small_shift == 0 {  |  
342  |    #[allow(clippy::needless_range_loop)]  |  
343  |    #[allow(clippy::manual_memcpy)]   |  
347  |    } else {  |  
348  |    #[allow(clippy::needless_range_loop)]  |  
349  |    for i in 0..(4 - full_shifts) {  |  
451  |    if small_shift == 0 {  |  
452  |    #[allow(clippy::needless_range_loop)]  |  
453  |    #[allow(clippy::manual_memcpy)]   |  
457  |    } else {  |  
458  |    #[allow(clippy::needless_range_loop)]  |  
459  |    for i in 0..(8 - full_shifts) {  |  
87  |    #[allow(clippy::needless_range_loop)] // More readable like this.  |  
88  |    fn print_note(   |  
166  |    #[allow(clippy::needless_range_loop)] // The loops are clearer.  |  
167  |    pub fn print(&self, nodes: &Nodes, verticals: &mut Vec<usize>) {  |  
54  |    //rather than the elements of the array, but clippy disagrees...  |  
55  |    #[allow(clippy::needless_range_loop)]  |  
56  |    for i in 0..size {   |  
63  |    {  |  
64  |    #[allow(clippy::needless_range_loop)]  |  
65  |    for i in 0..size {  |  
27  |   impl ShabalVarCore {  |  
28  |    #[allow(clippy::needless_range_loop)]  |  
29  |    fn add_m(&mut self, m: &M) {   |  
35  |    #[allow(clippy::needless_range_loop)]  |  
36  |    fn sub_m(&mut self, m: &M) {   |  
190  |    #[inline]  |  
191  |    #[allow(clippy::needless_range_loop)]  |  
192  |    fn new(output_size: usize) -> Result<Self, InvalidOutputSize> {  |  
926  |   #[allow(clippy::needless_range_loop)]  |  
927  |   fn dependencies(  |  
115  |    #[allow(clippy::needless_range_loop)]  |  
116  |    pub fn apply(&mut self, g: Gate) {   |  
194  |   #[allow(clippy::needless_range_loop)]  |  
195  |   fn tensor(m: Gate, n: Rc<Gate>) -> Gate {   |  
367  |   #[allow(clippy::needless_range_loop)]  |  
368  |   fn transpose(g: Gate) -> Gate {   |  
384  |   #[allow(clippy::needless_range_loop)]  |  
385  |   fn conjugate(g: Gate) -> Gate {  |  
83  |    #[allow(clippy::needless_range_loop)]  |  
84  |    for i in 0..generators.len() {  |  
92  |    #[allow(clippy::needless_range_loop)]  |  
93  |    for i in 0..proofs1.len() {  |  
63  |    #[allow(clippy::needless_range_loop)]  |  
64  |    for i in 0..arr.len() {  |  
141  |    #[allow(clippy::needless_range_loop)]  |  
142  |    for i in 0..self.cache.scalars.len() {  |  
63  |    #[allow(clippy::needless_range_loop)]  |  
64  |    for i in 0..arr.len() {  |  
51  |    #[allow(clippy::needless_range_loop)]  |  
52  |    for i in 0..messages.len() {  |  
57  |    let mut arr = [0u8; Signature::BYTES];  |  
58  |    #[allow(clippy::needless_range_loop)]  |  
59  |    for i in 0..arr.len() {   |  
121  |    #[allow(clippy::needless_range_loop)]  |  
122  |    for i in 0..msgs.len() {   |  
154  |    #[allow(clippy::needless_range_loop)]  |  
155  |    for i in 0..msgs.len() {  |  
102  |    // Replace any NULL bytes  |  
103  |    #[allow(clippy::needless_range_loop)]  |  
104  |    for i in 1..(name_vec.len()) {  |  
104  |    let mut v = i;  |  
105  |    #[allow(clippy::needless_range_loop)]  |  
106  |    for r in 0..4 {   |  
154  |    let mut v = i;  |  
155  |    #[allow(clippy::needless_range_loop)]  |  
156  |    for r in 0..4 {  |  
95  |    let mut v = t;  |  
96  |    #[allow(clippy::needless_range_loop)]  |  
97  |    for r in 0..4 {   |  
114  |    let mut v = i;  |  
115  |    #[allow(clippy::needless_range_loop)]  |  
116  |    for r in 0..4 {   |  
246  |    let mut v = i;  |  
247  |    #[allow(clippy::needless_range_loop)]  |  
248  |    for r in 0..4 {   |  
334  |    #[allow(clippy::needless_range_loop)]  |  
335  |    for i in 0..l2 {   |  
352  |    #[allow(clippy::needless_range_loop)]  |  
353  |    for i in 0..l1 {  |  
89  |    // This is allowed becuase I couldn't find a way to implement clippy's suggestion without doing something ridiculous.  |  
90  |    #[allow(clippy::needless_range_loop)]  |  
91  |    for output in 0..self.output_weights.len() {  |  
108  |    #[allow(clippy::needless_range_loop)]  |  
109  |    /// Distribute the reward  |  
723  |    #[allow(clippy::needless_range_loop)]  |  
724  |    #[test]  |  
86  |    #[allow(clippy::needless_range_loop)]  |  
87  |    // b50, ..., b79 are set to 1  |  
266  |    #[allow(clippy::needless_range_loop)]  |  
267  |    for k in 0..params.num_limbs {  |  
98  |    // but leader_schedule doesn't implement Iter...  |  
99  |    #[allow(clippy::needless_range_loop)]  |  
100  |    for i in start_index..bank.get_slots_in_epoch(epoch) {  |  
10322  |    #[allow(clippy::needless_range_loop)]  |  
10323  |    fn modify_accounts(  |  
32  |    let mut out = vec![Scalar::zero(); n];  |  
33  |    #[allow(clippy::needless_range_loop)]  |  
34  |    for i in 0..n {  |  
453  |   #[allow(clippy::needless_range_loop)]  |  
454  |   fn conditional_select_ristretto(  |  
172  |    #[allow(clippy::needless_range_loop)]  |  
173  |    for i in 0..a.len() {  |  
288  |    #[allow(clippy::needless_range_loop)]  |  
289  |    pub fn combined_info(&self) -> TextInfo {  |  
32  |    let mut out = vec![Scalar::zero(); n];  |  
33  |    #[allow(clippy::needless_range_loop)]  |  
34  |    for i in 0..n {  |  
2792  |    /// Create a currency value.  |  
2793  |    #[allow(clippy::needless_range_loop)]  |  
2794  |    pub fn new_currency<S: AsRef<str>>(cur: S, value: f64) -> Self {  |  
217  |   /// **matrix:** The matrix to be transposed, must be a valid matrix else an error is returned.  |  
218  |   #[allow(clippy::needless_range_loop)]  |  
219  |   pub fn transpose_vec_matrix<T: Clone>(matrix: Vec<Vec<T>>) -> Result<Vec<Vec<T>>, Error> {  |  
9  |   #[allow(clippy::needless_range_loop)]  |  
10  |   fn u128_to_byte_array(n: u128) -> [u8; 16] {  |  
263  |    let mut values = MaybeUninit::uninit();  |  
264  |    #[allow(clippy::needless_range_loop)]  |  
265  |    for i in 0..N {  |  
506  |    #[allow(clippy::needless_range_loop)]  |  
507  |    #[cfg(any(feature = "cuda", feature = "opencl"))]  |  
58  |    #[allow(clippy::needless_range_loop)]  |  
59  |    for i in 0..12 {  |  
204  |   /// This algorithm runs at a time complexity of O(mn).  |  
205  |   #[allow(clippy::needless_range_loop)]  |  
206  |   pub fn levenshtein_distance(x: &str, y: &str, threshold: usize) -> usize {  |  
297  |    #[allow(clippy::needless_range_loop)]  |  
298  |    for i in 0..state.meta_heuristics.len() {  |  
1357  |    #[allow(clippy::needless_range_loop)]  |  
1358  |    fn compute_scalars(data: &BlendData, outer: u16, scalars: &mut [f32]) -> Option<(bool, usize)> {  |  
260  |    /// for the deltas associated with this region.  |  
261  |    #[allow(clippy::needless_range_loop)]  |  
262  |    fn compute_scalar(&self, coords: &[i16]) -> Fixed {  |  
541  |   #[allow(clippy::needless_range_loop)]  |  
542  |   pub fn reorder_complex(glyphs: &mut [GlyphData], buf: &mut Vec<GlyphData>, order: &mut Vec<usize>) {  |  
9  |    #[allow(clippy::needless_range_loop)]  |  
10  |    for i in 0..N {  |  
157  |    }  |  
158  |    #[allow(clippy::needless_range_loop)]  |  
159  |    for i in columns.len()..row.len() {  |  
141  |   let mut feature_values_sum_of_squares = 0.0;  |  
142  |   #[allow(clippy::needless_range_loop)]  |  
143  |   for ngram_index in 0..self.ngrams.len() {  |  
125  |   /// Tree hash algorithm in monero  |  
126  |   #[allow(clippy::needless_range_loop)]  |  
127  |   pub fn tree_hash(hashes: &[Hash]) -> Result<Hash, MergeMineError> {  |  
80  |    /// Construct an initial state from a 128-bit constant, 256-bit key, 96-bit nonce and a 32-bit block counter  |  
81  |    #[allow(clippy::needless_range_loop)]  |  
82  |    fn construct_state(key: &[u8; 32], nonce: &[u8; 12], counter: u32) -> [u32; 16] {  |  
23  |   #[allow(clippy::needless_range_loop)]  |  
24  |   pub mod bit;  |  
79  |   #[allow(clippy::needless_range_loop)]  |  
80  |   impl Table {  |  
101  |    #[allow(clippy::needless_range_loop)]  |  
102  |    for i in 0..sp {  |  
345  |    let low_26_bits = (1 << 26) - 1;  |  
346  |    #[allow(clippy::needless_range_loop)]  |  
347  |    for i in 0..5 {  |  
98  |    #[allow(clippy::needless_range_loop)]  |  
99  |    for i in 0..sp {  |  
397  |    let mut bytes = [0u8; 32];  |  
398  |    #[allow(clippy::needless_range_loop)]  |  
399  |    for i in 0..32 {   |  
1070  |    let digits_count = (256 + w - 1) / w;  |  
1071  |    #[allow(clippy::needless_range_loop)]  |  
1072  |    for i in 0..digits_count {  |  
214  |    #[allow(clippy::needless_range_loop)]  |  
215  |    for i in 0..16 {   |  
226  |    #[allow(clippy::needless_range_loop)]  |  
227  |    for i in 0..16 {   |  
2374  |    #[allow(clippy::needless_range_loop)]  |  
2375  |    for i in 0..=14 {  |  
236  |    for y in 0..4 {  |  
237  |    #[allow(clippy::needless_range_loop)]  |  
238  |    for x in 0..4 {   |  
251  |    for y in 0..2 {  |  
252  |    #[allow(clippy::needless_range_loop)]  |  
253  |    for x in 0..4 {   |  
266  |    for y in 0..4 {  |  
267  |    #[allow(clippy::needless_range_loop)]  |  
268  |    for x in 0..2 {  |  
11  |   #[allow(clippy::needless_range_loop)]  |  
12  |   fn bad_sort(mut v: Vec<u32>) -> Vec<u32> {  |  
207  |    #[allow(clippy::needless_range_loop)]  |  
208  |    for i in 0..len {   |  
384  |    #[allow(clippy::needless_range_loop)]  |  
385  |    for i in 0..len {   |  
393  |    // check zero knowledge proof  |  
394  |    #[allow(clippy::needless_range_loop)]  |  
395  |    for i in 0..len {  |  
78  |   #[allow(clippy::needless_range_loop)]  |  
79  |   pub fn multiply(m1: Matrix, m2: Matrix) -> Matrix {  |  
104  |   #[allow(clippy::needless_range_loop)]  |  
105  |   impl<'pgm> VMState<'pgm> {  |  
354  |   // Xor first 100 bytes with a static value  |  
355  |   #[allow(clippy::needless_range_loop)]  |  
356  |   for i in 0..cmp::min(data.len(), 100) {   |  
408  |   // Xor first 100 bytes with a static value  |  
409  |   #[allow(clippy::needless_range_loop)]  |  
410  |   for i in 0..cmp::min(data.len(), 100) {  |  
222  |   #[cfg_attr(feature = "cargo-clippy",  |  
223  |    allow(needless_range_loop, needless_pass_by_value))]  |  
224  |   fn event_loop(tx: Sender<Box<Event>>) -> Result<()> {  |  
162  |    #[allow(clippy::needless_range_loop)] // faster like so  |  
163  |    for i in 0..8 {  |  
280  |    /// <https://www.unicode.org/reports/tr9/#Reordering_Resolved_Levels>  |  
281  |    #[cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
282  |    pub fn visual_runs(  |  
265  |    let format = frame.format();  |  
266  |    #[allow(clippy::needless_range_loop)]  |  
267  |    for plane in 0..format.plane_count() {  |  
44  |    unsafe {  |  
45  |    #[allow(clippy::needless_range_loop)]  |  
46  |    for j in 0..dest_width {  |  
396  |    /// ```  |  
397  |    #[allow(clippy::needless_range_loop)]  |  
398  |    pub fn list_domains(&self) -> Result<Vec<u32>, Error> {   |  
424  |    /// ```  |  
425  |    #[allow(clippy::needless_range_loop)]  |  
426  |    pub fn list_interfaces(&self) -> Result<Vec<String>, Error> {   |  
452  |    /// ```  |  
453  |    #[allow(clippy::needless_range_loop)]  |  
454  |    pub fn list_networks(&self) -> Result<Vec<String>, Error> {   |  
470  |    #[allow(clippy::needless_range_loop)]  |  
471  |    pub fn list_nw_filters(&self) -> Result<Vec<String>, Error> {   |  
487  |    #[allow(clippy::needless_range_loop)]  |  
488  |    pub fn list_secrets(&self) -> Result<Vec<String>, Error> {  |  
213  |    #[allow(clippy::needless_range_loop)]  |  
214  |    pub fn list_caps(&self) -> Result<Vec<String>, Error> {  |  
171  |    #[allow(clippy::needless_range_loop)]  |  
172  |    pub fn list_volumes(&self) -> Result<Vec<String>, Error> {  |  
72  |    #[allow(clippy::needless_range_loop)]  |  
73  |    fn mask_with_keystream(&self, data: &mut [u8], type_: u8, seed: u8) {  |  
101  |    #[allow(unknown_lints, clippy::needless_range_loop)]  |  
102  |    fn from_str(text: &str) -> Result<Self, Self::Err> {  |  
32  |   #[allow(clippy::needless_range_loop)]  |  
33  |   #[inline(always)]   |  
47  |   #[allow(clippy::needless_range_loop)]  |  
48  |   #[inline(always)]   |  
57  |   #[allow(clippy::needless_range_loop)]  |  
58  |   #[inline(always)]  |  
579  |    let limit = self.osc.num_params.min(MAX_OSC);  |  
580  |    #[allow(clippy::needless_range_loop)]  |  
581  |    for i in 0..limit - 1 {  |  
11061  |    #[allow(clippy::needless_range_loop)]  |  
11062  |    fn modify_accounts(  |  
32  |    let mut out = vec![Scalar::zero(); n];  |  
33  |    #[allow(clippy::needless_range_loop)]  |  
34  |    for i in 0..n {  |  
453  |   #[allow(clippy::needless_range_loop)]  |  
454  |   fn conditional_select_ristretto(  |  
94  |    // Overwrite with placeholder  |  
95  |    #[allow(clippy::needless_range_loop)]  |  
96  |    for i in 0..m {  |  
689  |    // getting an iterator of this const produces `&&str` which is a super annoying type  |  
690  |    #[allow(clippy::needless_range_loop)]  |  
691  |    for x in 0..RESTRICTED_LABELS.len() {  |  
3550  |    /* Clippy is wrong about using `i` to index `PARAM_REGS` here. */  |  
3551  |    #[allow(clippy::needless_range_loop)]  |  
3552  |    for i in 0..sig.params().len() {  |  
8093  |    static PARAM_REGS: &[GPR] = &[GPR::RDX, GPR::R8, GPR::R9];  |  
8094  |    #[allow(clippy::needless_range_loop)]  |  
8095  |    for i in 0..sig.params().len() {   |  
8134  |    static PARAM_REGS: &[GPR] = &[GPR::RSI, GPR::RDX, GPR::RCX, GPR::R8, GPR::R9];  |  
8135  |    #[allow(clippy::needless_range_loop)]  |  
8136  |    for i in 0..sig.params().len() {  |  
46  |   impl<G> Selector<G> for TournamentSelector<G> {  |  
47  |    #[allow(clippy::needless_range_loop)]  |  
48  |    fn select(&mut self, _population: &[G], costs: &[f64], partner_indices: &mut [usize]) {  |  
23  |    #[allow(clippy::needless_range_loop)]  |  
24  |    for r in 0..R {  |  
115  |    let mut trace_state = vec![BaseElement::ZERO; trace_table.main_trace_width()];  |  
116  |    #[allow(clippy::needless_range_loop)]  |  
117  |    for i in 0..trace_table.trace_len() {  |  
326  |   /// strings' lengths.  |  
327  |   #[allow(clippy::needless_range_loop)]  |  
328  |   pub fn edit_distance(a: &str, b: &str) -> usize {  |  
266  |    // iter methods aren't quite sufficient here  |  
267  |    #[allow(clippy::needless_range_loop)]  |  
268  |    for i in min..max {  |  
67  |    #[allow(clippy::needless_range_loop)]  |  
68  |    fn towns(&mut self, altitudes: &[Vec<u8>]) -> HashSet<Pos> {  |  
39  |   #[allow(clippy::needless_range_loop)]  |  
40  |   for i in 0..chars.len() {  |  
27  |    #[allow(clippy::needless_range_loop)]  |  
28  |    for i in 0..timestamps.len() {  |  
29  |   pub fn add_mul_ctx(uses: Uses, use_ctx: &mut Ctx, use_ctx2: Ctx) {  |  
30  |    #[allow(clippy::needless_range_loop)]  |  
31  |    for i in 0..use_ctx.len() {   |  
38  |   pub fn add_ctx(use_ctx: &mut Ctx, use_ctx2: Ctx) {  |  
39  |    #[allow(clippy::needless_range_loop)]  |  
40  |    for i in 0..use_ctx.len() {   |  
47  |   pub fn mul_ctx(uses: Uses, use_ctx: &mut Ctx) {  |  
48  |    #[allow(clippy::needless_range_loop)]  |  
49  |    for i in 0..use_ctx.len() {   |  
57  |    let mut rest = use_ctx.clone();  |  
58  |    #[allow(clippy::needless_range_loop)]  |  
59  |    for i in 0..use_ctx.len() {  |  
105  |   } else {  |  
106  |   #[allow(clippy::needless_range_loop)]  |  
107  |   for i in 0..self.cpu_count {  |  
10  |   #[allow(clippy::type_complexity, clippy::needless_range_loop)]  |  
11  |   /// \[Generic\] [Floyd–Warshall algorithm](https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm) is an algorithm for all pairs shortest path problem  |  
10  |   #[allow(clippy::type_complexity, clippy::needless_range_loop)]  |  
11  |   /// \[Generic\] [Floyd–Warshall algorithm](https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm) is an algorithm for all pairs shortest path problem  |  
228  |    #[allow(clippy::needless_range_loop)]  |  
229  |    /// Evaluate all the lagrange polynomials defined by this domain at the  |  
449  |    // We want to use `for i in 0..CHUNK_SIZE` for consistency  |  
450  |    #[allow(clippy::needless_range_loop)]  |  
451  |    pub(crate) fn init(&mut self, start: usize) {   |  
495  |    // We want to use `for i in 0..CHUNK_SIZE` for consistency  |  
496  |    #[allow(clippy::needless_range_loop)]  |  
497  |    #[inline(never)]  |  
1447  |    /// Build the decode table for the precode  |  
1448  |    #[allow(clippy::needless_range_loop)]  |  
1449  |    fn build_decode_table_inner(  |  
33  |   {  |  
34  |    #[allow(clippy::needless_range_loop)]  |  
35  |    for i in 0..Arr::len() {   |  
392  |    let bounds = &mut result.cell_bounds;  |  
393  |    #[allow(clippy::needless_range_loop)]  |  
394  |    for axis in 0..2 {   |  
433  |    let bounds = &mut result.cell_bounds;  |  
434  |    #[allow(clippy::needless_range_loop)]  |  
435  |    for axis in 0..3 {   |  
577  |    let bounds = &mut result.cell_bounds;  |  
578  |    #[allow(clippy::needless_range_loop)]  |  
579  |    for axis in 0..2 {   |  
647  |    let bounds = &mut result.cell_bounds;  |  
648  |    #[allow(clippy::needless_range_loop)]  |  
649  |    for axis in 0..3 {  |  
10  |   #![allow(clippy::needless_range_loop)]  |  
3  |   // TODO(tarcieri): check performance impact / generated assembly changes  |  
4  |   #![allow(clippy::needless_range_loop)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
5  |   #![allow(clippy::cast_lossless)]  |  
6  |   #![allow(clippy::needless_range_loop)]  |  
7  |   #![allow(clippy::unreadable_literal)]  |  
21  |   // We are using special indexing everywhere  |  
22  |   #![allow(clippy::needless_range_loop)]  |  
23  |   // not const and tends to be longer  |  
190  |   #![deny(unsafe_op_in_unsafe_fn)]  |  
191  |   #![allow(clippy::needless_range_loop)]  |  
192  |   #![allow(clippy::comparison_chain)]  |  
14  |   // We are using special indexing everywhere  |  
15  |   #![allow(clippy::needless_range_loop)]  |  
16  |   // not const and tends to be longer  |  
14  |   #![allow(clippy::manual_range_contains)]  |  
15  |   #![allow(clippy::needless_range_loop)]  |  
6  |   #![allow(clippy::needless_range_loop)]  |  
7  |   #![allow(clippy::comparison_chain)]  |  
4  |    clippy::len_without_is_empty,  |  
5  |    clippy::needless_range_loop,  |  
6  |    clippy::all,  |  
23  |   #![allow(clippy::needless_range_loop)]  |  
24  |   use binreader_macros::make_number_methods;  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
7  |   #![allow(clippy::needless_range_loop)]  |  
290  |   // What is the more appropiate way to iterate a couple arrays of same size, while also using the index itself?  |  
291  |   #![allow(clippy::needless_range_loop)]  |  
292  |   // I have several cases that seem cleaner without collapsing.  |  
112  |   #![warn(missing_docs, rust_2018_idioms, trivial_casts, unused_qualifications)]  |  
113  |   #![allow(clippy::needless_range_loop)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
1  |   #![allow(clippy::needless_range_loop, dead_code)]  |  
2  |   use crate::symmetric::KeccakState;  |  
1  |   #![allow(clippy::needless_range_loop, dead_code)]  |  
23  |    clippy::too_many_arguments,  |  
24  |    clippy::needless_range_loop  |  
25  |   )]  |  
3  |   #![allow(  |  
4  |    clippy::needless_range_loop,  |  
5  |    clippy::many_single_char_names,  |  
298  |   mod tests {  |  
299  |    #![allow(clippy::needless_range_loop)]  |  
95  |   mod tests {  |  
96  |    #![allow(clippy::needless_range_loop)]  |  
25  |   #![warn(missing_docs, rust_2018_idioms)]  |  
26  |   #![allow(clippy::needless_range_loop)]  |  
80  |   #![allow(clippy::float_cmp)]  |  
81  |   #![allow(clippy::needless_range_loop)]  |  
82  |   #![allow(clippy::useless_let_if_seq)]  |  
6  |   #![allow(clippy::match_like_matches_macro)]  |  
7  |   #![allow(clippy::needless_range_loop)]  |  
8  |   #![allow(clippy::useless_format)]  |  
95  |   #![allow(  |  
96  |    clippy::needless_range_loop,  |  
97  |    clippy::many_single_char_names,  |  
6  |   #![allow(clippy::needless_range_loop)]  |  
52  |    clippy::wrong_self_convention,// smaller than pointer  |  
53  |    clippy::needless_range_loop,// the suggested iterator chains are less intuitive  |  
54  |    clippy::identity_op,// applying a set of opereations with varying arguments to many elements looks nice  |  
1  |   #![allow(clippy::excessive_precision)]  |  
2  |   #![allow(clippy::needless_range_loop)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
6  |   #![warn(clippy::needless_pass_by_value)]  |  
7  |   #![allow(clippy::needless_range_loop)]  |  
8  |   #![warn(clippy::disallowed_types)]  |  
12  |    clippy::double_neg,  |  
13  |    clippy::needless_range_loop,  |  
14  |    clippy::manual_range_contains,  |  
48  |   #![allow(clippy::type_complexity)]  |  
49  |   #![allow(clippy::needless_range_loop)]  |  
8  |   #![allow(clippy::needless_range_loop)]  |  
9  |   use crate::math::FourierCoefficients;  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
2  |   use crate::table::TABLE;  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
2  |   use crate::table::TABLE;  |  
1  |   #![cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
2  |   #![allow(non_snake_case)]  |  
14  |    clippy::too_many_arguments,  |  
15  |    clippy::needless_range_loop,  |  
16  |    clippy::useless_let_if_seq,  |  
14  |    clippy::too_many_arguments,  |  
15  |    clippy::needless_range_loop,  |  
16  |    clippy::useless_let_if_seq,  |  
49  |   #![allow(clippy::many_single_char_names, clippy::needless_range_loop)]  |  
50  |   #![cfg_attr(docsrs, feature(doc_cfg))]  |  
10  |   #![allow(clippy::never_loop)]  |  
11  |   #![allow(clippy::needless_range_loop)]  |  
30  |   #![warn(missing_docs, rust_2018_idioms)]  |  
31  |   #![allow(clippy::needless_range_loop, clippy::transmute_ptr_to_ptr)]  |  
20  |    clippy::many_single_char_names,  |  
21  |    clippy::needless_range_loop,  |  
22  |    clippy::new_without_default,  |  
6  |    clippy::many_single_char_names,  |  
7  |    clippy::needless_range_loop,  |  
8  |    clippy::suspicious_op_assign_impl,  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
5  |    clippy::cast_possible_wrap,  |  
6  |    clippy::needless_range_loop  |  
7  |   )]  |  
1  |   // There's a number of cases in this file where this lint just complicates the code.  |  
2  |   #![allow(clippy::needless_range_loop)]  |  
16  |   #![allow(clippy::needless_range_loop)]  |  
1  |   #![cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
1  |   #![allow(  |  
2  |    clippy::needless_range_loop,  |  
3  |    clippy::many_single_char_names,  |  
22  |   #![allow(clippy::many_single_char_names)]  |  
23  |   #![allow(clippy::needless_range_loop)]  |  
24  |   #![allow(clippy::manual_memcpy)]  |  
23  |   #![allow(clippy::many_single_char_names)]  |  
24  |   #![allow(clippy::needless_range_loop)]  |  
25  |   #![allow(clippy::manual_memcpy)]  |  
22  |   #![allow(clippy::many_single_char_names)]  |  
23  |   #![allow(clippy::needless_range_loop)]  |  
24  |   #![allow(clippy::manual_memcpy)]  |  
22  |   #![allow(clippy::many_single_char_names)]  |  
23  |   #![allow(clippy::needless_range_loop)]  |  
24  |   #![allow(clippy::manual_memcpy)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
1  |   #![no_std]  |  
2  |   #![cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
1  |   #![cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
34  |   #![warn(clippy::all)]  |  
35  |   #![allow(clippy::needless_range_loop)]  |  
3  |   #![allow(clippy::needless_range_loop, clippy::op_ref)]  |  
3  |   #![allow(clippy::needless_range_loop)]  |  
1  |   #![allow(clippy::too_many_arguments)]  |  
2  |   #![allow(clippy::needless_range_loop)]  |  
3  |   #![cfg_attr(not(feature = "std"), no_std)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
2  |   #![cfg_attr(not(test), no_std)]  |  
5  |   #![allow(clippy::len_without_is_empty)]  |  
6  |   #![allow(clippy::needless_range_loop)]  |  
7  |   #![allow(clippy::return_self_not_must_use)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
2  |   #![no_std]  |  
4  |   #![allow(clippy::len_without_is_empty)]  |  
5  |   #![allow(clippy::needless_range_loop)]  |  
6  |   #![allow(clippy::return_self_not_must_use)]  |  
1  |   #![allow(clippy::needless_range_loop, dead_code)]  |  
2  |   use crate::symmetric::KeccakState;  |  
1  |   #![allow(clippy::needless_range_loop, dead_code)]  |  
3  |   #![allow(clippy::needless_range_loop, clippy::op_ref)]  |  
3  |   //! <https://github.com/mwlon/quantile-compression/tree/main/q_compress>.  |  
4  |   #![allow(clippy::needless_range_loop)]  |  
5  |   #![allow(clippy::manual_range_contains)]  |  
13  |   #![allow(clippy::cognitive_complexity)]  |  
14  |   #![allow(clippy::needless_range_loop)]  |  
15  |   #![allow(clippy::too_many_arguments)]  |  
13  |   #![allow(clippy::cognitive_complexity)]  |  
14  |   #![allow(clippy::needless_range_loop)]  |  
15  |   #![allow(clippy::too_many_arguments)]  |  
40  |   #![allow(clippy::cognitive_complexity)]  |  
41  |   #![allow(clippy::needless_range_loop)]  |  
42  |   #![allow(clippy::too_many_arguments)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
9  |   #![allow(clippy::single_match)]  |  
10  |   #![allow(clippy::needless_range_loop)]  |  
11  |   #![allow(clippy::type_complexity)]  |  
9  |   #![allow(clippy::type_complexity)]  |  
10  |   #![allow(clippy::needless_range_loop)]  |  
11  |   #![allow(clippy::single_match)]  |  
9  |   #![allow(clippy::type_complexity)]  |  
10  |   #![allow(clippy::needless_range_loop)]  |  
11  |   #![allow(clippy::single_match)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
2  |   use crate::{  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
2  |   use crate::{Endidness, Result, Segment};  |  
21  |   #![warn(missing_docs, rust_2018_idioms)]  |  
22  |   #![allow(clippy::needless_range_loop)]  |  
1  |   #![feature(test)]  |  
2  |   #![cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
1  |   #![feature(test)]  |  
2  |   #![cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
1  |   #![feature(test)]  |  
2  |   #![cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
1  |   #![feature(test)]  |  
2  |   #![cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
2  |   //! # Elastic Net  |  
1  |   #![cfg(any(feature = "default-resolver", feature = "ring-accelerated"))]  |  
2  |   #![allow(clippy::needless_range_loop)]  |  
3  |   #![allow(non_snake_case)]  |  
2  |   #![allow(clippy::too_many_arguments)]  |  
3  |   #![allow(clippy::needless_range_loop)]  |  
4  |   use super::dense_mlpoly::DensePolynomial;  |  
1  |   #![cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
8  |    clippy::module_inception,  |  
9  |    clippy::needless_range_loop,  |  
10  |    clippy::bool_assert_comparison  |  
8  |   // Justification: Some loops are better expressed without a range loop.  |  
9  |   #![allow(clippy::needless_range_loop)]  |  
16  |   // TODO: Remove this when refactoring AAC.  |  
17  |   #![allow(clippy::needless_range_loop)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
2  |   #![allow(clippy::missing_safety_doc)]  |  
3  |   #![allow(clippy::needless_range_loop)]  |  
17  |   #![allow(clippy::missing_safety_doc)]  |  
18  |   #![allow(clippy::needless_range_loop)]  |  
24  |   #![allow(clippy::manual_range_contains)]  |  
25  |   #![allow(clippy::needless_range_loop)]  |  
26  |   #![allow(clippy::too_many_arguments)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
2  |   #![warn(rust_2018_idioms)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
2  |   #![warn(rust_2018_idioms)]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
2  |   use num_traits::AsPrimitive;  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
401  |    where TRes : Clone + Default  |  
402  |    { #![allow(clippy::needless_range_loop)]  |  
403  |    let mut newvals:Vec<TRes> = Vec::with_capacity(self.values.len());   |  
426  |    where TRes : Clone + Default  |  
427  |    { #![allow(clippy::needless_range_loop)]  |  
428  |    let mut newvals:Vec<TRes> = Vec::with_capacity(self.values.len());  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
2  |   #![forbid(unsafe_code)]  |  
21  |   #![warn(missing_docs, rust_2018_idioms)]  |  
22  |   #![allow(clippy::needless_range_loop, clippy::unreadable_literal)]  |  
2  |   #![deny(unsafe_code)]  |  
3  |   #![allow(clippy::needless_range_loop)]  |  
3  |   #![allow(dead_code)]  |  
4  |   #![allow(clippy::explicit_counter_loop, clippy::needless_range_loop)]  |  
29  |    clippy::let_unit_value,  |  
30  |    clippy::needless_range_loop,  |  
31  |    clippy::iter_nth_zero,  |  
10  |    clippy::unnecessary_to_owned,  |  
11  |    clippy::needless_range_loop,  |  
12  |    clippy::manual_map,  |  
13  |   #![allow(clippy::cognitive_complexity)]  |  
14  |   #![allow(clippy::needless_range_loop)]  |  
15  |   #![allow(clippy::too_many_arguments)]  |  
20  |    clippy::many_single_char_names,  |  
21  |    clippy::needless_range_loop,  |  
22  |    clippy::new_without_default,  |  
11  |   #![cfg_attr(feature = "cargo-clippy", allow(needless_range_loop))]  |  
1  |   #![allow(clippy::needless_range_loop)]  |  
2  |   extern crate bellman_ce;  |