• Show log

    Commit

  • Hash : a5eea2d7
    Author : Russell Belfer
    Date : 2013-03-11T11:31:50

    Stabilize order for equiv tree iterator entries
    
    Given a group of case-insensitively equivalent tree iterator
    entries, this ensures that the case-sensitively first trees will
    be used as the representative items.  I.e. if you have conflicting
    entries "A/B/x", "a/b/x", and "A/b/x", this change ensures that
    the earliest entry "A/B/x" will be returned.  The actual choice
    is not that important, but it is nice to have it stable and to
    have it been either the first or last item, as opposed to a
    random item from within the equivalent span.