Le samedi 9 mai 2009, Jakub Narebski a écrit : > Christian Couder <chriscool@xxxxxxxxxxxxx> writes: > > This makes sha1_array easier to use, so later patches will be simpler. > > Hmmm... sort on lookup array. I wonder if it would be worth > librarizing, and if there is any smart optimization for that (like > e.g. heap for fast access to smallest value and fast insertion, using > insertion sort for almost sorted array, etc.). > > BTW. does it become unsorted anywhere? No, it doesn't. We first read all the "refs/bisect/good-*" and "refs/bisect/skip-*" and put them in some "struct sha1_array". Then later we may lookup sha1 there from 2 different functions: "check_merge_bases" first and then "filter_skipped". This patch optimizes by not sorting before we lookup, so if we don't lookup anything, we pay no sorting price. Best regards, Christian. -- 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