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
..
po
.gitignore
add.c
add.h
alpm_list.c	alpm_list : add new alpm_list_diff_sorted function	2009-10-11 15:28:10 -05:00
alpm_list.h	alpm_list : add new alpm_list_diff_sorted function	2009-10-11 15:28:10 -05:00
alpm.c
alpm.h
backup.c
backup.h
be_files.c
be_package.c
cache.c
cache.h
conflict.c
conflict.h
db.c
db.h
delta.c
delta.h
deps.c
deps.h
dload.c
dload.h
error.c
graph.h
group.c
group.h
handle.c
handle.h
log.c
log.h
Makefile.am
md5.c
md5.h
package.c
package.h
remove.c
remove.h
sync.c	typing: a few more fixes for special int types	2009-10-11 14:41:59 -05:00
sync.h
trans.c
trans.h
util.c
util.h