• Show log

    Commit

  • Hash : cee1e7af
    Author : Michael Tesch
    Date : 2017-04-12T14:38:30

    merge: perform exact rename detection in linear time
    The current exact rename detection has order n^2 complexity.
    We can do better by using a map to first aggregate deletes and
    using that to match deletes to adds.
    
    This results in a substantial performance improvement for merges
    with a large quantity of adds and deletes.