treebuilder: insert sorted

By inserting in the right position, we can keep the vector sorted, making entry insertion almost twice as fast.
jcajka · Jun 9, 2014 · 2c11d2e · 2c11d2e
1 parent 281da00
commit 2c11d2e
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/src/tree.c b/src/tree.c
@@ -460,7 +460,7 @@ static int append_entry(
 	git_oid_cpy(&entry->oid, id);
 	entry->attr = (uint16_t)filemode;
 
-	if (git_vector_insert(&bld->entries, entry) < 0) {
+	if (git_vector_insert_sorted(&bld->entries, entry, NULL) < 0) {
 		git__free(entry);
 		return -1;
 	}
@@ -671,7 +671,7 @@ int git_treebuilder_insert(
 		entry = alloc_entry(filename);
 		GITERR_CHECK_ALLOC(entry);
 
-		if (git_vector_insert(&bld->entries, entry) < 0) {
+		if (git_vector_insert_sorted(&bld->entries, entry, NULL) < 0) {
 			git__free(entry);
 			return -1;
 		}