moraine 0.7.0

A SlateDB-backed catalog for DuckLake
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155

use super::row_set::{FileRowSet, FileRowSetKind, PositionedRowSet};

#[test]
fn contiguous_rows_choose_a_range() {
    let rows = FileRowSet::from_sorted((10..1_010).collect()).unwrap();

    assert_eq!(rows.kind(), FileRowSetKind::Range);
    assert!(rows.contains(10));
    assert!(rows.contains(1_009));
    assert!(!rows.contains(1_010));
    assert!(rows.estimated_bytes() <= 32);
}

#[test]
fn moderately_sparse_rows_choose_roaring() {
    let rows = FileRowSet::from_sorted((0..100_000).map(|row| row * 10).collect()).unwrap();

    assert_eq!(rows.kind(), FileRowSetKind::Roaring);
    assert!(rows.contains(420));
    assert!(!rows.contains(421));
    assert!(rows.estimated_bytes() < 800_000);
}

#[test]
fn fragmented_rows_choose_the_predictable_sorted_form() {
    let rows = FileRowSet::from_sorted((0..10_000).map(|row| row << 16).collect()).unwrap();

    assert_eq!(rows.kind(), FileRowSetKind::Sorted);
    assert!(rows.contains(9_999 << 16));
    assert!(!rows.contains((9_999 << 16) + 1));
    assert_eq!(rows.estimated_bytes(), 80_000);
}

#[test]
fn matching_preserves_query_order_and_ignores_absent_rows() {
    let rows = FileRowSet::from_sorted(vec![3, 7, 11, 50]).unwrap();

    assert_eq!(rows.matching(&[1, 3, 7, 12, 50]), vec![3, 7, 50]);
}

#[test]
fn duplicate_or_unsorted_input_is_refused() {
    assert!(FileRowSet::from_sorted(vec![1, 1]).is_err());
    assert!(FileRowSet::from_sorted(vec![2, 1]).is_err());
}

#[test]
fn ascending_input_collapses_through_from_sorted_shapes() {
    let range = PositionedRowSet::from_file_order((10..1_010).collect()).unwrap();
    assert_eq!(range.rows.kind(), FileRowSetKind::Range);

    let roaring =
        PositionedRowSet::from_file_order((0..100_000).map(|row| row * 10).collect()).unwrap();
    assert_eq!(roaring.rows.kind(), FileRowSetKind::Roaring);

    let sorted =
        PositionedRowSet::from_file_order((0..10_000).map(|row| row << 16).collect()).unwrap();
    assert_eq!(sorted.rows.kind(), FileRowSetKind::Sorted);
}

#[test]
fn non_ascending_input_permutes_the_ascending_representation() {
    // Two ascending runs, as an UPDATE rewriting rows from two source files
    // would emit: file order is [30, 40, 10, 20], ascending order is
    // [10, 20, 30, 40] at file positions [2, 3, 0, 1].
    let rows = PositionedRowSet::from_file_order(vec![30, 40, 10, 20]).unwrap();

    assert_eq!(rows.rows.kind(), FileRowSetKind::Sorted);
    assert_eq!(
        rows.positions_of(&[30, 40, 10, 20, 999]),
        vec![Some(0), Some(1), Some(2), Some(3), None]
    );
}

#[test]
fn repeated_ids_retain_every_physical_position() {
    let rows = PositionedRowSet::from_file_order(vec![30, 10, 30]).unwrap();
    let mut positions = Vec::new();
    assert!(rows.visit_positions(30, |position| positions.push(position)));
    assert_eq!(positions, vec![0, 2]);
    assert!(!rows.visit_positions(999, |_| unreachable!()));
}

proptest::proptest! {
    #[test]
    fn repeated_positions_match_exhaustive_file_order(ids in proptest::collection::vec(0_u64..128, 0..512), requested in 0_u64..256) {
        let rows = PositionedRowSet::from_file_order(ids.clone()).unwrap();
        let mut actual = Vec::new();
        let found = rows.visit_positions(requested, |position| actual.push(position));
        let expected: Vec<_> = ids.iter().enumerate().filter(|(_, id)| **id == requested).map(|(position, _)| u64::try_from(position).unwrap()).collect();
        proptest::prop_assert_eq!(found, !expected.is_empty());
        proptest::prop_assert_eq!(actual, expected);
    }
}

#[test]
fn positions_of_range_is_arithmetic() {
    let rows = PositionedRowSet::from_file_order((100..110).collect()).unwrap();
    assert_eq!(rows.rows.kind(), FileRowSetKind::Range);

    assert_eq!(
        rows.positions_of(&[100, 105, 109, 110]),
        vec![Some(0), Some(5), Some(9), None]
    );
}

#[test]
fn positions_of_ascending_roaring_uses_rank() {
    let rows =
        PositionedRowSet::from_file_order((0..100_000).map(|row| row * 10).collect()).unwrap();
    assert_eq!(rows.rows.kind(), FileRowSetKind::Roaring);

    assert_eq!(
        rows.positions_of(&[0, 10, 420, 421]),
        vec![Some(0), Some(1), Some(42), None]
    );
}

#[test]
fn positions_of_ascending_sorted_uses_binary_search() {
    let rows =
        PositionedRowSet::from_file_order((0..10_000).map(|row| row << 16).collect()).unwrap();
    assert_eq!(rows.rows.kind(), FileRowSetKind::Sorted);

    assert_eq!(
        rows.positions_of(&[0, 1 << 16, (9_999 << 16) + 1]),
        vec![Some(0), Some(1), None]
    );
}

/// A permutation over a Roaring-shaped set: sparse ascending ids rewritten
/// out of file order still answer positions correctly.
#[test]
fn positions_of_permuted_roaring_uses_rank_then_permutation() {
    let sorted_sparse: Vec<u64> = (0..100_000).map(|row| row * 10).collect();
    // Swap the first two ids' file positions: file order now disagrees with
    // ascending order only at the front.
    let mut file_order = sorted_sparse.clone();
    file_order.swap(0, 1);

    let rows = PositionedRowSet::from_file_order(file_order).unwrap();
    assert_eq!(rows.rows.kind(), FileRowSetKind::Roaring);

    assert_eq!(
        rows.positions_of(&[0, 10, 20]),
        vec![Some(1), Some(0), Some(2)]
    );
}

#[test]
fn positions_of_absent_row_is_none() {
    let rows = PositionedRowSet::from_file_order(vec![30, 10, 20]).unwrap();

    assert_eq!(rows.positions_of(&[999]), vec![None]);
}