|
| 1 | +"""Unit tests for Pyvectorhound vector database operations.""" |
| 2 | + |
| 3 | +import pytest |
| 4 | +import numpy as np |
| 5 | +from pyvectorhound import VectorStore, EmbeddingManager |
| 6 | + |
| 7 | + |
| 8 | +class TestVectorStore: |
| 9 | + """Tests for VectorStore core functionality.""" |
| 10 | + |
| 11 | + def test_vectorstore_initialization(self): |
| 12 | + """Test VectorStore can be initialized.""" |
| 13 | + store = VectorStore(backend="memory", dimension=128) |
| 14 | + assert store is not None |
| 15 | + assert store.dimension == 128 |
| 16 | + |
| 17 | + def test_add_single_vector(self): |
| 18 | + """Test adding a single vector.""" |
| 19 | + store = VectorStore(backend="memory", dimension=3) |
| 20 | + vector = np.array([1.0, 2.0, 3.0]) |
| 21 | + |
| 22 | + result = store.add(vector, metadata={"id": "vec1"}) |
| 23 | + assert result is not None |
| 24 | + |
| 25 | + def test_add_multiple_vectors(self): |
| 26 | + """Test adding multiple vectors.""" |
| 27 | + store = VectorStore(backend="memory", dimension=5) |
| 28 | + vectors = np.random.randn(10, 5) |
| 29 | + |
| 30 | + for i, vec in enumerate(vectors): |
| 31 | + store.add(vec, metadata={"id": f"vec{i}"}) |
| 32 | + |
| 33 | + assert store.size() == 10 |
| 34 | + |
| 35 | + def test_vector_dimension_validation(self): |
| 36 | + """Test that vectors must match store dimension.""" |
| 37 | + store = VectorStore(backend="memory", dimension=3) |
| 38 | + vector = np.array([1.0, 2.0]) # Wrong dimension |
| 39 | + |
| 40 | + with pytest.raises((ValueError, IndexError)): |
| 41 | + store.add(vector) |
| 42 | + |
| 43 | + def test_similarity_search(self): |
| 44 | + """Test similarity search functionality.""" |
| 45 | + store = VectorStore(backend="memory", dimension=5) |
| 46 | + |
| 47 | + # Add vectors |
| 48 | + vectors = np.array([ |
| 49 | + [1, 0, 0, 0, 0], |
| 50 | + [1, 0.1, 0, 0, 0], |
| 51 | + [0, 0, 1, 0, 0], |
| 52 | + [0, 0, 0, 1, 0], |
| 53 | + ], dtype=np.float32) |
| 54 | + |
| 55 | + for i, vec in enumerate(vectors): |
| 56 | + store.add(vec, metadata={"id": i}) |
| 57 | + |
| 58 | + # Search with first vector |
| 59 | + query = vectors[0] |
| 60 | + results = store.search(query, top_k=2) |
| 61 | + |
| 62 | + assert len(results) <= 2 |
| 63 | + # First result should be identical (itself) |
| 64 | + assert results[0]["metadata"]["id"] == 0 |
| 65 | + |
| 66 | + def test_batch_search(self): |
| 67 | + """Test searching with multiple queries.""" |
| 68 | + store = VectorStore(backend="memory", dimension=4) |
| 69 | + vectors = np.random.randn(20, 4) |
| 70 | + |
| 71 | + for i, vec in enumerate(vectors): |
| 72 | + store.add(vec, metadata={"id": i}) |
| 73 | + |
| 74 | + # Batch search |
| 75 | + queries = np.random.randn(5, 4) |
| 76 | + results = store.batch_search(queries, top_k=3) |
| 77 | + |
| 78 | + assert len(results) == 5 |
| 79 | + for result in results: |
| 80 | + assert len(result) <= 3 |
| 81 | + |
| 82 | + def test_delete_vector(self): |
| 83 | + """Test deleting vectors.""" |
| 84 | + store = VectorStore(backend="memory", dimension=2) |
| 85 | + |
| 86 | + vec_id = store.add(np.array([1, 2]), metadata={"id": "test"}) |
| 87 | + assert store.size() == 1 |
| 88 | + |
| 89 | + store.delete(vec_id) |
| 90 | + assert store.size() == 0 |
| 91 | + |
| 92 | + def test_update_vector(self): |
| 93 | + """Test updating vector metadata.""" |
| 94 | + store = VectorStore(backend="memory", dimension=2) |
| 95 | + |
| 96 | + vec_id = store.add(np.array([1, 2]), metadata={"id": "test", "label": "old"}) |
| 97 | + store.update(vec_id, metadata={"label": "new"}) |
| 98 | + |
| 99 | + results = store.search(np.array([1, 2]), top_k=1) |
| 100 | + assert results[0]["metadata"]["label"] == "new" |
| 101 | + |
| 102 | + def test_empty_store_search(self): |
| 103 | + """Test searching in empty store.""" |
| 104 | + store = VectorStore(backend="memory", dimension=3) |
| 105 | + query = np.array([1, 2, 3]) |
| 106 | + |
| 107 | + results = store.search(query, top_k=5) |
| 108 | + assert len(results) == 0 |
| 109 | + |
| 110 | + def test_single_vector_search(self): |
| 111 | + """Test searching with only one vector in store.""" |
| 112 | + store = VectorStore(backend="memory", dimension=2) |
| 113 | + store.add(np.array([1, 2]), metadata={"id": "only"}) |
| 114 | + |
| 115 | + results = store.search(np.array([1, 2]), top_k=10) |
| 116 | + assert len(results) == 1 |
| 117 | + |
| 118 | + def test_duplicate_vectors(self): |
| 119 | + """Test handling of duplicate vectors.""" |
| 120 | + store = VectorStore(backend="memory", dimension=2) |
| 121 | + |
| 122 | + vec = np.array([1.0, 2.0]) |
| 123 | + id1 = store.add(vec, metadata={"id": "first"}) |
| 124 | + id2 = store.add(vec, metadata={"id": "second"}) |
| 125 | + |
| 126 | + assert id1 != id2 # Should have different IDs |
| 127 | + assert store.size() == 2 |
| 128 | + |
| 129 | + |
| 130 | +class TestEmbeddingManager: |
| 131 | + """Tests for embedding generation and management.""" |
| 132 | + |
| 133 | + def test_embedding_manager_initialization(self): |
| 134 | + """Test EmbeddingManager can be initialized.""" |
| 135 | + manager = EmbeddingManager(model="default", dimension=128) |
| 136 | + assert manager is not None |
| 137 | + |
| 138 | + def test_embed_single_text(self): |
| 139 | + """Test embedding a single text.""" |
| 140 | + manager = EmbeddingManager(model="default", dimension=384) |
| 141 | + embedding = manager.embed("Hello world") |
| 142 | + |
| 143 | + assert embedding is not None |
| 144 | + assert len(embedding) == 384 |
| 145 | + |
| 146 | + def test_embed_multiple_texts(self): |
| 147 | + """Test embedding multiple texts.""" |
| 148 | + manager = EmbeddingManager(model="default", dimension=384) |
| 149 | + texts = ["Hello", "world", "test"] |
| 150 | + |
| 151 | + embeddings = manager.embed_batch(texts) |
| 152 | + |
| 153 | + assert len(embeddings) == len(texts) |
| 154 | + for emb in embeddings: |
| 155 | + assert len(emb) == 384 |
| 156 | + |
| 157 | + def test_embedding_consistency(self): |
| 158 | + """Test that same text produces same embedding.""" |
| 159 | + manager = EmbeddingManager(model="default", dimension=384) |
| 160 | + text = "test embedding consistency" |
| 161 | + |
| 162 | + emb1 = manager.embed(text) |
| 163 | + emb2 = manager.embed(text) |
| 164 | + |
| 165 | + assert np.allclose(emb1, emb2) |
| 166 | + |
| 167 | + def test_embedding_similarity(self): |
| 168 | + """Test that similar texts have similar embeddings.""" |
| 169 | + manager = EmbeddingManager(model="default", dimension=384) |
| 170 | + |
| 171 | + text1 = "The quick brown fox" |
| 172 | + text2 = "The fast brown fox" |
| 173 | + text3 = "Unrelated random text" |
| 174 | + |
| 175 | + emb1 = manager.embed(text1) |
| 176 | + emb2 = manager.embed(text2) |
| 177 | + emb3 = manager.embed(text3) |
| 178 | + |
| 179 | + # Cosine similarity |
| 180 | + sim_12 = np.dot(emb1, emb2) / (np.linalg.norm(emb1) * np.linalg.norm(emb2)) |
| 181 | + sim_13 = np.dot(emb1, emb3) / (np.linalg.norm(emb1) * np.linalg.norm(emb3)) |
| 182 | + |
| 183 | + assert sim_12 > sim_13 # Similar texts more similar than dissimilar |
| 184 | + |
| 185 | + def test_empty_text(self): |
| 186 | + """Test handling of empty text.""" |
| 187 | + manager = EmbeddingManager(model="default", dimension=384) |
| 188 | + |
| 189 | + # Should either handle gracefully or raise clear error |
| 190 | + try: |
| 191 | + embedding = manager.embed("") |
| 192 | + assert embedding is not None |
| 193 | + except ValueError as e: |
| 194 | + assert "empty" in str(e).lower() |
| 195 | + |
| 196 | + def test_very_long_text(self): |
| 197 | + """Test handling of very long text.""" |
| 198 | + manager = EmbeddingManager(model="default", dimension=384) |
| 199 | + long_text = " ".join(["word"] * 10000) |
| 200 | + |
| 201 | + # Should either handle with truncation or raise error |
| 202 | + try: |
| 203 | + embedding = manager.embed(long_text) |
| 204 | + assert len(embedding) == 384 |
| 205 | + except ValueError: |
| 206 | + pass # Acceptable to reject overly long text |
| 207 | + |
| 208 | + |
| 209 | +class TestVectorDatabaseAdapters: |
| 210 | + """Tests for different vector database backends.""" |
| 211 | + |
| 212 | + @pytest.mark.parametrize("backend", ["memory", "qdrant", "chroma"]) |
| 213 | + def test_backend_initialization(self, backend): |
| 214 | + """Test that all backends can be initialized.""" |
| 215 | + if backend == "memory": |
| 216 | + store = VectorStore(backend=backend, dimension=64) |
| 217 | + assert store is not None |
| 218 | + |
| 219 | + def test_memory_backend_persistence(self): |
| 220 | + """Test in-memory backend persistence.""" |
| 221 | + store = VectorStore(backend="memory", dimension=3) |
| 222 | + store.add(np.array([1, 2, 3]), metadata={"id": "test"}) |
| 223 | + |
| 224 | + # In-memory should persist within same object |
| 225 | + assert store.size() == 1 |
| 226 | + |
| 227 | + def test_backend_switch_incompatibility(self): |
| 228 | + """Test that switching backends doesn't corrupt data.""" |
| 229 | + store1 = VectorStore(backend="memory", dimension=3) |
| 230 | + store1.add(np.array([1, 2, 3])) |
| 231 | + |
| 232 | + # New backend is separate |
| 233 | + store2 = VectorStore(backend="memory", dimension=3) |
| 234 | + assert store2.size() == 0 |
| 235 | + |
| 236 | + |
| 237 | +class TestPerformance: |
| 238 | + """Performance and scalability tests.""" |
| 239 | + |
| 240 | + def test_large_batch_performance(self): |
| 241 | + """Test performance with large batch operations.""" |
| 242 | + import time |
| 243 | + |
| 244 | + store = VectorStore(backend="memory", dimension=128) |
| 245 | + vectors = np.random.randn(5000, 128) |
| 246 | + |
| 247 | + start = time.time() |
| 248 | + for vec in vectors: |
| 249 | + store.add(vec) |
| 250 | + elapsed = time.time() - start |
| 251 | + |
| 252 | + assert elapsed < 60 # Should complete in under 60 seconds |
| 253 | + assert store.size() == 5000 |
| 254 | + |
| 255 | + def test_search_performance(self): |
| 256 | + """Test search performance on large store.""" |
| 257 | + import time |
| 258 | + |
| 259 | + store = VectorStore(backend="memory", dimension=64) |
| 260 | + vectors = np.random.randn(1000, 64) |
| 261 | + |
| 262 | + for vec in vectors: |
| 263 | + store.add(vec) |
| 264 | + |
| 265 | + query = np.random.randn(64) |
| 266 | + start = time.time() |
| 267 | + results = store.search(query, top_k=100) |
| 268 | + elapsed = time.time() - start |
| 269 | + |
| 270 | + assert len(results) <= 100 |
| 271 | + assert elapsed < 5 # Should search in under 5 seconds |
| 272 | + |
| 273 | + |
| 274 | +class TestMemorySecurity: |
| 275 | + """Tests for TIER 1 file size limits (if applicable).""" |
| 276 | + |
| 277 | + def test_no_unbounded_memory_growth(self): |
| 278 | + """Test that repeated operations don't cause memory leaks.""" |
| 279 | + store = VectorStore(backend="memory", dimension=64) |
| 280 | + |
| 281 | + # Simulate repeated operations |
| 282 | + for iteration in range(100): |
| 283 | + vectors = np.random.randn(100, 64) |
| 284 | + for vec in vectors: |
| 285 | + store.add(vec) |
| 286 | + |
| 287 | + assert store.size() == 10000 |
| 288 | + |
| 289 | + |
| 290 | +if __name__ == "__main__": |
| 291 | + pytest.main([__file__, "-v"]) |
0 commit comments