llm-memory-graph 0.1.0

Graph-based context-tracking and prompt-lineage database for LLM systems
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
//! Async query builder with streaming support for memory-efficient queries
//!
//! This module provides a fluent API for building and executing async queries
//! over the graph data with support for streaming large result sets.

use crate::error::Result;
use crate::storage::AsyncStorageBackend;
use crate::types::{Node, NodeType, SessionId};
use chrono::{DateTime, Utc};
use futures::stream::Stream;
use std::pin::Pin;
use std::sync::Arc;

/// Builder for constructing async queries over the graph
///
/// Provides a fluent API for filtering and executing queries asynchronously.
/// Supports both batch loading and streaming for memory-efficient processing.
///
/// # Examples
///
/// ```no_run
/// use llm_memory_graph::query::AsyncQueryBuilder;
/// use llm_memory_graph::types::NodeType;
/// use futures::stream::StreamExt;
///
/// # async fn example(builder: AsyncQueryBuilder) -> Result<(), Box<dyn std::error::Error>> {
/// // Query with filters
/// let nodes = builder
///     .node_type(NodeType::Prompt)
///     .limit(100)
///     .execute()
///     .await?;
/// # Ok(())
/// # }
///
/// # async fn example2(builder: AsyncQueryBuilder) -> Result<(), Box<dyn std::error::Error>> {
/// // Stream large result sets
/// let mut stream = builder.execute_stream();
/// while let Some(node) = stream.next().await {
///     // Process node...
/// }
/// # Ok(())
/// # }
/// ```
pub struct AsyncQueryBuilder {
    storage: Arc<dyn AsyncStorageBackend>,
    session_filter: Option<SessionId>,
    node_type_filter: Option<NodeType>,
    time_range: Option<(DateTime<Utc>, DateTime<Utc>)>,
    limit: Option<usize>,
    offset: usize,
}

impl AsyncQueryBuilder {
    /// Create a new async query builder
    ///
    /// # Examples
    ///
    /// ```no_run
    /// use llm_memory_graph::query::AsyncQueryBuilder;
    /// use llm_memory_graph::storage::AsyncSledBackend;
    /// use std::sync::Arc;
    ///
    /// # async fn example() -> Result<(), Box<dyn std::error::Error>> {
    /// let backend = AsyncSledBackend::open("./data/graph.db").await?;
    /// let builder = AsyncQueryBuilder::new(Arc::new(backend));
    /// # Ok(())
    /// # }
    /// ```
    pub fn new(storage: Arc<dyn AsyncStorageBackend>) -> Self {
        Self {
            storage,
            session_filter: None,
            node_type_filter: None,
            time_range: None,
            limit: None,
            offset: 0,
        }
    }

    /// Filter by session ID
    ///
    /// # Examples
    ///
    /// ```no_run
    /// # use llm_memory_graph::query::AsyncQueryBuilder;
    /// # use llm_memory_graph::types::SessionId;
    /// # async fn example(builder: AsyncQueryBuilder, session_id: SessionId) -> Result<(), Box<dyn std::error::Error>> {
    /// let nodes = builder
    ///     .session(session_id)
    ///     .execute()
    ///     .await?;
    /// # Ok(())
    /// # }
    /// ```
    pub fn session(mut self, session_id: SessionId) -> Self {
        self.session_filter = Some(session_id);
        self
    }

    /// Filter by node type
    ///
    /// # Examples
    ///
    /// ```no_run
    /// # use llm_memory_graph::query::AsyncQueryBuilder;
    /// # use llm_memory_graph::types::NodeType;
    /// # async fn example(builder: AsyncQueryBuilder) -> Result<(), Box<dyn std::error::Error>> {
    /// let prompts = builder
    ///     .node_type(NodeType::Prompt)
    ///     .execute()
    ///     .await?;
    /// # Ok(())
    /// # }
    /// ```
    pub fn node_type(mut self, node_type: NodeType) -> Self {
        self.node_type_filter = Some(node_type);
        self
    }

    /// Filter by time range (inclusive)
    ///
    /// # Examples
    ///
    /// ```no_run
    /// # use llm_memory_graph::query::AsyncQueryBuilder;
    /// # use chrono::Utc;
    /// # async fn example(builder: AsyncQueryBuilder) -> Result<(), Box<dyn std::error::Error>> {
    /// let start = Utc::now() - chrono::Duration::hours(24);
    /// let end = Utc::now();
    ///
    /// let recent_nodes = builder
    ///     .time_range(start, end)
    ///     .execute()
    ///     .await?;
    /// # Ok(())
    /// # }
    /// ```
    pub fn time_range(mut self, start: DateTime<Utc>, end: DateTime<Utc>) -> Self {
        self.time_range = Some((start, end));
        self
    }

    /// Limit the number of results
    ///
    /// # Examples
    ///
    /// ```no_run
    /// # use llm_memory_graph::query::AsyncQueryBuilder;
    /// # async fn example(builder: AsyncQueryBuilder) -> Result<(), Box<dyn std::error::Error>> {
    /// let first_10 = builder
    ///     .limit(10)
    ///     .execute()
    ///     .await?;
    /// # Ok(())
    /// # }
    /// ```
    pub fn limit(mut self, limit: usize) -> Self {
        self.limit = Some(limit);
        self
    }

    /// Skip the first N results
    ///
    /// # Examples
    ///
    /// ```no_run
    /// # use llm_memory_graph::query::AsyncQueryBuilder;
    /// # async fn example(builder: AsyncQueryBuilder) -> Result<(), Box<dyn std::error::Error>> {
    /// // Get results 11-20 (skip first 10, take next 10)
    /// let page2 = builder
    ///     .offset(10)
    ///     .limit(10)
    ///     .execute()
    ///     .await?;
    /// # Ok(())
    /// # }
    /// ```
    pub fn offset(mut self, offset: usize) -> Self {
        self.offset = offset;
        self
    }

    /// Execute the query and return all matching nodes
    ///
    /// This loads all results into memory. For large result sets, consider using
    /// `execute_stream()` instead.
    ///
    /// # Examples
    ///
    /// ```no_run
    /// # use llm_memory_graph::query::AsyncQueryBuilder;
    /// # async fn example(builder: AsyncQueryBuilder) -> Result<(), Box<dyn std::error::Error>> {
    /// let nodes = builder.execute().await?;
    /// println!("Found {} nodes", nodes.len());
    /// # Ok(())
    /// # }
    /// ```
    pub async fn execute(&self) -> Result<Vec<Node>> {
        // Get base nodes from session or all nodes
        let mut nodes = if let Some(session_id) = &self.session_filter {
            self.storage.get_session_nodes(session_id).await?
        } else {
            // For now, we'll need to iterate through sessions
            // In production, you'd want a more efficient approach
            vec![]
        };

        // Apply node type filter
        if let Some(node_type) = &self.node_type_filter {
            nodes.retain(|node| node.node_type() == *node_type);
        }

        // Apply time range filter
        if let Some((start, end)) = &self.time_range {
            nodes.retain(|node| {
                let timestamp = match node {
                    Node::Prompt(p) => p.timestamp,
                    Node::Response(r) => r.timestamp,
                    Node::Session(s) => s.created_at,
                    Node::ToolInvocation(t) => t.timestamp,
                    Node::Agent(a) => a.created_at,
                    Node::Template(t) => t.created_at,
                };
                timestamp >= *start && timestamp <= *end
            });
        }

        // Sort by timestamp (newest first)
        nodes.sort_by(|a, b| {
            let ts_a = match a {
                Node::Prompt(p) => p.timestamp,
                Node::Response(r) => r.timestamp,
                Node::Session(s) => s.created_at,
                Node::ToolInvocation(t) => t.timestamp,
                Node::Agent(a) => a.created_at,
                Node::Template(t) => t.created_at,
            };
            let ts_b = match b {
                Node::Prompt(p) => p.timestamp,
                Node::Response(r) => r.timestamp,
                Node::Session(s) => s.created_at,
                Node::ToolInvocation(t) => t.timestamp,
                Node::Agent(a) => a.created_at,
                Node::Template(t) => t.created_at,
            };
            ts_b.cmp(&ts_a)
        });

        // Apply offset
        let nodes: Vec<_> = nodes.into_iter().skip(self.offset).collect();

        // Apply limit
        let nodes = if let Some(limit) = self.limit {
            nodes.into_iter().take(limit).collect()
        } else {
            nodes
        };

        Ok(nodes)
    }

    /// Execute the query and return a stream of results
    ///
    /// This is memory-efficient for large result sets as it processes nodes
    /// one at a time without loading everything into memory. The stream uses
    /// storage-level streaming to avoid loading all nodes at once.
    ///
    /// # Examples
    ///
    /// ```no_run
    /// # use llm_memory_graph::query::AsyncQueryBuilder;
    /// # use futures::stream::StreamExt;
    /// # async fn example(builder: AsyncQueryBuilder) -> Result<(), Box<dyn std::error::Error>> {
    /// let mut stream = builder.execute_stream();
    ///
    /// let mut count = 0;
    /// while let Some(result) = stream.next().await {
    ///     match result {
    ///         Ok(node) => {
    ///             // Process node without loading all into memory
    ///             count += 1;
    ///         }
    ///         Err(e) => eprintln!("Error: {}", e),
    ///     }
    /// }
    ///
    /// println!("Processed {} nodes", count);
    /// # Ok(())
    /// # }
    /// ```
    pub fn execute_stream(&self) -> Pin<Box<dyn Stream<Item = Result<Node>> + Send + '_>> {
        use futures::StreamExt;

        let session_filter = self.session_filter;
        let node_type_filter = self.node_type_filter.clone();
        let time_range = self.time_range;
        let limit = self.limit;
        let offset = self.offset;

        Box::pin(async_stream::stream! {
            // Use storage-level streaming for better memory efficiency
            let mut stream = if let Some(session_id) = session_filter {
                self.storage.get_session_nodes_stream(&session_id)
            } else {
                // Empty stream if no session filter
                Box::pin(futures::stream::empty()) as Pin<Box<dyn Stream<Item = Result<Node>> + Send + '_>>
            };

            // Apply filters and stream results
            let mut skipped = 0;
            let mut emitted = 0;

            while let Some(result) = stream.next().await {
                let node = match result {
                    Ok(n) => n,
                    Err(e) => {
                        yield Err(e);
                        continue;
                    }
                };

                // Apply node type filter
                if let Some(ref nt) = node_type_filter {
                    if node.node_type() != *nt {
                        continue;
                    }
                }

                // Apply time range filter
                if let Some((start, end)) = time_range {
                    let timestamp = match &node {
                        Node::Prompt(p) => p.timestamp,
                        Node::Response(r) => r.timestamp,
                        Node::Session(s) => s.created_at,
                        Node::ToolInvocation(t) => t.timestamp,
                        Node::Agent(a) => a.created_at,
                        Node::Template(t) => t.created_at,
                    };

                    if timestamp < start || timestamp > end {
                        continue;
                    }
                }

                // Apply offset
                if skipped < offset {
                    skipped += 1;
                    continue;
                }

                // Apply limit
                if let Some(lim) = limit {
                    if emitted >= lim {
                        break;
                    }
                }

                emitted += 1;
                yield Ok(node);
            }
        })
    }

    /// Count the number of matching nodes without loading them
    ///
    /// This is more efficient than `execute().await?.len()` for large result sets
    /// as it uses storage-level counting when possible.
    ///
    /// # Examples
    ///
    /// ```no_run
    /// # use llm_memory_graph::query::AsyncQueryBuilder;
    /// # use llm_memory_graph::types::NodeType;
    /// # async fn example(builder: AsyncQueryBuilder) -> Result<(), Box<dyn std::error::Error>> {
    /// let prompt_count = builder
    ///     .node_type(NodeType::Prompt)
    ///     .count()
    ///     .await?;
    ///
    /// println!("Total prompts: {}", prompt_count);
    /// # Ok(())
    /// # }
    /// ```
    pub async fn count(&self) -> Result<usize> {
        use futures::StreamExt;

        // If we only have a session filter and no other filters, use efficient count
        if self.session_filter.is_some()
            && self.node_type_filter.is_none()
            && self.time_range.is_none()
            && self.offset == 0
            && self.limit.is_none()
        {
            return self
                .storage
                .count_session_nodes(&self.session_filter.unwrap())
                .await;
        }

        // Otherwise, stream and count to avoid loading all into memory
        let mut stream = self.execute_stream();
        let mut count = 0;
        while let Some(result) = stream.next().await {
            result?;
            count += 1;
        }
        Ok(count)
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::storage::AsyncSledBackend;
    use crate::types::{ConversationSession, PromptNode};
    use futures::stream::StreamExt;
    use tempfile::tempdir;

    #[tokio::test]
    async fn test_query_builder_creation() {
        let dir = tempdir().unwrap();
        let backend = AsyncSledBackend::open(dir.path()).await.unwrap();
        let builder = AsyncQueryBuilder::new(
            Arc::new(backend) as Arc<dyn crate::storage::AsyncStorageBackend>
        );

        let results = builder.execute().await.unwrap();
        assert_eq!(results.len(), 0);
    }

    #[tokio::test]
    async fn test_query_with_session_filter() {
        let dir = tempdir().unwrap();
        let backend = Arc::new(AsyncSledBackend::open(dir.path()).await.unwrap())
            as Arc<dyn crate::storage::AsyncStorageBackend>;

        // Create test data
        let session = ConversationSession::new();
        backend
            .store_node(&Node::Session(session.clone()))
            .await
            .unwrap();

        for i in 0..5 {
            let prompt = PromptNode::new(session.id, format!("Prompt {}", i));
            backend.store_node(&Node::Prompt(prompt)).await.unwrap();
        }

        // Query with session filter
        let builder = AsyncQueryBuilder::new(backend);
        let results = builder.session(session.id).execute().await.unwrap();

        assert_eq!(results.len(), 6); // 1 session + 5 prompts
    }

    #[tokio::test]
    async fn test_query_with_node_type_filter() {
        let dir = tempdir().unwrap();
        let backend = Arc::new(AsyncSledBackend::open(dir.path()).await.unwrap())
            as Arc<dyn crate::storage::AsyncStorageBackend>;

        let session = ConversationSession::new();
        backend
            .store_node(&Node::Session(session.clone()))
            .await
            .unwrap();

        for i in 0..3 {
            let prompt = PromptNode::new(session.id, format!("Prompt {}", i));
            backend.store_node(&Node::Prompt(prompt)).await.unwrap();
        }

        // Query only prompts
        let builder = AsyncQueryBuilder::new(backend);
        let results = builder
            .session(session.id)
            .node_type(NodeType::Prompt)
            .execute()
            .await
            .unwrap();

        assert_eq!(results.len(), 3);
        for node in results {
            assert!(matches!(node, Node::Prompt(_)));
        }
    }

    #[tokio::test]
    async fn test_query_with_limit_and_offset() {
        let dir = tempdir().unwrap();
        let backend = Arc::new(AsyncSledBackend::open(dir.path()).await.unwrap())
            as Arc<dyn crate::storage::AsyncStorageBackend>;

        let session = ConversationSession::new();
        backend
            .store_node(&Node::Session(session.clone()))
            .await
            .unwrap();

        for i in 0..10 {
            let prompt = PromptNode::new(session.id, format!("Prompt {}", i));
            backend.store_node(&Node::Prompt(prompt)).await.unwrap();
        }

        // Test limit
        let builder = AsyncQueryBuilder::new(Arc::clone(&backend));
        let results = builder
            .session(session.id)
            .node_type(NodeType::Prompt)
            .limit(5)
            .execute()
            .await
            .unwrap();
        assert_eq!(results.len(), 5);

        // Test offset + limit (pagination)
        let builder = AsyncQueryBuilder::new(backend);
        let results = builder
            .session(session.id)
            .node_type(NodeType::Prompt)
            .offset(5)
            .limit(3)
            .execute()
            .await
            .unwrap();
        assert_eq!(results.len(), 3);
    }

    #[tokio::test]
    async fn test_query_streaming() {
        let dir = tempdir().unwrap();
        let backend = Arc::new(AsyncSledBackend::open(dir.path()).await.unwrap())
            as Arc<dyn crate::storage::AsyncStorageBackend>;

        let session = ConversationSession::new();
        backend
            .store_node(&Node::Session(session.clone()))
            .await
            .unwrap();

        for i in 0..10 {
            let prompt = PromptNode::new(session.id, format!("Prompt {}", i));
            backend.store_node(&Node::Prompt(prompt)).await.unwrap();
        }

        // Stream results
        let query = AsyncQueryBuilder::new(backend)
            .session(session.id)
            .node_type(NodeType::Prompt);
        let mut stream = query.execute_stream();

        let mut count = 0;
        while let Some(result) = stream.next().await {
            result.unwrap();
            count += 1;
        }

        assert_eq!(count, 10);
    }

    #[tokio::test]
    async fn test_query_count() {
        let dir = tempdir().unwrap();
        let backend = Arc::new(AsyncSledBackend::open(dir.path()).await.unwrap())
            as Arc<dyn crate::storage::AsyncStorageBackend>;

        let session = ConversationSession::new();
        backend
            .store_node(&Node::Session(session.clone()))
            .await
            .unwrap();

        for i in 0..7 {
            let prompt = PromptNode::new(session.id, format!("Prompt {}", i));
            backend.store_node(&Node::Prompt(prompt)).await.unwrap();
        }

        // Count prompts
        let builder = AsyncQueryBuilder::new(backend);
        let count = builder
            .session(session.id)
            .node_type(NodeType::Prompt)
            .count()
            .await
            .unwrap();

        assert_eq!(count, 7);
    }

    #[tokio::test]
    async fn test_streaming_with_limit() {
        let dir = tempdir().unwrap();
        let backend = Arc::new(AsyncSledBackend::open(dir.path()).await.unwrap())
            as Arc<dyn crate::storage::AsyncStorageBackend>;

        let session = ConversationSession::new();
        backend
            .store_node(&Node::Session(session.clone()))
            .await
            .unwrap();

        for i in 0..20 {
            let prompt = PromptNode::new(session.id, format!("Prompt {}", i));
            backend.store_node(&Node::Prompt(prompt)).await.unwrap();
        }

        // Stream with limit
        let query = AsyncQueryBuilder::new(backend)
            .session(session.id)
            .node_type(NodeType::Prompt)
            .limit(5);
        let mut stream = query.execute_stream();

        let mut count = 0;
        while let Some(result) = stream.next().await {
            result.unwrap();
            count += 1;
        }

        assert_eq!(count, 5);
    }
}