diff options
| -rw-r--r-- | lib/libalpm/deps.c | 19 | ||||
| -rw-r--r-- | lib/libalpm/deps.h | 1 |
2 files changed, 0 insertions, 20 deletions
diff --git a/lib/libalpm/deps.c b/lib/libalpm/deps.c index 7b7d1097..7529ec98 100644 --- a/lib/libalpm/deps.c +++ b/lib/libalpm/deps.c @@ -82,25 +82,6 @@ pmdepmissing_t *_alpm_depmiss_new(const char *target, pmdepmod_t depmod, return(miss); } -int _alpm_depmiss_isin(pmdepmissing_t *needle, alpm_list_t *haystack) -{ - alpm_list_t *i; - - ALPM_LOG_FUNC; - - for(i = haystack; i; i = i->next) { - pmdepmissing_t *miss = i->data; - if(!strcmp(needle->target, miss->target) && - needle->depend.mod == miss->depend.mod && - !strcmp(needle->depend.name, miss->depend.name) && - !strcmp(needle->depend.version, miss->depend.version)) { - return(1); - } - } - - return(0); -} - /* Convert a list of pmpkg_t * to a graph structure, * with a edge for each dependency. * Returns a list of vertices (one vertex = one package) diff --git a/lib/libalpm/deps.h b/lib/libalpm/deps.h index e4bba8bf..2da39b8b 100644 --- a/lib/libalpm/deps.h +++ b/lib/libalpm/deps.h @@ -52,7 +52,6 @@ struct __pmgraph_t { pmdepmissing_t *_alpm_depmiss_new(const char *target, pmdepmod_t depmod, const char *depname, const char *depversion); -int _alpm_depmiss_isin(pmdepmissing_t *needle, alpm_list_t *haystack); alpm_list_t *_alpm_sortbydeps(alpm_list_t *targets, pmtranstype_t mode); void _alpm_recursedeps(pmdb_t *db, alpm_list_t *targs, int include_explicit); int _alpm_resolvedeps(pmdb_t *local, alpm_list_t *dbs_sync, pmpkg_t *syncpkg, |