stoolap 0.4.0

High-performance embedded SQL database with MVCC, time-travel queries, and full ACID compliance
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

// Copyright 2025 Stoolap Contributors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

//! ROW_NUMBER window function

use crate::core::{Result, Value};
use crate::functions::{
    FunctionDataType, FunctionInfo, FunctionSignature, FunctionType, WindowFunction,
};

/// ROW_NUMBER window function
///
/// Returns the sequential row number within the current partition, starting at 1.
/// Unlike RANK(), ROW_NUMBER() assigns consecutive numbers even for equal values.
#[derive(Default)]
pub struct RowNumberFunction;

impl WindowFunction for RowNumberFunction {
    fn name(&self) -> &str {
        "ROW_NUMBER"
    }

    fn info(&self) -> FunctionInfo {
        FunctionInfo::new(
            "ROW_NUMBER",
            FunctionType::Window,
            "Returns the sequential row number within the current partition",
            FunctionSignature::new(FunctionDataType::Integer, vec![], 0, 0),
        )
    }

    fn process(
        &self,
        _partition: &[Value],
        _order_by: &[Value],
        current_row: usize,
    ) -> Result<Value> {
        // ROW_NUMBER returns the 1-based position within the partition
        // current_row is 0-based, so we add 1
        Ok(Value::Integer((current_row + 1) as i64))
    }

    fn clone_box(&self) -> Box<dyn WindowFunction> {
        Box::new(RowNumberFunction)
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_row_number_basic() {
        let f = RowNumberFunction;

        // Test with empty partition (still works, just uses current_row)
        let partition = vec![];
        let order_by = vec![];

        assert_eq!(
            f.process(&partition, &order_by, 0).unwrap(),
            Value::Integer(1)
        );
        assert_eq!(
            f.process(&partition, &order_by, 1).unwrap(),
            Value::Integer(2)
        );
        assert_eq!(
            f.process(&partition, &order_by, 9).unwrap(),
            Value::Integer(10)
        );
    }

    #[test]
    fn test_row_number_with_partition() {
        let f = RowNumberFunction;

        // ROW_NUMBER doesn't actually use partition values,
        // it just uses the current_row position
        let partition = vec![
            Value::Integer(100),
            Value::Integer(200),
            Value::Integer(300),
        ];
        let order_by = vec![];

        assert_eq!(
            f.process(&partition, &order_by, 0).unwrap(),
            Value::Integer(1)
        );
        assert_eq!(
            f.process(&partition, &order_by, 1).unwrap(),
            Value::Integer(2)
        );
        assert_eq!(
            f.process(&partition, &order_by, 2).unwrap(),
            Value::Integer(3)
        );
    }

    #[test]
    fn test_row_number_info() {
        let f = RowNumberFunction;
        let info = f.info();
        assert_eq!(info.name(), "ROW_NUMBER");
        assert_eq!(info.function_type(), FunctionType::Window);
    }
}