lolraft 0.10.2

A Multi-Raft implementation in Rust language.
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

use super::*;

impl RaftProcess {
    pub(crate) async fn queue_new_entry(
        &self,
        command: Bytes,
        completion: Completion,
    ) -> Result<Index> {
        ensure!(self.voter.allow_queue_new_entry().await?);

        let append_index = self
            .command_log
            .append_new_entry(command.clone(), None)
            .await?;

        self.command_log
            .register_completion(append_index, completion);

        self.process_configuration_command(&command, append_index)
            .await?;

        Ok(append_index)
    }

    pub(crate) async fn queue_received_entries(
        &self,
        mut req: request::ReplicationStream,
    ) -> Result<u64> {
        let mut prev_clock = req.prev_clock;
        let mut n_inserted = 0;
        while let Some(Some(cur)) = req.entries.next().await {
            let entry = Entry {
                prev_clock,
                this_clock: cur.this_clock,
                command: cur.command,
            };
            let insert_index = entry.this_clock.index;
            let command = entry.command.clone();
            match self
                .command_log
                .try_insert_entry(entry, req.sender_id.clone(), self.driver.clone())
                .await?
            {
                command_log::TryInsertResult::Inserted => {
                    self.process_configuration_command(&command, insert_index)
                        .await?
                }
                command_log::TryInsertResult::SkippedInsertion => {}
                command_log::TryInsertResult::InconsistencyDetected => {
                    warn!("rejected append entry (clock={:?})", cur.this_clock);
                    break;
                }
            }
            prev_clock = cur.this_clock;
            n_inserted += 1;
        }

        Ok(n_inserted)
    }
}