File size: 8,036 Bytes
9bd422a
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
/**
 * Property-Based Test: Property 41 - Lazy Loading Implementation
 * Validates: Requirements 15.5
 *
 * Tests that the parsed model cache correctly implements lazy loading:
 * - Models are only parsed once (cache hit avoids re-parsing)
 * - Cache evicts oldest entries when at capacity
 * - Uploaded files (no path key) are not cached
 */

import { describe, it, expect, beforeEach } from 'vitest';
import fc from 'fast-check';

// ─── Extracted cache logic (mirrors app.js implementation) ───────────────────

/**
 * Creates a parsed model cache with LRU-style eviction.
 * @param {number} maxSize
 */
function createModelCache(maxSize) {
    const cache = new Map();

    return {
        get(key) {
            return cache.get(key);
        },
        set(key, value) {
            if (cache.size >= maxSize) {
                // Evict oldest (first inserted) entry
                const firstKey = cache.keys().next().value;
                cache.delete(firstKey);
            }
            cache.set(key, value);
        },
        has(key) {
            return cache.has(key);
        },
        size() {
            return cache.size;
        },
        clear() {
            cache.clear();
        },
        keys() {
            return Array.from(cache.keys());
        }
    };
}

/**
 * Simulates the model selection flow with caching.
 * Returns { parsedModel, cacheHit } where cacheHit indicates if cache was used.
 */
async function selectModelWithCache(cache, modelPath, parseModel) {
    const cached = cache.get(modelPath);
    if (cached) {
        return { parsedModel: cached, cacheHit: true };
    }
    const parsed = await parseModel(modelPath);
    cache.set(modelPath, parsed);
    return { parsedModel: parsed, cacheHit: false };
}

// ─── Tests ────────────────────────────────────────────────────────────────────

describe('Property 41: Lazy Loading Implementation', () => {
    /**
     * **Validates: Requirements 15.5**
     *
     * Property: For any model path, selecting the same model twice should
     * result in a cache hit on the second selection (parse is called only once).
     */
    it('should cache parsed models and avoid re-parsing on repeated selection', async () => {
        await fc.assert(
            fc.asyncProperty(
                fc.string({ minLength: 1, maxLength: 50 }).filter(s => s.trim().length > 0),
                async (modelPath) => {
                    const cache = createModelCache(10);
                    let parseCallCount = 0;

                    const mockParse = async (path) => {
                        parseCallCount++;
                        return { metadata: { fileName: path }, graph: { nodes: [] } };
                    };

                    // First selection: should parse
                    const first = await selectModelWithCache(cache, modelPath, mockParse);
                    expect(first.cacheHit).toBe(false);
                    expect(parseCallCount).toBe(1);

                    // Second selection: should use cache
                    const second = await selectModelWithCache(cache, modelPath, mockParse);
                    expect(second.cacheHit).toBe(true);
                    expect(parseCallCount).toBe(1); // No additional parse call

                    // Both results should be the same object
                    expect(second.parsedModel).toBe(first.parsedModel);
                }
            ),
            { numRuns: 100 }
        );
    });

    /**
     * **Validates: Requirements 15.5**
     *
     * Property: For any set of distinct model paths up to cache capacity,
     * all models should be cached after selection.
     */
    it('should cache all models within capacity', async () => {
        await fc.assert(
            fc.asyncProperty(
                fc.array(
                    fc.string({ minLength: 1, maxLength: 30 }).filter(s => s.trim().length > 0),
                    { minLength: 1, maxLength: 8 }
                ).map(arr => [...new Set(arr)]), // unique paths
                async (modelPaths) => {
                    const cacheSize = 10;
                    const cache = createModelCache(cacheSize);
                    const mockParse = async (path) => ({ metadata: { fileName: path } });

                    for (const path of modelPaths) {
                        await selectModelWithCache(cache, path, mockParse);
                    }

                    // All unique paths (up to cache size) should be cached
                    const expectedCached = modelPaths.slice(-cacheSize);
                    for (const path of expectedCached) {
                        expect(cache.has(path)).toBe(true);
                    }
                }
            ),
            { numRuns: 100 }
        );
    });

    /**
     * **Validates: Requirements 15.5**
     *
     * Property: When cache is at capacity and a new model is added,
     * the oldest entry is evicted and cache size stays at maxSize.
     */
    it('should evict oldest entry when cache is full', async () => {
        await fc.assert(
            fc.asyncProperty(
                fc.integer({ min: 1, max: 8 }),
                async (maxSize) => {
                    const cache = createModelCache(maxSize);
                    const mockParse = async (path) => ({ metadata: { fileName: path } });

                    // Fill cache to capacity with unique paths
                    const paths = Array.from({ length: maxSize }, (_, i) => `model_${i}.onnx`);
                    for (const path of paths) {
                        await selectModelWithCache(cache, path, mockParse);
                    }

                    expect(cache.size()).toBe(maxSize);

                    // Add one more model (should evict oldest)
                    const newPath = 'model_new.onnx';
                    await selectModelWithCache(cache, newPath, mockParse);

                    // Cache size should not exceed maxSize
                    expect(cache.size()).toBe(maxSize);

                    // New model should be in cache
                    expect(cache.has(newPath)).toBe(true);

                    // Oldest model (first inserted) should be evicted
                    expect(cache.has(paths[0])).toBe(false);
                }
            ),
            { numRuns: 50 }
        );
    });

    /**
     * **Validates: Requirements 15.5**
     *
     * Property: For any sequence of model selections with repeated paths,
     * the total number of parse calls should equal the number of unique paths
     * (not the total number of selections).
     */
    it('should parse each unique model path exactly once', async () => {
        await fc.assert(
            fc.asyncProperty(
                fc.array(
                    fc.integer({ min: 0, max: 4 }).map(i => `model_${i}.onnx`),
                    { minLength: 2, maxLength: 20 }
                ),
                async (selectionSequence) => {
                    const cacheSize = 10; // Large enough to hold all 5 possible models
                    const cache = createModelCache(cacheSize);
                    const parseCallCounts = new Map();

                    const mockParse = async (path) => {
                        parseCallCounts.set(path, (parseCallCounts.get(path) || 0) + 1);
                        return { metadata: { fileName: path } };
                    };

                    for (const path of selectionSequence) {
                        await selectModelWithCache(cache, path, mockParse);
                    }

                    // Each unique path should have been parsed exactly once
                    for (const [, count] of parseCallCounts) {
                        expect(count).toBe(1);
                    }
                }
            ),
            { numRuns: 100 }
        );
    });
});