| 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()); |
| 1128 | match left.name[..common].cmp(&right.name[..common]) { |
| 1129 | std::cmp::Ordering::Equal => { |
| 1130 | let left_next = left.name.get(common).copied().unwrap_or_else(|| { |
| 1131 | if left.mode.is_tree() { |
| 1132 | b'/' |
| 1133 | } else { |
| 1134 | 0 |
| 1135 | } |
| 1136 | }); |
| 1137 | let right_next = right.name.get(common).copied().unwrap_or_else(|| { |
| 1138 | if right.mode.is_tree() { |
| 1139 | b'/' |
| 1140 | } else { |
| 1141 | 0 |
| 1142 | } |
| 1143 | }); |
| 1144 | left_next.cmp(&right_next) |
| 1145 | } |
| 1146 | ordering => ordering, |
| 1147 | } |
| 1148 | } |
| 1149 | |
| 1150 | fn compare_index_to_head( |
| 1151 | entries: &[IndexEntryObservation], |