diff options
| author | Xavier Chantry <shiningxc@gmail.com> | 2009-10-11 02:38:33 +0200 |
|---|---|---|
| committer | Dan McGee <dan@archlinux.org> | 2009-10-11 15:28:10 -0500 |
| commit | 3dc87851cc5990d358cf985d8e79dffeb2d91a21 (patch) | |
| tree | 415ac62ab7700fdee800503e3bc1c6bfbfb81f0e /lib/libalpm/trans.c | |
| parent | 14ab02e289668e30d33c473e00fc43e5dc457644 (diff) | |
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>
Diffstat (limited to 'lib/libalpm/trans.c')
0 files changed, 0 insertions, 0 deletions