mirror of
https://github.com/sigp/lighthouse.git
synced 2026-03-10 04:01:51 +00:00
118 lines
3.5 KiB
Rust
118 lines
3.5 KiB
Rust
/// A function for splitting a list into N pieces.
|
|
///
|
|
/// We have titled it the "honey badger split" because of its robustness. It don't care.
|
|
|
|
/// Iterator for the honey_badger_split function
|
|
pub struct Split<'a, T: 'a> {
|
|
n: usize,
|
|
current_pos: usize,
|
|
list: &'a [T],
|
|
list_length: usize,
|
|
}
|
|
|
|
impl<'a, T> Iterator for Split<'a, T> {
|
|
type Item = &'a [T];
|
|
|
|
fn next(&mut self) -> Option<Self::Item> {
|
|
self.current_pos += 1;
|
|
if self.current_pos <= self.n {
|
|
match self.list.get(
|
|
self.list_length * (self.current_pos - 1) / self.n
|
|
..self.list_length * self.current_pos / self.n,
|
|
) {
|
|
Some(v) => Some(v),
|
|
None => unreachable!(),
|
|
}
|
|
} else {
|
|
None
|
|
}
|
|
}
|
|
}
|
|
|
|
/// Splits a slice into chunks of size n. All postive n values are applicable,
|
|
/// hence the honey_badger prefix.
|
|
///
|
|
/// Returns an iterator over the original list.
|
|
pub trait SplitExt<T> {
|
|
fn honey_badger_split(&self, n: usize) -> Split<T>;
|
|
}
|
|
|
|
impl<T> SplitExt<T> for [T] {
|
|
fn honey_badger_split(&self, n: usize) -> Split<T> {
|
|
Split {
|
|
n,
|
|
current_pos: 0,
|
|
list: &self,
|
|
list_length: self.len(),
|
|
}
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use super::*;
|
|
|
|
fn alternative_split_at_index<T>(indices: &[T], index: usize, count: usize) -> &[T] {
|
|
let start = (indices.len() * index) / count;
|
|
let end = (indices.len() * (index + 1)) / count;
|
|
|
|
&indices[start..end]
|
|
}
|
|
|
|
fn alternative_split<T: Clone>(input: &[T], n: usize) -> Vec<&[T]> {
|
|
(0..n)
|
|
.into_iter()
|
|
.map(|i| alternative_split_at_index(&input, i, n))
|
|
.collect()
|
|
}
|
|
|
|
fn honey_badger_vs_alternative_fn(num_items: usize, num_chunks: usize) {
|
|
let input: Vec<usize> = (0..num_items).collect();
|
|
|
|
let hb: Vec<&[usize]> = input.honey_badger_split(num_chunks).collect();
|
|
let spec: Vec<&[usize]> = alternative_split(&input, num_chunks);
|
|
|
|
assert_eq!(hb, spec);
|
|
}
|
|
|
|
#[test]
|
|
fn vs_eth_spec_fn() {
|
|
for i in 0..10 {
|
|
for j in 0..10 {
|
|
honey_badger_vs_alternative_fn(i, j);
|
|
}
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn test_honey_badger_split() {
|
|
/*
|
|
* These test cases are generated from the eth2.0 spec `split()`
|
|
* function at commit cbd254a.
|
|
*/
|
|
let input: Vec<usize> = vec![0, 1, 2, 3];
|
|
let output: Vec<&[usize]> = input.honey_badger_split(2).collect();
|
|
assert_eq!(output, vec![&[0, 1], &[2, 3]]);
|
|
|
|
let input: Vec<usize> = vec![0, 1, 2, 3];
|
|
let output: Vec<&[usize]> = input.honey_badger_split(6).collect();
|
|
let expected: Vec<&[usize]> = vec![&[], &[0], &[1], &[], &[2], &[3]];
|
|
assert_eq!(output, expected);
|
|
|
|
let input: Vec<usize> = vec![0, 1, 2, 3];
|
|
let output: Vec<&[usize]> = input.honey_badger_split(10).collect();
|
|
let expected: Vec<&[usize]> = vec![&[], &[], &[0], &[], &[1], &[], &[], &[2], &[], &[3]];
|
|
assert_eq!(output, expected);
|
|
|
|
let input: Vec<usize> = vec![0];
|
|
let output: Vec<&[usize]> = input.honey_badger_split(5).collect();
|
|
let expected: Vec<&[usize]> = vec![&[], &[], &[], &[], &[0]];
|
|
assert_eq!(output, expected);
|
|
|
|
let input: Vec<usize> = vec![0, 1, 2];
|
|
let output: Vec<&[usize]> = input.honey_badger_split(2).collect();
|
|
let expected: Vec<&[usize]> = vec![&[0], &[1, 2]];
|
|
assert_eq!(output, expected);
|
|
}
|
|
}
|