@@ -22,7 +22,7 @@ fn reachable_with_var_join(edges: &[(u32, u32)]) -> Relation<(u32, u32)> {
22
22
23
23
while iteration. changed ( ) {
24
24
// reachable(N1, N3) :- edges(N1, N2), reachable(N2, N3).
25
- reachable. from_join ( & reachable, & edges_by_successor, |_: ( u32 , ) , n3, n1| ( n1, n3) ) ;
25
+ reachable. from_join_first ( & reachable, & edges_by_successor, |_, n3, n1| ( n1, n3) ) ;
26
26
}
27
27
28
28
reachable. complete ( )
@@ -41,7 +41,7 @@ fn reachable_with_relation_join(edges: &[(u32, u32)]) -> Relation<(u32, u32)> {
41
41
42
42
while iteration. changed ( ) {
43
43
// reachable(N1, N3) :- edges(N1, N2), reachable(N2, N3).
44
- reachable. from_join ( & reachable, & edges_by_successor, |_: ( u32 , ) , n3, n1| ( n1, n3) ) ;
44
+ reachable. from_join_first ( & reachable, & edges_by_successor, |_, n3, n1| ( n1, n3) ) ;
45
45
}
46
46
47
47
reachable. complete ( )
@@ -86,7 +86,7 @@ fn sum_join_via_var(
86
86
87
87
while iteration. changed ( ) {
88
88
// output(K1, V1 * 100 + V2) :- input1(K1, V1), input2(K1, V2).
89
- output. from_join ( & input1, & input2, |( k1 , ) , v1, v2| ( k1, v1 * 100 + v2) ) ;
89
+ output. from_join_first ( & input1, & input2, |k1 , v1, v2| ( k1, v1 * 100 + v2) ) ;
90
90
}
91
91
92
92
output. complete ( )
@@ -100,7 +100,7 @@ fn sum_join_via_relation(
100
100
) -> Relation < ( u32 , u32 ) > {
101
101
let input1: Relation < ( u32 , u32 ) > = input1_slice. iter ( ) . collect ( ) ;
102
102
let input2: Relation < ( u32 , u32 ) > = input2_slice. iter ( ) . collect ( ) ;
103
- Relation :: from_join ( & input1, & input2, |( k1 , ) , v1, v2| ( k1, v1 * 100 + v2) )
103
+ Relation :: from_join_first ( & input1, & input2, |k1 , v1, v2| ( k1, v1 * 100 + v2) )
104
104
}
105
105
106
106
proptest ! {
0 commit comments