adaptive_memory 0.2.0

An associative memory system using spreading activation with SQLite FTS5 full-text search
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

//! Memory data structures.

use chrono::{DateTime, Utc};
use serde::{Deserialize, Serialize};

/// A memory entry.
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct Memory {
    pub id: i64,
    pub datetime: DateTime<Utc>,
    pub text: String,
    pub source: Option<String>,
}

/// Result of adding a memory.
#[derive(Debug, Serialize)]
pub struct AddMemoryResult {
    pub memory: Memory,
}

/// Result of amending a memory.
#[derive(Debug, Serialize)]
pub struct AmendResult {
    pub memory: Memory,
}

/// Database statistics.
#[derive(Debug, Serialize)]
pub struct Stats {
    pub memory_count: i64,
    pub min_memory_id: Option<i64>,
    pub max_memory_id: Option<i64>,
    pub relationship_count: i64,
    pub relationship_event_count: i64,
    pub unique_sources: Vec<String>,
    /// Graph metrics
    pub graph: GraphStats,
}

/// Graph-oriented statistics.
#[derive(Debug, Serialize)]
pub struct GraphStats {
    /// Memories with no connections
    pub stray_count: i64,
    /// Number of connected components (islands)
    pub island_count: i64,
    /// Size of the largest connected component
    pub largest_island_size: i64,
    /// Memories with only one connection
    pub leaf_count: i64,
    /// Maximum degree (most connections on a single memory)
    pub max_degree: i64,
    /// Average degree of connected memories (0 if none)
    pub avg_degree: f64,
}