|
6 | 6 | //! |
7 | 7 | //! The rebuild process is fully deterministic with respect to: |
8 | 8 | //! - key decoding |
9 | | -//! - volume selection (`key2volume`) |
| 9 | +//! - volume selection (`key_to_volume`) |
10 | 10 | //! - replica ordering |
11 | 11 | //! |
12 | 12 | //! It does not recover hash or content-type metadata, as that information |
|
21 | 21 | //! 3. For each file entry: |
22 | 22 | //! - Base64-decode the filename to obtain the raw key. |
23 | 23 | //! - Merge the current volume into the key's record. |
24 | | -//! - Reorder volumes according to `key2volume`, preserving unknown |
| 24 | +//! - Reorder volumes according to `key_to_volume`, preserving unknown |
25 | 25 | //! volumes at the end. |
26 | 26 | //! 4. Write the reconstructed record with: |
27 | 27 | //! - `deleted = No` |
@@ -99,7 +99,7 @@ fn is_subvolume_dir(entry: &AutoindexEntry) -> bool { |
99 | 99 | /// |
100 | 100 | /// - Decodes the filename into raw key bytes. |
101 | 101 | /// - Acquires a per-key lock to prevent concurrent modification. |
102 | | -/// - Computes the ideal replica ordering via `key2volume`. |
| 102 | +/// - Computes the ideal replica ordering via `key_to_volume`. |
103 | 103 | /// - Merges the current volume into the existing record. |
104 | 104 | /// - Reorders volumes deterministically. |
105 | 105 | /// - Writes a reconstructed `Record`. |
@@ -255,7 +255,7 @@ pub async fn rebuild_all(state: Arc<AppState>) { |
255 | 255 | }; |
256 | 256 |
|
257 | 257 | // Check if volume uses subvolume directories. |
258 | | - let has_subvolumes = top_listing.iter().any(|e| is_subvolume_dir(e)); |
| 258 | + let has_subvolumes = top_listing.iter().any(is_subvolume_dir); |
259 | 259 |
|
260 | 260 | if has_subvolumes { |
261 | 261 | for sv in top_listing.iter().filter(|e| is_subvolume_dir(e)) { |
|
0 commit comments