Xavier Chantry 3dc87851cc alpm_list : add new alpm_list_diff_sorted function ... This is more efficient than alpm_list_diff since it assumes the two lists are sorted. And also we get the two sides of the diff. Even sorting should more efficient than the current list_diff. Sorting the two lists should be O(n*log(n)+m*log(m)) while the current list_diff is O(n*m). So I also reimplemented list_diff using list_diff_sorted. Signed-off-by: Xavier Chantry <shiningxc@gmail.com> Signed-off-by: Dan McGee <dan@archlinux.org>		2009-10-11 15:28:10 -05:00
..
libalpm	alpm_list : add new alpm_list_diff_sorted function	2009-10-11 15:28:10 -05:00