| 1094 | } |
| 1095 | |
| 1096 | fn hash_index_tree(tree: &InMemoryIndexTree) -> Result<Oid, ObservationError> { |
| 1097 | let mut entries = Vec::with_capacity(tree.entries.len()); |
| 1098 | for (name, entry) in &tree.entries { |
| 1099 | let (oid, mode) = match entry { |
| 1100 | InMemoryIndexTreeEntry::Directory(child) => { |
| 1101 | (hash_index_tree(child)?, CanonicalTreeMode::Tree) |
| 1102 | } |
| 1103 | InMemoryIndexTreeEntry::Object { oid, mode } => (*oid, *mode), |
| 1104 | }; |
| 1105 | entries.push(EncodedTreeEntry { |
| 1106 | name: name.clone(), |
| 1107 | oid, |
| 1108 | mode, |
| 1109 | }); |
| 1110 | } |
| 1111 | entries.sort_by(git_tree_entry_order); |
| 1112 | |
| 1113 | let mut bytes = Vec::new(); |
| 1114 | for entry in entries { |
| 1115 | bytes.extend_from_slice(entry.mode.encoded()); |
| 1116 | bytes.push(b' '); |
| 1117 | bytes.extend_from_slice(&entry.name); |
| 1118 | bytes.push(0); |
| 1119 | bytes.extend_from_slice(entry.oid.as_bytes()); |
| 1120 | } |
| 1121 | Oid::hash_object(ObjectType::Tree, &bytes).map_err(|error| { |
| 1122 | ObservationError::new(format!("cannot hash in-memory Git index tree: {error}")) |
| 1123 | }) |
| 1124 | } |
| 1125 | |
| 1126 | fn git_tree_entry_order(left: &EncodedTreeEntry, right: &EncodedTreeEntry) -> std::cmp::Ordering { |
| 1127 | let common = left.name.len().min(right.name.len()); |