int start; /* start of this repo solvables within pool->solvables */
int end; /* last solvable + 1 of this repo */
int nsolvables; /* number of solvables repo is contributing to pool */
- int nextra; /* number of extra objects (non-solvables) */
int priority; /* priority of this repo */
#define SEARCH_NOCASE (1<<8)
#define SEARCH_NO_STORAGE_SOLVABLE (1<<9)
-#define SEARCH_EXTRA (1<<10)
#define SEARCH_SUB (1<<10)
#define SEARCH_ALL_REPOS (1<<11)
#define SEARCH_SKIP_KIND (1<<12)
repo = pool->repos[j];
dump_repodata(repo);
- printf("repo %d contains %d solvables %d non-solvables\n", j, repo->nsolvables, repo->nextra);
+ printf("repo %d contains %d solvables\n", j, repo->nsolvables);
printf("repo start: %d end: %d\n", repo->start, repo->end);
for (i = repo->start, n = 1; i < repo->end; i++)
{
#endif
n++;
}
+#if 0
for (i = 0; i < repo->nextra; i++)
{
printf("\nextra %d:\n", i);
while (dataiterator_step(&di))
dump_attr(repo, di.data, di.key, &di.kv);
}
+#endif
#if 0
tryme(repo, 0, SOLVABLE_MEDIANR, 0, 0);
printf("\n");