arcon 0.2.1

A runtime for writing streaming applications
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

use crate::{
    error::ArconResult,
    index::{AppenderIndex, HashTable, IndexOps, IndexValue},
    table::ImmutableTable,
};
use arcon_state::{
    backend::{handles::ActiveHandle, Backend, VecState},
    error::*,
};
use prost::*;
use std::ops::{Deref, DerefMut};

const DEFAULT_APPENDER_SIZE: usize = 1024;

pub mod eager;

#[derive(Clone, Message)]
pub struct ProstVec<V: IndexValue> {
    #[prost(message, repeated, tag = "1")]
    data: Vec<V>,
}

impl<V> Deref for ProstVec<V>
where
    V: IndexValue,
{
    type Target = Vec<V>;

    fn deref(&self) -> &Self::Target {
        &self.data
    }
}

impl<V> DerefMut for ProstVec<V>
where
    V: IndexValue,
{
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.data
    }
}

/// An Index suitable for Non-associative Windows
///
/// A backing [VecState] acts as an overflow vector when
/// the data no longer fits in the specified in-memory capacity.
pub struct LazyAppender<V, B>
where
    V: IndexValue,
    B: Backend,
{
    current_key: u64,
    /// A handle to the VecState
    handle: ActiveHandle<B, VecState<V>>,
    hash_table: HashTable<u64, ProstVec<V>, B>,
}

impl<V, B> LazyAppender<V, B>
where
    V: IndexValue,
    B: Backend,
{
}

impl<V, B> IndexOps for LazyAppender<V, B>
where
    V: IndexValue,
    B: Backend,
{
    fn persist(&mut self) -> ArconResult<()> {
        // for each modified, set handle key and drain
        unimplemented!();
    }
    fn set_key(&mut self, key: u64) {
        self.current_key = key;
    }
    fn table(&mut self) -> ArconResult<Option<ImmutableTable>> {
        Ok(None)
    }
}

impl<V, B> AppenderIndex<V> for LazyAppender<V, B>
where
    V: IndexValue,
    B: Backend,
{
    #[inline]
    fn append(&mut self, _: V) -> Result<()> {
        unimplemented!();
    }
    #[inline]
    fn consume(&mut self) -> Result<Vec<V>> {
        unimplemented!();
    }
    #[inline]
    fn len(&self) -> usize {
        unimplemented!();
    }
    #[inline]
    fn is_empty(&self) -> bool {
        unimplemented!();
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::test_utils::temp_backend;
    use arcon_state::Sled;
    use eager::EagerAppender;
    use std::sync::Arc;

    fn index_test(mut index: impl AppenderIndex<u64>) -> Result<()> {
        index.set_key(0);
        for i in 0..1024 {
            index.append(i as u64)?;
        }

        assert_eq!(index.len(), 1024);
        let consumed = index.consume()?;
        assert_eq!(consumed.len(), 1024);

        for (c, i) in consumed.into_iter().enumerate() {
            assert_eq!(c as u64, i);
        }

        index.set_key(1);

        for i in 0..524 {
            index.append(i as u64)?;
        }

        assert_eq!(index.len(), 524);

        Ok(())
    }

    #[test]
    fn eager_appender_test() {
        let backend = Arc::new(temp_backend::<Sled>());
        let index = EagerAppender::new("appender", backend);
        assert!(index_test(index).is_ok());
    }
}