|
| 1 | +#[derive(Default)] |
| 2 | +pub struct Eytzinger<T>(Vec<T>, Vec<usize>); |
| 3 | + |
| 4 | +#[derive(Debug)] |
| 5 | +pub struct Index { |
| 6 | + pub index: usize, |
| 7 | + pub original: usize, |
| 8 | +} |
| 9 | + |
| 10 | +fn eytzinger<T: Copy>(a: &[T], b: &mut [T], mut i: usize, k: usize) -> usize { |
| 11 | + if k <= a.len() { |
| 12 | + i = eytzinger(a, b, i, 2 * k); |
| 13 | + b[k] = a[i]; |
| 14 | + i += 1; |
| 15 | + i = eytzinger(a, b, i, 2 * k + 1); |
| 16 | + } |
| 17 | + i |
| 18 | +} |
| 19 | + |
| 20 | +impl<T: Copy + Default> From<&[T]> for Eytzinger<T> { |
| 21 | + fn from(input: &[T]) -> Self { |
| 22 | + let mut result = vec![T::default(); input.len() + 1]; |
| 23 | + eytzinger(&input[..], &mut result[..], 0, 1); |
| 24 | + let original = (0..input.len()).into_iter().collect::<Vec<_>>(); |
| 25 | + let mut order = vec![input.len(); input.len() + 1]; |
| 26 | + eytzinger(&original[..], &mut order[..], 0, 1); |
| 27 | + Self(result, order) |
| 28 | + } |
| 29 | +} |
| 30 | + |
| 31 | +impl<T: Copy + Ord> Eytzinger<T> { |
| 32 | + pub fn get(&self, idx: usize) -> Option<&T> { |
| 33 | + self.0.get(idx) |
| 34 | + } |
| 35 | + |
| 36 | + #[inline] |
| 37 | + pub fn binary_search(&self, target: T) -> Result<Index, Index> { |
| 38 | + let mut idx = 1; |
| 39 | + |
| 40 | + while idx < self.0.len() { |
| 41 | + #[cfg(target_arch = "x86_64")] |
| 42 | + unsafe { |
| 43 | + use std::arch::x86_64::*; |
| 44 | + let prefetch = self.0.as_ptr().wrapping_offset(2 * idx as isize); |
| 45 | + _mm_prefetch::<_MM_HINT_T0>(std::ptr::addr_of!(prefetch) as *const i8); |
| 46 | + } |
| 47 | + let current = self.0[idx]; |
| 48 | + idx = 2 * idx + usize::from(current < target); |
| 49 | + } |
| 50 | + |
| 51 | + idx >>= idx.trailing_ones() + 1; |
| 52 | + |
| 53 | + let r = Index { |
| 54 | + index: idx, |
| 55 | + original: self.1[idx], |
| 56 | + }; |
| 57 | + |
| 58 | + if self.0[idx] == target { |
| 59 | + Ok(r) |
| 60 | + } else { |
| 61 | + Err(r) |
| 62 | + } |
| 63 | + } |
| 64 | +} |
| 65 | + |
| 66 | +#[test] |
| 67 | +fn ok_binary_search() { |
| 68 | + let v = Eytzinger::from(vec![1, 5, 10].as_slice()); |
| 69 | + assert_eq!(v.binary_search(1).unwrap().original, 0); |
| 70 | + assert_eq!(v.binary_search(5).unwrap().original, 1); |
| 71 | + assert_eq!(v.binary_search(10).unwrap().original, 2); |
| 72 | + |
| 73 | + assert_eq!(v.binary_search(0).unwrap_err().original, 0); |
| 74 | + assert_eq!(v.binary_search(2).unwrap_err().original, 1); |
| 75 | + |
| 76 | + assert_eq!(v.binary_search(4).unwrap_err().original, 1); |
| 77 | + assert_eq!(v.binary_search(6).unwrap_err().original, 2); |
| 78 | + |
| 79 | + assert_eq!(v.binary_search(9).unwrap_err().original, 2); |
| 80 | + assert_eq!(v.binary_search(11).unwrap_err().original, 3); |
| 81 | +} |
0 commit comments