Skip to content

feat: Implement incremental processing via tree and file hashing #12

@thiagozf

Description

@thiagozf

Improve performance and costs by skipping unchanged files and Git trees during indexing.

  • Store Git tree hashes for each branch or tag processed.
  • For each file, extract its hash and compare it to previous runs.
  • Skip LLM extraction and embedding if content haven't changed.

This avoids redundant processing of identical versions across runs — especially useful when re-indexing updated repositories or processing multiple tags with shared content.

Metadata

Metadata

Assignees

No one assigned

    Labels

    help wantedExtra attention is needed

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions