ugnos 0.1.1

A high-performance, concurrent time-series database core written in Rust, designed for efficient IoT data ingestion, real-time analytics, and monitoring.
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

use std::collections::HashMap;

/// Timestamp type (nanoseconds since epoch).
pub type Timestamp = u64;

/// Value type.
pub type Value = f64;

/// TagSet type (using a HashMap for flexibility).
pub type TagSet = HashMap<String, String>;

/// Represents a single data point received via API or stored temporarily in buffer.
#[derive(Debug, Clone, PartialEq)]
pub struct DataPoint {
    pub timestamp: Timestamp,
    pub value: Value,
    pub tags: TagSet,
}

/// Represents a chunk of time-series data in columnar format within storage.
/// Using Arc for tags might be slightly more efficient if tags are often duplicated,
/// but let's stick to owned TagSet for simplicity first as per design.
#[derive(Debug, Default, Clone)] // Clone needed for potential storage operations
pub struct TimeSeriesChunk {
    pub timestamps: Vec<Timestamp>,
    pub values: Vec<Value>,
    // Storing full TagSet per point. Optimization (e.g., interning) can be added later.
    pub tags: Vec<TagSet>,
}

impl TimeSeriesChunk {
    /// Appends a DataPoint to the chunk. Assumes timestamp is monotonically increasing
    /// or that sorting will happen elsewhere if needed.
    pub fn append(&mut self, point: DataPoint) {
        self.timestamps.push(point.timestamp);
        self.values.push(point.value);
        self.tags.push(point.tags);
    }

    /// Appends multiple data points. Assumes timestamps are monotonically increasing.
    pub fn append_batch(&mut self, points: Vec<DataPoint>) {
        let additional_capacity = points.len();
        self.timestamps.reserve(additional_capacity);
        self.values.reserve(additional_capacity);
        self.tags.reserve(additional_capacity);

        for point in points {
            self.timestamps.push(point.timestamp);
            self.values.push(point.value);
            self.tags.push(point.tags);
        }
    }

    /// Returns the number of data points in the chunk.
    pub fn len(&self) -> usize {
        self.timestamps.len()
    }

    /// Returns true if the chunk is empty.
    pub fn is_empty(&self) -> bool {
        self.timestamps.is_empty()
    }
}