rfgrep 0.5.0

Advanced recursive file grep utility with comprehensive file type classification - search, list, and analyze 153+ file formats with intelligent filtering and safety policies
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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246

use proptest::prelude::*;
use rfgrep::search_algorithms::{BoyerMoore, SimdSearch, SimpleSearch};

// Property: Search should always find the pattern if it exists
proptest! {
    #[test]
    fn test_simd_search_finds_pattern(pattern in "[a-z]{1,10}", text_prefix in "[a-z ]{0,100}", text_suffix in "[a-z ]{0,100}") {
        let text = format!("{}{}{}", text_prefix, pattern, text_suffix);
        let searcher = SimdSearch::new(&pattern);
        let results = searcher.search(&text, &pattern);
        prop_assert!(!results.is_empty(), "Pattern '{}' should be found in text", pattern);

        for &pos in &results {
            let found = &text[pos..pos + pattern.len()];
            prop_assert_eq!(found, &pattern, "Found text should match pattern");
        }
    }
}

proptest! {
    #[test]
    fn test_boyer_moore_finds_pattern(pattern in "[a-z]{2,10}", text_prefix in "[a-z ]{0,100}", text_suffix in "[a-z ]{0,100}") {
        let text = format!("{}{}{}", text_prefix, pattern, text_suffix);
        let searcher = BoyerMoore::new(&pattern);
        let results = searcher.search(&text, &pattern);

        if !results.is_empty() {
            for &pos in &results {
                if pos + pattern.len() <= text.len() {
                    let found = &text[pos..pos + pattern.len()];
                    prop_assert_eq!(found, &pattern, "Found text should match pattern");
                }
            }
        }
    }
}

// Property: Empty pattern should return empty results
proptest! {
    #[test]
    fn test_empty_pattern_returns_empty(text in ".*") {
        let searcher = SimdSearch::new("");
        let results = searcher.search(&text, "");
        prop_assert!(results.is_empty(), "Empty pattern should return no results");
    }
}

// Property: Pattern not in text should return empty results
proptest! {
    #[test]
    fn test_pattern_not_found(pattern in "XXXXX+", text in "[a-z ]{10,100}") {
        let searcher = SimdSearch::new(&pattern);
        let results = searcher.search(&text, &pattern);
        prop_assert!(results.is_empty(), "Pattern '{}' should not be found in text without it", pattern);
    }
}

// Property: Multiple occurrences should all be found
proptest! {
    #[test]
    fn test_multiple_occurrences(pattern in "[a-z]{3,8}", count in 2usize..10) {
        let parts: Vec<String> = (0..count + 1).map(|i| format!("filler{}", i)).collect();
        let mut text = String::new();

        for (i, part) in parts.iter().enumerate() {
            text.push_str(part);
            if i < count {
                // Use a space as a separator to prevent accidental pattern matches
                // that overlap with the filler text (e.g., filler0ifi where 'ifi'
                // might overlap with 'r0i').
                text.push(' ');
                text.push_str(&pattern);
                text.push(' ');
            }
        }

        let searcher = SimdSearch::new(&pattern);
        let results = searcher.search(&text, &pattern);

        prop_assert_eq!(results.len(), count, "Should find exactly {} occurrences", count);
    }
}

// Property: All algorithms should find the same matches
proptest! {
    #[test]
    fn test_algorithms_consistency(pattern in "[a-z]{2,8}", text in "[a-z ]{20,200}") {
        if !text.contains(&pattern) {
            return Ok(());
        }

        let simd = SimdSearch::new(&pattern);
        let boyer_moore = BoyerMoore::new(&pattern);
        let simple = SimpleSearch::new(&pattern);

        let simd_results = simd.search(&text, &pattern);
        let bm_results = boyer_moore.search(&text, &pattern);
        let simple_results = simple.search(&text, &pattern);

        prop_assert_eq!(simd_results.len(), bm_results.len(),
            "SIMD and Boyer-Moore should find same number of matches");
        prop_assert_eq!(simd_results.len(), simple_results.len(),
            "SIMD and Simple should find same number of matches");
        for i in 0..simd_results.len() {
            prop_assert_eq!(simd_results[i], bm_results[i],
                "Match positions should be identical");
            prop_assert_eq!(simd_results[i], simple_results[i],
                "Match positions should be identical");
        }
    }
}

// Property: Search should be case-sensitive by default
proptest! {
    #[test]
    fn test_case_sensitivity(lower in "[a-z]{3,8}") {
        let upper = lower.to_uppercase();
        let text = format!(">>> {} <<< {} >>>", lower, upper);

        let searcher = SimdSearch::new(&lower);
        let results = searcher.search(&text, &lower);

        prop_assert_eq!(results.len(), 1, "Should only find lowercase match");
    }
}

// Property: Overlapping patterns should be handled correctly
proptest! {
    #[test]
    fn test_overlapping_patterns(base in "[a-z]{3,5}") {
        let pattern = format!("{}{}", base, base);
        let text = format!("{}{}{}", base, base, base);

        let searcher = SimdSearch::new(&pattern);
        let results = searcher.search(&text, &pattern);

        prop_assert!(!results.is_empty(), "Should find pattern in overlapping text");

        for &pos in &results {
            if pos + pattern.len() <= text.len() {
                let found = &text[pos..pos + pattern.len()];
                prop_assert_eq!(found, &pattern, "Found text should match pattern");
            }
        }
    }
}

// Property: Search should handle special characters
proptest! {
    #[test]
    fn test_special_characters(pattern in "[a-z0-9]{1,10}") {
        let text = format!("start {} middle {} end", pattern, pattern);
        let searcher = SimdSearch::new(&pattern);
        let results = searcher.search(&text, &pattern);

        prop_assert!(results.len() >= 2, "Should find at least both explicit occurrences");
    }
}

// Property: Search at boundaries (start, end)
proptest! {
    #[test]
    fn test_boundary_search(pattern in "[a-z]{3,8}", middle in "[a-z ]{10,50}") {
        let text_start = format!("{}{}", pattern, middle);
        let searcher = SimdSearch::new(&pattern);
        let results = searcher.search(&text_start, &pattern);
        prop_assert!(!results.is_empty(), "Should find pattern at start");
        prop_assert_eq!(results[0], 0, "First match should be at position 0");

        let text_end = format!("{}{}", middle, pattern);
        let results = searcher.search(&text_end, &pattern);
        prop_assert!(!results.is_empty(), "Should find pattern at end");
    }
}

// Property: Large text should be handled efficiently
proptest! {
    #[test]
    fn test_large_text_handling(pattern in "[a-z]{4,8}") {
        let mut text = String::new();
        for i in 0..1000 {
            text.push_str(&format!("filler{} ", i));
            if i % 100 == 0 {
                text.push_str(&pattern);
                text.push(' ');
            }
        }

        let searcher = SimdSearch::new(&pattern);
        let results = searcher.search(&text, &pattern);

        prop_assert!(results.len() >= 9 && results.len() <= 11,
            "Should find around 10 occurrences in large text");
    }
}

// Property: Unicode handling
proptest! {
    #[test]
    fn test_unicode_patterns(pattern in "[a-zA-Z0-9]{3,8}") {
        let text = format!("Hello {} World {} 你好", pattern, pattern);
        let searcher = SimdSearch::new(&pattern);
        let results = searcher.search(&text, &pattern);

        prop_assert_eq!(results.len(), 2, "Should find both ASCII pattern occurrences");
    }
}

// Property: Repeated patterns
proptest! {
    #[test]
    fn test_repeated_patterns(pattern in "[a-z]{2,4}", repeats in 3usize..20) {
        let text = pattern.repeat(repeats);
        let searcher = SimdSearch::new(&pattern);
        let results = searcher.search(&text, &pattern);

        prop_assert!(results.len() >= repeats - 1,
            "Should find multiple occurrences of repeated pattern");
    }
}

// Property: Single character patterns
proptest! {
    #[test]
    fn test_single_char_pattern(text in "[a-z ]{20,100}") {
        let pattern = "x";
        let text_with_pattern = format!("{}{}{}", text, pattern, text);

        let searcher = SimdSearch::new(pattern);
        let results = searcher.search(&text_with_pattern, pattern);

        prop_assert!(!results.is_empty(), "Should find single character pattern");
    }
}

// Property: Pattern longer than text
proptest! {
    #[test]
    fn test_pattern_longer_than_text(short_text in "[a-z]{1,5}") {
        let long_pattern = "thisisaverylongpattern";
        let searcher = SimdSearch::new(long_pattern);
        let results = searcher.search(&short_text, long_pattern);

        prop_assert!(results.is_empty(), "Should not find pattern longer than text");
    }
}