unimorph-core 0.1.5

Core library for UniMorph morphological data
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
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
//! SQLite-based storage for UniMorph data.
//!
//! The store provides high-performance lookups for morphological data using
//! SQLite with B-tree indexes on lemma and form columns.
//!
//! # Schema
//!
//! ```sql
//! CREATE TABLE entries (
//!     id INTEGER PRIMARY KEY,
//!     lang TEXT NOT NULL,
//!     lemma TEXT NOT NULL,
//!     form TEXT NOT NULL,
//!     features TEXT NOT NULL
//! );
//!
//! CREATE INDEX idx_lang_lemma ON entries(lang, lemma);
//! CREATE INDEX idx_lang_form ON entries(lang, form);
//!
//! CREATE TABLE meta (
//!     lang TEXT PRIMARY KEY,
//!     entry_count INTEGER,
//!     unique_lemmas INTEGER,
//!     unique_forms INTEGER,
//!     unique_features INTEGER,
//!     imported_at TEXT,
//!     source_url TEXT,
//!     commit_sha TEXT
//! );
//! ```

use std::path::Path;

use rusqlite::{Connection, params};
use tracing::{debug, instrument};

use crate::query::QueryBuilder;
use crate::{DatasetStats, Entry, FeatureBundle, LangCode, Result};

/// SQLite-based store for UniMorph data.
///
/// All languages are stored in a single database file with a `lang` column
/// to distinguish them. This simplifies management and enables cross-language
/// queries.
pub struct Store {
    pub(crate) conn: Connection,
}

impl Store {
    /// Open or create a store at the given path.
    ///
    /// If the database doesn't exist, it will be created with the required schema.
    /// If it exists, the schema will be verified/upgraded as needed.
    pub fn open<P: AsRef<Path>>(path: P) -> Result<Self> {
        let conn = Connection::open(path)?;
        let store = Self { conn };
        store.init_schema()?;
        store.set_pragmas()?;
        Ok(store)
    }

    /// Create an in-memory store (useful for testing).
    pub fn in_memory() -> Result<Self> {
        let conn = Connection::open_in_memory()?;
        let store = Self { conn };
        store.init_schema()?;
        store.set_pragmas()?;
        Ok(store)
    }

    /// Set SQLite pragmas for optimal read-heavy workload.
    fn set_pragmas(&self) -> Result<()> {
        self.conn.execute_batch(
            "
            PRAGMA journal_mode = WAL;
            PRAGMA synchronous = NORMAL;
            PRAGMA cache_size = -64000;
            PRAGMA mmap_size = 268435456;
            PRAGMA temp_store = MEMORY;
            ",
        )?;
        Ok(())
    }

    /// Initialize the database schema.
    fn init_schema(&self) -> Result<()> {
        self.conn.execute_batch(
            "
            CREATE TABLE IF NOT EXISTS entries (
                id INTEGER PRIMARY KEY,
                lang TEXT NOT NULL,
                lemma TEXT NOT NULL,
                form TEXT NOT NULL,
                features TEXT NOT NULL
            );

            CREATE INDEX IF NOT EXISTS idx_lang_lemma ON entries(lang, lemma);
            CREATE INDEX IF NOT EXISTS idx_lang_form ON entries(lang, form);

            CREATE TABLE IF NOT EXISTS meta (
                lang TEXT PRIMARY KEY,
                entry_count INTEGER NOT NULL,
                unique_lemmas INTEGER NOT NULL,
                unique_forms INTEGER NOT NULL,
                unique_features INTEGER NOT NULL,
                imported_at TEXT NOT NULL,
                source_url TEXT,
                commit_sha TEXT
            );
            ",
        )?;
        Ok(())
    }

    /// Import entries for a language, replacing any existing data.
    ///
    /// This computes and caches statistics in the `meta` table.
    #[instrument(level = "debug", skip(self, entries), fields(entry_count = entries.len()))]
    pub fn import(
        &mut self,
        lang: &LangCode,
        entries: &[Entry],
        source_url: Option<&str>,
        commit_sha: Option<&str>,
    ) -> Result<()> {
        let tx = self.conn.transaction()?;

        // Delete existing entries for this language
        tx.execute("DELETE FROM entries WHERE lang = ?", params![lang.as_str()])?;
        tx.execute("DELETE FROM meta WHERE lang = ?", params![lang.as_str()])?;

        // Insert new entries
        {
            let mut stmt = tx
                .prepare("INSERT INTO entries (lang, lemma, form, features) VALUES (?, ?, ?, ?)")?;

            for entry in entries {
                stmt.execute(params![
                    lang.as_str(),
                    &entry.lemma,
                    &entry.form,
                    entry.features.as_str(),
                ])?;
            }
        }

        // Compute and store stats
        let stats = DatasetStats::from_entries(entries);
        let now = chrono_lite_now();

        tx.execute(
            "INSERT INTO meta (lang, entry_count, unique_lemmas, unique_forms, unique_features, imported_at, source_url, commit_sha)
             VALUES (?, ?, ?, ?, ?, ?, ?, ?)",
            params![
                lang.as_str(),
                stats.total_entries as i64,
                stats.unique_lemmas as i64,
                stats.unique_forms as i64,
                stats.unique_features as i64,
                now,
                source_url,
                commit_sha,
            ],
        )?;

        tx.commit()?;
        Ok(())
    }

    /// Look up all inflected forms of a lemma (dictionary form).
    ///
    /// This is the "inflect" operation: given a lemma like "parlare",
    /// return all its forms (parlo, parli, parla, ...).
    #[instrument(level = "debug", skip(self))]
    pub fn inflect(&self, lang: &str, lemma: &str) -> Result<Vec<Entry>> {
        let mut stmt = self
            .conn
            .prepare("SELECT lemma, form, features FROM entries WHERE lang = ? AND lemma = ?")?;

        let entries = stmt
            .query_map(params![lang, lemma], |row| {
                Ok((
                    row.get::<_, String>(0)?,
                    row.get::<_, String>(1)?,
                    row.get::<_, String>(2)?,
                ))
            })?
            .filter_map(|r| r.ok())
            .filter_map(|(lemma, form, features)| {
                FeatureBundle::new(&features)
                    .ok()
                    .map(|fb| Entry::new(lemma, form, fb))
            })
            .collect();

        Ok(entries)
    }

    /// Look up all lemmas that produce a given surface form.
    ///
    /// This is the "analyze" operation: given a form like "parlo",
    /// return all possible analyses (parlare -> parlo, ...).
    #[instrument(level = "debug", skip(self))]
    pub fn analyze(&self, lang: &str, form: &str) -> Result<Vec<Entry>> {
        let mut stmt = self
            .conn
            .prepare("SELECT lemma, form, features FROM entries WHERE lang = ? AND form = ?")?;

        let entries = stmt
            .query_map(params![lang, form], |row| {
                Ok((
                    row.get::<_, String>(0)?,
                    row.get::<_, String>(1)?,
                    row.get::<_, String>(2)?,
                ))
            })?
            .filter_map(|r| r.ok())
            .filter_map(|(lemma, form, features)| {
                FeatureBundle::new(&features)
                    .ok()
                    .map(|fb| Entry::new(lemma, form, fb))
            })
            .collect();

        Ok(entries)
    }

    /// Get cached statistics for a language.
    ///
    /// Returns `None` if the language is not in the store.
    pub fn stats(&self, lang: &str) -> Result<Option<DatasetStats>> {
        let mut stmt = self.conn.prepare(
            "SELECT entry_count, unique_lemmas, unique_forms, unique_features
             FROM meta WHERE lang = ?",
        )?;

        let result = stmt.query_row(params![lang], |row| {
            Ok(DatasetStats::new(
                row.get::<_, i64>(0)? as usize,
                row.get::<_, i64>(1)? as usize,
                row.get::<_, i64>(2)? as usize,
                row.get::<_, i64>(3)? as usize,
            ))
        });

        match result {
            Ok(stats) => Ok(Some(stats)),
            Err(rusqlite::Error::QueryReturnedNoRows) => Ok(None),
            Err(e) => Err(e.into()),
        }
    }

    /// List all languages in the store.
    pub fn languages(&self) -> Result<Vec<LangCode>> {
        let mut stmt = self.conn.prepare("SELECT lang FROM meta ORDER BY lang")?;

        let langs = stmt
            .query_map([], |row| row.get::<_, String>(0))?
            .filter_map(|r| r.ok())
            .filter_map(|s| LangCode::new(&s).ok())
            .collect();

        Ok(langs)
    }

    /// Check if a language is in the store.
    pub fn has_language(&self, lang: &str) -> Result<bool> {
        let mut stmt = self.conn.prepare("SELECT 1 FROM meta WHERE lang = ?")?;
        let exists = stmt.exists(params![lang])?;
        Ok(exists)
    }

    /// Create a query builder for the given language.
    ///
    /// The query builder provides a fluent API for constructing complex queries.
    ///
    /// # Example
    ///
    /// ```ignore
    /// let forms = store.query("ita")
    ///     .lemma("parlare")
    ///     .features_contain(&["IND", "PRS"])
    ///     .limit(10)
    ///     .execute()?;
    /// ```
    pub fn query(&self, lang: &str) -> QueryBuilder<'_> {
        QueryBuilder::new(&self.conn, lang)
    }

    /// Delete a language from the store.
    pub fn delete_language(&mut self, lang: &str) -> Result<()> {
        let tx = self.conn.transaction()?;
        tx.execute("DELETE FROM entries WHERE lang = ?", params![lang])?;
        tx.execute("DELETE FROM meta WHERE lang = ?", params![lang])?;
        tx.commit()?;
        Ok(())
    }

    /// Search for entries matching a feature pattern.
    ///
    /// The pattern uses `;` as separator and `*` as wildcard.
    /// This is slower than lemma/form lookups as it requires scanning.
    ///
    /// For better performance on large datasets, consider using
    /// `inflect` or `analyze` first, then filtering the results.
    #[instrument(level = "debug", skip(self))]
    pub fn search_features(&self, lang: &str, pattern: &str) -> Result<Vec<Entry>> {
        debug!(pattern, "searching features with pattern");
        // Convert pattern to SQL LIKE pattern
        // V;IND;*;1;* -> V;IND;%;1;%
        let sql_pattern = pattern.replace('*', "%");

        let mut stmt = self.conn.prepare(
            "SELECT lemma, form, features FROM entries
             WHERE lang = ? AND features LIKE ?",
        )?;

        let entries: Vec<Entry> = stmt
            .query_map(params![lang, sql_pattern], |row| {
                Ok((
                    row.get::<_, String>(0)?,
                    row.get::<_, String>(1)?,
                    row.get::<_, String>(2)?,
                ))
            })?
            .filter_map(|r| r.ok())
            .filter_map(|(lemma, form, features)| {
                FeatureBundle::new(&features)
                    .ok()
                    .map(|fb| Entry::new(lemma, form, fb))
            })
            // Double-check with proper pattern matching (LIKE is approximate)
            .filter(|e| e.features.matches_pattern(pattern))
            .collect();

        Ok(entries)
    }

    /// Get the import timestamp for a language.
    pub fn imported_at(&self, lang: &str) -> Result<Option<String>> {
        let mut stmt = self
            .conn
            .prepare("SELECT imported_at FROM meta WHERE lang = ?")?;

        let result = stmt.query_row(params![lang], |row| row.get::<_, String>(0));

        match result {
            Ok(ts) => Ok(Some(ts)),
            Err(rusqlite::Error::QueryReturnedNoRows) => Ok(None),
            Err(e) => Err(e.into()),
        }
    }

    /// Get the commit SHA for a language (if stored).
    pub fn commit_sha(&self, lang: &str) -> Result<Option<String>> {
        let mut stmt = self
            .conn
            .prepare("SELECT commit_sha FROM meta WHERE lang = ?")?;

        let result = stmt.query_row(params![lang], |row| row.get::<_, Option<String>>(0));

        match result {
            Ok(sha) => Ok(sha),
            Err(rusqlite::Error::QueryReturnedNoRows) => Ok(None),
            Err(e) => Err(e.into()),
        }
    }

    /// Randomly sample entries from a language dataset.
    ///
    /// Uses SQLite's random() for efficient sampling without loading
    /// the entire dataset into memory.
    ///
    /// # Arguments
    ///
    /// * `lang` - Language code
    /// * `n` - Number of entries to sample
    /// * `seed` - Optional seed for reproducible sampling
    #[instrument(level = "debug", skip(self))]
    pub fn sample(&self, lang: &str, n: usize, seed: Option<u64>) -> Result<Vec<Entry>> {
        // If seed is provided, we need deterministic sampling
        // SQLite's random() isn't seedable, so we use a different approach
        if let Some(seed) = seed {
            self.sample_seeded(lang, n, seed)
        } else {
            self.sample_random(lang, n)
        }
    }

    /// Random sampling using SQLite's random() function.
    fn sample_random(&self, lang: &str, n: usize) -> Result<Vec<Entry>> {
        let mut stmt = self.conn.prepare(
            "SELECT lemma, form, features FROM entries
             WHERE lang = ?
             ORDER BY random()
             LIMIT ?",
        )?;

        let entries = stmt
            .query_map(params![lang, n as i64], |row| {
                Ok((
                    row.get::<_, String>(0)?,
                    row.get::<_, String>(1)?,
                    row.get::<_, String>(2)?,
                ))
            })?
            .filter_map(|r| r.ok())
            .filter_map(|(lemma, form, features)| {
                FeatureBundle::new(&features)
                    .ok()
                    .map(|fb| Entry::new(lemma, form, fb))
            })
            .collect();

        Ok(entries)
    }

    /// Deterministic sampling using a seed.
    ///
    /// Uses a simple hash-based approach: hash(id + seed) and take top N.
    fn sample_seeded(&self, lang: &str, n: usize, seed: u64) -> Result<Vec<Entry>> {
        // Get total count first
        let count: i64 = self.conn.query_row(
            "SELECT COUNT(*) FROM entries WHERE lang = ?",
            params![lang],
            |row| row.get(0),
        )?;

        if count == 0 {
            return Ok(vec![]);
        }

        // For seeded sampling, we fetch IDs, shuffle deterministically, then fetch entries
        let mut stmt = self.conn.prepare("SELECT id FROM entries WHERE lang = ?")?;

        let mut ids: Vec<i64> = stmt
            .query_map(params![lang], |row| row.get::<_, i64>(0))?
            .filter_map(|r| r.ok())
            .collect();

        // Deterministic shuffle using seed
        use std::collections::hash_map::DefaultHasher;
        use std::hash::{Hash, Hasher};

        ids.sort_by(|a, b| {
            let mut ha = DefaultHasher::new();
            (*a as u64).hash(&mut ha);
            seed.hash(&mut ha);
            let hash_a = ha.finish();

            let mut hb = DefaultHasher::new();
            (*b as u64).hash(&mut hb);
            seed.hash(&mut hb);
            let hash_b = hb.finish();

            hash_a.cmp(&hash_b)
        });

        ids.truncate(n);

        // Fetch the selected entries
        if ids.is_empty() {
            return Ok(vec![]);
        }

        let placeholders: String = ids.iter().map(|_| "?").collect::<Vec<_>>().join(",");
        let query = format!(
            "SELECT lemma, form, features FROM entries WHERE id IN ({})",
            placeholders
        );

        let mut stmt = self.conn.prepare(&query)?;

        let entries = stmt
            .query_map(rusqlite::params_from_iter(ids.iter()), |row| {
                Ok((
                    row.get::<_, String>(0)?,
                    row.get::<_, String>(1)?,
                    row.get::<_, String>(2)?,
                ))
            })?
            .filter_map(|r| r.ok())
            .filter_map(|(lemma, form, features)| {
                FeatureBundle::new(&features)
                    .ok()
                    .map(|fb| Entry::new(lemma, form, fb))
            })
            .collect();

        Ok(entries)
    }

    /// Sample complete paradigms (all forms of selected lemmas).
    ///
    /// This is useful for morphological inflection tasks where you want
    /// complete paradigms in your sample rather than random individual forms.
    ///
    /// # Arguments
    ///
    /// * `lang` - Language code
    /// * `n` - Approximate number of entries (samples lemmas until reaching n)
    /// * `seed` - Optional seed for reproducible sampling
    #[instrument(level = "debug", skip(self))]
    pub fn sample_by_lemma(&self, lang: &str, n: usize, seed: Option<u64>) -> Result<Vec<Entry>> {
        // Get all unique lemmas
        let mut stmt = self
            .conn
            .prepare("SELECT DISTINCT lemma FROM entries WHERE lang = ?")?;

        let mut lemmas: Vec<String> = stmt
            .query_map(params![lang], |row| row.get::<_, String>(0))?
            .filter_map(|r| r.ok())
            .collect();

        if lemmas.is_empty() {
            return Ok(vec![]);
        }

        // Shuffle lemmas (deterministically if seed provided)
        if let Some(seed) = seed {
            use std::collections::hash_map::DefaultHasher;
            use std::hash::{Hash, Hasher};

            lemmas.sort_by(|a, b| {
                let mut ha = DefaultHasher::new();
                a.hash(&mut ha);
                seed.hash(&mut ha);
                let hash_a = ha.finish();

                let mut hb = DefaultHasher::new();
                b.hash(&mut hb);
                seed.hash(&mut hb);
                let hash_b = hb.finish();

                hash_a.cmp(&hash_b)
            });
        } else {
            // Random shuffle
            use std::collections::hash_map::DefaultHasher;
            use std::hash::{Hash, Hasher};
            use std::time::SystemTime;

            let random_seed = SystemTime::now()
                .duration_since(SystemTime::UNIX_EPOCH)
                .unwrap_or_default()
                .as_nanos() as u64;

            lemmas.sort_by(|a, b| {
                let mut ha = DefaultHasher::new();
                a.hash(&mut ha);
                random_seed.hash(&mut ha);
                let hash_a = ha.finish();

                let mut hb = DefaultHasher::new();
                b.hash(&mut hb);
                random_seed.hash(&mut hb);
                let hash_b = hb.finish();

                hash_a.cmp(&hash_b)
            });
        }

        // Collect entries until we have enough
        let mut entries = Vec::new();
        for lemma in lemmas {
            if entries.len() >= n {
                break;
            }
            let mut lemma_entries = self.inflect(lang, &lemma)?;
            entries.append(&mut lemma_entries);
        }

        Ok(entries)
    }
}

/// Simple timestamp without pulling in chrono.
fn chrono_lite_now() -> String {
    use std::time::SystemTime;
    let duration = SystemTime::now()
        .duration_since(SystemTime::UNIX_EPOCH)
        .unwrap_or_default();

    // Convert to ISO 8601-ish format
    let secs = duration.as_secs();
    format!("{}", secs)
}

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

    fn sample_entries() -> Vec<Entry> {
        vec![
            Entry::parse_line("parlare\tparlo\tV;IND;PRS;1;SG", 1).unwrap(),
            Entry::parse_line("parlare\tparli\tV;IND;PRS;2;SG", 2).unwrap(),
            Entry::parse_line("parlare\tparla\tV;IND;PRS;3;SG", 3).unwrap(),
            Entry::parse_line("essere\tsono\tV;IND;PRS;1;SG", 4).unwrap(),
            Entry::parse_line("essere\tsei\tV;IND;PRS;2;SG", 5).unwrap(),
            Entry::parse_line("essere\tè\tV;IND;PRS;3;SG", 6).unwrap(),
        ]
    }

    #[test]
    fn open_in_memory() {
        let store = Store::in_memory().unwrap();
        assert!(store.languages().unwrap().is_empty());
    }

    #[test]
    fn import_and_stats() {
        let mut store = Store::in_memory().unwrap();
        let lang: LangCode = "ita".parse().unwrap();
        let entries = sample_entries();

        store.import(&lang, &entries, None, None).unwrap();

        let stats = store.stats("ita").unwrap().unwrap();
        assert_eq!(stats.total_entries, 6);
        assert_eq!(stats.unique_lemmas, 2);
        assert_eq!(stats.unique_forms, 6);
    }

    #[test]
    fn inflect() {
        let mut store = Store::in_memory().unwrap();
        let lang: LangCode = "ita".parse().unwrap();
        store.import(&lang, &sample_entries(), None, None).unwrap();

        let forms = store.inflect("ita", "parlare").unwrap();
        assert_eq!(forms.len(), 3);
        assert!(forms.iter().any(|e| e.form == "parlo"));
        assert!(forms.iter().any(|e| e.form == "parli"));
        assert!(forms.iter().any(|e| e.form == "parla"));
    }

    #[test]
    fn analyze() {
        let mut store = Store::in_memory().unwrap();
        let lang: LangCode = "ita".parse().unwrap();
        store.import(&lang, &sample_entries(), None, None).unwrap();

        let analyses = store.analyze("ita", "sono").unwrap();
        assert_eq!(analyses.len(), 1);
        assert_eq!(analyses[0].lemma, "essere");
    }

    #[test]
    fn languages() {
        let mut store = Store::in_memory().unwrap();

        let ita: LangCode = "ita".parse().unwrap();
        let deu: LangCode = "deu".parse().unwrap();

        store.import(&ita, &sample_entries(), None, None).unwrap();
        store.import(&deu, &[], None, None).unwrap();

        let langs = store.languages().unwrap();
        assert_eq!(langs.len(), 2);
        assert!(langs.iter().any(|l| l.as_str() == "deu"));
        assert!(langs.iter().any(|l| l.as_str() == "ita"));
    }

    #[test]
    fn has_language() {
        let mut store = Store::in_memory().unwrap();
        let lang: LangCode = "ita".parse().unwrap();

        assert!(!store.has_language("ita").unwrap());
        store.import(&lang, &sample_entries(), None, None).unwrap();
        assert!(store.has_language("ita").unwrap());
    }

    #[test]
    fn delete_language() {
        let mut store = Store::in_memory().unwrap();
        let lang: LangCode = "ita".parse().unwrap();

        store.import(&lang, &sample_entries(), None, None).unwrap();
        assert!(store.has_language("ita").unwrap());

        store.delete_language("ita").unwrap();
        assert!(!store.has_language("ita").unwrap());
    }

    #[test]
    fn search_features() {
        let mut store = Store::in_memory().unwrap();
        let lang: LangCode = "ita".parse().unwrap();
        store.import(&lang, &sample_entries(), None, None).unwrap();

        // Search for first person singular verbs
        let results = store.search_features("ita", "V;IND;PRS;1;SG").unwrap();
        assert_eq!(results.len(), 2); // parlo, sono

        // Search with wildcard
        let results = store.search_features("ita", "V;IND;PRS;*;SG").unwrap();
        assert_eq!(results.len(), 6); // all entries
    }

    #[test]
    fn reimport_replaces_data() {
        let mut store = Store::in_memory().unwrap();
        let lang: LangCode = "ita".parse().unwrap();

        store.import(&lang, &sample_entries(), None, None).unwrap();
        assert_eq!(store.stats("ita").unwrap().unwrap().total_entries, 6);

        // Import fewer entries
        let fewer = vec![Entry::parse_line("parlare\tparlo\tV;IND;PRS;1;SG", 1).unwrap()];
        store.import(&lang, &fewer, None, None).unwrap();
        assert_eq!(store.stats("ita").unwrap().unwrap().total_entries, 1);
    }

    #[test]
    fn sample_random() {
        let mut store = Store::in_memory().unwrap();
        let lang: LangCode = "ita".parse().unwrap();
        store.import(&lang, &sample_entries(), None, None).unwrap();

        let sampled = store.sample("ita", 3, None).unwrap();
        assert_eq!(sampled.len(), 3);

        // Sampling more than available returns all
        let sampled = store.sample("ita", 100, None).unwrap();
        assert_eq!(sampled.len(), 6);
    }

    #[test]
    fn sample_seeded_is_deterministic() {
        let mut store = Store::in_memory().unwrap();
        let lang: LangCode = "ita".parse().unwrap();
        store.import(&lang, &sample_entries(), None, None).unwrap();

        let sample1 = store.sample("ita", 3, Some(42)).unwrap();
        let sample2 = store.sample("ita", 3, Some(42)).unwrap();

        // Same seed should produce same results
        assert_eq!(sample1.len(), sample2.len());
        for (e1, e2) in sample1.iter().zip(sample2.iter()) {
            assert_eq!(e1.lemma, e2.lemma);
            assert_eq!(e1.form, e2.form);
        }

        // Different seed should (likely) produce different results
        let sample3 = store.sample("ita", 3, Some(99)).unwrap();
        let different = sample1
            .iter()
            .zip(sample3.iter())
            .any(|(e1, e2)| e1.form != e2.form);
        assert!(
            different,
            "Different seeds should produce different samples"
        );
    }

    #[test]
    fn sample_by_lemma() {
        let mut store = Store::in_memory().unwrap();
        let lang: LangCode = "ita".parse().unwrap();
        store.import(&lang, &sample_entries(), None, None).unwrap();

        // Sample ~3 entries by lemma - should get complete paradigm
        let sampled = store.sample_by_lemma("ita", 3, Some(42)).unwrap();

        // Should have at least 3 entries
        assert!(sampled.len() >= 3);

        // All entries should be from the same lemma (since we asked for ~3 and each lemma has 3)
        let lemmas: std::collections::HashSet<_> = sampled.iter().map(|e| &e.lemma).collect();
        assert!(
            lemmas.len() <= 2,
            "Should have entries from 1-2 lemmas, got {}",
            lemmas.len()
        );
    }

    #[test]
    fn sample_empty_language() {
        let store = Store::in_memory().unwrap();

        let sampled = store.sample("xxx", 10, None).unwrap();
        assert!(sampled.is_empty());

        let sampled = store.sample_by_lemma("xxx", 10, None).unwrap();
        assert!(sampled.is_empty());
    }
}