lcpfs 2026.1.102

LCP File System - A ZFS-inspired copy-on-write filesystem for Rust
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
// Copyright 2025 LunaOS Contributors
// SPDX-License-Identifier: Apache-2.0

//! Vector search engine providing the global API for LCPFS vector operations.
//!
//! The `VectorEngine` provides a high-level interface for storing embeddings
//! alongside files and searching by semantic similarity. It manages HNSW
//! indexes per dataset and handles persistence.
//!
//! # Architecture
//!
//! ```text
//! +------------------+
//! |  VectorEngine    |  <- Global singleton
//! +------------------+
//!         |
//!         v
//! +------------------+
//! |  DatasetIndex    |  <- One per dataset with vectors
//! +------------------+
//!         |
//!         v
//! +------------------+
//! |   HnswIndex      |  <- HNSW graph for ANN search
//! +------------------+
//! ```
//!
//! # Usage
//!
//! ```ignore
//! use lcpfs::vector::{VectorEngine, store_embedding, search};
//!
//! // Store an embedding for a file
//! store_embedding("pool/dataset", file_id, "clip-vit-b32", &embedding)?;
//!
//! // Search by similarity
//! let results = search("pool/dataset", &query_embedding, 10)?;
//! ```

use alloc::string::String;
use alloc::vec::Vec;
use hashbrown::HashMap;
use lazy_static::lazy_static;
use spin::Mutex;

use super::hnsw::{HnswIndex, HnswStats};
use super::types::{
    DistanceMetric, IndexParams, IndexType, SearchFilter, VectorError, VectorIndexMeta,
    VectorSearchResult,
};

// ═══════════════════════════════════════════════════════════════════════════════
// DATASET INDEX
// ═══════════════════════════════════════════════════════════════════════════════

/// Index state for a single dataset.
struct DatasetIndex {
    /// The HNSW index.
    hnsw: HnswIndex,
    /// Model ID for embeddings in this index.
    model_id: u32,
    /// Model name.
    model_name: String,
    /// Whether the index has unsaved changes.
    dirty: bool,
}

impl DatasetIndex {
    /// Create a new dataset index.
    fn new(model_name: &str, params: &IndexParams) -> Self {
        let hnsw = HnswIndex::with_params(
            params.hnsw_m,
            params.hnsw_ef_construction,
            params.hnsw_ef_search,
            params.metric,
        );

        Self {
            hnsw,
            model_id: Self::hash_model_name(model_name),
            model_name: String::from(model_name),
            dirty: false,
        }
    }

    /// Hash a model name to a u32 ID.
    fn hash_model_name(name: &str) -> u32 {
        let mut hash = 0u32;
        for byte in name.bytes() {
            hash = hash.wrapping_mul(31).wrapping_add(byte as u32);
        }
        hash
    }

    /// Get metadata about this index.
    fn metadata(&self) -> VectorIndexMeta {
        let stats = self.hnsw.stats();
        VectorIndexMeta {
            index_type: IndexType::Hnsw,
            vector_count: stats.vector_count as u64,
            dimensions: stats.dimensions as u32,
            distance_metric: stats.metric,
            hnsw_m: stats.m as u16,
            hnsw_ef_construction: stats.ef_construction as u16,
            max_layer: stats.layer_count as u8,
            entry_point: stats.entry_point.unwrap_or(0),
        }
    }
}

// ═══════════════════════════════════════════════════════════════════════════════
// VECTOR ENGINE
// ═══════════════════════════════════════════════════════════════════════════════

/// Global vector search engine.
///
/// Manages vector indexes for all datasets and provides the main API
/// for storing and searching embeddings.
pub struct VectorEngine {
    /// Indexes by dataset name.
    indexes: HashMap<String, DatasetIndex>,
    /// Default index parameters.
    default_params: IndexParams,
}

impl VectorEngine {
    /// Create a new vector engine.
    pub fn new() -> Self {
        Self {
            indexes: HashMap::new(),
            default_params: IndexParams::default(),
        }
    }

    /// Set default index parameters for new datasets.
    pub fn set_default_params(&mut self, params: IndexParams) {
        self.default_params = params;
    }

    /// Get or create an index for a dataset.
    fn get_or_create_index(&mut self, dataset: &str, model: &str) -> &mut DatasetIndex {
        if !self.indexes.contains_key(dataset) {
            let index = DatasetIndex::new(model, &self.default_params);
            self.indexes.insert(String::from(dataset), index);
        }
        self.indexes.get_mut(dataset).unwrap()
    }

    /// Store an embedding for an object.
    pub fn store_embedding(
        &mut self,
        dataset: &str,
        object_id: u64,
        model: &str,
        embedding: &[f32],
    ) -> Result<(), VectorError> {
        let index = self.get_or_create_index(dataset, model);

        // Check model consistency
        let model_id = DatasetIndex::hash_model_name(model);
        if !index.hnsw.is_empty() && index.model_id != model_id {
            return Err(VectorError::NotSupported(
                "Cannot mix embeddings from different models in same dataset".into(),
            ));
        }

        index.hnsw.insert(object_id, embedding)?;
        index.dirty = true;
        Ok(())
    }

    /// Search for similar vectors.
    pub fn search(
        &self,
        dataset: &str,
        query: &[f32],
        k: usize,
    ) -> Result<Vec<VectorSearchResult>, VectorError> {
        let index = self
            .indexes
            .get(dataset)
            .ok_or_else(|| VectorError::DatasetNotFound(String::from(dataset)))?;

        if index.hnsw.is_empty() {
            return Err(VectorError::EmptyIndex);
        }

        Ok(index.hnsw.search(query, k))
    }

    /// Search with a filter.
    pub fn search_filtered(
        &self,
        dataset: &str,
        query: &[f32],
        k: usize,
        filter: &SearchFilter,
    ) -> Result<Vec<VectorSearchResult>, VectorError> {
        let index = self
            .indexes
            .get(dataset)
            .ok_or_else(|| VectorError::DatasetNotFound(String::from(dataset)))?;

        if index.hnsw.is_empty() {
            return Err(VectorError::EmptyIndex);
        }

        // Get more results than needed, then filter
        let candidates = index.hnsw.search(query, k * 10);

        let filtered: Vec<_> = candidates
            .into_iter()
            .filter(|r| filter.matches_basic(r))
            .take(k)
            .collect();

        Ok(filtered)
    }

    /// Search with custom ef parameter.
    pub fn search_with_ef(
        &self,
        dataset: &str,
        query: &[f32],
        k: usize,
        ef: usize,
    ) -> Result<Vec<VectorSearchResult>, VectorError> {
        let index = self
            .indexes
            .get(dataset)
            .ok_or_else(|| VectorError::DatasetNotFound(String::from(dataset)))?;

        if index.hnsw.is_empty() {
            return Err(VectorError::EmptyIndex);
        }

        Ok(index.hnsw.search_with_ef(query, k, ef))
    }

    /// Find objects similar to a given object.
    pub fn find_similar(
        &self,
        dataset: &str,
        object_id: u64,
        k: usize,
    ) -> Result<Vec<VectorSearchResult>, VectorError> {
        let index = self
            .indexes
            .get(dataset)
            .ok_or_else(|| VectorError::DatasetNotFound(String::from(dataset)))?;

        let query = index
            .hnsw
            .get_vector(object_id)
            .ok_or(VectorError::ObjectNotFound(object_id))?;

        // Search for k+1 to exclude self
        let mut results = index.hnsw.search(query, k + 1);
        results.retain(|r| r.object_id != object_id);
        results.truncate(k);

        Ok(results)
    }

    /// Batch insert embeddings.
    pub fn batch_store(
        &mut self,
        dataset: &str,
        model: &str,
        embeddings: &[(u64, Vec<f32>)],
    ) -> Result<usize, VectorError> {
        let mut count = 0;
        for (id, embedding) in embeddings {
            self.store_embedding(dataset, *id, model, embedding)?;
            count += 1;
        }
        Ok(count)
    }

    /// Delete a vector from the index.
    pub fn delete(&mut self, dataset: &str, object_id: u64) -> Result<(), VectorError> {
        let index = self
            .indexes
            .get_mut(dataset)
            .ok_or_else(|| VectorError::DatasetNotFound(String::from(dataset)))?;

        index.hnsw.delete(object_id)?;
        index.dirty = true;
        Ok(())
    }

    /// Get a stored vector.
    pub fn get_vector(&self, dataset: &str, object_id: u64) -> Result<Vec<f32>, VectorError> {
        let index = self
            .indexes
            .get(dataset)
            .ok_or_else(|| VectorError::DatasetNotFound(String::from(dataset)))?;

        index
            .hnsw
            .get_vector(object_id)
            .map(|v| v.to_vec())
            .ok_or(VectorError::ObjectNotFound(object_id))
    }

    /// Check if a vector exists.
    pub fn contains(&self, dataset: &str, object_id: u64) -> bool {
        self.indexes
            .get(dataset)
            .map(|idx| idx.hnsw.contains(object_id))
            .unwrap_or(false)
    }

    /// Get index metadata.
    pub fn get_index_meta(&self, dataset: &str) -> Option<VectorIndexMeta> {
        self.indexes.get(dataset).map(|idx| idx.metadata())
    }

    /// Get index statistics.
    pub fn get_stats(&self, dataset: &str) -> Option<HnswStats> {
        self.indexes.get(dataset).map(|idx| idx.hnsw.stats())
    }

    /// Get all dataset names with vector indexes.
    pub fn list_datasets(&self) -> Vec<String> {
        self.indexes.keys().cloned().collect()
    }

    /// Check if a dataset has an index.
    pub fn has_index(&self, dataset: &str) -> bool {
        self.indexes.contains_key(dataset)
    }

    /// Remove an index entirely.
    pub fn remove_index(&mut self, dataset: &str) -> bool {
        self.indexes.remove(dataset).is_some()
    }

    /// Set the search ef parameter for a dataset.
    pub fn set_ef_search(&mut self, dataset: &str, ef: usize) -> Result<(), VectorError> {
        let index = self
            .indexes
            .get_mut(dataset)
            .ok_or_else(|| VectorError::DatasetNotFound(String::from(dataset)))?;

        index.hnsw.set_ef_search(ef);
        Ok(())
    }

    /// Rebuild an index with new parameters.
    ///
    /// This creates a new index and reinserts all vectors.
    pub fn rebuild_index(
        &mut self,
        dataset: &str,
        params: &IndexParams,
    ) -> Result<(), VectorError> {
        let old_index = self
            .indexes
            .get(dataset)
            .ok_or_else(|| VectorError::DatasetNotFound(String::from(dataset)))?;

        // Get all vectors
        let ids = old_index.hnsw.get_ids();
        let vectors: Vec<_> = ids
            .iter()
            .filter_map(|&id| old_index.hnsw.get_vector(id).map(|v| (id, v.to_vec())))
            .collect();

        let model_name = old_index.model_name.clone();

        // Create new index
        let mut new_index = DatasetIndex::new(&model_name, params);

        // Reinsert vectors
        for (id, embedding) in vectors {
            new_index.hnsw.insert(id, &embedding)?;
        }

        new_index.dirty = true;
        self.indexes.insert(String::from(dataset), new_index);

        Ok(())
    }

    /// Get total number of vectors across all datasets.
    pub fn total_vectors(&self) -> usize {
        self.indexes.values().map(|idx| idx.hnsw.len()).sum()
    }

    /// Mark all indexes as clean (after persistence).
    pub fn mark_clean(&mut self) {
        for index in self.indexes.values_mut() {
            index.dirty = false;
        }
    }

    /// Check if any index has unsaved changes.
    pub fn is_dirty(&self) -> bool {
        self.indexes.values().any(|idx| idx.dirty)
    }
}

impl Default for VectorEngine {
    fn default() -> Self {
        Self::new()
    }
}

// ═══════════════════════════════════════════════════════════════════════════════
// GLOBAL SINGLETON
// ═══════════════════════════════════════════════════════════════════════════════

lazy_static! {
    /// Global vector engine instance.
    static ref VECTOR_ENGINE: Mutex<VectorEngine> = Mutex::new(VectorEngine::new());
}

/// Store an embedding for an object (global API).
///
/// # Arguments
///
/// * `dataset` - Dataset name (e.g., "pool/photos")
/// * `object_id` - Unique object identifier
/// * `model` - Embedding model name (e.g., "clip-vit-b32")
/// * `embedding` - The embedding vector
pub fn store_embedding(
    dataset: &str,
    object_id: u64,
    model: &str,
    embedding: &[f32],
) -> Result<(), VectorError> {
    VECTOR_ENGINE
        .lock()
        .store_embedding(dataset, object_id, model, embedding)
}

/// Search for similar vectors (global API).
///
/// # Arguments
///
/// * `dataset` - Dataset name
/// * `query` - Query embedding
/// * `k` - Number of results to return
pub fn search(
    dataset: &str,
    query: &[f32],
    k: usize,
) -> Result<Vec<VectorSearchResult>, VectorError> {
    VECTOR_ENGINE.lock().search(dataset, query, k)
}

/// Search with a filter (global API).
pub fn search_filtered(
    dataset: &str,
    query: &[f32],
    k: usize,
    filter: &SearchFilter,
) -> Result<Vec<VectorSearchResult>, VectorError> {
    VECTOR_ENGINE
        .lock()
        .search_filtered(dataset, query, k, filter)
}

/// Find objects similar to a given object (global API).
pub fn find_similar(
    dataset: &str,
    object_id: u64,
    k: usize,
) -> Result<Vec<VectorSearchResult>, VectorError> {
    VECTOR_ENGINE.lock().find_similar(dataset, object_id, k)
}

/// Batch store embeddings (global API).
pub fn batch_store(
    dataset: &str,
    model: &str,
    embeddings: &[(u64, Vec<f32>)],
) -> Result<usize, VectorError> {
    VECTOR_ENGINE.lock().batch_store(dataset, model, embeddings)
}

/// Delete a vector (global API).
pub fn delete_embedding(dataset: &str, object_id: u64) -> Result<(), VectorError> {
    VECTOR_ENGINE.lock().delete(dataset, object_id)
}

/// Get a stored vector (global API).
pub fn get_embedding(dataset: &str, object_id: u64) -> Result<Vec<f32>, VectorError> {
    VECTOR_ENGINE.lock().get_vector(dataset, object_id)
}

/// Get index metadata (global API).
pub fn get_index_meta(dataset: &str) -> Option<VectorIndexMeta> {
    VECTOR_ENGINE.lock().get_index_meta(dataset)
}

/// Get index statistics (global API).
pub fn get_index_stats(dataset: &str) -> Option<HnswStats> {
    VECTOR_ENGINE.lock().get_stats(dataset)
}

/// List all datasets with vector indexes (global API).
pub fn list_datasets() -> Vec<String> {
    VECTOR_ENGINE.lock().list_datasets()
}

/// Rebuild an index with new parameters (global API).
pub fn rebuild_index(dataset: &str, params: &IndexParams) -> Result<(), VectorError> {
    VECTOR_ENGINE.lock().rebuild_index(dataset, params)
}

/// Set search ef parameter for a dataset (global API).
pub fn set_ef_search(dataset: &str, ef: usize) -> Result<(), VectorError> {
    VECTOR_ENGINE.lock().set_ef_search(dataset, ef)
}

/// Get total vectors across all datasets (global API).
pub fn total_vectors() -> usize {
    VECTOR_ENGINE.lock().total_vectors()
}

// ═══════════════════════════════════════════════════════════════════════════════
// TESTS
// ═══════════════════════════════════════════════════════════════════════════════

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

    fn random_vector(dim: usize, seed: u64) -> Vec<f32> {
        let mut rng = seed;
        let mut v: Vec<f32> = (0..dim)
            .map(|_| {
                rng = rng.wrapping_mul(6364136223846793005).wrapping_add(1);
                ((rng >> 33) as f32 / (1u64 << 31) as f32) * 2.0 - 1.0
            })
            .collect();

        // Normalize
        let norm: f32 = v.iter().map(|x| x * x).sum::<f32>().sqrt();
        for x in &mut v {
            *x /= norm;
        }
        v
    }

    #[test]
    fn test_vector_engine_basic() {
        let mut engine = VectorEngine::new();

        let embedding = vec![1.0, 0.0, 0.0, 0.0];
        engine
            .store_embedding("test/dataset", 1, "test-model", &embedding)
            .unwrap();

        assert!(engine.contains("test/dataset", 1));
        assert!(!engine.contains("test/dataset", 2));

        let retrieved = engine.get_vector("test/dataset", 1).unwrap();
        assert_eq!(retrieved, embedding);
    }

    #[test]
    fn test_vector_engine_search() {
        let mut engine = VectorEngine::new();

        // Insert vectors
        engine
            .store_embedding("test", 1, "model", &[1.0, 0.0, 0.0, 0.0])
            .unwrap();
        engine
            .store_embedding("test", 2, "model", &[0.9, 0.1, 0.0, 0.0])
            .unwrap();
        engine
            .store_embedding("test", 3, "model", &[0.0, 1.0, 0.0, 0.0])
            .unwrap();

        // Search
        let results = engine.search("test", &[1.0, 0.0, 0.0, 0.0], 2).unwrap();

        assert_eq!(results.len(), 2);
        // First result should be the exact match
        assert_eq!(results[0].object_id, 1);
    }

    #[test]
    fn test_vector_engine_find_similar() {
        let mut engine = VectorEngine::new();

        engine
            .store_embedding("test", 1, "model", &[1.0, 0.0, 0.0])
            .unwrap();
        engine
            .store_embedding("test", 2, "model", &[0.9, 0.1, 0.0])
            .unwrap();
        engine
            .store_embedding("test", 3, "model", &[0.0, 1.0, 0.0])
            .unwrap();

        let similar = engine.find_similar("test", 1, 2).unwrap();

        // Should not include the query object itself
        assert!(similar.iter().all(|r| r.object_id != 1));
        // Object 2 should be most similar to object 1
        assert_eq!(similar[0].object_id, 2);
    }

    #[test]
    fn test_vector_engine_batch() {
        let mut engine = VectorEngine::new();

        let embeddings = vec![
            (1, vec![1.0, 0.0, 0.0]),
            (2, vec![0.0, 1.0, 0.0]),
            (3, vec![0.0, 0.0, 1.0]),
        ];

        let count = engine.batch_store("test", "model", &embeddings).unwrap();
        assert_eq!(count, 3);

        assert!(engine.contains("test", 1));
        assert!(engine.contains("test", 2));
        assert!(engine.contains("test", 3));
    }

    #[test]
    fn test_vector_engine_delete() {
        let mut engine = VectorEngine::new();

        engine
            .store_embedding("test", 1, "model", &[1.0, 0.0, 0.0])
            .unwrap();
        engine
            .store_embedding("test", 2, "model", &[0.0, 1.0, 0.0])
            .unwrap();

        assert!(engine.contains("test", 1));

        engine.delete("test", 1).unwrap();

        assert!(!engine.contains("test", 1));
        assert!(engine.contains("test", 2));
    }

    #[test]
    fn test_vector_engine_metadata() {
        let mut engine = VectorEngine::new();

        for i in 0..10 {
            let v = random_vector(64, i);
            engine.store_embedding("test", i, "model", &v).unwrap();
        }

        let meta = engine.get_index_meta("test").unwrap();
        assert_eq!(meta.vector_count, 10);
        assert_eq!(meta.dimensions, 64);

        let stats = engine.get_stats("test").unwrap();
        assert_eq!(stats.vector_count, 10);
    }

    #[test]
    fn test_vector_engine_rebuild() {
        let mut engine = VectorEngine::new();

        for i in 0..5 {
            let v = random_vector(32, i);
            engine.store_embedding("test", i, "model", &v).unwrap();
        }

        // Rebuild with different parameters
        let params = IndexParams {
            hnsw_m: 32,
            hnsw_ef_construction: 400,
            ..Default::default()
        };

        engine.rebuild_index("test", &params).unwrap();

        // Verify vectors are still there
        for i in 0..5 {
            assert!(engine.contains("test", i as u64));
        }

        let stats = engine.get_stats("test").unwrap();
        assert_eq!(stats.m, 32);
    }

    #[test]
    fn test_vector_engine_multiple_datasets() {
        let mut engine = VectorEngine::new();

        engine
            .store_embedding("photos", 1, "clip", &[1.0, 0.0])
            .unwrap();
        engine
            .store_embedding("documents", 1, "bert", &[0.0, 1.0])
            .unwrap();

        assert!(engine.has_index("photos"));
        assert!(engine.has_index("documents"));
        assert!(!engine.has_index("other"));

        let datasets = engine.list_datasets();
        assert_eq!(datasets.len(), 2);
        assert!(datasets.contains(&String::from("photos")));
        assert!(datasets.contains(&String::from("documents")));
    }

    #[test]
    fn test_vector_engine_error_cases() {
        let engine = VectorEngine::new();

        // Search on non-existent dataset
        let result = engine.search("nonexistent", &[1.0, 0.0], 10);
        assert!(matches!(result, Err(VectorError::DatasetNotFound(_))));
    }

    #[test]
    fn test_vector_engine_dirty_tracking() {
        let mut engine = VectorEngine::new();

        assert!(!engine.is_dirty());

        engine
            .store_embedding("test", 1, "model", &[1.0, 0.0, 0.0])
            .unwrap();

        assert!(engine.is_dirty());

        engine.mark_clean();

        assert!(!engine.is_dirty());
    }
}