Jeff King <peff@xxxxxxxx> writes: > We could instead bump X into the `i` slot, and then shift > the whole contiguous chain down by one, resulting in: > > index | i-1 | i | i+1 | i+2 | > ----------------------------------- > entry ... | A | X | B | C | ... > ----------------------------------- > > That puts our chain in true most-recently-used order. > However, experiments show that it is not any faster (and in > fact, is slightly slower due to the extra manipulation). Makes quite a lot of sense to me. Very simple, clean and nice. -- To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html