sort-governor 0.1.0

Process-wide governor for bounded asynchronous sorting: plans in-memory versus external sorts and rations file descriptors and spill memory
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

//! One key/value pair as it lives in an in-memory run and on disk.

use serde::{
    Deserialize,
    Serialize,
};

/// A single row threaded through the sort: the ordering key and its
/// payload value. Serialized with the key first so a spilled run is
/// self-describing.
#[derive(Debug, Clone, Serialize, Deserialize)]
pub(crate) struct RunRow<K, V> {
    /// The ordering key.
    pub key: K,
    /// The payload carried alongside the key.
    pub value: V,
}

impl<K, V> RunRow<K, V> {
    /// Pair a key with its value.
    pub(crate) fn new(key: K, value: V) -> Self {
        Self { key, value }
    }
}