Drop every graph, CRDT and conflict row, then write `slice`'s. Conflicts are written for `view_id`.
(&mut self, slice: &GraphSlice, view_id: u64)
| 565 | /// Drop every graph, CRDT and conflict row, then write `slice`'s. |
| 566 | /// Conflicts are written for `view_id`. |
| 567 | pub fn import_graph_slice(&mut self, slice: &GraphSlice, view_id: u64) -> PristineResult<()> { |
| 568 | self.txn.delete_multimap_table(GRAPH)?; |
| 569 | self.txn.delete_multimap_table(INODE_GRAPH)?; |
| 570 | self.txn.delete_table(CONFLICTS)?; |
| 571 | self.txn.delete_table(TRUNKS)?; |
| 572 | self.txn.delete_table(INODE_TRUNK)?; |
| 573 | self.txn.delete_table(PATH_TRUNK)?; |
| 574 | self.txn.delete_multimap_table(TRUNK_BRANCHES)?; |
| 575 | self.txn.delete_table(BRANCHES)?; |
| 576 | self.txn.delete_table(BRANCH_AFTER)?; |
| 577 | self.txn.delete_table(BRANCH_VERTEX)?; |
| 578 | self.txn.delete_table(VERTEX_BRANCH)?; |
| 579 | self.txn.delete_multimap_table(BRANCH_LEAVES)?; |
| 580 | self.txn.delete_table(LEAVES)?; |
| 581 | |
| 582 | { |
| 583 | let mut t = self.txn.open_multimap_table(GRAPH)?; |
| 584 | for (k, edges) in &slice.graph { |
| 585 | for e in edges { |
| 586 | t.insert(k, e)?; |
| 587 | } |
| 588 | } |
| 589 | } |
| 590 | { |
| 591 | let mut t = self.txn.open_multimap_table(INODE_GRAPH)?; |
| 592 | for (k, edges) in &slice.inode_graph { |
| 593 | for e in edges { |
| 594 | t.insert(k, e)?; |
| 595 | } |
| 596 | } |
| 597 | } |
| 598 | { |
| 599 | let mut t = self.txn.open_table(CONFLICTS)?; |
| 600 | for (inode, c) in &slice.conflicts { |
| 601 | t.insert(&encode_view_seq(view_id, *inode), c.as_slice())?; |
| 602 | } |
| 603 | } |
| 604 | let c = &slice.crdt; |
| 605 | { |
| 606 | let mut t = self.txn.open_table(TRUNKS)?; |
| 607 | for (k, v) in &c.trunks { |
| 608 | t.insert(k, v.as_slice())?; |
| 609 | } |
| 610 | let mut t = self.txn.open_table(INODE_TRUNK)?; |
| 611 | for (k, v) in &c.inode_trunk { |
| 612 | t.insert(*k, v)?; |
| 613 | } |
| 614 | let mut t = self.txn.open_table(PATH_TRUNK)?; |
| 615 | for (k, v) in &c.path_trunk { |
| 616 | t.insert(k.as_str(), v)?; |
| 617 | } |
| 618 | let mut t = self.txn.open_multimap_table(TRUNK_BRANCHES)?; |
| 619 | for (k, vs) in &c.trunk_branches { |
| 620 | for v in vs { |
| 621 | t.insert(k, v)?; |
| 622 | } |
| 623 | } |
| 624 | let mut t = self.txn.open_table(BRANCHES)?; |
no test coverage detected