-
-
Notifications
You must be signed in to change notification settings - Fork 1.7k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
9 changed files
with
515 additions
and
16 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,141 @@ | ||
| use super::*; | ||
|
|
||
| pub fn join<T: PartialOrd + Copy + Debug>( | ||
| left: &[T], | ||
| right: &[T], | ||
| left_offset: IdxSize, | ||
| ) -> InnerJoinIds { | ||
| if left.is_empty() || right.is_empty() { | ||
| return (vec![], vec![]); | ||
| } | ||
|
|
||
| // * 1.5 because of possible duplicates | ||
| let cap = (std::cmp::min(left.len(), right.len()) as f32 * 1.5) as usize; | ||
| let mut out_rhs = Vec::with_capacity(cap); | ||
| let mut out_lhs = Vec::with_capacity(cap); | ||
|
|
||
| let mut right_idx = 0 as IdxSize; | ||
| // left array could start lower than right; | ||
| // left: [-1, 0, 1, 2], | ||
| // right: [1, 2, 3] | ||
| let first_right = right[0]; | ||
| let mut left_idx = left.partition_point(|v| v < &first_right) as IdxSize; | ||
|
|
||
| for &val_l in &left[left_idx as usize..] { | ||
| while let Some(&val_r) = right.get(right_idx as usize) { | ||
| // matching join key | ||
| if val_l == val_r { | ||
| out_lhs.push(left_idx + left_offset); | ||
| out_rhs.push(right_idx); | ||
| let current_idx = right_idx; | ||
|
|
||
| loop { | ||
| right_idx += 1; | ||
| match right.get(right_idx as usize) { | ||
| // rhs depleted | ||
| None => { | ||
| // reset right index because the next lhs value can be the same | ||
| right_idx = current_idx; | ||
| break; | ||
| } | ||
| Some(&val_r) => { | ||
| if val_l == val_r { | ||
| out_lhs.push(left_idx + left_offset); | ||
| out_rhs.push(right_idx); | ||
| } else { | ||
| // reset right index because the next lhs value can be the same | ||
| right_idx = current_idx; | ||
| break; | ||
| } | ||
| } | ||
| } | ||
| } | ||
| break; | ||
| } | ||
|
|
||
| // right is larger than left. | ||
| if val_r > val_l { | ||
| break; | ||
| } | ||
| // continue looping the right side | ||
| right_idx += 1; | ||
| } | ||
| // loop { | ||
| // match right.get(right_idx as usize) { | ||
| // Some(&val_r) => { | ||
| // // matching join key | ||
| // if val_l == val_r { | ||
| // out_lhs.push(left_idx + left_offset); | ||
| // out_rhs.push(right_idx); | ||
| // let current_idx = right_idx; | ||
| // | ||
| // loop { | ||
| // right_idx += 1; | ||
| // match right.get(right_idx as usize) { | ||
| // // rhs depleted | ||
| // None => { | ||
| // // reset right index because the next lhs value can be the same | ||
| // right_idx = current_idx; | ||
| // break; | ||
| // } | ||
| // Some(&val_r) => { | ||
| // if val_l == val_r { | ||
| // out_lhs.push(left_idx + left_offset); | ||
| // out_rhs.push(right_idx); | ||
| // } else { | ||
| // // reset right index because the next lhs value can be the same | ||
| // right_idx = current_idx; | ||
| // break; | ||
| // } | ||
| // } | ||
| // } | ||
| // } | ||
| // break; | ||
| // } | ||
| // | ||
| // // right is larger than left. | ||
| // if val_r > val_l { | ||
| // break; | ||
| // } | ||
| // // continue looping the right side | ||
| // right_idx += 1; | ||
| // } | ||
| // // we depleted the right array | ||
| // None => { | ||
| // break; | ||
| // } | ||
| // } | ||
| // } | ||
| left_idx += 1; | ||
| } | ||
| (out_lhs, out_rhs) | ||
| } | ||
|
|
||
| #[cfg(test)] | ||
| mod test { | ||
| use super::*; | ||
|
|
||
| #[test] | ||
| fn test_inner_join() { | ||
| let lhs = &[0, 1, 1, 2, 3, 5]; | ||
| let rhs = &[0, 1, 1, 3, 4]; | ||
|
|
||
| let (l_idx, r_idx) = join(lhs, rhs, 0); | ||
|
|
||
| assert_eq!(&l_idx, &[0, 1, 1, 2, 2, 4]); | ||
| assert_eq!(&r_idx, &[0, 1, 2, 1, 2, 3]); | ||
|
|
||
| let lhs = &[4, 4, 4, 4, 5, 6, 6, 7, 7, 7]; | ||
| let rhs = &[0, 1, 2, 3, 4, 4, 4, 6, 7, 7]; | ||
| let (l_idx, r_idx) = join(lhs, rhs, 0); | ||
|
|
||
| assert_eq!( | ||
| &l_idx, | ||
| &[0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 5, 6, 7, 7, 8, 8, 9, 9] | ||
| ); | ||
| assert_eq!( | ||
| &r_idx, | ||
| &[4, 5, 6, 4, 5, 6, 4, 5, 6, 4, 5, 6, 7, 7, 8, 9, 8, 9, 8, 9] | ||
| ); | ||
| } | ||
| } |
Oops, something went wrong.