@@ -4,7 +4,7 @@ use super::{Relation, Variable};
4
4
use std:: cell:: Ref ;
5
5
use std:: ops:: Deref ;
6
6
7
- pub trait JoinInput < ' me , Tuple : Ord > : Copy {
7
+ pub ( crate ) trait JoinInput < ' me , Tuple : Ord > : Copy {
8
8
type RecentTuples : Deref < Target = Relation < Tuple > > ;
9
9
type StableTuples : Deref < Target = Vec < Relation < Tuple > > > ;
10
10
@@ -25,7 +25,7 @@ impl<'me, Tuple: Ord> JoinInput<'me, Tuple> for &'me Variable<Tuple> {
25
25
}
26
26
}
27
27
28
- pub fn join_into < ' me , Key : Ord , Val1 : Ord , Val2 : Ord , Result : Ord > (
28
+ pub ( crate ) fn join_into < ' me , Key : Ord , Val1 : Ord , Val2 : Ord , Result : Ord > (
29
29
input1 : impl JoinInput < ' me , ( Key , Val1 ) > ,
30
30
input2 : impl JoinInput < ' me , ( Key , Val2 ) > ,
31
31
output : & Variable < Result > ,
@@ -56,7 +56,7 @@ pub fn join_into<'me, Key: Ord, Val1: Ord, Val2: Ord, Result: Ord>(
56
56
}
57
57
58
58
/// Moves all recent tuples from `input1` that are not present in `input2` into `output`.
59
- pub fn antijoin_into < Key : Ord , Val : Ord , Result : Ord > (
59
+ pub ( crate ) fn antijoin_into < Key : Ord , Val : Ord , Result : Ord > (
60
60
input1 : & Variable < ( Key , Val ) > ,
61
61
input2 : & Relation < Key > ,
62
62
output : & Variable < Result > ,
@@ -114,7 +114,7 @@ fn join_helper<K: Ord, V1, V2>(
114
114
}
115
115
}
116
116
117
- pub fn gallop < T > ( mut slice : & [ T ] , mut cmp : impl FnMut ( & T ) -> bool ) -> & [ T ] {
117
+ pub ( crate ) fn gallop < T > ( mut slice : & [ T ] , mut cmp : impl FnMut ( & T ) -> bool ) -> & [ T ] {
118
118
// if empty slice, or already >= element, return
119
119
if !slice. is_empty ( ) && cmp ( & slice[ 0 ] ) {
120
120
let mut step = 1 ;
0 commit comments