2 # WARNING: for perl iterator/array support you need to run
3 # sed -i -e 's/SvTYPE(tsv) == SVt_PVHV/SvTYPE(tsv) == SVt_PVHV || SvTYPE(tsv) == SVt_PVAV/'
4 # on the generated c code
9 # %rename("to_s") string();
11 ##if defined(SWIGPYTHON)
12 # %rename("__str__") string();
19 %markfunc Pool "mark_Pool";
22 #if defined(SWIGPYTHON)
24 /* Check if is a list */
26 if (PyList_Check($input)) {
27 int size = PyList_Size($input);
29 for (i = 0; i < size; i++) {
30 PyObject *o = PyList_GetItem($input,i);
32 int e = SWIG_AsVal_int(o, &v);
34 SWIG_exception_fail(SWIG_ArgError(e), "list must contain only integers");
41 PyErr_SetString(PyExc_TypeError,"not a list");
48 PyObject *o = PyList_New($1.count);
49 for (i = 0; i < $1.count; i++)
50 PyList_SetItem(o, i, SWIG_From_int($1.elements[i]));
55 %define Queue2Array(type, step, con) %{
57 int cnt = $1.count / step;
58 Id *idp = $1.elements;
59 PyObject *o = PyList_New(cnt);
60 for (i = 0; i < cnt; i++, idp += step)
63 #define result resultx
66 PyList_SetItem(o, i, $result);
83 if (!SvROK($input) || SvTYPE(SvRV($input)) != SVt_PVAV)
84 SWIG_croak("Argument $argnum is not an array reference.");
85 av = (AV*)SvRV($input);
87 for (i = 0; i <= size; i++) {
88 SV **sv = av_fetch(av, i, 0);
90 int e = SWIG_AsVal_int(*sv, &v);
92 SWIG_croak("list must contain only integers");
98 # av_push(o, SvREFCNT_inc(SWIG_From_int($1.elements[i])));
99 # $result = newRV_noinc((SV*)o); argvi++;
101 %typemap(out) Queue {
103 if (argvi + $1.count + 1>= items) {
104 EXTEND(sp, items - (argvi + $1.count + 1) + 1);
106 for (i = 0; i < $1.count; i++)
107 ST(argvi++) = SvREFCNT_inc(SWIG_From_int($1.elements[i]));
111 %define Queue2Array(type, step, con) %{
113 int cnt = $1.count / step;
114 Id *idp = $1.elements;
115 if (argvi + cnt + 1 >= items) {
116 EXTEND(sp, items - (argvi + cnt + 1) + 1);
118 for (i = 0; i < cnt; i++, idp += step)
121 #define result resultx
124 SvREFCNT_inc(ST(argvi - 1));
134 %typemap(arginit) Queue {
137 %typemap(freearg) Queue {
141 #if defined(SWIGRUBY)
146 size = RARRAY($input)->len;
148 o = RARRAY($input)->ptr;
149 for (i = 0; i < size; i++, o++) {
151 int e = SWIG_AsVal_int(*o, &v);
154 SWIG_Error(SWIG_RuntimeError, "list must contain only integers");
160 %typemap(out) Queue {
162 VALUE o = rb_ary_new2($1.count);
163 for (i = 0; i < $1.count; i++)
164 rb_ary_store(o, i, SWIG_From_int($1.elements[i]));
168 %typemap(arginit) Queue {
171 %typemap(freearg) Queue {
174 %define Queue2Array(type, step, con) %{
176 int cnt = $1.count / step;
177 Id *idp = $1.elements;
178 VALUE o = rb_ary_new2(cnt);
179 for (i = 0; i < cnt; i++, idp += step)
182 #define result resultx
185 rb_ary_store(o, i, $result);
197 #if defined(SWIGPERL)
199 # work around a swig bug
203 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv,pPerl)
205 # ifndef MULTIPLICITY
206 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv)
208 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(PERL_GET_THX, cv)
214 %define perliter(class)
217 my $i = ${##class##::ITERATORS}{$_[0]};
219 $_[1] == $i->[0] - 1 ? $i->[1] : undef;
221 $_[0]->__getitem__($_[1]);
224 sub class##::FETCHSIZE {
225 my $i = ${##class##::ITERATORS}{$_[0]};
227 ($i->[1] = $_[0]->__next__()) ? ++$i->[0] : 0;
237 #define SWIG_PERL_ITERATOR 0x80
239 SWIGRUNTIMEINLINE SV *
240 SWIG_Perl_NewArrayObj(SWIG_MAYBE_PERL_OBJECT void *ptr, swig_type_info *t, int flags) {
241 SV *result = sv_newmortal();
242 if (ptr && (flags & (SWIG_SHADOW | SWIG_POINTER_OWN))) {
247 sv_setref_pv(obj, (char *) SWIG_Perl_TypeProxyName(t), ptr);
248 stash=SvSTASH(SvRV(obj));
249 if (flags & SWIG_POINTER_OWN) {
251 GV *gv=*(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
253 gv_init(gv, stash, "OWNER", 5, FALSE);
255 hv_store_ent(hv, obj, newSViv(1), 0);
257 if (flags & SWIG_PERL_ITERATOR) {
259 GV *gv=*(GV**)hv_fetch(stash, "ITERATORS", 9, TRUE);
262 gv_init(gv, stash, "ITERATORS", 9, FALSE);
264 hv_store_ent(hv, obj, newRV_inc((SV *)av), 0);
266 sv_magic((SV *)array, (SV *)obj, 'P', Nullch, 0);
268 self=newRV_noinc((SV *)array);
269 sv_setsv(result, self);
270 SvREFCNT_dec((SV *)self);
271 sv_bless(result, stash);
273 sv_setref_pv(result, (char *) SWIG_Perl_TypeProxyName(t), ptr);
280 %typemap(out) Perlarray {
281 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow); argvi++;
283 %typemap(out) Perliterator {
284 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow | SWIG_PERL_ITERATOR); argvi++;
287 %typemap(out) Pool_solvable_iterator * = Perlarray;
288 %typemap(out) Pool_solvable_iterator * solvables_iter = Perliterator;
289 %typemap(out) Pool_repo_iterator * = Perlarray;
290 %typemap(out) Pool_repo_iterator * repos_iter = Perliterator;
291 %typemap(out) Repo_solvable_iterator * = Perlarray;
292 %typemap(out) Repo_solvable_iterator * solvables_iter = Perliterator;
293 %typemap(out) Dataiterator * = Perliterator;
299 #if defined(SWIGPYTHON)
300 typedef PyObject *AppObjectPtr;
301 %typemap(out) AppObjectPtr {
306 #if defined(SWIGPERL)
307 typedef SV *AppObjectPtr;
308 %typemap(in) AppObjectPtr {
309 $1 = SvROK($input) ? SvRV($input) : 0;
311 %typemap(out) AppObjectPtr {
312 $result = $1 ? newRV_inc($1) : newSV(0);
316 #if defined(SWIGRUBY)
317 typedef VALUE AppObjectPtr;
318 %typemap(in) AppObjectPtr {
321 %typemap(out) AppObjectPtr {
331 %include "typemaps.i"
335 #include <sys/stat.h>
336 #include <sys/types.h>
340 #include "poolarch.h"
343 #include "solverdebug.h"
344 #include "repo_solv.h"
347 #include "repo_write.h"
349 #include "repo_rpmdb.h"
352 #include "repo_deb.h"
355 #include "repo_rpmmd.h"
356 #include "repo_updateinfoxml.h"
357 #include "repo_deltainfoxml.h"
358 #include "repo_repomdxml.h"
360 #ifdef ENABLE_SUSEREPO
361 #include "repo_products.h"
362 #include "repo_susetags.h"
363 #include "repo_content.h"
365 #include "solv_xfopen.h"
370 #define SOLVER_SOLUTION_ERASE -100
371 #define SOLVER_SOLUTION_REPLACE -101
372 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
373 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
374 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
376 typedef struct chksum Chksum;
378 typedef void *AppObjectPtr;
403 } Pool_solvable_iterator;
408 } Pool_repo_iterator;
413 } Repo_solvable_iterator;
453 Transaction *transaction;
461 typedef Dataiterator Datamatch;
466 %mixin Dataiterator "Enumerable";
467 %mixin Pool_solvable_iterator "Enumerable";
468 %mixin Pool_repo_iterator "Enumerable";
469 %mixin Repo_solvable_iterator "Enumerable";
477 %constant Id SOLVID_META;
478 %constant Id SOLVID_POS;
480 %constant int REL_EQ;
481 %constant int REL_GT;
482 %constant int REL_LT;
483 %constant int REL_ARCH;
511 # put before pool/repo so we can access the constructor
512 %nodefaultdtor Dataiterator;
513 typedef struct {} Dataiterator;
514 typedef struct {} Pool_solvable_iterator;
515 typedef struct {} Pool_repo_iterator;
516 typedef struct {} Repo_solvable_iterator;
518 %nodefaultctor Datamatch;
519 %nodefaultdtor Datamatch;
526 %nodefaultctor Datapos;
540 AppObjectPtr appdata;
545 typedef struct _Repo {
547 const char * const name;
550 int const nsolvables;
551 AppObjectPtr appdata;
554 %nodefaultctor Solver;
555 %nodefaultdtor Solver;
560 typedef struct chksum {
563 %rename(xfopen) solv_xfopen;
564 %rename(xfopen_fd) solv_xfopen_fd;
565 %rename(xfopen_dup) solv_xfopen_dup;
566 %rename(xfclose) solv_xfclose;
567 %rename(xfileno) solv_xfileno;
569 FILE *solv_xfopen(const char *fn, const char *mode = 0);
570 FILE *solv_xfopen_fd(const char *fn, int fd, const char *mode = 0);
571 FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode = 0);
572 int solv_xfclose(FILE *fp);
573 int solv_xfileno(FILE *fp);
576 SWIGINTERN int solv_xfclose(FILE *fp) {
579 SWIGINTERN int solv_xfileno(FILE *fp) {
582 SWIGINTERN FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode) {
584 return fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
607 %nodefaultctor Transaction;
608 %nodefaultdtor Transaction;
614 Transaction * const transaction;
623 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
624 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
625 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
626 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
627 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
628 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
629 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
630 static const Id SOLVER_NOOP = SOLVER_NOOP;
631 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
632 static const Id SOLVER_ERASE = SOLVER_ERASE;
633 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
634 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
635 static const Id SOLVER_NOOBSOLETES = SOLVER_NOOBSOLETES;
636 static const Id SOLVER_LOCK = SOLVER_LOCK;
637 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
638 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
639 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
640 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
641 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
642 static const Id SOLVER_WEAK = SOLVER_WEAK;
643 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
644 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
645 static const Id SOLVER_SETEV = SOLVER_SETEV;
646 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
647 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
648 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
649 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
650 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
651 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
653 Job(Pool *pool, int how, Id what) {
654 Job *job = solv_calloc(1, sizeof(*job));
661 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
662 %newobject solvables;
664 Pool *pool = $self->pool;
668 how = $self->how & SOLVER_SELECTMASK;
669 FOR_JOB_SELECT(p, pp, how, $self->what)
674 bool __eq__(Job *j) {
675 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
677 bool __ne__(Job *j) {
678 return !Job___eq__($self, j);
680 #if defined(SWIGPERL)
681 %rename("str") __str__;
683 const char *__str__() {
684 return pool_job2str($self->pool, $self->how, $self->what, 0);
686 const char *__repr__() {
687 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
688 return pool_tmpjoin($self->pool, "<Job ", str, ">");
694 return (Chksum *)solv_chksum_create(type);
696 Chksum(Id type, const char *hex) {
697 unsigned char buf[64];
698 int l = solv_chksum_len(type);
701 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
703 return (Chksum *)solv_chksum_create_from_bin(type, buf);
706 solv_chksum_free($self, 0);
710 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
711 return solv_chksum_get_type(chksum);
714 void add(const char *str) {
715 solv_chksum_add($self, str, strlen((char *)str));
717 void add_fp(FILE *fp) {
720 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
721 solv_chksum_add($self, buf, l);
722 rewind(fp); /* convenience */
724 void add_fd(int fd) {
727 while ((l = read(fd, buf, sizeof(buf))) > 0)
728 solv_chksum_add($self, buf, l);
729 lseek(fd, 0, 0); /* convenience */
731 void add_stat(const char *filename) {
733 if (stat(filename, &stb))
734 memset(&stb, 0, sizeof(stb));
735 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
736 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
737 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
738 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
742 const unsigned char *b;
743 b = solv_chksum_get($self, &l);
744 return cdata_void((void *)b, l);
749 const unsigned char *b;
752 b = solv_chksum_get($self, &l);
753 ret = solv_malloc(2 * l + 1);
754 solv_bin2hex(b, l, ret);
758 bool __eq__(Chksum *chk) {
760 const unsigned char *b, *bo;
763 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
765 b = solv_chksum_get($self, &l);
766 bo = solv_chksum_get(chk, 0);
767 return memcmp(b, bo, l) == 0;
769 bool __ne__(Chksum *chk) {
770 return !Chksum___eq__($self, chk);
772 #if defined(SWIGRUBY)
773 %rename("to_s") __str__;
774 %rename("inspect") __repr__;
776 #if defined(SWIGPERL)
777 %rename("str") __str__;
780 const char *__str__() {
783 if (solv_chksum_isfinished($self))
784 h = Chksum_hex($self);
785 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
786 solv_free((void *)h);
790 const char *__repr__() {
791 const char *h = Chksum___str__($self);
792 const char *str = solv_dupjoin("<Chksum ", h, ">");
793 solv_free((void *)h);
800 Pool *pool = pool_create();
805 void set_debuglevel(int level) {
806 pool_setdebuglevel($self, level);
808 #if defined(SWIGPYTHON)
810 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
811 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
812 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
813 PyObject *result = PyEval_CallObject((PyObject *)d, args);
818 return 0; /* exception */
819 ecode = SWIG_AsVal_int(result, &vresult);
821 return SWIG_IsOK(ecode) ? vresult : 0;
824 void set_loadcallback(PyObject *callable) {
825 if ($self->loadcallback == loadcallback) {
826 Py_DECREF($self->loadcallbackdata);
831 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
834 #if defined(SWIGPERL)
836 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
840 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
845 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
847 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
857 void set_loadcallback(SV *callable) {
858 if ($self->loadcallback == loadcallback)
859 SvREFCNT_dec($self->loadcallbackdata);
861 SvREFCNT_inc(callable);
862 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
866 #if defined(SWIGRUBY)
868 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
869 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
870 VALUE callable = (VALUE)d;
871 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
872 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
875 SWIGINTERN void mark_Pool(void *ptr) {
877 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
878 VALUE callable = (VALUE)pool->loadcallbackdata;
879 rb_gc_mark(callable);
883 %typemap(in, numinputs=0) VALUE callable {
884 $1 = rb_block_given_p() ? rb_block_proc() : 0;
886 void set_loadcallback(VALUE callable) {
887 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
892 Pool_set_loadcallback($self, 0);
895 Id str2id(const char *str, bool create=1) {
896 return pool_str2id($self, str, create);
898 Dep *Dep(const char *str, bool create=1) {
899 Id id = pool_str2id($self, str, create);
900 return new_Dep($self, id);
902 const char *id2str(Id id) {
903 return pool_id2str($self, id);
905 const char *dep2str(Id id) {
906 return pool_dep2str($self, id);
908 Id rel2id(Id name, Id evr, int flags, bool create=1) {
909 return pool_rel2id($self, name, evr, flags, create);
911 Id id2langid(Id id, const char *lang, bool create=1) {
912 return pool_id2langid($self, id, lang, create);
914 void setarch(const char *arch) {
915 pool_setarch($self, arch);
917 Repo *add_repo(const char *name) {
918 return repo_create($self, name);
920 const char *lookup_str(Id entry, Id keyname) {
921 return pool_lookup_str($self, entry, keyname);
923 Id lookup_id(Id entry, Id keyname) {
924 return pool_lookup_id($self, entry, keyname);
926 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
927 return pool_lookup_num($self, entry, keyname, notfound);
929 bool lookup_void(Id entry, Id keyname) {
930 return pool_lookup_void($self, entry, keyname);
932 %newobject lookup_checksum;
933 Chksum *lookup_checksum(Id entry, Id keyname) {
935 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
936 return solv_chksum_create_from_bin(type, b);
939 %newobject Dataiterator;
940 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
941 return new_Dataiterator($self, 0, p, key, match, flags);
943 const char *solvid2str(Id solvid) {
944 return pool_solvid2str($self, solvid);
946 void addfileprovides() {
947 pool_addfileprovides($self);
949 Queue addfileprovides_queue() {
952 pool_addfileprovides_queue($self, &r);
955 void createwhatprovides() {
956 pool_createwhatprovides($self);
959 XSolvable *id2solvable(Id id) {
960 return new_XSolvable($self, id);
962 %newobject solvables;
963 Pool_solvable_iterator * const solvables;
965 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
966 return new_Pool_solvable_iterator(pool);
969 %newobject solvables_iter;
970 Pool_solvable_iterator * solvables_iter() {
971 return new_Pool_solvable_iterator($self);
974 Repo *id2repo(Id id) {
975 if (id < 1 || id >= $self->nrepos)
977 return pool_id2repo($self, id);
980 Pool_repo_iterator * const repos;
982 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
983 return new_Pool_repo_iterator(pool);
986 %newobject repos_iter;
987 Pool_repo_iterator * repos_iter() {
988 return new_Pool_repo_iterator($self);
993 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
994 pool_set_installed(pool, installed);
996 Repo *Pool_installed_get(Pool *pool) {
997 return pool->installed;
1001 Queue matchprovidingids(const char *match, int flags) {
1007 for (id = 1; id < pool->ss.nstrings; id++)
1008 if (pool->whatprovides[id])
1012 if (!datamatcher_init(&ma, match, flags)) {
1013 for (id = 1; id < pool->ss.nstrings; id++)
1014 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1016 datamatcher_free(&ma);
1022 Job *Job(int how, Id what) {
1023 return new_Job($self, how, what);
1026 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1027 %newobject whatprovides;
1028 Queue whatprovides(Id dep) {
1033 FOR_PROVIDES(p, pp, dep)
1038 Id towhatprovides(Queue q) {
1039 return pool_queuetowhatprovides($self, &q);
1043 %rename("isknownarch?") isknownarch;
1045 bool isknownarch(Id id) {
1047 if (!id || id == ID_EMPTY)
1049 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1051 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1058 return solver_create($self);
1063 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1064 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1065 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1066 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1067 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1068 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1069 #ifdef ENABLE_SUSETAGS
1070 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1073 void free(bool reuseids = 0) {
1074 repo_free($self, reuseids);
1076 void empty(bool reuseids = 0) {
1077 repo_empty($self, reuseids);
1080 %rename("isempty?") isempty;
1083 return !$self->nsolvables;
1085 bool add_solv(const char *name, int flags = 0) {
1086 FILE *fp = fopen(name, "r");
1090 r = repo_add_solv_flags($self, fp, flags);
1094 bool add_solv(FILE *fp, int flags = 0) {
1095 return repo_add_solv_flags($self, fp, flags) == 0;
1098 XSolvable *add_solvable() {
1099 Id solvid = repo_add_solvable($self);
1100 return new_XSolvable($self->pool, solvid);
1104 bool add_rpmdb(Repo *ref, int flags = 0) {
1105 repo_add_rpmdb($self, ref, 0, flags);
1108 Id add_rpm(const char *name, int flags = 0) {
1109 return repo_add_rpm($self, name, flags);
1113 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1114 repo_add_rpmmd($self, fp, language, flags);
1117 bool add_repomdxml(FILE *fp, int flags = 0) {
1118 repo_add_repomdxml($self, fp, flags);
1121 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1122 repo_add_updateinfoxml($self, fp, flags);
1125 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1126 repo_add_deltainfoxml($self, fp, flags);
1130 #ifdef ENABLE_DEBIAN
1131 bool add_debdb(int flags = 0) {
1132 repo_add_debdb($self, 0, flags);
1135 Id add_deb(const char *name, int flags = 0) {
1136 return repo_add_deb($self, name, flags);
1139 #ifdef ENABLE_SUSEREPO
1140 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1141 repo_add_susetags($self, fp, defvendor, language, flags);
1144 bool add_content(FILE *fp, int flags = 0) {
1145 repo_add_content($self, fp, flags);
1148 bool add_products(const char *proddir, int flags = 0) {
1149 repo_add_products($self, proddir, 0, flags);
1153 void internalize() {
1154 repo_internalize($self);
1156 const char *lookup_str(Id entry, Id keyname) {
1157 return repo_lookup_str($self, entry, keyname);
1159 Id lookup_id(Id entry, Id keyname) {
1160 return repo_lookup_id($self, entry, keyname);
1162 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
1163 return repo_lookup_num($self, entry, keyname, notfound);
1165 void write(FILE *fp) {
1166 repo_write($self, fp, repo_write_stdkeyfilter, 0, 0);
1168 # HACK, remove if no longer needed!
1169 bool write_first_repodata(FILE *fp) {
1170 int oldnrepodata = $self->nrepodata;
1171 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1172 repo_write($self, fp, repo_write_stdkeyfilter, 0, 0);
1173 $self->nrepodata = oldnrepodata;
1177 %newobject Dataiterator;
1178 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1179 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1184 SWIGINTERN Id Repo_id_get(Repo *repo) {
1185 return repo->repoid;
1188 Repo_solvable_iterator * const solvables;
1190 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1191 return new_Repo_solvable_iterator(repo);
1194 %newobject solvables_iter;
1195 Repo_solvable_iterator *solvables_iter() {
1196 return new_Repo_solvable_iterator($self);
1199 XRepodata *add_repodata(int flags = 0) {
1200 Repodata *rd = repo_add_repodata($self, flags);
1201 return new_XRepodata($self, rd->repodataid);
1204 void create_stubs() {
1206 if (!$self->nrepodata)
1208 data = repo_id2repodata($self, $self->nrepodata - 1);
1209 if (data->state != REPODATA_STUB)
1210 repodata_create_stubs(data);
1213 %rename("iscontiguous?") iscontiguous;
1215 bool iscontiguous() {
1217 for (i = $self->start; i < $self->end; i++)
1218 if ($self->pool->solvables[i].repo != $self)
1222 XRepodata *first_repodata() {
1225 if ($self->nrepodata < 2)
1227 /* make sure all repodatas but the first are extensions */
1228 data = repo_id2repodata($self, 1);
1229 if (data->loadcallback)
1231 for (i = 2; i < $self->nrepodata; i++)
1233 data = repo_id2repodata($self, i);
1234 if (!data->loadcallback)
1235 return 0; /* oops, not an extension */
1237 return new_XRepodata($self, 1);
1240 bool __eq__(Repo *repo) {
1241 return $self == repo;
1243 bool __ne__(Repo *repo) {
1244 return $self != repo;
1246 #if defined(SWIGPERL)
1247 %rename("str") __str__;
1250 const char *__str__() {
1253 return solv_strdup($self->name);
1254 sprintf(buf, "Repo#%d", $self->repoid);
1255 return solv_strdup(buf);
1257 %newobject __repr__;
1258 const char *__repr__() {
1262 sprintf(buf, "<Repo #%d ", $self->repoid);
1263 return solv_dupjoin(buf, $self->name, ">");
1265 sprintf(buf, "<Repo #%d>", $self->repoid);
1266 return solv_strdup(buf);
1270 %extend Dataiterator {
1271 static const int SEARCH_STRING = SEARCH_STRING;
1272 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1273 static const int SEARCH_GLOB = SEARCH_GLOB;
1274 static const int SEARCH_REGEX = SEARCH_REGEX;
1275 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1276 static const int SEARCH_FILES = SEARCH_FILES;
1277 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1279 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1280 Dataiterator *di = solv_calloc(1, sizeof(*di));
1281 dataiterator_init(di, pool, repo, p, key, match, flags);
1285 dataiterator_free($self);
1288 #if defined(SWIGPYTHON)
1289 %newobject __iter__;
1290 Dataiterator *__iter__() {
1292 ndi = solv_calloc(1, sizeof(*ndi));
1293 dataiterator_init_clone(ndi, $self);
1296 %rename("next") __next__();
1297 %exception __next__ {
1300 PyErr_SetString(PyExc_StopIteration,"no more matches");
1307 perliter(solv::Dataiterator)
1310 %newobject __next__;
1311 Datamatch *__next__() {
1313 if (!dataiterator_step($self)) {
1316 ndi = solv_calloc(1, sizeof(*ndi));
1317 dataiterator_init_clone(ndi, $self);
1323 while ((d = Dataiterator___next__($self)) != 0) {
1324 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1328 void prepend_keyname(Id key) {
1329 dataiterator_prepend_keyname($self, key);
1331 void skip_solvable() {
1332 dataiterator_skip_solvable($self);
1337 Id lookup_id(Id keyname) {
1338 Pool *pool = $self->repo->pool;
1339 Datapos oldpos = pool->pos;
1342 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1346 const char *lookup_str(Id keyname) {
1347 Pool *pool = $self->repo->pool;
1348 Datapos oldpos = pool->pos;
1351 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1355 %newobject lookup_checksum;
1356 Chksum *lookup_checksum(Id keyname) {
1357 Pool *pool = $self->repo->pool;
1358 Datapos oldpos = pool->pos;
1360 const unsigned char *b;
1362 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1364 return solv_chksum_create_from_bin(type, b);
1370 dataiterator_free($self);
1373 %newobject solvable;
1374 XSolvable * const solvable;
1376 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1377 return new_XSolvable(di->pool, di->solvid);
1381 return $self->key->name;
1383 const char *key_idstr() {
1384 return pool_id2str($self->pool, $self->key->name);
1387 return $self->key->type;
1389 const char *type_idstr() {
1390 return pool_id2str($self->pool, $self->key->type);
1393 return $self->kv.id;
1395 const char *idstr() {
1396 return pool_id2str($self->pool, $self->kv.id);
1399 return $self->kv.str;
1402 return $self->kv.num;
1405 return $self->kv.num2;
1409 Pool *pool = $self->pool;
1410 Datapos *pos, oldpos = pool->pos;
1411 dataiterator_setpos($self);
1412 pos = solv_calloc(1, sizeof(*pos));
1417 %newobject parentpos;
1418 Datapos *parentpos() {
1419 Pool *pool = $self->pool;
1420 Datapos *pos, oldpos = pool->pos;
1421 dataiterator_setpos_parent($self);
1422 pos = solv_calloc(1, sizeof(*pos));
1428 dataiterator_setpos($self);
1430 void setpos_parent() {
1431 dataiterator_setpos_parent($self);
1435 %extend Pool_solvable_iterator {
1436 Pool_solvable_iterator(Pool *pool) {
1437 Pool_solvable_iterator *s;
1438 s = solv_calloc(1, sizeof(*s));
1442 #if defined(SWIGPYTHON)
1443 %newobject __iter__;
1444 Pool_solvable_iterator *__iter__() {
1445 Pool_solvable_iterator *s;
1446 s = solv_calloc(1, sizeof(*s));
1450 %rename("next") __next__();
1451 %exception __next__ {
1454 PyErr_SetString(PyExc_StopIteration,"no more matches");
1461 perliter(solv::Pool_solvable_iterator)
1463 %newobject __next__;
1464 XSolvable *__next__() {
1465 Pool *pool = $self->pool;
1466 if ($self->id >= pool->nsolvables)
1468 while (++$self->id < pool->nsolvables)
1469 if (pool->solvables[$self->id].repo)
1470 return new_XSolvable(pool, $self->id);
1476 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1477 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1481 %newobject __getitem__;
1482 XSolvable *__getitem__(Id key) {
1483 Pool *pool = $self->pool;
1484 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1485 return new_XSolvable(pool, key);
1489 return $self->pool->nsolvables;
1493 %extend Pool_repo_iterator {
1494 Pool_repo_iterator(Pool *pool) {
1495 Pool_repo_iterator *s;
1496 s = solv_calloc(1, sizeof(*s));
1500 #if defined(SWIGPYTHON)
1501 %newobject __iter__;
1502 Pool_repo_iterator *__iter__() {
1503 Pool_repo_iterator *s;
1504 s = solv_calloc(1, sizeof(*s));
1508 %rename("next") __next__();
1509 %exception __next__ {
1512 PyErr_SetString(PyExc_StopIteration,"no more matches");
1517 %newobject __next__;
1519 Pool *pool = $self->pool;
1520 if ($self->id >= pool->nrepos)
1522 while (++$self->id < pool->nrepos) {
1523 Repo *r = pool_id2repo(pool, $self->id);
1532 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1533 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p__Repo, SWIG_POINTER_OWN | 0));
1537 Repo *__getitem__(Id key) {
1538 Pool *pool = $self->pool;
1539 if (key > 0 && key < pool->nrepos)
1540 return pool_id2repo(pool, key);
1544 return $self->pool->nrepos;
1548 %extend Repo_solvable_iterator {
1549 Repo_solvable_iterator(Repo *repo) {
1550 Repo_solvable_iterator *s;
1551 s = solv_calloc(1, sizeof(*s));
1555 #if defined(SWIGPYTHON)
1556 %newobject __iter__;
1557 Repo_solvable_iterator *__iter__() {
1558 Repo_solvable_iterator *s;
1559 s = solv_calloc(1, sizeof(*s));
1563 %rename("next") __next__();
1564 %exception __next__ {
1567 PyErr_SetString(PyExc_StopIteration,"no more matches");
1572 %newobject __next__;
1573 XSolvable *__next__() {
1574 Repo *repo = $self->repo;
1575 Pool *pool = repo->pool;
1576 if (repo->start > 0 && $self->id < repo->start)
1577 $self->id = repo->start - 1;
1578 if ($self->id >= repo->end)
1580 while (++$self->id < repo->end)
1581 if (pool->solvables[$self->id].repo == repo)
1582 return new_XSolvable(pool, $self->id);
1588 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
1589 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1593 %newobject __getitem__;
1594 XSolvable *__getitem__(Id key) {
1595 Repo *repo = $self->repo;
1596 Pool *pool = repo->pool;
1597 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
1598 return new_XSolvable(pool, key);
1602 return $self->repo->pool->nsolvables;
1607 Dep(Pool *pool, Id id) {
1611 s = solv_calloc(1, sizeof(*s));
1617 return pool_dep2str($self->pool, $self->id);
1619 bool __eq__(Dep *s) {
1620 return $self->pool == s->pool && $self->id == s->id;
1622 bool __ne__(Dep *s) {
1623 return !Dep___eq__($self, s);
1625 #if defined(SWIGPERL)
1626 %rename("str") __str__;
1628 const char *__str__() {
1629 return pool_dep2str($self->pool, $self->id);
1631 %newobject __repr__;
1632 const char *__repr__() {
1634 sprintf(buf, "<Id #%d ", $self->id);
1635 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
1640 XSolvable(Pool *pool, Id id) {
1642 if (!id || id >= pool->nsolvables)
1644 s = solv_calloc(1, sizeof(*s));
1650 return pool_solvid2str($self->pool, $self->id);
1652 const char *lookup_str(Id keyname) {
1653 return pool_lookup_str($self->pool, $self->id, keyname);
1655 Id lookup_id(Id keyname) {
1656 return pool_lookup_id($self->pool, $self->id, keyname);
1658 unsigned int lookup_num(Id keyname, unsigned int notfound = 0) {
1659 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
1661 bool lookup_void(Id keyname) {
1662 return pool_lookup_void($self->pool, $self->id, keyname);
1664 %newobject lookup_checksum;
1665 Chksum *lookup_checksum(Id keyname) {
1667 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
1668 return solv_chksum_create_from_bin(type, b);
1670 Queue lookup_idarray(Id keyname, Id marker = 1) {
1671 Solvable *s = $self->pool->solvables + $self->id;
1675 if (keyname == SOLVABLE_PROVIDES)
1676 marker = -SOLVABLE_FILEMARKER;
1677 else if (keyname == SOLVABLE_REQUIRES)
1678 marker = -SOLVABLE_PREREQMARKER;
1682 solvable_lookup_deparray(s, keyname, &r, marker);
1685 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
1686 %newobject lookup_deparray;
1687 Queue lookup_deparray(Id keyname, Id marker = 1) {
1688 Solvable *s = $self->pool->solvables + $self->id;
1692 if (keyname == SOLVABLE_PROVIDES)
1693 marker = -SOLVABLE_FILEMARKER;
1694 else if (keyname == SOLVABLE_REQUIRES)
1695 marker = -SOLVABLE_PREREQMARKER;
1699 solvable_lookup_deparray(s, keyname, &r, marker);
1702 const char *lookup_location(unsigned int *OUTPUT) {
1703 return solvable_get_location($self->pool->solvables + $self->id, OUTPUT);
1706 %rename("installable?") installable;
1708 bool installable() {
1709 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
1712 %rename("isinstalled?") isinstalled;
1714 bool isinstalled() {
1715 Pool *pool = $self->pool;
1716 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
1721 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
1722 Pool *pool = xs->pool;
1723 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
1725 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
1726 Pool *pool = xs->pool;
1727 return pool_id2str(pool, pool->solvables[xs->id].name);
1732 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
1733 xs->pool->solvables[xs->id].name = nameid;
1735 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
1736 return xs->pool->solvables[xs->id].name;
1741 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
1742 Pool *pool = xs->pool;
1743 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
1745 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
1746 Pool *pool = xs->pool;
1747 return pool_id2str(pool, pool->solvables[xs->id].evr);
1752 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
1753 xs->pool->solvables[xs->id].evr = evrid;
1755 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
1756 return xs->pool->solvables[xs->id].evr;
1761 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
1762 Pool *pool = xs->pool;
1763 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
1765 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
1766 Pool *pool = xs->pool;
1767 return pool_id2str(pool, pool->solvables[xs->id].arch);
1772 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
1773 xs->pool->solvables[xs->id].arch = archid;
1775 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
1776 return xs->pool->solvables[xs->id].arch;
1781 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
1782 Pool *pool = xs->pool;
1783 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
1785 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
1786 Pool *pool = xs->pool;
1787 return pool_id2str(pool, pool->solvables[xs->id].vendor);
1792 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
1793 xs->pool->solvables[xs->id].vendor = vendorid;
1795 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
1796 return xs->pool->solvables[xs->id].vendor;
1801 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
1802 return xs->pool->solvables[xs->id].repo;
1806 void add_provides(Dep *dep, Id marker = -SOLVABLE_FILEMARKER) {
1807 Solvable *s = $self->pool->solvables + $self->id;
1808 s->provides = repo_addid_dep(s->repo, s->provides, dep->id, marker);
1810 void add_providesid(Id id, Id marker = -SOLVABLE_FILEMARKER) {
1811 Solvable *s = $self->pool->solvables + $self->id;
1812 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
1814 void add_obsoletes(Dep *dep) {
1815 Solvable *s = $self->pool->solvables + $self->id;
1816 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, dep->id, 0);
1818 void add_obsoletesid(Id id) {
1819 Solvable *s = $self->pool->solvables + $self->id;
1820 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
1822 void add_conflicts(Dep *dep) {
1823 Solvable *s = $self->pool->solvables + $self->id;
1824 s->conflicts = repo_addid_dep(s->repo, s->conflicts, dep->id, 0);
1826 void add_conflictsid(Id id) {
1827 Solvable *s = $self->pool->solvables + $self->id;
1828 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
1830 void add_requires(Dep *dep, Id marker = -SOLVABLE_PREREQMARKER) {
1831 Solvable *s = $self->pool->solvables + $self->id;
1832 s->requires = repo_addid_dep(s->repo, s->requires, dep->id, marker);
1834 void add_requiresid(Id id, Id marker = -SOLVABLE_PREREQMARKER) {
1835 Solvable *s = $self->pool->solvables + $self->id;
1836 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
1838 void add_recommends(Dep *dep) {
1839 Solvable *s = $self->pool->solvables + $self->id;
1840 s->recommends = repo_addid_dep(s->repo, s->recommends, dep->id, 0);
1842 void add_recommendsid(Id id) {
1843 Solvable *s = $self->pool->solvables + $self->id;
1844 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
1846 void add_suggests(Dep *dep) {
1847 Solvable *s = $self->pool->solvables + $self->id;
1848 s->suggests = repo_addid_dep(s->repo, s->suggests, dep->id, 0);
1850 void add_suggestsid(Id id) {
1851 Solvable *s = $self->pool->solvables + $self->id;
1852 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
1854 void add_supplements(Dep *dep) {
1855 Solvable *s = $self->pool->solvables + $self->id;
1856 s->supplements = repo_addid_dep(s->repo, s->supplements, dep->id, 0);
1858 void add_supplementsid(Id id) {
1859 Solvable *s = $self->pool->solvables + $self->id;
1860 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
1862 void add_enhances(Dep *dep) {
1863 Solvable *s = $self->pool->solvables + $self->id;
1864 s->enhances = repo_addid_dep(s->repo, s->enhances, dep->id, 0);
1866 void add_enhancesid(Id id) {
1867 Solvable *s = $self->pool->solvables + $self->id;
1868 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
1871 bool __eq__(XSolvable *s) {
1872 return $self->pool == s->pool && $self->id == s->id;
1874 bool __ne__(XSolvable *s) {
1875 return !XSolvable___eq__($self, s);
1877 #if defined(SWIGPERL)
1878 %rename("str") __str__;
1880 const char *__str__() {
1881 return pool_solvid2str($self->pool, $self->id);
1883 %newobject __repr__;
1884 const char *__repr__() {
1886 sprintf(buf, "<Solvable #%d ", $self->id);
1887 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
1892 Problem(Solver *solv, Id id) {
1894 p = solv_calloc(1, sizeof(*p));
1899 %newobject findproblemrule;
1900 XRule *findproblemrule() {
1901 Id r = solver_findproblemrule($self->solv, $self->id);
1902 return new_XRule($self->solv, r);
1904 %newobject findallproblemrules;
1905 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
1906 Queue findallproblemrules(int unfiltered=0) {
1907 Solver *solv = $self->solv;
1912 solver_findallproblemrules(solv, $self->id, &q);
1915 for (i = j = 0; i < q.count; i++)
1917 SolverRuleinfo rclass;
1918 probr = q.elements[i];
1919 rclass = solver_ruleclass(solv, probr);
1920 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
1922 q.elements[j++] = probr;
1925 queue_truncate(&q, j);
1929 int solution_count() {
1930 return solver_solution_count($self->solv, $self->id);
1932 %newobject solutions;
1933 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
1938 cnt = solver_solution_count($self->solv, $self->id);
1939 for (i = 1; i <= cnt; i++)
1946 Solution(Problem *p, Id id) {
1948 s = solv_calloc(1, sizeof(*s));
1950 s->problemid = p->id;
1954 int element_count() {
1955 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
1958 %newobject elements;
1959 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
1960 Queue elements(bool expandreplaces=0) {
1964 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
1965 for (i = 1; i <= cnt; i++)
1968 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
1970 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
1976 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
1977 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
1979 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
1980 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
1981 queue_push2(&q, p, rp);
1983 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
1984 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
1985 queue_push2(&q, p, rp);
1987 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
1988 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
1989 queue_push2(&q, p, rp);
1994 queue_push2(&q, i, type);
1995 queue_push2(&q, p, rp);
2001 %extend Solutionelement {
2002 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2004 e = solv_calloc(1, sizeof(*e));
2006 e->problemid = problemid;
2017 if (p == SOLVER_SOLUTION_ERASE)
2022 else if (p == SOLVER_SOLUTION_REPLACE)
2027 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2028 return pool_tmpjoin($self->solv->pool, "allow ", policy_illegal2str($self->solv, POLICY_ILLEGAL_DOWNGRADE, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp), 0);
2029 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2030 return pool_tmpjoin($self->solv->pool, "allow ", policy_illegal2str($self->solv, POLICY_ILLEGAL_ARCHCHANGE, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp), 0);
2031 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2032 return pool_tmpjoin($self->solv->pool, "allow ", policy_illegal2str($self->solv, POLICY_ILLEGAL_VENDORCHANGE, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp), 0);
2033 return solver_solutionelement2str($self->solv, p, rp);
2035 %newobject replaceelements;
2036 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2037 Queue replaceelements() {
2042 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2045 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2046 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2047 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2048 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2049 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2050 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2051 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2053 queue_push(&q, $self->type);
2056 int illegalreplace() {
2057 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2059 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2061 %newobject solvable;
2062 XSolvable * const solvable;
2063 %newobject replacement;
2064 XSolvable * const replacement;
2067 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2068 return new_XSolvable(e->solv->pool, e->p);
2070 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2071 return new_XSolvable(e->solv->pool, e->rp);
2073 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2074 if (e->type != SOLVER_SOLUTION_JOB)
2076 return (e->p - 1) / 2;
2081 if ($self->type == SOLVER_SOLUTION_JOB)
2082 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2083 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE)
2084 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE, $self->p);
2085 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2086 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE, $self->rp);
2087 if ($self->type == SOLVER_SOLUTION_ERASE)
2088 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE, $self->p);
2094 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2095 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2096 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2097 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2098 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2099 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2100 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2101 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2102 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2103 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2104 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2105 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2106 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2107 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2108 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2109 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2110 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2111 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2112 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2114 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2115 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2116 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2117 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2118 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2119 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2120 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2121 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2123 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2124 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2125 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2127 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2128 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2129 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2130 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2131 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2132 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2133 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2134 static const int SOLVER_FLAG_IGNORE_ALREADY_RECOMMENDED = SOLVER_FLAG_IGNORE_ALREADY_RECOMMENDED;
2135 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2141 int set_flag(int flag, int value) {
2142 return solver_set_flag($self, flag, value);
2144 int get_flag(int flag) {
2145 return solver_get_flag($self, flag);
2147 #if defined(SWIGPYTHON)
2149 def solve(self, jobs):
2151 for job in jobs: j += [job.how, job.what]
2152 return self.solve_helper(j)
2155 #if defined(SWIGPERL)
2157 sub solv::Solver::solve {
2158 my ($self, $jobs) = @_;
2159 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2160 return $self->solve_helper(\@j);
2164 #if defined(SWIGRUBY)
2167 "class Solv::Solver\n"
2168 " def solve(jobs)\n"
2170 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2171 " solve_helper(jl)\n"
2177 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2178 %newobject solve_helper;
2179 Queue solve_helper(Queue jobs) {
2183 solver_solve($self, &jobs);
2184 cnt = solver_problem_count($self);
2185 for (i = 1; i <= cnt; i++)
2189 %newobject transaction;
2190 Transaction *transaction() {
2191 return solver_create_transaction($self);
2195 %extend Transaction {
2196 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2197 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2198 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2199 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2200 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2201 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2202 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2203 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2204 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2205 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2206 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2207 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2208 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2209 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2210 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2211 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2212 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2213 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2214 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2215 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2216 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2217 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2218 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2219 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2220 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2221 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2222 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2224 transaction_free($self);
2227 %rename("isempty?") isempty;
2230 return $self->steps.count == 0;
2233 %newobject othersolvable;
2234 XSolvable *othersolvable(XSolvable *s) {
2235 Id op = transaction_obs_pkg($self, s->id);
2236 return new_XSolvable($self->pool, op);
2239 %newobject allothersolvables;
2240 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2241 Queue allothersolvables(XSolvable *s) {
2244 transaction_all_obs_pkgs($self, s->id, &q);
2248 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2249 %newobject classify;
2250 Queue classify(int mode = 0) {
2253 transaction_classify($self, mode, &q);
2257 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2258 %newobject newpackages;
2259 Queue newpackages() {
2263 cut = transaction_installedresult(self, &q);
2264 queue_truncate(&q, cut);
2268 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2269 %newobject keptpackages;
2270 Queue keptpackages() {
2274 cut = transaction_installedresult(self, &q);
2276 queue_deleten(&q, 0, cut);
2280 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2284 queue_init_clone(&q, &$self->steps);
2288 int steptype(XSolvable *s, int mode) {
2289 return transaction_type($self, s->id, mode);
2291 int calc_installsizechange() {
2292 return transaction_calc_installsizechange($self);
2294 void order(int flags) {
2295 transaction_order($self, flags);
2299 %extend TransactionClass {
2300 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2301 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2302 cl->transaction = trans;
2306 cl->fromid = fromid;
2310 %newobject solvables;
2311 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2315 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2321 XRule(Solver *solv, Id id) {
2324 XRule *xr = solv_calloc(1, sizeof(*xr));
2330 Id type, source, target, dep;
2331 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2332 return new_Ruleinfo($self, type, source, target, dep);
2334 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2335 %newobject allinfos;
2339 solver_allruleinfos($self->solv, $self->id, &q);
2343 bool __eq__(XRule *xr) {
2344 return $self->solv == xr->solv && $self->id == xr->id;
2346 bool __ne__(XRule *xr) {
2347 return !XRule___eq__($self, xr);
2349 %newobject __repr__;
2350 const char *__repr__() {
2352 sprintf(buf, "<Rule #%d>", $self->id);
2353 return solv_strdup(buf);
2358 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2359 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2363 ri->source = source;
2364 ri->target = target;
2368 XSolvable * const solvable;
2369 XSolvable * const othersolvable;
2371 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2372 return new_XSolvable(ri->solv->pool, ri->source);
2374 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2375 return new_XSolvable(ri->solv->pool, ri->target);
2378 const char *problemstr() {
2379 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2384 XRepodata(Repo *repo, Id id) {
2385 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2391 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2393 void set_id(Id solvid, Id keyname, Id id) {
2394 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2396 void set_str(Id solvid, Id keyname, const char *str) {
2397 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2399 void set_poolstr(Id solvid, Id keyname, const char *str) {
2400 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2402 void add_idarray(Id solvid, Id keyname, Id id) {
2403 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2405 void add_flexarray(Id solvid, Id keyname, Id handle) {
2406 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2408 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2409 const unsigned char *buf = solv_chksum_get(chksum, 0);
2411 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2413 const char *lookup_str(Id solvid, Id keyname) {
2414 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2416 Queue lookup_idarray(Id solvid, Id keyname) {
2419 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2422 %newobject lookup_checksum;
2423 Chksum *lookup_checksum(Id solvid, Id keyname) {
2425 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2426 return solv_chksum_create_from_bin(type, b);
2428 void internalize() {
2429 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2431 void create_stubs() {
2432 repodata_create_stubs(repo_id2repodata($self->repo, $self->id));
2434 void write(FILE *fp) {
2435 repodata_write(repo_id2repodata($self->repo, $self->id), fp, repo_write_stdkeyfilter, 0);
2437 bool add_solv(FILE *fp, int flags = 0) {
2438 Repodata *data = repo_id2repodata($self->repo, $self->id);
2439 int r, oldstate = data->state;
2440 data->state = REPODATA_LOADING;
2441 r = repo_add_solv_flags(data->repo, fp, flags | REPO_USE_LOADING);
2442 if (r || data->state == REPODATA_LOADING)
2443 data->state = oldstate;
2446 void extend_to_repo() {
2447 Repodata *data = repo_id2repodata($self->repo, $self->id);
2448 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2450 bool __eq__(XRepodata *xr) {
2451 return $self->repo == xr->repo && $self->id == xr->id;
2453 bool __ne__(XRepodata *xr) {
2454 return !XRepodata___eq__($self, xr);
2456 %newobject __repr__;
2457 const char *__repr__() {
2459 sprintf(buf, "<Repodata #%d>", $self->id);
2460 return solv_strdup(buf);