aboutsummaryrefslogtreecommitdiff
path: root/src/table_sharded.rs
diff options
context:
space:
mode:
authorAlex Auvolat <alex@adnab.me>2020-04-23 17:05:46 +0000
committerAlex Auvolat <alex@adnab.me>2020-04-23 17:05:46 +0000
commitc9c6b0dbd41e20d19b91c6615c46da6f45925bca (patch)
treebd299a3c5fbbd567250f6314462bc0998555589a /src/table_sharded.rs
parent01a8acdeecfcacafb61809f9e135709148e842ce (diff)
downloadgarage-c9c6b0dbd41e20d19b91c6615c46da6f45925bca.tar.gz
garage-c9c6b0dbd41e20d19b91c6615c46da6f45925bca.zip
Reorganize code
Diffstat (limited to 'src/table_sharded.rs')
-rw-r--r--src/table_sharded.rs55
1 files changed, 0 insertions, 55 deletions
diff --git a/src/table_sharded.rs b/src/table_sharded.rs
deleted file mode 100644
index c17ea0d4..00000000
--- a/src/table_sharded.rs
+++ /dev/null
@@ -1,55 +0,0 @@
-use crate::data::*;
-use crate::membership::{Ring, System};
-use crate::table::*;
-
-#[derive(Clone)]
-pub struct TableShardedReplication {
- pub replication_factor: usize,
- pub read_quorum: usize,
- pub write_quorum: usize,
-}
-
-impl TableReplication for TableShardedReplication {
- // Sharded replication schema:
- // - based on the ring of nodes, a certain set of neighbors
- // store entries, given as a function of the position of the
- // entry's hash in the ring
- // - reads are done on all of the nodes that replicate the data
- // - writes as well
-
- fn read_nodes(&self, hash: &Hash, system: &System) -> Vec<UUID> {
- let ring = system.ring.borrow().clone();
- ring.walk_ring(&hash, self.replication_factor)
- }
- fn read_quorum(&self) -> usize {
- self.read_quorum
- }
-
- fn write_nodes(&self, hash: &Hash, system: &System) -> Vec<UUID> {
- let ring = system.ring.borrow().clone();
- ring.walk_ring(&hash, self.replication_factor)
- }
- fn write_quorum(&self) -> usize {
- self.write_quorum
- }
- fn max_write_errors(&self) -> usize {
- self.replication_factor - self.write_quorum
- }
- fn epidemic_writes(&self) -> bool {
- false
- }
-
- fn replication_nodes(&self, hash: &Hash, ring: &Ring) -> Vec<UUID> {
- ring.walk_ring(&hash, self.replication_factor)
- }
- fn split_points(&self, ring: &Ring) -> Vec<Hash> {
- let mut ret = vec![];
-
- ret.push([0u8; 32].into());
- for entry in ring.ring.iter() {
- ret.push(entry.location);
- }
- ret.push([0xFFu8; 32].into());
- ret
- }
-}