⛏️ index : gitore.git

author Alexander von Gluck IV <alex@terarocket.io> 2025-11-26 8:18:37.0 -06:00:00
committer Alexander von Gluck IV <alex@terarocket.io> 2025-11-26 8:20:50.0 -06:00:00
commit
7c66f6b6b027e2e68244cc71acadd09902884d65 [patch]
tree
794f32026c3343dbeac670387446e379d4a2156e
parent
4270626573bcb47d33eac0aca909769edff1b2e8
download
7c66f6b6b027e2e68244cc71acadd09902884d65.tar.gz

database/indexer: Drop sorting

* After a quick discussion with the gix folks, the sorting has no
  impact on linear git histories. (and the presented double-sided
  rev() isn't possible)
* We're going to have to figure out a way to reverse the presentation
  of the commits stored in RocksDB.

Diff

 src/database/indexer.rs | 5 +----
 1 file changed, 1 insertion(+), 4 deletions(-)

diff --git a/src/database/indexer.rs b/src/database/indexer.rs
index fcd2e31..75891be 100644
--- a/src/database/indexer.rs
+++ b/src/database/indexer.rs
@@ -13,8 +13,6 @@
    bstr::{BStr, ByteSlice},
    objs::tree::EntryKind,
    refs::Category,
    revision::walk::Sorting,
    traverse::commit::simple::CommitTimeOrder,
    url::Scheme,
};

@@ -264,8 +262,7 @@
    let mut seen = false;
    let mut i = 0;

    let sorting = Sorting::ByCommitTime(CommitTimeOrder::OldestFirst);
    let revwalk_iter = git_repository.rev_walk([commit.id()]).sorting(sorting).all()?;
    let revwalk_iter = git_repository.rev_walk([commit.id()]).all()?;
    for revwalk in revwalk_iter {
        for revs in &revwalk.into_iter().chunks(250) {
            if ((i + 1) % 5_000) == 0 {