Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Changed all instances of assignation to assignment. | Jonathan Davies | 2023-01-05 | 1 | -2/+2 |
| | |||||
* | Use bytes as capacity units | Alex Auvolat | 2022-11-07 | 1 | -17/+17 |
| | |||||
* | Style improvements | Alex Auvolat | 2022-11-07 | 1 | -141/+132 |
| | |||||
* | Added some comment | Mendes | 2022-10-11 | 1 | -40/+39 |
| | |||||
* | cargo fmt | Mendes | 2022-10-10 | 1 | -377/+377 |
| | |||||
* | Tests written in layout.rs | Mendes | 2022-10-10 | 1 | -14/+0 |
| | | | | | added staged_parameters to ClusterLayout removed the serde(default) -> will need a migration function | ||||
* | corrected warnings of cargo clippy | Mendes | 2022-10-06 | 1 | -13/+13 |
| | |||||
* | Correction of a few bugs in the tests, modification of ClusterLayout::check | Mendes | 2022-09-22 | 1 | -23/+18 |
| | |||||
* | New version of the algorithm that calculate the layout. | Mendes | 2022-09-21 | 1 | -0/+440 |
It takes as paramters the replication factor and the zone redundancy, computes the largest partition size reachable with these constraints, and among the possible assignation with this partition size, it computes the one that moves the least number of partitions compared to the previous assignation. This computation uses graph algorithms defined in graph_algo.rs |