• Show log

    Commit

  • Hash : d307a013
    Author : Vicent Marti
    Date : 2015-10-27T22:17:32

    reuc: Be smarter when inserting new REUC entries
    
    Inserting new REUC entries can quickly become pathological given that
    each insert unsorts the REUC vector, and both subsequent lookups *and*
    insertions will require sorting it again before being successful.
    
    To avoid this, we're switching to `git_vector_insert_sorted`: this keeps
    the REUC vector constantly sorted and lets us use the `on_dup` callback
    to skip an extra binary search on each insertion.