+/*
+ * Copyright (c) 2009-2012, Novell Inc.
+ *
+ * This program is licensed under the BSD license, read LICENSE.BSD
+ * for further information
+ */
+
#include <stdio.h>
#include <sys/stat.h>
+/*
+ * Copyright (c) 2009-2012, Novell Inc.
+ *
+ * This program is licensed under the BSD license, read LICENSE.BSD
+ * for further information
+ */
+
#ifndef POOL_FILECONFLICTS_H
#define POOL_FILECONFLICTS_H
+/*
+ * Copyright (c) 2009-2012, Novell Inc.
+ *
+ * This program is licensed under the BSD license, read LICENSE.BSD
+ * for further information
+ */
+
#ifndef SOLV_XFOPEN_H
#define SOLV_XFOPEN_H
printf ("\nSearchresults:\n");
Dataiterator di;
dataiterator_init(&di, pool, 0, 0, 0, "3", SEARCH_SUB | SEARCH_SUBSTRING | SEARCH_FILES);
- //int count = 0;
+ /* int count = 0; */
while (dataiterator_step(&di))
{
printf("%d:", di.solvid);
dump_attr(repo, di.data, di.key, &di.kv);
/*if (di.solvid == 4 && count++ == 0)
dataiterator_jump_to_solvable(&di, pool->solvables + 3);*/
- //dataiterator_skip_attribute(&di);
- //dataiterator_skip_solvable(&di);
- //dataiterator_skip_repo(&di);
+ /* dataiterator_skip_attribute(&di); */
+ /* dataiterator_skip_solvable(&di); */
+ /* dataiterator_skip_repo(&di); */
}
#endif
pool_free(pool);