libsolv/bindings/solv.i

/*
 * WARNING: for perl iterator/array support you need to run
 *   sed -i -e 's/SvTYPE(tsv) == SVt_PVHV/SvTYPE(tsv) == SVt_PVHV || SvTYPE(tsv) == SVt_PVAV/'
 * on the generated c code
 */

%module solv

#ifdef SWIGRUBY
%markfunc Pool "mark_Pool";
#endif

#ifdef SWIGPYTHON
%begin %{
#define PY_SSIZE_T_CLEAN
%}
#endif

/**
 ** lua object stashing
 **/
#if defined(SWIGLUA)
%{
SWIGINTERN
void prep_stashed_lua_var(lua_State* L, char *name, void *ptr)
{
  lua_getglobal(L, "solv"); 
  if (lua_getfield(L, -1, "_stash") == LUA_TNIL) {
    lua_pop(L, 1);
    lua_newtable(L);
    lua_pushvalue(L, -1);
    lua_setfield(L, -3, "_stash");
  }
  lua_remove(L, -2);
  lua_pushfstring(L, "%s:%p", name, ptr);
}

SWIGINTERN
void set_stashed_lua_var(lua_State* L, int idx, char *name, void *ptr)
{
  lua_pushvalue(L, idx);
  prep_stashed_lua_var(L, name, ptr);
  lua_pushvalue(L, -3);
  lua_settable(L, -3);
  lua_pop(L, 2);
}

SWIGINTERN
void get_stashed_lua_var(lua_State* L, char *name, void *ptr)
{
  prep_stashed_lua_var(L, name, ptr);
  lua_gettable(L, -2);
  lua_remove(L, -2);
}

SWIGINTERN
void clr_stashed_lua_var(lua_State* L, char *name, void *ptr)
{
  prep_stashed_lua_var(L, name, ptr);
  lua_pushnil(L);
  lua_settable(L, -3);
  lua_pop(L, 1);
}
%}
#endif

/**
 ** binaryblob handling
 **/

%{
typedef struct {
  const void *data;
  size_t len;
} BinaryBlob;
%}

#if defined(SWIGLUA)
%typemap(in,noblock=1) (const unsigned char *str, size_t len) (char *buf = 0, size_t size = 0) {
  if (!lua_isstring(L, $input)) SWIG_fail_arg($symname, $input, "const char *");
  buf = (char *)lua_tolstring(L, $input, &size);
  $1 = (unsigned char *)buf;
  $2 = size;
}
%typemap(out,noblock=1) BinaryBlob {
  if ($1.data) {
    lua_pushlstring(L, $1.data, $1.len);
  } else {
    lua_pushnil(L);
  }
  SWIG_arg++;
}

#else

%typemap(in,noblock=1,fragment="SWIG_AsCharPtrAndSize") (const unsigned char *str, size_t len) (int res, char *buf = 0, size_t size = 0, int alloc = 0) {
#if defined(SWIGTCL)
  {
    int bal;
    unsigned char *ba;
    res = SWIG_TypeError;
    ba = Tcl_GetByteArrayFromObj($input, &bal);
    if (ba) {
      buf = (char *)ba;
      size = bal;
      res = SWIG_OK;
      alloc = SWIG_OLDOBJ;
    }
  }
#else
  res = SWIG_AsCharPtrAndSize($input, &buf, &size, &alloc);
  if (buf && size)
    size--;
#endif
  if (!SWIG_IsOK(res)) {
#if defined(SWIGPYTHON)
    const void *pybuf = 0;
    Py_ssize_t pysize = 0;
%#if PY_VERSION_HEX >= 0x03000000
    res = PyBytes_AsStringAndSize($input, (char **)&pybuf, &pysize);
%#else
    res = PyObject_AsReadBuffer($input, &pybuf, &pysize);
%#endif
    if (res < 0) {
      %argument_fail(res, "BinaryBlob", $symname, $argnum);
    } else {
      buf = (void *)pybuf;
      size = pysize;
    }
#else
    %argument_fail(res, "const char *", $symname, $argnum);
#endif
  }
  $1 = (unsigned char *)buf;
  $2 = size;
}

%typemap(freearg,noblock=1,match="in") (const unsigned char *str, size_t len) {
  if (alloc$argnum == SWIG_NEWOBJ) %delete_array(buf$argnum);
}

%typemap(out,noblock=1,fragment="SWIG_FromCharPtrAndSize") BinaryBlob {
#if defined(SWIGPYTHON) && defined(PYTHON3)
  $result = $1.data ? Py_BuildValue("y#", $1.data, (Py_ssize_t)$1.len) : SWIG_Py_Void();
#elif defined(SWIGTCL)
  Tcl_SetObjResult(interp, $1.data ? Tcl_NewByteArrayObj($1.data, $1.len) : NULL);
#else
  $result = SWIG_FromCharPtrAndSize($1.data, $1.len);
#if defined(SWIGPERL)
  argvi++;
#endif
#endif
}

#endif

/**
 ** Queue handling
 **/

%typemap(arginit) Queue {
  queue_init(&$1);
}
%typemap(freearg) Queue {
  queue_free(&$1);
}

#if defined(SWIGPYTHON)

%typemap(out) Queue {
  int i;
  PyObject *o = PyList_New($1.count);
  for (i = 0; i < $1.count; i++)
    PyList_SetItem(o, i, SWIG_From_int($1.elements[i]));
  queue_free(&$1);
  $result = o;
}

%define Queue2Array(type, step, con) %{ {
  int i;
  int cnt = $1.count / step;
  Id *idp = $1.elements;
  PyObject *o = PyList_New(cnt);
  for (i = 0; i < cnt; i++, idp += step)
    {
      Id id = *idp;
#define result resultx
      type result = con;
      $typemap(out, type)
      PyList_SetItem(o, i, $result);
#undef result
    }
  queue_free(&$1);
  $result = o;
}
%}
%enddef

%define Array2Queue(asval_meth,typestr) %{ {
  int i, size;
  if (!PyList_Check($input))
    SWIG_exception_fail(SWIG_TypeError, "argument $argnum is not a list");
  size = PyList_Size($input);
  for (i = 0; i < size; i++) {
    PyObject *o = PyList_GetItem($input,i);
    int v;
    int e = asval_meth(o, &v);
    if (!SWIG_IsOK(e))
      SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only " typestr);
    queue_push(&$1, v);
  }
}
%}
%enddef

%define ObjArray2Queue(type, obj2queue) %{ {
  int i, size;
  if (!PyList_Check($input))
    SWIG_exception_fail(SWIG_TypeError, "argument $argnum is not a list");
  size = PyList_Size($input);
  for (i = 0; i < size; i++) {
    PyObject *o = PyList_GetItem($input,i);
    type obj;
    int e = SWIG_ConvertPtr(o, (void **)&obj, $descriptor(type), 0 | 0);
    if (!SWIG_IsOK(e))
      SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only "`type`);
    obj2queue;
  }
}
%}
%enddef

#endif  /* SWIGPYTHON */

#if defined(SWIGPERL)
/* AV *o = newAV();
 * av_push(o, SvREFCNT_inc(SWIG_From_int($1.elements[i])));
 * $result = newRV_noinc((SV*)o); argvi++;
 */
%typemap(out) Queue {
  int i;
  if (argvi + $1.count + 1 >= items) {
    EXTEND(sp, (argvi + $1.count + 1) - items + 1);
  }
  for (i = 0; i < $1.count; i++)
    ST(argvi++) = SvREFCNT_inc(SWIG_From_int($1.elements[i]));
  queue_free(&$1);
  $result = 0;
}

%define Queue2Array(type, step, con) %{ {
  int i;
  int cnt = $1.count / step;
  Id *idp = $1.elements;
  if (argvi + cnt + 1 >= items) {
    EXTEND(sp, (argvi + cnt + 1) - items + 1);
  }
  for (i = 0; i < cnt; i++, idp += step)
    {
      Id id = *idp;
#define result resultx
      type result = con;
      $typemap(out, type)
      SvREFCNT_inc(ST(argvi - 1));
#undef result
    }
  queue_free(&$1);
  $result = 0;
}
%}
%enddef

%define Array2Queue(asval_meth,typestr) %{ {
  AV *av;
  int i, size;
  if (!SvROK($input) || SvTYPE(SvRV($input)) != SVt_PVAV)
    SWIG_croak("argument $argnum is not an array reference.");
  av = (AV*)SvRV($input);
  size = av_len(av);
  for (i = 0; i <= size; i++) {
    SV **sv = av_fetch(av, i, 0);
    int v;
    int e = asval_meth(*sv, &v);
    if (!SWIG_IsOK(e))
      SWIG_croak("array in argument $argnum must contain only " typestr);
    queue_push(&$1, v);
  }
}
%}
%enddef

%define ObjArray2Queue(type, obj2queue) %{ {
  AV *av;
  int i, size;
  if (!SvROK($input) || SvTYPE(SvRV($input)) != SVt_PVAV)
    SWIG_croak("argument $argnum is not an array reference.");
  av = (AV*)SvRV($input);
  size = av_len(av);
  for (i = 0; i <= size; i++) {
    SV **sv = av_fetch(av, i, 0);
    type obj;
    int e = SWIG_ConvertPtr(*sv, (void **)&obj, $descriptor(type), 0 | 0);
    if (!SWIG_IsOK(e))
      SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only "`type`);
    obj2queue;
  }
}
%}
%enddef

#endif  /* SWIGPERL */


#if defined(SWIGRUBY)
%typemap(out) Queue {
  int i;
  VALUE o = rb_ary_new2($1.count);
  for (i = 0; i < $1.count; i++)
    rb_ary_store(o, i, SWIG_From_int($1.elements[i]));
  queue_free(&$1);
  $result = o;
}

%define Queue2Array(type, step, con) %{ {
  int i;
  int cnt = $1.count / step;
  Id *idp = $1.elements;
  VALUE o = rb_ary_new2(cnt);
  for (i = 0; i < cnt; i++, idp += step)
    {
      Id id = *idp;
#define result resultx
      type result = con;
      $typemap(out, type)
      rb_ary_store(o, i, $result);
#undef result
    }
  queue_free(&$1);
  $result = o;
}
%}
%enddef

%define Array2Queue(asval_meth,typestr) %{ {
  int size, i;
  VALUE *o, ary;
  ary = rb_Array($input);
  size = RARRAY_LEN(ary);
  i = 0;
  o = RARRAY_PTR(ary);
  for (i = 0; i < size; i++, o++) {
    int v;
    int e = asval_meth(*o, &v);
    if (!SWIG_IsOK(e))
      SWIG_exception_fail(SWIG_TypeError, "list in argument $argnum must contain only " typestr);
    queue_push(&$1, v);
  }
}
%}
%enddef

%define ObjArray2Queue(type, obj2queue) %{ {
  int size, i;
  VALUE *o, ary;
  ary = rb_Array($input);
  size = RARRAY_LEN(ary);
  i = 0;
  o = RARRAY_PTR(ary);
  for (i = 0; i < size; i++, o++) {
    type obj;
    int e = SWIG_ConvertPtr(*o, (void **)&obj, $descriptor(type), 0 | 0);
    if (!SWIG_IsOK(e))
      SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only "`type`);
    obj2queue;
  }
}
%}
%enddef

#endif  /* SWIGRUBY */

#if defined(SWIGTCL)
%typemap(out) Queue {
  Tcl_Obj *objvx[$1.count];
  int i;

  for (i = 0; i < $1.count; i++) {
    objvx[i] = SWIG_From_int($1.elements[i]);
  }
  Tcl_SetObjResult(interp, Tcl_NewListObj($1.count, objvx));
  queue_free(&$1);
}

%define Queue2Array(type, step, con) %{
  { /* scope is needed to make the goto of SWIG_exception_fail work */
    int i;
    int cnt = $1.count / step;
    Id *idp = $1.elements;
    Tcl_Obj *objvx[cnt];

    for (i = 0; i < cnt; i++, idp += step) {
      Id id = *idp;
#define result resultx
#define Tcl_SetObjResult(i, x) resultobj = x
      type result = con;
      Tcl_Obj *resultobj;
      $typemap(out, type)
      objvx[i] = resultobj;
#undef Tcl_SetObjResult
#undef result
    }
    queue_free(&$1);
    Tcl_SetObjResult(interp, Tcl_NewListObj(cnt, objvx));
 }
%}
%enddef

%define Array2Queue(asval_meth,typestr) %{ {
  int size = 0;
  int i = 0;
  if (TCL_OK != Tcl_ListObjLength(interp, $input, &size))
    SWIG_exception_fail(SWIG_TypeError, "argument $argnum is not a list");
  for (i = 0; i < size; i++) {
    Tcl_Obj *o = NULL;
    int e, v;

    if (TCL_OK != Tcl_ListObjIndex(interp, $input, i, &o))
      SWIG_exception_fail(SWIG_IndexError, "failed to retrieve a list member");
    e = SWIG_AsVal_int SWIG_TCL_CALL_ARGS_2(o, &v);
    if (!SWIG_IsOK(e))
      SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only " typestr);
    queue_push(&$1, v);
  }
}
%}
%enddef

%define ObjArray2Queue(type, obj2queue) %{ {
  int size = 0;
  int i = 0;
  if (TCL_OK != Tcl_ListObjLength(interp, $input, &size))
    SWIG_exception_fail(SWIG_TypeError, "argument $argnum is not a list");
  for (i = 0; i < size; i++) {
    Tcl_Obj *o = NULL;
    type obj;
    int e;
    if (TCL_OK != Tcl_ListObjIndex(interp, $input, i, &o))
      SWIG_exception_fail(SWIG_IndexError, "failed to retrieve a list member");
    e = SWIG_ConvertPtr(o, (void **)&obj, $descriptor(type), 0 | 0);
    if (!SWIG_IsOK(e))
      SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only "`type`);
    obj2queue;
  }
}
%}
%enddef

#endif  /* SWIGTCL */

#if defined(SWIGLUA)
%typemap(out) Queue {
  int i;
  lua_newtable(L);
  for (i = 0; i < $1.count; i++) {
    lua_pushnumber(L, $1.elements[i]);
    lua_rawseti(L, -2, i + 1);
  }
  queue_free(&$1);
  SWIG_arg = 1;
}

%define Queue2Array(type, step, con) %{
  int i;
  int cnt = $1.count / step;
  Id *idp = $1.elements;

  lua_newtable(L);
  for (i = 0; i < cnt; i++, idp += step)
    {
      Id id = *idp;
#define result resultx
      type result = con;
      $typemap(out, type)
      lua_rawseti(L, -2, i+1);
#undef result
    }
  queue_free(&$1);
  SWIG_arg = 1;
%}
%enddef

%define Array2Queue(asval_meth,typestr) %{ {
  int i;
  luaL_checktype(L, -1, LUA_TTABLE);
  for (i = 1; i; i++) {
    lua_rawgeti(L, -1, i);
    if (lua_type(L, -1) == LUA_TNIL)
      i = -1;
    else
      {
        int v;
        int e = asval_meth(L, -1, &v);
        if (!SWIG_IsOK(e)) {
          lua_pop(L, 1);
          SWIG_Lua_pusherrstring(L,"list in argument $argnum must contain only " typestr);
          SWIG_fail;
        }
        queue_push(&$1, v);
      }
    lua_pop(L, 1);
  }
}
%}
%enddef

%define ObjArray2Queue(type, obj2queue) %{ {
  int i;
  luaL_checktype(L, -1, LUA_TTABLE);
  for (i = 1; i; i++) {
    lua_rawgeti(L, -1, i);
    if (lua_type(L, -1) == LUA_TNIL)
      i = -1;
    else
      {
        type obj;
        int e = SWIG_ConvertPtr(L, -1, (void **)&obj, $descriptor(type), 0 | 0);
        if (!SWIG_IsOK(e))
          {
            lua_pop(L, 1);
            SWIG_Lua_pusherrstring(L,"list in argument $argnum must contain only "`type`);
            SWIG_fail;
          }
        obj2queue;
      }
    lua_pop(L, 1);
  }
}
%}
%enddef

%{

SWIGINTERN int
SWIG_AsVal_int(lua_State* L, int idx, int *val) {
  int ecode = lua_isnumber(L, idx) ? SWIG_OK : SWIG_TypeError;
  if (ecode == SWIG_OK)
    *val = (int)lua_tonumber(L, idx);
  return ecode;
}

%}

#endif  /* SWIGLUA */

%typemap(in) Queue Array2Queue(SWIG_AsVal_int, "integers")
%typemap(in) Queue solvejobs ObjArray2Queue(Job *, queue_push2(&$1, obj->how, obj->what))
%typemap(in) Queue solvables ObjArray2Queue(XSolvable *, queue_push(&$1, obj->id))



#if defined(SWIGPERL)

/* work around a swig bug for swig versions < 2.0.5 */
#if SWIG_VERSION < 0x020005
%{
#undef SWIG_CALLXS
#ifdef PERL_OBJECT
#  define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv,pPerl)
#else
#  ifndef MULTIPLICITY
#    define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv)
#  else
#    define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(PERL_GET_THX, cv)
#  endif
#endif
%}
#endif


%define perliter(class)
  %perlcode {
    sub class##::FETCH {
      my $i = ${##class##::ITERATORS}{$_[0]};
      if ($i) {
        $_[1] == $i->[0] - 1 ? $i->[1] : undef;
      } else {
        $_[0]->__getitem__($_[1]);
      }
    }
    sub class##::FETCHSIZE {
      my $i = ${##class##::ITERATORS}{$_[0]};
      if ($i) {
        ($i->[1] = $_[0]->__next__()) ? ++$i->[0]  : 0;
      } else {
        $_[0]->__len__();
      }
    }
  }
%enddef

%{

#define SWIG_PERL_ITERATOR      0x80

SWIGRUNTIMEINLINE SV *
SWIG_Perl_NewArrayObj(SWIG_MAYBE_PERL_OBJECT void *ptr, swig_type_info *t, int flags) {
  SV *result = sv_newmortal();
  if (ptr && (flags & (SWIG_SHADOW | SWIG_POINTER_OWN))) {
    SV *self;
    SV *obj=newSV(0);
    AV *array=newAV();
    HV *stash;
    sv_setref_pv(obj, (char *) SWIG_Perl_TypeProxyName(t), ptr);
    stash=SvSTASH(SvRV(obj));
    if (flags & SWIG_POINTER_OWN) {
      HV *hv;
      GV *gv=*(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
      if (!isGV(gv))
        gv_init(gv, stash, "OWNER", 5, FALSE);
      hv=GvHVn(gv);
      hv_store_ent(hv, obj, newSViv(1), 0);
    }
    if (flags & SWIG_PERL_ITERATOR) {
      HV *hv;
      GV *gv=*(GV**)hv_fetch(stash, "ITERATORS", 9, TRUE);
      AV *av=newAV();
      if (!isGV(gv))
        gv_init(gv, stash, "ITERATORS", 9, FALSE);
      hv=GvHVn(gv);
      hv_store_ent(hv, obj, newRV_inc((SV *)av), 0);
    }
    sv_magic((SV *)array, (SV *)obj, 'P', Nullch, 0);
    SvREFCNT_dec(obj);
    self=newRV_noinc((SV *)array);
    sv_setsv(result, self);
    SvREFCNT_dec((SV *)self);
    sv_bless(result, stash);
  } else {
    sv_setref_pv(result, (char *) SWIG_Perl_TypeProxyName(t), ptr);
  }
  return result;
}

%}

%typemap(out) Perlarray {
  ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow); argvi++;
}
%typemap(out) Perliterator {
  ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow | SWIG_PERL_ITERATOR); argvi++;
}

%typemap(out) Pool_solvable_iterator * = Perlarray;
%typemap(out) Pool_solvable_iterator * solvables_iter = Perliterator;
%typemap(out) Pool_repo_iterator * = Perlarray;
%typemap(out) Pool_repo_iterator * repos_iter = Perliterator;
%typemap(out) Repo_solvable_iterator * = Perlarray;
%typemap(out) Repo_solvable_iterator * solvables_iter = Perliterator;
%typemap(out) Dataiterator * = Perliterator;

#endif  /* SWIGPERL */


/**
 ** appdata handling
 **/

#if defined(SWIGPYTHON)
typedef PyObject *AppObjectPtr;
%typemap(in) AppObjectPtr {
  if ($input)
    Py_INCREF($input);
  $1 = $input;
}
%typemap(out) AppObjectPtr {
  $result = $1 ? $1 : Py_None;
  Py_INCREF($result);
}
#elif defined(SWIGPERL)
typedef SV *AppObjectPtr;
%typemap(in) AppObjectPtr {
  if ($input) {
    $1 = newSV(0);
    sv_setsv((SV *)$1, $input);
  } else
    $1 = (void *)0;
}
%typemap(out) AppObjectPtr {
  $result = sv_2mortal($1 ? SvREFCNT_inc($1) : newSV(0));
  argvi++;
}
#elif defined(SWIGRUBY)
typedef VALUE AppObjectPtr;
%typemap(in) AppObjectPtr {
  $1 = (void *)$input;
}
%typemap(out) AppObjectPtr {
  $result = (VALUE)$1;
}
#elif defined(SWIGTCL)
typedef Tcl_Obj *AppObjectPtr;
%typemap(in) AppObjectPtr {
  if ($input)
    Tcl_IncrRefCount($input);
  $1 = (void *)$input;
}
%typemap(out) AppObjectPtr {
  Tcl_SetObjResult(interp, $1 ? $1 : Tcl_NewObj());
}
#elif defined(SWIGLUA)
typedef void *AppObjectPtr;
%typemap(in) AppObjectPtr {
  $1 = (void *)L;
}
%typemap(out) AppObjectPtr {
  get_stashed_lua_var(L, "appdata", $1);
  SWIG_arg++;
}
#else
#warning AppObjectPtr not defined for this language!
#endif

/**
 ** FILE handling
 **/

#ifdef SWIGPYTHON
%include "file.i"
#else
%fragment("SWIG_AsValFilePtr","header") {}
#endif


%fragment("SWIG_AsValSolvFpPtr","header", fragment="SWIG_AsValFilePtr") {

SWIGINTERN int
#ifdef SWIGRUBY
SWIG_AsValSolvFpPtr(VALUE obj, FILE **val) {
#elif defined(SWIGTCL)
SWIG_AsValSolvFpPtr SWIG_TCL_DECL_ARGS_2(void *obj, FILE **val) {
#elif defined(SWIGLUA)
SWIG_AsValSolvFpPtr(lua_State *L, int idx, FILE **val) {
#else
SWIG_AsValSolvFpPtr(void *obj, FILE **val) {
#endif
  static swig_type_info* desc = 0;
  void *vptr = 0;
#ifdef SWIGPYTHON
  int ecode;
#endif

  if (!desc) desc = SWIG_TypeQuery("SolvFp *");
#if defined(SWIGLUA)
  if ((SWIG_ConvertPtr(L, idx, &vptr, desc, 0)) == SWIG_OK) {
#else
  if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
#endif
    if (val)
      *val = vptr ? ((SolvFp *)vptr)->fp : 0;
    return SWIG_OK;
  }
#ifdef SWIGPYTHON
  ecode = SWIG_AsValFilePtr(obj, val);
  if (ecode == SWIG_OK)
    return ecode;
#endif
  return SWIG_TypeError;
}

#if defined(SWIGTCL)
#define SWIG_AsValSolvFpPtr(x, y) SWIG_AsValSolvFpPtr SWIG_TCL_CALL_ARGS_2(x, y)
#endif

}


/**
 ** DepId handling
 **/

%fragment("SWIG_AsValDepId","header") {

SWIGINTERN int
#ifdef SWIGRUBY
SWIG_AsValDepId(VALUE obj, int *val) {
#elif defined(SWIGTCL)
SWIG_AsValDepId SWIG_TCL_DECL_ARGS_2(void *obj, int *val) {
#elif defined(SWIGLUA)
SWIG_AsValDepId(lua_State *L, int idx, int *val) {
#else
SWIG_AsValDepId(void *obj, int *val) {
#endif
  static swig_type_info* desc = 0;
  void *vptr = 0;
  int ecode;
  if (!desc) desc = SWIG_TypeQuery("Dep *");
#ifdef SWIGTCL
  ecode = SWIG_AsVal_int SWIG_TCL_CALL_ARGS_2(obj, val);
#elif defined(SWIGLUA)
  ecode = SWIG_AsVal_int(L, idx, val);
#else
  ecode = SWIG_AsVal_int(obj, val);
#endif
  if (SWIG_IsOK(ecode))
    return ecode;
#if defined(SWIGLUA)
  if ((SWIG_ConvertPtr(L, idx, &vptr, desc, 0)) == SWIG_OK) {
#else
  if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
#endif
    if (val)
      *val = vptr ? ((Dep *)vptr)->id : 0;
    return SWIG_OK;
  }
  return SWIG_TypeError;
}

#ifdef SWIGTCL
#define SWIG_AsValDepId(x, y) SWIG_AsValDepId SWIG_TCL_CALL_ARGS_2(x, y)
#endif
}

/**
 ** Pool disown helper
 **/

%typemap(out) disown_helper {
#if defined(SWIGRUBY)
  SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN |  0 );
#elif defined(SWIGPYTHON)
  SWIG_ConvertPtr($self, &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN |  0 );
#elif defined(SWIGPERL)
  SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN |  0 );
#elif defined(SWIGTCL)
  SWIG_ConvertPtr(objv[1], &argp1, SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0);
#elif defined(SWIGLUA)
  SWIG_ConvertPtr(L, 1, (void **)&arg1, SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0);
#else
#warning disown_helper not implemented for this language, this is likely going to leak memory
#endif

#ifdef SWIGTCL
  Tcl_SetObjResult(interp, SWIG_From_int((int)(0)));
#elif defined(SWIGLUA)
  $result = 0;
  lua_pushnumber(L, $result); SWIG_arg++;
#else
  $result = SWIG_From_int((int)(0));
#endif
}


/**
 ** return $self
 **/

%define returnself(func)
#if defined(SWIGPYTHON)
%typemap(out) void func {
  $result = $self;
  Py_INCREF($result);
}
#elif defined(SWIGPERL)
%typemap(out) void func {
  $result = sv_2mortal(SvREFCNT_inc(ST(0)));argvi++;
}
#elif defined(SWIGRUBY)
%typemap(ret) void func {
  return self;
}
#elif defined(SWIGTCL)
%typemap(out) void func {
  Tcl_IncrRefCount(objv[1]);
  Tcl_SetObjResult(interp, objv[1]);
}
#elif defined(SWIGLUA)
%typemap(out) void func {
  lua_pushvalue(L, 1);SWIG_arg++;
}
#else
#warning returnself not implemented for this language
#endif
%enddef


/**
 ** meta method renaming
 **/
#if defined(SWIGPERL)
%rename("str") *::__str__;
#endif
#if defined(SWIGRUBY)
%rename("to_s") *::__str__;
#endif
#if defined(SWIGTCL)
%rename("str") *::__str__;
%rename("==") *::__eq__;
%rename("!=") *::__ne__;
#endif
#if defined(SWIGLUA)
%rename(__call) *::__next__;
%rename(__tostring) *::__str__;
%rename(__index) *::__getitem__;
%rename(__eq) *::__eq__;
%rename(__ne) *::__ne__;
#endif
#if defined(SWIGPERL) || defined(SWIGTCL) || defined(SWIGLUA)
%rename("repr") *::__repr__;
#endif


/**
 ** misc stuff
 **/

%include "typemaps.i"
#if defined(SWIGLUA)
%runtime "swigerrors.swg";
%include "typemaps/swigmacros.swg"

%typemap(in) void *ign1 {};
%typemap(in) void *ign2 {};
%typemap(in,checkfn="lua_isfunction") int lua_function_idx { $1 = $input; };
#endif

%typemap(in,numinputs=0,noblock=1) XRule **OUTPUT ($*1_ltype temp) {
  $1 = &temp;
}
#if defined(SWIGLUA)
%typemap(argout,noblock=1) XRule **OUTPUT {
  SWIG_NewPointerObj(L, (void *)(*$1), SWIGTYPE_p_XRule, SWIG_POINTER_OWN); SWIG_arg++;
}
#else
%typemap(argout,noblock=1) XRule **OUTPUT {
  %append_output(SWIG_NewPointerObj((void*)(*$1), SWIGTYPE_p_XRule, SWIG_POINTER_OWN | %newpointer_flags));
}
#endif

#if defined(SWIGLUA)
%typemap(in,noblock=1,fragment="SWIG_AsValSolvFpPtr") FILE * (FILE *val, int ecode) {
  ecode = SWIG_AsValSolvFpPtr(L, $input, &val);
  if (!SWIG_IsOK(ecode)) SWIG_fail_arg("$symname", $argnum, "FILE *");
  $1 = val;
}
%typemap(typecheck,precedence=%checkcode(POINTER),fragment="SWIG_AsValSolvFpPtr") FILE * {
  int res = SWIG_AsValSolvFpPtr(L, $input, NULL);
  $1 = SWIG_CheckState(res);
}
%typemap(in,noblock=1,fragment="SWIG_AsValDepId") DepId (int val, int ecode) {
  ecode = SWIG_AsValDepId(L, $input, &val);
  if (!SWIG_IsOK(ecode)) SWIG_fail_arg("$symname", $argnum, "DepId")
  $1 = val;
}
%typemap(typecheck,precedence=%checkcode(INT32),fragment="SWIG_AsValDepId") DepId {
  int res = SWIG_AsValDepId(L, $input, NULL);
  $1 = SWIG_CheckState(res);
}
#else
%typemaps_asval(%checkcode(POINTER), SWIG_AsValSolvFpPtr, "SWIG_AsValSolvFpPtr", FILE*);
%typemaps_asval(%checkcode(INT32), SWIG_AsValDepId, "SWIG_AsValDepId", DepId);
#endif


/**
 ** the C declarations
 **/

%{
#include <stdbool.h>
#include <stdio.h>
#include <sys/stat.h>
#include <sys/utsname.h>
#include <sys/types.h>
#include <unistd.h>
#include <fcntl.h>

/* argh, swig undefs bool for perl */
#ifndef bool
typedef int bool;
#endif

#include "pool.h"
#include "poolarch.h"
#include "evr.h"
#include "solver.h"
#include "policy.h"
#include "solverdebug.h"
#include "repo_solv.h"
#include "chksum.h"
#include "selection.h"

#include "repo_write.h"
#if defined(ENABLE_RPMDB) || defined(ENABLE_RPMPKG)
#include "repo_rpmdb.h"
#endif
#ifdef ENABLE_PUBKEY
#include "repo_pubkey.h"
#endif
#ifdef ENABLE_DEBIAN
#include "repo_deb.h"
#endif
#ifdef ENABLE_RPMMD
#include "repo_rpmmd.h"
#include "repo_updateinfoxml.h"
#include "repo_deltainfoxml.h"
#include "repo_repomdxml.h"
#endif
#ifdef ENABLE_SUSEREPO
#include "repo_products.h"
#include "repo_susetags.h"
#include "repo_content.h"
#endif
#ifdef ENABLE_MDKREPO
#include "repo_mdk.h"
#endif
#ifdef ENABLE_ARCHREPO
#include "repo_arch.h"
#endif
#ifdef SUSE
#include "repo_autopattern.h"
#endif
#if defined(ENABLE_COMPLEX_DEPS) && (defined(ENABLE_SUSEREPO) || defined(ENABLE_RPMMD) || defined(ENABLE_RPMDB) || defined(ENABLE_RPMPKG))
#include "pool_parserpmrichdep.h"
#endif
#include "solv_xfopen.h"
#include "testcase.h"

/* for old ruby versions */
#ifndef RARRAY_PTR
#define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
#endif
#ifndef RARRAY_LEN
#define RARRAY_LEN(ary) (RARRAY(ary)->len)
#endif

typedef void *AppObjectPtr;
typedef Id DepId;

typedef struct {
  Pool *pool;
  Id id;
} Dep;

typedef struct {
  Pool *pool;
  Id id;
} XSolvable;

typedef struct {
  Solver *solv;
  Id id;
} XRule;

typedef struct {
  Repo *repo;
  Id id;
} XRepodata;

typedef struct {
  Pool *pool;
  Id id;
} Pool_solvable_iterator;

typedef struct {
  Pool *pool;
  Id id;
} Pool_repo_iterator;

typedef struct {
  Repo *repo;
  Id id;
} Repo_solvable_iterator;

typedef struct {
  Pool *pool;
  int how;
  Id what;
} Job;

typedef struct {
  Solver *solv;
  Id id;
} Problem;

typedef struct {
  Solver *solv;
  Id problemid;
  Id id;
} Solution;

typedef struct {
  Solver *solv;
  Id problemid;
  Id solutionid;

  Id type;
  Id p;
  Id rp;
} Solutionelement;

typedef struct {
  Solver *solv;
  Id rid;
  int type;
  Id source;
  Id target;
  Id dep_id;
} Ruleinfo;

typedef struct {
  Solver *solv;
  Id type;
  Id rid;
  Id from_id;
  Id dep_id;
  Id chosen_id;
  Queue choices;
  int level;
} Alternative;

typedef struct {
  Transaction *transaction;
  int mode;
  Id type;
  int count;
  Id fromid;
  Id toid;
} TransactionClass;

typedef struct {
  Pool *pool;
  Queue q;
  int flags;
} Selection;

typedef struct {
  Solver *solv;
  Id p;
  int reason;
  Id infoid;
} Decision;

typedef struct {
  Solver *solv;
  Queue decisionlistq;
  Id p;
  int reason;
  Id infoid;
  int bits;
  int type;
  Id source;
  Id target;
  Id dep_id;
} Decisionset;

typedef struct {
  FILE *fp;
} SolvFp;

typedef Dataiterator Datamatch;

typedef int disown_helper;

struct myappdata {
  void *appdata;
  int disowned;
};

/* special internal decisionset constructor from a prepared decisionlist */
static Decisionset *decisionset_fromids(Solver *solv, Id *ids, int cnt)
{
  Decisionset *d = solv_calloc(1, sizeof(*d));
  int i;
  d->solv = solv;
  queue_init(&d->decisionlistq);
  d->p = ids[0];
  d->reason = ids[1];
  d->infoid = ids[2];
  d->bits = ids[3];
  d->type = ids[4];
  d->source = ids[5];
  d->target = ids[6];
  d->dep_id = ids[7];
  for (i = 0; i < cnt; i += 8)
    queue_insertn(&d->decisionlistq, d->decisionlistq.count, 3, ids + i);
  if (cnt > 8)
    d->infoid = 0;
  return d;
}

/* prepare a decisionlist so we can feed it to decisionset_fromids */
static void prepare_decisionset_queue(Solver *solv, Queue *q) {
  int i, cnt;
  for (i = cnt = 0; i < q->count; cnt++)
    {
      i += 1 + 8 + 8 * solver_decisionlist_merged(solv, q, i);  /* +1 as we insert one element */
      queue_insert(q, cnt, i - cnt);
    }
  if (cnt)
    queue_unshift(q, 1);        /* start of first block */
  for (i = 0; i < cnt; i++)
    q->elements[i] += cnt - i;
  q->count = cnt;   /* hack */
}

%}

/**
 ** appdata helpers
 **/

#ifdef SWIGRUBY

%{
SWIGINTERN void appdata_disown_helper(void *appdata) {
}
SWIGINTERN void appdata_clr_helper(void **appdatap) {
  *appdatap = 0;
}
SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
  *appdatap = appdata;
}
SWIGINTERN void *appdata_get_helper(void **appdatap) {
  return *appdatap;
}
%}

#elif defined(SWIGTCL)

%{
SWIGINTERN void appdata_disown_helper(void *appdata) {
}
SWIGINTERN void appdata_clr_helper(void **appdatap) {
  if (*appdatap)
    Tcl_DecrRefCount((Tcl_Obj *)(*appdatap));
  *appdatap = 0;
}
SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
  appdata_clr_helper(appdatap);
  *appdatap = appdata;
}
SWIGINTERN void *appdata_get_helper(void **appdatap) {
  return *appdatap;
}
%}

#elif defined(SWIGPYTHON)

%{
SWIGINTERN void appdata_disown_helper(void *appdata) {
  struct myappdata *myappdata = appdata;
  if (!myappdata || !myappdata->appdata || myappdata->disowned)
    return;
  myappdata->disowned = 1;
  Py_DECREF((PyObject *)myappdata->appdata);
}
SWIGINTERN void appdata_clr_helper(void **appdatap) {
  struct myappdata *myappdata = *(struct myappdata **)appdatap;
  if (myappdata && myappdata->appdata && !myappdata->disowned) {
    Py_DECREF((PyObject *)myappdata->appdata);
  }
  *appdatap = solv_free(myappdata);
}
SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
  appdata_clr_helper(appdatap);
  if (appdata) {
    struct myappdata *myappdata = *appdatap = solv_calloc(sizeof(struct myappdata), 1);
    myappdata->appdata = appdata;
  }
}
SWIGINTERN void *appdata_get_helper(void **appdatap) {
  struct myappdata *myappdata = *(struct myappdata **)appdatap;
  return myappdata ? myappdata->appdata : 0;
}

%}

#elif defined(SWIGPERL)

%{
SWIGINTERN void appdata_disown_helper(void *appdata) {
  struct myappdata *myappdata = appdata;
  SV *rsv;
  if (!myappdata || !myappdata->appdata || myappdata->disowned)
    return;
  rsv = myappdata->appdata;
  if (!SvROK(rsv))
    return;
  myappdata->appdata = SvRV(rsv);
  myappdata->disowned = 1;
  SvREFCNT_dec(rsv);
}
SWIGINTERN void appdata_clr_helper(void **appdatap) {
  struct myappdata *myappdata = *(struct myappdata **)appdatap;
  if (myappdata && myappdata->appdata && !myappdata->disowned) {
    SvREFCNT_dec((SV *)myappdata->appdata);
  }
  *appdatap = solv_free(myappdata);
}
SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
  appdata_clr_helper(appdatap);
  if (appdata) {
    struct myappdata *myappdata = *appdatap = solv_calloc(sizeof(struct myappdata), 1);
    myappdata->appdata = appdata;
  }
}
SWIGINTERN void *appdata_get_helper(void **appdatap) {
  struct myappdata *myappdata = *appdatap;
  if (!myappdata || !myappdata->appdata)
    return 0;
  return myappdata->disowned ? newRV_noinc((SV *)myappdata->appdata) : myappdata->appdata;
}

%}

#elif defined(SWIGLUA)

%{
SWIGINTERN void appdata_disown_helper(void *appdata) {
}
SWIGINTERN void appdata_clr_helper(void **appdatap) {
  if (*appdatap) {
    void *appdata = *appdatap;
    clr_stashed_lua_var((lua_State*)appdata, "appdata", (void *)appdatap);
    *appdatap = 0;
  }
}
SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
  *appdatap = appdata;
  set_stashed_lua_var((lua_State*)appdata, -1, "appdata", (void *)appdatap);
}
SWIGINTERN void *appdata_get_helper(void **appdatap) {
  return (void *)appdatap;
}
%}

#else
#warning appdata helpers not implemented for this language
#endif


/**
 ** the SWIG declarations defining the API
 **/

#ifdef SWIGRUBY
%mixin Dataiterator "Enumerable";
%mixin Pool_solvable_iterator "Enumerable";
%mixin Pool_repo_iterator "Enumerable";
%mixin Repo_solvable_iterator "Enumerable";
#endif

typedef int Id;

%include "knownid.h"

/* from repodata.h */
%constant Id SOLVID_META;
%constant Id SOLVID_POS;

%constant int REL_EQ;
%constant int REL_GT;
%constant int REL_LT;
%constant int REL_AND;
%constant int REL_OR;
%constant int REL_WITH;
%constant int REL_NAMESPACE;
%constant int REL_ARCH;
%constant int REL_FILECONFLICT;
%constant int REL_COND;
%constant int REL_COMPAT;
%constant int REL_KIND;
%constant int REL_MULTIARCH;
%constant int REL_ELSE;
%constant int REL_ERROR;
%constant int REL_WITHOUT;
%constant int REL_UNLESS;
%constant int REL_CONDA;

typedef struct {
  Pool* const pool;
  int const flags;
} Selection;

typedef struct {
  Pool* const pool;
  Id const id;
} Dep;

/* put before pool/repo so we can access the constructor */
%nodefaultdtor Dataiterator;
typedef struct {} Dataiterator;

typedef struct {
  Pool* const pool;
  Id const id;
} XSolvable;

typedef struct {
  Solver* const solv;
  int const type;
  Id const dep_id;
} Ruleinfo;

typedef struct {
  Solver* const solv;
  Id const id;
} XRule;

typedef struct {
  Repo* const repo;
  Id const id;
} XRepodata;

typedef struct {} Pool_solvable_iterator;
typedef struct {} Pool_repo_iterator;
typedef struct {} Repo_solvable_iterator;

%nodefaultctor Datamatch;
%nodefaultdtor Datamatch;
typedef struct {
  Pool * const pool;
  Repo * const repo;
  Id const solvid;
} Datamatch;

%nodefaultctor Datapos;
typedef struct {
  Repo * const repo;
} Datapos;

typedef struct {
  Pool * const pool;
  int how;
  Id what;
} Job;

%nodefaultctor Pool;
%nodefaultdtor Pool;
typedef struct {
} Pool;

%nodefaultctor Repo;
%nodefaultdtor Repo;
typedef struct {
  Pool * const pool;
  const char * const name;
  int priority;
  int subpriority;
  int const nsolvables;
} Repo;

%nodefaultctor Decision;
typedef struct {
  Solver *const solv;
  Id const p;
  int const reason;
  Id const infoid;
} Decision;

%nodefaultctor Decisionset;
%nodefaultdtor Decisionset;
typedef struct {
  Solver *const solv;
  Id const p;
  int const reason;
  Id const infoid;
  int const bits;
  int const type;
  Id const dep_id;
} Decisionset;

%nodefaultctor Solver;
%nodefaultdtor Solver;
typedef struct {
  Pool * const pool;
} Solver;

typedef struct {
} Chksum;

#ifdef ENABLE_PUBKEY
typedef struct {
  Id const htype;
  unsigned int const created;
  unsigned int const expires;
  const char * const keyid;
} Solvsig;
#endif

%rename(xfopen) solvfp_xfopen;
%rename(xfopen_fd) solvfp_xfopen_fd;

%nodefaultctor SolvFp;
typedef struct {
} SolvFp;

%newobject solvfp_xfopen;
%newobject solvfp_xfopen_fd;

SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);

%{
  SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
    SolvFp *sfp;
    FILE *fp;
    fd = dup(fd);
    if (fd == -1)
      return 0;
    solv_setcloexec(fd, 1);
    fp = solv_xfopen_fd(fn, fd, mode);
    if (!fp) {
      close(fd);
      return 0;
    }
    sfp = solv_calloc(1, sizeof(SolvFp));
    sfp->fp = fp;
    return sfp;
  }
  SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
    SolvFp *sfp;
    FILE *fp;
    fp = solv_xfopen(fn, mode);
    if (!fp)
      return 0;
    if (fileno(fp) != -1)
      solv_setcloexec(fileno(fp), 1);
    sfp = solv_calloc(1, sizeof(SolvFp));
    sfp->fp = fp;
    return sfp;
  }
%}

typedef struct {
  Solver * const solv;
  Id const id;
} Problem;

typedef struct {
  Solver * const solv;
  Id const problemid;
  Id const id;
} Solution;

typedef struct {
  Solver *const solv;
  Id const problemid;
  Id const solutionid;
  Id const type;
} Solutionelement;

%nodefaultctor Alternative;
typedef struct {
  Solver *const solv;
  Id const type;
  Id const dep_id;
  Id const chosen_id;
  int const level;
} Alternative;

%nodefaultctor Transaction;
%nodefaultdtor Transaction;
typedef struct {
  Pool * const pool;
} Transaction;

typedef struct {
  Transaction * const transaction;
  Id const type;
  Id const fromid;
  Id const toid;
  int const count;
} TransactionClass;

%extend SolvFp {
  ~SolvFp() {
    if ($self->fp)
      fclose($self->fp);
    free($self);
  }
  int fileno() {
    return $self->fp ? fileno($self->fp) : -1;
  }
  int dup() {
    return $self->fp ? dup(fileno($self->fp)) : -1;
  }
  bool write(const unsigned char *str, size_t len) {
    return fwrite(str, len, 1, $self->fp) == 1;
  }
  bool flush() {
    if (!$self->fp)
      return 1;
    return fflush($self->fp) == 0;
  }
  bool close() {
    bool ret;
    if (!$self->fp)
      return 1;
    ret = fclose($self->fp) == 0;
    $self->fp = 0;
    return ret;
  }
  void cloexec(bool state) {
    if (!$self->fp || fileno($self->fp) == -1)
      return;
    solv_setcloexec(fileno($self->fp), state);
  }
}

%extend Job {
  static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
  static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
  static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
  static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
  static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
  static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
  static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
  static const Id SOLVER_NOOP = SOLVER_NOOP;
  static const Id SOLVER_INSTALL = SOLVER_INSTALL;
  static const Id SOLVER_ERASE = SOLVER_ERASE;
  static const Id SOLVER_UPDATE = SOLVER_UPDATE;
  static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
  static const Id SOLVER_MULTIVERSION = SOLVER_MULTIVERSION;
  static const Id SOLVER_LOCK = SOLVER_LOCK;
  static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
  static const Id SOLVER_VERIFY = SOLVER_VERIFY;
  static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
  static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
  static const Id SOLVER_ALLOWUNINSTALL = SOLVER_ALLOWUNINSTALL;
  static const Id SOLVER_FAVOR = SOLVER_FAVOR;
  static const Id SOLVER_DISFAVOR = SOLVER_DISFAVOR;
  static const Id SOLVER_EXCLUDEFROMWEAK = SOLVER_EXCLUDEFROMWEAK;
  static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
  static const Id SOLVER_WEAK = SOLVER_WEAK;
  static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
  static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
  static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
  static const Id SOLVER_TARGETED = SOLVER_TARGETED;
  static const Id SOLVER_NOTBYUSER = SOLVER_NOTBYUSER;
  static const Id SOLVER_SETEV = SOLVER_SETEV;
  static const Id SOLVER_SETEVR = SOLVER_SETEVR;
  static const Id SOLVER_SETARCH = SOLVER_SETARCH;
  static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
  static const Id SOLVER_SETREPO = SOLVER_SETREPO;
  static const Id SOLVER_SETNAME = SOLVER_SETNAME;
  static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
  static const Id SOLVER_SETMASK = SOLVER_SETMASK;

  Job(Pool *pool, int how, Id what) {
    Job *job = solv_calloc(1, sizeof(*job));
    job->pool = pool;
    job->how = how;
    job->what = what;
    return job;
  }

  %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
  %newobject solvables;
  Queue solvables() {
    Queue q;
    queue_init(&q);
    pool_job2solvables($self->pool, &q, $self->how, $self->what);
    return q;
  }
#ifdef SWIGRUBY
  %rename("isemptyupdate?") isemptyupdate;
#endif
  bool isemptyupdate() {
    return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
  }

  bool __eq__(Job *j) {
    return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
  }
  bool __ne__(Job *j) {
    return !Job___eq__($self, j);
  }
  const char *__str__() {
    return pool_job2str($self->pool, $self->how, $self->what, 0);
  }
  const char *__repr__() {
    const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
    return pool_tmpjoin($self->pool, "<Job ", str, ">");
  }
}

%extend Selection {
  static const Id SELECTION_NAME = SELECTION_NAME;
  static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
  static const Id SELECTION_FILELIST = SELECTION_FILELIST;
  static const Id SELECTION_CANON = SELECTION_CANON;
  static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
  static const Id SELECTION_REL = SELECTION_REL;
  static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
  static const Id SELECTION_GLOB = SELECTION_GLOB;
  static const Id SELECTION_FLAT = SELECTION_FLAT;
  static const Id SELECTION_NOCASE = SELECTION_NOCASE;
  static const Id SELECTION_SKIP_KIND = SELECTION_SKIP_KIND;
  static const Id SELECTION_MATCH_DEPSTR = SELECTION_MATCH_DEPSTR;
  static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
  static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
  static const Id SELECTION_WITH_DISABLED = SELECTION_WITH_DISABLED;
  static const Id SELECTION_WITH_BADARCH = SELECTION_WITH_BADARCH;
  static const Id SELECTION_WITH_ALL = SELECTION_WITH_ALL;
  static const Id SELECTION_ADD = SELECTION_ADD;
  static const Id SELECTION_SUBTRACT = SELECTION_SUBTRACT;
  static const Id SELECTION_FILTER = SELECTION_FILTER;
  static const Id SELECTION_FILTER_KEEP_IFEMPTY = SELECTION_FILTER_KEEP_IFEMPTY;
  static const Id SELECTION_FILTER_SWAPPED = SELECTION_FILTER_SWAPPED;

  Selection(Pool *pool) {
    Selection *s;
    s = solv_calloc(1, sizeof(*s));
    s->pool = pool;
    return s;
  }

  ~Selection() {
    queue_free(&$self->q);
    solv_free($self);
  }
#ifdef SWIGRUBY
  %rename("isempty?") isempty;
#endif
  bool isempty() {
    return $self->q.count == 0;
  }
  %newobject clone;
  Selection *clone(int flags = 0) {
    Selection *s = new_Selection($self->pool);
    queue_init_clone(&s->q, &$self->q);
    s->flags = $self->flags;
    return s;
  }
returnself(filter)
  void filter(Selection *lsel) {
    if ($self->pool != lsel->pool)
      queue_empty(&$self->q);
    else
      selection_filter($self->pool, &$self->q, &lsel->q);
  }
returnself(add)
  void add(Selection *lsel) {
    if ($self->pool == lsel->pool)
      {
        selection_add($self->pool, &$self->q, &lsel->q);
        $self->flags |= lsel->flags;
      }
  }
returnself(add_raw)
  void add_raw(Id how, Id what) {
    queue_push2(&$self->q, how, what);
  }
returnself(subtract)
  void subtract(Selection *lsel) {
    if ($self->pool == lsel->pool)
      selection_subtract($self->pool, &$self->q, &lsel->q);
  }

returnself(select)
  void select(const char *name, int flags) {
    if ((flags & SELECTION_MODEBITS) == 0)
      flags |= SELECTION_FILTER | SELECTION_WITH_ALL;
    $self->flags = selection_make($self->pool, &$self->q, name, flags);
  }
returnself(matchdeps)
  void matchdeps(const char *name, int flags, Id keyname, Id marker = -1) {
    if ((flags & SELECTION_MODEBITS) == 0)
      flags |= SELECTION_FILTER | SELECTION_WITH_ALL;
    $self->flags = selection_make_matchdeps($self->pool, &$self->q, name, flags, keyname, marker);
  }
returnself(matchdepid)
  void matchdepid(DepId dep, int flags, Id keyname, Id marker = -1) {
    if ((flags & SELECTION_MODEBITS) == 0)
      flags |= SELECTION_FILTER | SELECTION_WITH_ALL;
    $self->flags = selection_make_matchdepid($self->pool, &$self->q, dep, flags, keyname, marker);
  }
returnself(matchsolvable)
  void matchsolvable(XSolvable *solvable, int flags, Id keyname, Id marker = -1) {
    if ((flags & SELECTION_MODEBITS) == 0)
      flags |= SELECTION_FILTER | SELECTION_WITH_ALL;
    $self->flags = selection_make_matchsolvable($self->pool, &$self->q, solvable->id, flags, keyname, marker);
  }

  %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
  %newobject jobs;
  Queue jobs(int flags) {
    Queue q;
    int i;
    queue_init_clone(&q, &$self->q);
    for (i = 0; i < q.count; i += 2)
      q.elements[i] |= flags;
    return q;
  }

  %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
  %newobject solvables;
  Queue solvables() {
    Queue q;
    queue_init(&q);
    selection_solvables($self->pool, &$self->q, &q);
    return q;
  }

  const char *__str__() {
    return pool_selection2str($self->pool, &$self->q, 0);
  }
  const char *__repr__() {
    const char *str = pool_selection2str($self->pool, &$self->q, ~0);
    return pool_tmpjoin($self->pool, "<Selection ", str, ">");
  }
}

%extend Chksum {
  Chksum(Id type) {
    return solv_chksum_create(type);
  }
  Chksum(Id type, const char *hex) {
    unsigned char buf[64];
    int l = solv_chksum_len(type);
    if (!l)
      return 0;
    if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
      return 0;
    return solv_chksum_create_from_bin(type, buf);
  }
  %newobject from_bin;
  static Chksum *from_bin(Id type, const unsigned char *str, size_t len) {
    return len == solv_chksum_len(type) ? solv_chksum_create_from_bin(type, str) : 0;
  }
#if defined(SWIGPERL)
  %perlcode {
    undef *solv::Chksum::from_bin;
    *solv::Chksum::from_bin = sub {
      my $pkg = shift;
      my $self = solvc::Chksum_from_bin(@_);
      bless $self, $pkg if defined $self;
    };
  }
#endif
  ~Chksum() {
    solv_chksum_free($self, 0);
  }
  Id const type;
  %{
  SWIGINTERN Id Chksum_type_get(Chksum *chk) {
    return solv_chksum_get_type(chk);
  }
  %}
  void add(const unsigned char *str, size_t len) {
    solv_chksum_add($self, str, (int)len);
  }
  void add_fp(FILE *fp) {
    char buf[4096];
    int l;
    while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
      solv_chksum_add($self, buf, l);
    rewind(fp);         /* convenience */
  }
  void add_fd(int fd) {
    char buf[4096];
    int l;
    while ((l = read(fd, buf, sizeof(buf))) > 0)
      solv_chksum_add($self, buf, l);
    lseek(fd, 0, 0);    /* convenience */
  }
  void add_stat(const char *filename) {
    struct stat stb;
    if (stat(filename, &stb))
      memset(&stb, 0, sizeof(stb));
    solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
    solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
    solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
    solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
  }
  void add_fstat(int fd) {
    struct stat stb;
    if (fstat(fd, &stb))
      memset(&stb, 0, sizeof(stb));
    solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
    solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
    solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
    solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
  }
  BinaryBlob raw() {
    BinaryBlob bl;
    int l;
    const unsigned char *b;
    b = solv_chksum_get($self, &l);
    bl.data = b;
    bl.len = l;
    return bl;
  }
  %newobject hex;
  char *hex() {
    int l;
    const unsigned char *b;
    char *ret;

    b = solv_chksum_get($self, &l);
    ret = solv_malloc(2 * l + 1);
    solv_bin2hex(b, l, ret);
    return ret;
  }
  const char *typestr() {
    return solv_chksum_type2str(solv_chksum_get_type($self));
  }

  bool __eq__(Chksum *chk) {
    return solv_chksum_cmp($self, chk);
  }
  bool __ne__(Chksum *chk) {
    return !solv_chksum_cmp($self, chk);
  }
  %newobject __str__;
  const char *__str__() {
    const char *str;
    const char *h = 0;
    if (solv_chksum_isfinished($self))
      h = Chksum_hex($self);
    str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
    solv_free((void *)h);
    return str;
  }
  %newobject __repr__;
  const char *__repr__() {
    const char *h = Chksum___str__($self);
    const char *str = solv_dupjoin("<Chksum ", h, ">");
    solv_free((void *)h);
    return str;
  }
}

%extend Pool {
  static const int POOL_FLAG_PROMOTEEPOCH = POOL_FLAG_PROMOTEEPOCH;
  static const int POOL_FLAG_FORBIDSELFCONFLICTS = POOL_FLAG_FORBIDSELFCONFLICTS;
  static const int POOL_FLAG_OBSOLETEUSESPROVIDES = POOL_FLAG_OBSOLETEUSESPROVIDES;
  static const int POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES = POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES;
  static const int POOL_FLAG_OBSOLETEUSESCOLORS = POOL_FLAG_OBSOLETEUSESCOLORS;
  static const int POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS = POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS;
  static const int POOL_FLAG_NOINSTALLEDOBSOLETES = POOL_FLAG_NOINSTALLEDOBSOLETES;
  static const int POOL_FLAG_HAVEDISTEPOCH = POOL_FLAG_HAVEDISTEPOCH;
  static const int POOL_FLAG_NOOBSOLETESMULTIVERSION = POOL_FLAG_NOOBSOLETESMULTIVERSION;
  static const int POOL_FLAG_ADDFILEPROVIDESFILTERED = POOL_FLAG_ADDFILEPROVIDESFILTERED;
  static const int POOL_FLAG_NOWHATPROVIDESAUX = POOL_FLAG_NOWHATPROVIDESAUX;
  static const int POOL_FLAG_WHATPROVIDESWITHDISABLED = POOL_FLAG_WHATPROVIDESWITHDISABLED;
  static const int DISTTYPE_RPM = DISTTYPE_RPM;
  static const int DISTTYPE_DEB = DISTTYPE_DEB;
  static const int DISTTYPE_ARCH = DISTTYPE_ARCH;
  static const int DISTTYPE_HAIKU = DISTTYPE_HAIKU;
  static const int DISTTYPE_CONDA = DISTTYPE_CONDA;

  Pool() {
    Pool *pool = pool_create();
    return pool;
  }
  int setdisttype(int disttype) {
    return pool_setdisttype($self, disttype);
  }
  void set_debuglevel(int level) {
    pool_setdebuglevel($self, level);
  }
  int set_flag(int flag, int value) {
    return pool_set_flag($self, flag, value);
  }
  int get_flag(int flag) {
    return pool_get_flag($self, flag);
  }
  void set_rootdir(const char *rootdir) {
    pool_set_rootdir($self, rootdir);
  }
  const char *get_rootdir(int flag) {
    return pool_get_rootdir($self);
  }
#if defined(SWIGPYTHON)
  %{
  SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
    XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
    PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
    PyObject *result = PyObject_Call((PyObject *)d, args, NULL);

    int ecode = 0;
    int vresult = 0;
    Py_DECREF(args);
    if (!result)
      return 0; /* exception */
    ecode = SWIG_AsVal_int(result, &vresult);
    Py_DECREF(result);
    return SWIG_IsOK(ecode) ? vresult : 0;
  }
  %}
  void clr_loadcallback() {
    if ($self->loadcallback == loadcallback) {
      PyObject *obj = $self->loadcallbackdata;
      Py_DECREF(obj);
      pool_setloadcallback($self, 0, 0);
    }
  }
  void set_loadcallback(PyObject *callable) {
    Pool_clr_loadcallback($self);
    if (callable) {
      Py_INCREF(callable);
      pool_setloadcallback($self, loadcallback, callable);
    }
  }
#elif defined(SWIGPERL)
%{
  SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
    int count;
    int ret = 0;
    dSP;
    XRepodata *xd = new_XRepodata(data->repo, data->repodataid);

    ENTER;
    SAVETMPS;
    PUSHMARK(SP);
    XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
    PUTBACK;
    count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
    SPAGAIN;
    if (count)
      ret = POPi;
    PUTBACK;
    FREETMPS;
    LEAVE;
    return ret;
  }
%}
  void clr_loadcallback() {
    if ($self->loadcallback == loadcallback) {
      SvREFCNT_dec($self->loadcallbackdata);
      pool_setloadcallback($self, 0, 0);
    }
  }
  void set_loadcallback(SV *callable) {
    Pool_clr_loadcallback($self);
    if (callable) {
      SvREFCNT_inc(callable);
      pool_setloadcallback($self, loadcallback, callable);
    }
  }
#elif defined(SWIGRUBY)
%{
  SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
    XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
    VALUE callable = (VALUE)d;
    VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
    VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
    return res == Qtrue;
  }
  SWIGINTERN void mark_Pool(void *ptr) {
    Pool *pool = ptr;
    if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
      VALUE callable = (VALUE)pool->loadcallbackdata;
      rb_gc_mark(callable);
    }
  }
%}
  void clr_loadcallback() {
    pool_setloadcallback($self, 0, 0);
  }
  %typemap(in, numinputs=0) VALUE callable {
    $1 = rb_block_given_p() ? rb_block_proc() : 0;
  }
  void set_loadcallback(VALUE callable) {
    pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
  }
#elif defined(SWIGTCL)
  %{
  typedef struct {
    Tcl_Interp *interp;
    Tcl_Obj *obj;
  } tcl_callback_t;
  SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
    tcl_callback_t *callback_var = (tcl_callback_t *)d;
    Tcl_Interp *interp = callback_var->interp;
    XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
    int result, ecode = 0, vresult = 0;
    Tcl_Obj *objvx[2];
    objvx[0] = callback_var->obj;
    objvx[1] = SWIG_NewInstanceObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, 0);
    Tcl_IncrRefCount(objvx[1]);
    result = Tcl_EvalObjv(interp, sizeof(objvx)/sizeof(*objvx), objvx, TCL_EVAL_GLOBAL);
    Tcl_DecrRefCount(objvx[1]);
    if (result != TCL_OK)
      return 0; /* exception */
    ecode = SWIG_AsVal_int(interp, Tcl_GetObjResult(interp), &vresult);
    return SWIG_IsOK(ecode) ? vresult : 0;
  }
  %}
  void clr_loadcallback() {
    if ($self->loadcallback == loadcallback) {
      tcl_callback_t *callback_var = $self->loadcallbackdata;
      Tcl_DecrRefCount(callback_var->obj);
      solv_free(callback_var);
      pool_setloadcallback($self, 0, 0);
    }
  }
  void set_loadcallback(Tcl_Obj *callable, Tcl_Interp *interp) {
    Pool_clr_loadcallback($self);
    if (callable) {
      tcl_callback_t *callback_var = solv_malloc(sizeof(tcl_callback_t));
      Tcl_IncrRefCount(callable);
      callback_var->interp = interp;
      callback_var->obj = callable;
      pool_setloadcallback($self, loadcallback, callback_var);
    }
  }
#elif defined(SWIGLUA)
  %{
  SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
    lua_State* L = d;
    get_stashed_lua_var(L, "loadcallback", pool);
    XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
    SWIG_NewPointerObj(L,SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, 0);
    int res = lua_pcall(L, 1, 1, 0);
    res = res == LUA_OK ? lua_toboolean(L, -1) : 0;
    lua_pop(L, 1);
    return res;
  }
  %}
  void clr_loadcallback() {
    if ($self->loadcallback == loadcallback) {
      lua_State* L = $self->loadcallbackdata;
      clr_stashed_lua_var(L, "loadcallback", $self);
      pool_setloadcallback($self, 0, 0);
    }
  }
  void set_loadcallback(int lua_function_idx, lua_State* L) {
    clr_stashed_lua_var(L, "loadcallback", $self);
    if (!lua_isnil(L, lua_function_idx))  {
      set_stashed_lua_var(L, lua_function_idx, "loadcallback", $self);
      pool_setloadcallback($self, loadcallback, L);
    }
  }

#else
#warning loadcallback not implemented for this language
#endif

  ~Pool() {
    Pool *pool = $self;
    Id repoid;
    Repo *repo;
    FOR_REPOS(repoid, repo)
      appdata_clr_helper(&repo->appdata);
    Pool_clr_loadcallback(pool);
    appdata_clr_helper(&pool->appdata);
    pool_free(pool);
  }
  disown_helper free() {
    Pool *pool = $self;
    Id repoid;
    Repo *repo;
    FOR_REPOS(repoid, repo)
      appdata_clr_helper(&repo->appdata);
    Pool_clr_loadcallback(pool);
    appdata_clr_helper(&pool->appdata);
    pool_free(pool);
    return 0;
  }
  disown_helper disown() {
    return 0;
  }
  AppObjectPtr appdata;
  %{
  SWIGINTERN void Pool_appdata_set(Pool *pool, AppObjectPtr appdata) {
    appdata_set_helper(&pool->appdata, appdata);
  }
  SWIGINTERN AppObjectPtr Pool_appdata_get(Pool *pool) {
    return appdata_get_helper(&pool->appdata);
  }
  %}
  void appdata_disown() {
    appdata_disown_helper($self->appdata);
  }

  Id str2id(const char *str, bool create=1) {
    return pool_str2id($self, str, create);
  }
  %newobject Dep;
  Dep *Dep(const char *str, bool create=1) {
    Id id = pool_str2id($self, str, create);
    return new_Dep($self, id);
  }
#if defined(ENABLE_COMPLEX_DEPS) && (defined(ENABLE_SUSEREPO) || defined(ENABLE_RPMMD) || defined(ENABLE_RPMDB) || defined(ENABLE_RPMPKG))
  %newobject Dep;
  Dep *parserpmrichdep(const char *str) {
    Id id = pool_parserpmrichdep($self, str);
    return new_Dep($self, id);
  }
#endif
  const char *id2str(Id id) {
    return pool_id2str($self, id);
  }
  const char *dep2str(Id id) {
    return pool_dep2str($self, id);
  }
  Id rel2id(Id name, Id evr, int flags, bool create=1) {
    return pool_rel2id($self, name, evr, flags, create);
  }
  Id id2langid(Id id, const char *lang, bool create=1) {
    return pool_id2langid($self, id, lang, create);
  }
  void setarch(const char *arch = 0) {
    struct utsname un;
    if (!arch) {
      if (uname(&un)) {
        perror("uname");
        return;
      }
      arch = un.machine;
    }
    pool_setarch($self, arch);
  }
  Repo *add_repo(const char *name) {
    return repo_create($self, name);
  }
  const char *lookup_str(Id entry, Id keyname) {
    return pool_lookup_str($self, entry, keyname);
  }
  Id lookup_id(Id entry, Id keyname) {
    return pool_lookup_id($self, entry, keyname);
  }
  unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
    return pool_lookup_num($self, entry, keyname, notfound);
  }
  bool lookup_void(Id entry, Id keyname) {
    return pool_lookup_void($self, entry, keyname);
  }
  %newobject lookup_checksum;
  Chksum *lookup_checksum(Id entry, Id keyname) {
    Id type = 0;
    const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
    return solv_chksum_create_from_bin(type, b);
  }

  %newobject Dataiterator;
  Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
    return new_Dataiterator($self, 0, 0, key, match, flags);
  }
  %newobject Dataiterator_solvid;
  Dataiterator *Dataiterator_solvid(Id p, Id key, const char *match = 0, int flags = 0) {
    return new_Dataiterator($self, 0, p, key, match, flags);
  }
  const char *solvid2str(Id solvid) {
    return pool_solvid2str($self, solvid);
  }
  const char *solvidset2str(Queue q) {
    return pool_solvidset2str($self, &q);
  }
  const char *solvableset2str(Queue solvables) {
    return pool_solvidset2str($self, &solvables);
  }

  void addfileprovides() {
    pool_addfileprovides($self);
  }
  Queue addfileprovides_queue() {
    Queue r;
    queue_init(&r);
    pool_addfileprovides_queue($self, &r, 0);
    return r;
  }
  void createwhatprovides() {
    pool_createwhatprovides($self);
  }

  %newobject id2solvable;
  XSolvable *id2solvable(Id id) {
    return new_XSolvable($self, id);
  }
  %newobject solvables;
  Pool_solvable_iterator * const solvables;
  %{
  SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
    return new_Pool_solvable_iterator(pool);
  }
  %}
  %newobject solvables_iter;
  Pool_solvable_iterator * solvables_iter() {
    return new_Pool_solvable_iterator($self);
  }

  Repo *id2repo(Id id) {
    if (id < 1 || id >= $self->nrepos)
      return 0;
    return pool_id2repo($self, id);
  }

  %newobject repos;
  Pool_repo_iterator * const repos;
  %{
  SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
    return new_Pool_repo_iterator(pool);
  }
  %}
  %newobject repos_iter;
  Pool_repo_iterator * repos_iter() {
    return new_Pool_repo_iterator($self);
  }

  Repo *installed;
  const char * const errstr;
  %{
  SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
    pool_set_installed(pool, installed);
  }
  SWIGINTERN Repo *Pool_installed_get(Pool *pool) {
    return pool->installed;
  }
  SWIGINTERN const char *Pool_errstr_get(Pool *pool) {
    return pool_errstr(pool);
  }
  %}

  Queue matchprovidingids(const char *match, int flags) {
    Pool *pool = $self;
    Queue q;
    Id id;
    queue_init(&q);
    if (!flags) {
      for (id = 1; id < pool->ss.nstrings; id++)
        if (pool->whatprovides[id])
          queue_push(&q, id);
    } else {
      Datamatcher ma;
      if (!datamatcher_init(&ma, match, flags)) {
        for (id = 1; id < pool->ss.nstrings; id++)
          if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
            queue_push(&q, id);
        datamatcher_free(&ma);
      }
    }
    return q;
  }

  %newobject Job;
  Job *Job(int how, Id what) {
    return new_Job($self, how, what);
  }

  %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
  %newobject whatprovides;
  Queue whatprovides(DepId dep) {
    Pool *pool = $self;
    Queue q;
    Id p, pp;
    queue_init(&q);
    FOR_PROVIDES(p, pp, dep)
      queue_push(&q, p);
    return q;
  }
  %typemap(out) Queue best_solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
  %newobject best_solvables;
  Queue best_solvables(Queue solvables, int flags=0) {
    Queue q;
    queue_init_clone(&q, &solvables);
    pool_best_solvables($self, &q, flags);
    return q;
  }

  Id towhatprovides(Queue q) {
    return pool_queuetowhatprovides($self, &q);
  }

  void set_namespaceproviders(DepId ns, DepId evr, bool value=1) {
    Id dep = pool_rel2id($self, ns, evr, REL_NAMESPACE, 1);
    pool_set_whatprovides($self, dep, value ? 2 : 1);
  }

  void flush_namespaceproviders(DepId ns, DepId evr) {
    pool_flush_namespaceproviders($self, ns, evr);
  }

  %typemap(out) Queue whatcontainsdep Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
  %newobject whatcontainsdep;
  Queue whatcontainsdep(Id keyname, DepId dep, Id marker = -1) {
    Queue q;
    queue_init(&q);
    pool_whatcontainsdep($self, keyname, dep, &q, marker);
    return q;
  }

  %typemap(out) Queue whatmatchesdep Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
  %newobject whatmatchesdep;
  Queue whatmatchesdep(Id keyname, DepId dep, Id marker = -1) {
    Queue q;
    queue_init(&q);
    pool_whatmatchesdep($self, keyname, dep, &q, marker);
    return q;
  }

  %typemap(out) Queue whatmatchessolvable Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
  %newobject whatmatchessolvable;
  Queue whatmatchessolvable(Id keyname, XSolvable *pool_solvable, Id marker = -1) {
    Queue q;
    queue_init(&q);
    pool_whatmatchessolvable($self, keyname, pool_solvable->id, &q, marker);
    return q;
  }

#ifdef SWIGRUBY
  %rename("isknownarch?") isknownarch;
#endif
  bool isknownarch(DepId id) {
    Pool *pool = $self;
    if (!id || id == ID_EMPTY)
      return 0;
    if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
      return 1;
    if (pool->id2arch && pool_arch2score(pool, id) == 0)
      return 0;
    return 1;
  }

  %newobject Solver;
  Solver *Solver() {
    return solver_create($self);
  }

  %newobject Selection;
  Selection *Selection() {
    return new_Selection($self);
  }
  %newobject Selection_all;
  Selection *Selection_all(int setflags=0) {
    Selection *sel = new_Selection($self);
    queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
    return sel;
  }
  %newobject select;
  Selection *select(const char *name, int flags) {
    Selection *sel = new_Selection($self);
    sel->flags = selection_make($self, &sel->q, name, flags);
    return sel;
  }

  %newobject matchdeps;
  Selection *matchdeps(const char *name, int flags, Id keyname, Id marker = -1) {
    Selection *sel = new_Selection($self);
    sel->flags = selection_make_matchdeps($self, &sel->q, name, flags, keyname, marker);
    return sel;
  }

  %newobject matchdepid;
  Selection *matchdepid(DepId dep, int flags, Id keyname, Id marker = -1) {
    Selection *sel = new_Selection($self);
    sel->flags = selection_make_matchdepid($self, &sel->q, dep, flags, keyname, marker);
    return sel;
  }

  %newobject matchsolvable;
  Selection *matchsolvable(XSolvable *solvable, int flags, Id keyname, Id marker = -1) {
    Selection *sel = new_Selection($self);
    sel->flags = selection_make_matchsolvable($self, &sel->q, solvable->id, flags, keyname, marker);
    return sel;
  }

  Queue get_considered_list() {
    Queue q;
    queue_init(&q);
    int i;
    for (i = 2; i < $self->nsolvables; i++) {
      if ($self->solvables[i].repo && (!$self->considered || MAPTST($self->considered, i)))
        queue_push(&q, i);
    }
    return q;
  }

  Queue get_disabled_list() {
    Queue q;
    queue_init(&q);
    int i;
    for (i = 2; i < $self->nsolvables; i++) {
      if ($self->solvables[i].repo && ($self->considered && !MAPTST($self->considered, i)))
        queue_push(&q, i);
    }
    return q;
  }

  void set_considered_list(Queue q) {
    int i;
    Id p;
    if (!$self->considered) {
      $self->considered = solv_calloc(1, sizeof(Map));
      map_init($self->considered, $self->nsolvables);
    }
    map_empty($self->considered);
    MAPSET($self->considered, 1);
    for (i = 0; i < q.count; i++) {
      p = q.elements[i];
      if (p > 0 && p < $self->nsolvables)
        MAPSET($self->considered, p);
    }
  }

  void set_disabled_list(Queue q) {
    int i;
    Id p;
    if (!q.count) {
      if ($self->considered) {
        map_free($self->considered);
        $self->considered = solv_free($self->considered);
      }
      return;
    }
    if (!$self->considered) {
      $self->considered = solv_calloc(1, sizeof(Map));
      map_init($self->considered, $self->nsolvables);
    }
    map_setall($self->considered);
    for (i = 0; i < q.count; i++) {
      p = q.elements[i];
      if (p > 0 && p < $self->nsolvables)
        MAPCLR($self->considered, p);
    }
  }

  void setpooljobs(Queue solvejobs) {
    queue_free(&$self->pooljobs);
    queue_init_clone(&$self->pooljobs, &solvejobs);
  }
  %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
  %newobject getpooljobs;
  Queue getpooljobs() {
    Queue q;
    queue_init_clone(&q, &$self->pooljobs);
    return q;
  }

}

%extend Repo {
  static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
  static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
  static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
  static const int REPO_USE_LOADING = REPO_USE_LOADING;
  static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
  static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
  static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
  static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS;       /* repo_solv */
#ifdef ENABLE_SUSEREPO
  static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES;     /* repo_susetags */
#endif

  void free(bool reuseids = 0) {
    appdata_clr_helper(&$self->appdata);
    repo_free($self, reuseids);
  }
  void empty(bool reuseids = 0) {
    repo_empty($self, reuseids);
  }
#ifdef SWIGRUBY
  %rename("isempty?") isempty;
#endif
  bool isempty() {
    return !$self->nsolvables;
  }

  AppObjectPtr appdata;
  %{
  SWIGINTERN void Repo_appdata_set(Repo *repo, AppObjectPtr appdata) {
    appdata_set_helper(&repo->appdata, appdata);
  }
  SWIGINTERN AppObjectPtr Repo_appdata_get(Repo *repo) {
    return appdata_get_helper(&repo->appdata);
  }
  %}

  bool add_solv(const char *name, int flags = 0) {
    FILE *fp = fopen(name, "r");
    int r;
    if (!fp)
      return 0;
    r = repo_add_solv($self, fp, flags);
    fclose(fp);
    return r == 0;
  }
  bool add_solv(FILE *fp, int flags = 0) {
    return repo_add_solv($self, fp, flags) == 0;
  }

  %newobject add_solvable;
  XSolvable *add_solvable() {
    Id solvid = repo_add_solvable($self);
    return new_XSolvable($self->pool, solvid);
  }

#ifdef ENABLE_RPMDB
  bool add_rpmdb(int flags = 0) {
    return repo_add_rpmdb($self, 0, flags) == 0;
  }
  bool add_rpmdb_reffp(FILE *reffp, int flags = 0) {
    return repo_add_rpmdb_reffp($self, reffp, flags) == 0;
  }
#endif
#ifdef ENABLE_RPMPKG
  %newobject add_rpm;
  XSolvable *add_rpm(const char *name, int flags = 0) {
    return new_XSolvable($self->pool, repo_add_rpm($self, name, flags));
  }
#endif
#ifdef ENABLE_PUBKEY
#ifdef ENABLE_RPMDB
  bool add_rpmdb_pubkeys(int flags = 0) {
    return repo_add_rpmdb_pubkeys($self, flags) == 0;
  }
#endif
  %newobject add_pubkey;
  XSolvable *add_pubkey(const char *keyfile, int flags = 0) {
    return new_XSolvable($self->pool, repo_add_pubkey($self, keyfile, flags));
  }
  bool add_keyring(FILE *fp, int flags = 0) {
    return repo_add_keyring($self, fp, flags);
  }
  bool add_keydir(const char *keydir, const char *suffix, int flags = 0) {
    return repo_add_keydir($self, keydir, suffix, flags);
  }
#endif
#ifdef ENABLE_RPMMD
  bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
    return repo_add_rpmmd($self, fp, language, flags) == 0;
  }
  bool add_repomdxml(FILE *fp, int flags = 0) {
    return repo_add_repomdxml($self, fp, flags) == 0;
  }
  bool add_updateinfoxml(FILE *fp, int flags = 0) {
    return repo_add_updateinfoxml($self, fp, flags) == 0;
  }
  bool add_deltainfoxml(FILE *fp, int flags = 0) {
    return repo_add_deltainfoxml($self, fp, flags) == 0;
  }
#endif
#ifdef ENABLE_DEBIAN
  bool add_debdb(int flags = 0) {
    return repo_add_debdb($self, flags) == 0;
  }
  bool add_debpackages(FILE *fp, int flags = 0) {
    return repo_add_debpackages($self, fp, flags) == 0;
  }
  %newobject add_deb;
  XSolvable *add_deb(const char *name, int flags = 0) {
    return new_XSolvable($self->pool, repo_add_deb($self, name, flags));
  }
#endif
#ifdef ENABLE_SUSEREPO
  bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
    return repo_add_susetags($self, fp, defvendor, language, flags) == 0;
  }
  bool add_content(FILE *fp, int flags = 0) {
    return repo_add_content($self, fp, flags) == 0;
  }
  bool add_products(const char *proddir, int flags = 0) {
    return repo_add_products($self, proddir, flags) == 0;
  }
#endif
#ifdef ENABLE_MDKREPO
  bool add_mdk(FILE *fp, int flags = 0) {
    return repo_add_mdk($self, fp, flags) == 0;
  }
  bool add_mdk_info(FILE *fp, int flags = 0) {
    return repo_add_mdk_info($self, fp, flags) == 0;
  }
#endif
#ifdef ENABLE_ARCHREPO
  bool add_arch_repo(FILE *fp, int flags = 0) {
    return repo_add_arch_repo($self, fp, flags) == 0;
  }
  bool add_arch_local(const char *dir, int flags = 0) {
    return repo_add_arch_local($self, dir, flags) == 0;
  }
  %newobject add_arch_pkg;
  XSolvable *add_arch_pkg(const char *name, int flags = 0) {
    return new_XSolvable($self->pool, repo_add_arch_pkg($self, name, flags));
  }
#endif
#ifdef SUSE
  bool add_autopattern(int flags = 0) {
    return repo_add_autopattern($self, flags) == 0;
  }
#endif
  void internalize() {
    repo_internalize($self);
  }
  bool write(FILE *fp) {
    return repo_write($self, fp) == 0;
  }
  /* HACK, remove if no longer needed! */
  bool write_first_repodata(FILE *fp) {
    int oldnrepodata = $self->nrepodata;
    int res;
    $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
    res = repo_write($self, fp);
    $self->nrepodata = oldnrepodata;
    return res == 0;
  }

  %newobject Dataiterator;
  Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
    return new_Dataiterator($self->pool, $self, 0, key, match, flags);
  }
  %newobject Dataiterator_meta;
  Dataiterator *Dataiterator_meta(Id key, const char *match = 0, int flags = 0) {
    return new_Dataiterator($self->pool, $self, SOLVID_META, key, match, flags);
  }

  Id const id;
  %{
  SWIGINTERN Id Repo_id_get(Repo *repo) {
    return repo->repoid;
  }
  %}
  %newobject solvables;
  Repo_solvable_iterator * const solvables;
  %{
  SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
    return new_Repo_solvable_iterator(repo);
  }
  %}
  %newobject meta;
  Datapos * const meta;
  %{
  SWIGINTERN Datapos * Repo_meta_get(Repo *repo) {
    Datapos *pos = solv_calloc(1, sizeof(*pos));
    pos->solvid = SOLVID_META;
    pos->repo = repo;
    return pos;
  }
  %}

  %newobject solvables_iter;
  Repo_solvable_iterator *solvables_iter() {
    return new_Repo_solvable_iterator($self);
  }

  %newobject add_repodata;
  XRepodata *add_repodata(int flags = 0) {
    Repodata *rd = repo_add_repodata($self, flags);
    return new_XRepodata($self, rd->repodataid);
  }

  void create_stubs() {
    Repodata *data;
    if (!$self->nrepodata)
      return;
    data = repo_id2repodata($self, $self->nrepodata - 1);
    if (data->state != REPODATA_STUB)
      (void)repodata_create_stubs(data);
  }
#ifdef SWIGRUBY
  %rename("iscontiguous?") iscontiguous;
#endif
  bool iscontiguous() {
    int i;
    for (i = $self->start; i < $self->end; i++)
      if ($self->pool->solvables[i].repo != $self)
        return 0;
    return 1;
  }
  %newobject first_repodata;
  XRepodata *first_repodata() {
    Repodata *data;
    int i;
    if ($self->nrepodata < 2)
      return 0;
    /* make sure all repodatas but the first are extensions */
    data = repo_id2repodata($self, 1);
    if (data->loadcallback)
       return 0;
    for (i = 2; i < $self->nrepodata; i++)
      {
        data = repo_id2repodata($self, i);
        if (!data->loadcallback)
          return 0;       /* oops, not an extension */
      }
    return new_XRepodata($self, 1);
  }

  %newobject Selection;
  Selection *Selection(int setflags=0) {
    Selection *sel = new_Selection($self->pool);
    setflags |= SOLVER_SETREPO;
    queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
    return sel;
  }

#ifdef ENABLE_PUBKEY
  %newobject find_pubkey;
  XSolvable *find_pubkey(const char *keyid) {
    return new_XSolvable($self->pool, repo_find_pubkey($self, keyid));
  }
#endif

  Repo *createshadow(const char *name) {
    Repo *repo = repo_create($self->pool, name);
    if ($self->idarraysize) {
      repo_reserve_ids(repo, 0, $self->idarraysize);
      memcpy(repo->idarraydata, $self->idarraydata, sizeof(Id) * $self->idarraysize);
      repo->idarraysize = $self->idarraysize;
    }
    repo->start = $self->start;
    repo->end = $self->end;
    repo->nsolvables = $self->nsolvables;
    return repo;
  }

  void moveshadow(Queue q) {
    Pool *pool = $self->pool;
    int i;
    for (i = 0; i < q.count; i++) {
      Solvable *s;
      Id p = q.elements[i];
      if (p < $self->start || p >= $self->end)
        continue;
      s = pool->solvables + p;
      if ($self->idarraysize != s->repo->idarraysize)
        continue;
      s->repo = $self;
    }
  }

  bool __eq__(Repo *repo) {
    return $self == repo;
  }
  bool __ne__(Repo *repo) {
    return $self != repo;
  }
#if defined(SWIGPYTHON)
  int __hash__() {
    return $self->repoid;
  }
#endif
  %newobject __str__;
  const char *__str__() {
    char buf[20];
    if ($self->name)
      return solv_strdup($self->name);
    sprintf(buf, "Repo#%d", $self->repoid);
    return solv_strdup(buf);
  }
  %newobject __repr__;
  const char *__repr__() {
    char buf[20];
    if ($self->name)
      {
        sprintf(buf, "<Repo #%d ", $self->repoid);
        return solv_dupjoin(buf, $self->name, ">");
      }
    sprintf(buf, "<Repo #%d>", $self->repoid);
    return solv_strdup(buf);
  }
}

%extend Dataiterator {
  static const int SEARCH_STRING = SEARCH_STRING;
  static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
  static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
  static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
  static const int SEARCH_GLOB = SEARCH_GLOB;
  static const int SEARCH_REGEX = SEARCH_REGEX;
  static const int SEARCH_NOCASE = SEARCH_NOCASE;
  static const int SEARCH_FILES = SEARCH_FILES;
  static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
  static const int SEARCH_CHECKSUMS = SEARCH_CHECKSUMS;

  Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
    Dataiterator *di = solv_calloc(1, sizeof(*di));
    dataiterator_init(di, pool, repo, p, key, match, flags);
    return di;
  }
  ~Dataiterator() {
    dataiterator_free($self);
    solv_free($self);
  }
#if defined(SWIGPYTHON)
  %pythoncode {
    def __iter__(self): return self
  }
#ifndef PYTHON3
  %rename("next") __next__();
#endif
  %exception __next__ {
    $action
    if (!result) {
      PyErr_SetString(PyExc_StopIteration,"no more matches");
      return NULL;
    }
  }
#endif
#ifdef SWIGPERL
  perliter(solv::Dataiterator)
#endif
  %newobject __next__;
#ifdef SWIGLUA
  Datamatch *__next__(void *ign1=0, void *ign2=0) {
#else
  Datamatch *__next__() {
#endif
    Dataiterator *ndi;
    if (!dataiterator_step($self)) {
      return 0;
    }
    ndi = solv_calloc(1, sizeof(*ndi));
    dataiterator_init_clone(ndi, $self);
    dataiterator_strdup(ndi);
    return ndi;
  }
#ifdef SWIGRUBY
  void each() {
    Datamatch *d;
    while ((d = Dataiterator___next__($self)) != 0) {
      rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
    }
  }
#endif
  void prepend_keyname(Id key) {
    dataiterator_prepend_keyname($self, key);
  }
  void skip_solvable() {
    dataiterator_skip_solvable($self);
  }
}

%extend Datapos {
  Id lookup_id(Id keyname) {
    Pool *pool = $self->repo->pool;
    Datapos oldpos = pool->pos;
    Id r;
    pool->pos = *$self;
    r = pool_lookup_id(pool, SOLVID_POS, keyname);
    pool->pos = oldpos;
    return r;
  }
  const char *lookup_str(Id keyname) {
    Pool *pool = $self->repo->pool;
    Datapos oldpos = pool->pos;
    const char *r;
    pool->pos = *$self;
    r = pool_lookup_str(pool, SOLVID_POS, keyname);
    pool->pos = oldpos;
    return r;
  }
  unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
    Pool *pool = $self->repo->pool;
    Datapos oldpos = pool->pos;
    unsigned long long r;
    pool->pos = *$self;
    r = pool_lookup_num(pool, SOLVID_POS, keyname, notfound);
    pool->pos = oldpos;
    return r;
  }
  bool lookup_void(Id keyname) {
    Pool *pool = $self->repo->pool;
    Datapos oldpos = pool->pos;
    int r;
    pool->pos = *$self;
    r = pool_lookup_void(pool, SOLVID_POS, keyname);
    pool->pos = oldpos;
    return r;
  }
  %newobject lookup_checksum;
  Chksum *lookup_checksum(Id keyname) {
    Pool *pool = $self->repo->pool;
    Datapos oldpos = pool->pos;
    Id type = 0;
    const unsigned char *b;
    pool->pos = *$self;
    b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
    pool->pos = oldpos;
    return solv_chksum_create_from_bin(type, b);
  }
  const char *lookup_deltaseq() {
    Pool *pool = $self->repo->pool;
    Datapos oldpos = pool->pos;
    const char *seq;
    pool->pos = *$self;
    seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
    if (seq) {
      seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
      seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
    }
    pool->pos = oldpos;
    return seq;
  }
  const char *lookup_deltalocation(unsigned int *OUTPUT) {
    Pool *pool = $self->repo->pool;
    Datapos oldpos = pool->pos;
    const char *loc;
    pool->pos = *$self;
    loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
    pool->pos = oldpos;
    return loc;
  }
  Queue lookup_idarray(Id keyname) {
    Pool *pool = $self->repo->pool;
    Datapos oldpos = pool->pos;
    Queue r;
    queue_init(&r);
    pool->pos = *$self;
    pool_lookup_idarray(pool, SOLVID_POS, keyname, &r);
    pool->pos = oldpos;
    return r;
  }
  %newobject Dataiterator;
  Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
    Pool *pool = $self->repo->pool;
    Datapos oldpos = pool->pos;
    Dataiterator *di;
    pool->pos = *$self;
    di = new_Dataiterator(pool, 0, SOLVID_POS, key, match, flags);
    pool->pos = oldpos;
    return di;
  }
}

%extend Datamatch {
  ~Datamatch() {
    dataiterator_free($self);
    solv_free($self);
  }
  %newobject solvable;
  XSolvable * const solvable;
  Id const key_id;
  const char * const key_idstr;
  Id const type_id;
  const char * const type_idstr;
  Id const id;
  const char * const idstr;
  const char * const str;
  %newobject dep;
  Dep * const dep;
  BinaryBlob const binary;
  unsigned long long const num;
  unsigned int const num2;
  %{
  SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
    return new_XSolvable(di->pool, di->solvid);
  }
  SWIGINTERN Id Datamatch_key_id_get(Dataiterator *di) {
    return di->key->name;
  }
  SWIGINTERN const char *Datamatch_key_idstr_get(Dataiterator *di) {
    return pool_id2str(di->pool, di->key->name);
  }
  SWIGINTERN Id Datamatch_type_id_get(Dataiterator *di) {
    return di->key->type;
  }
  SWIGINTERN const char *Datamatch_type_idstr_get(Dataiterator *di) {
    return pool_id2str(di->pool, di->key->type);
  }
  SWIGINTERN Id Datamatch_id_get(Dataiterator *di) {
    return di->kv.id;
  }
  SWIGINTERN const char *Datamatch_idstr_get(Dataiterator *di) {
   if (di->data && (di->key->type == REPOKEY_TYPE_DIR || di->key->type == REPOKEY_TYPE_DIRSTRARRAY || di->key->type == REPOKEY_TYPE_DIRNUMNUMARRAY))
      return repodata_dir2str(di->data,  di->kv.id, 0);
    if (di->data && di->data->localpool)
      return stringpool_id2str(&di->data->spool, di->kv.id);
    return pool_id2str(di->pool, di->kv.id);
  }
  SWIGINTERN const char * const Datamatch_str_get(Dataiterator *di) {
    return di->kv.str;
  }
  SWIGINTERN Dep *Datamatch_dep_get(Dataiterator *di) {
    if (di->key->type == REPOKEY_TYPE_DIR || di->key->type == REPOKEY_TYPE_DIRSTRARRAY || di->key->type == REPOKEY_TYPE_DIRNUMNUMARRAY)
      return 0;
    if (di->data && di->data->localpool)
      return 0;
    return new_Dep(di->pool, di->kv.id);
  }
  SWIGINTERN BinaryBlob Datamatch_binary_get(Dataiterator *di) {
    BinaryBlob bl;
    bl.data = 0;
    bl.len = 0;
    if (di->key->type == REPOKEY_TYPE_BINARY)
      {
        bl.data = di->kv.str;
        bl.len = di->kv.num;
      }
    else if ((bl.len = solv_chksum_len(di->key->type)) != 0)
      bl.data = di->kv.str;
    return bl;
  }
  SWIGINTERN unsigned long long Datamatch_num_get(Dataiterator *di) {
   if (di->key->type == REPOKEY_TYPE_NUM)
     return SOLV_KV_NUM64(&di->kv);
   return di->kv.num;
  }
  SWIGINTERN unsigned int Datamatch_num2_get(Dataiterator *di) {
    return di->kv.num2;
  }
  %}
  %newobject pos;
  Datapos *pos() {
    Pool *pool = $self->pool;
    Datapos *pos, oldpos = pool->pos;
    dataiterator_setpos($self);
    pos = solv_calloc(1, sizeof(*pos));
    *pos = pool->pos;
    pool->pos = oldpos;
    return pos;
  }
  %newobject parentpos;
  Datapos *parentpos() {
    Pool *pool = $self->pool;
    Datapos *pos, oldpos = pool->pos;
    dataiterator_setpos_parent($self);
    pos = solv_calloc(1, sizeof(*pos));
    *pos = pool->pos;
    pool->pos = oldpos;
    return pos;
  }
#if defined(SWIGPERL)
  /* cannot use str here because swig reports a bogus conflict... */
  %rename("stringify") __str__;
  %perlcode {
    *solv::Datamatch::str = *solvc::Datamatch_stringify;
  }
#endif
#if defined(SWIGTCL)
  %rename("stringify") __str__;
#endif
  const char *__str__() {
    KeyValue kv = $self->kv;
    const char *str = repodata_stringify($self->pool, $self->data, $self->key, &kv, SEARCH_FILES | SEARCH_CHECKSUMS);
    return str ? str : "";
  }
}

%extend Pool_solvable_iterator {
  Pool_solvable_iterator(Pool *pool) {
    Pool_solvable_iterator *s;
    s = solv_calloc(1, sizeof(*s));
    s->pool = pool;
    return s;
  }
#if defined(SWIGPYTHON)
  %pythoncode {
    def __iter__(self): return self
  }
#ifndef PYTHON3
  %rename("next") __next__();
#endif
  %exception __next__ {
    $action
    if (!result) {
      PyErr_SetString(PyExc_StopIteration,"no more matches");
      return NULL;
    }
  }
#endif
#ifdef SWIGPERL
  perliter(solv::Pool_solvable_iterator)
#endif
  %newobject __next__;
#ifdef SWIGLUA
  XSolvable *__next__(void *ign1=0, void *ign2=0) {
#else
  XSolvable *__next__() {
#endif
    Pool *pool = $self->pool;
    if ($self->id >= pool->nsolvables)
      return 0;
    while (++$self->id < pool->nsolvables)
      if (pool->solvables[$self->id].repo)
        return new_XSolvable(pool, $self->id);
    return 0;
  }
#ifdef SWIGRUBY
  void each() {
    XSolvable *n;
    while ((n = Pool_solvable_iterator___next__($self)) != 0) {
      rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
    }
  }
#endif
  %newobject __getitem__;
  XSolvable *__getitem__(Id key) {
    Pool *pool = $self->pool;
    if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
      return new_XSolvable(pool, key);
    return 0;
  }
  int __len__() {
    return $self->pool->nsolvables;
  }
}

%extend Pool_repo_iterator {
  Pool_repo_iterator(Pool *pool) {
    Pool_repo_iterator *s;
    s = solv_calloc(1, sizeof(*s));
    s->pool = pool;
    return s;
  }
#if defined(SWIGPYTHON)
  %pythoncode {
    def __iter__(self): return self
  }
#ifndef PYTHON3
  %rename("next") __next__();
#endif
  %exception __next__ {
    $action
    if (!result) {
      PyErr_SetString(PyExc_StopIteration,"no more matches");
      return NULL;
    }
  }
#endif
#ifdef SWIGPERL
  perliter(solv::Pool_repo_iterator)
#endif
#ifdef SWIGLUA
  Repo *__next__(void *ign1=0, void *ign2=0) {
#else
  Repo *__next__() {
#endif
    Pool *pool = $self->pool;
    if ($self->id >= pool->nrepos)
      return 0;
    while (++$self->id < pool->nrepos) {
      Repo *r = pool_id2repo(pool, $self->id);
      if (r)
        return r;
    }
    return 0;
  }
#ifdef SWIGRUBY
  void each() {
    Repo *n;
    while ((n = Pool_repo_iterator___next__($self)) != 0) {
      rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, 0 | 0));
    }
  }
#endif
  Repo *__getitem__(Id key) {
    Pool *pool = $self->pool;
    if (key > 0 && key < pool->nrepos)
      return pool_id2repo(pool, key);
    return 0;
  }
  int __len__() {
    return $self->pool->nrepos;
  }
}

%extend Repo_solvable_iterator {
  Repo_solvable_iterator(Repo *repo) {
    Repo_solvable_iterator *s;
    s = solv_calloc(1, sizeof(*s));
    s->repo = repo;
    return s;
  }
#if defined(SWIGPYTHON)
  %pythoncode {
    def __iter__(self): return self
  }
#ifndef PYTHON3
  %rename("next") __next__();
#endif
  %exception __next__ {
    $action
    if (!result) {
      PyErr_SetString(PyExc_StopIteration,"no more matches");
      return NULL;
    }
  }
#endif
#ifdef SWIGPERL
  perliter(solv::Repo_solvable_iterator)
#endif
  %newobject __next__;
#ifdef SWIGLUA
  XSolvable *__next__(void *ign1=0, void *ign2=0) {
#else
  XSolvable *__next__() {
#endif
    Repo *repo = $self->repo;
    Pool *pool = repo->pool;
    if (repo->start > 0 && $self->id < repo->start)
      $self->id = repo->start - 1;
    if ($self->id >= repo->end)
      return 0;
    while (++$self->id < repo->end)
      if (pool->solvables[$self->id].repo == repo)
        return new_XSolvable(pool, $self->id);
    return 0;
  }
#ifdef SWIGRUBY
  void each() {
    XSolvable *n;
    while ((n = Repo_solvable_iterator___next__($self)) != 0) {
      rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
    }
  }
#endif
  %newobject __getitem__;
  XSolvable *__getitem__(Id key) {
    Repo *repo = $self->repo;
    Pool *pool = repo->pool;
    if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
      return new_XSolvable(pool, key);
    return 0;
  }
  int __len__() {
    return $self->repo->pool->nsolvables;
  }
}

%extend Dep {
  Dep(Pool *pool, Id id) {
    Dep *s;
    if (!id)
      return 0;
    s = solv_calloc(1, sizeof(*s));
    s->pool = pool;
    s->id = id;
    return s;
  }
  %newobject Rel;
  Dep *Rel(int flags, DepId evrid, bool create=1) {
    Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
    if (!id)
      return 0;
    return new_Dep($self->pool, id);
  }
  %newobject Selection_name;
  Selection *Selection_name(int setflags=0) {
    Selection *sel = new_Selection($self->pool);
    if (ISRELDEP($self->id)) {
      Reldep *rd = GETRELDEP($self->pool, $self->id);
      if (rd->flags == REL_EQ) {
        setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
        if (ISRELDEP(rd->name))
          rd = GETRELDEP($self->pool, rd->name);
      }
      if (rd->flags == REL_ARCH)
        setflags |= SOLVER_SETARCH;
    }
    queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
    return sel;
  }
  %newobject Selection_provides;
  Selection *Selection_provides(int setflags=0) {
    Selection *sel = new_Selection($self->pool);
    if (ISRELDEP($self->id)) {
      Reldep *rd = GETRELDEP($self->pool, $self->id);
      if (rd->flags == REL_ARCH)
        setflags |= SOLVER_SETARCH;
    }
    queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
    return sel;
  }
  const char *str() {
    return pool_dep2str($self->pool, $self->id);
  }
  bool __eq__(Dep *s) {
    return $self->pool == s->pool && $self->id == s->id;
  }
  bool __ne__(Dep *s) {
    return !Dep___eq__($self, s);
  }
#if defined(SWIGPYTHON)
  int __hash__() {
    return $self->id;
  }
#endif
  const char *__str__() {
    return pool_dep2str($self->pool, $self->id);
  }
  %newobject __repr__;
  const char *__repr__() {
    char buf[20];
    sprintf(buf, "<Id #%d ", $self->id);
    return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
  }
}

%extend XSolvable {
  XSolvable(Pool *pool, Id id) {
    XSolvable *s;
    if (!id || id >= pool->nsolvables)
      return 0;
    s = solv_calloc(1, sizeof(*s));
    s->pool = pool;
    s->id = id;
    return s;
  }
  const char *str() {
    return pool_solvid2str($self->pool, $self->id);
  }
  const char *lookup_str(Id keyname) {
    return pool_lookup_str($self->pool, $self->id, keyname);
  }
  Id lookup_id(Id keyname) {
    return pool_lookup_id($self->pool, $self->id, keyname);
  }
  unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
    return pool_lookup_num($self->pool, $self->id, keyname, notfound);
  }
  bool lookup_void(Id keyname) {
    return pool_lookup_void($self->pool, $self->id, keyname);
  }
  %newobject lookup_checksum;
  Chksum *lookup_checksum(Id keyname) {
    Id type = 0;
    const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
    return solv_chksum_create_from_bin(type, b);
  }
  Queue lookup_idarray(Id keyname, Id marker = -1) {
    Solvable *s = $self->pool->solvables + $self->id;
    Queue r;
    queue_init(&r);
    solvable_lookup_deparray(s, keyname, &r, marker);
    return r;
  }
  %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
  %newobject lookup_deparray;
  Queue lookup_deparray(Id keyname, Id marker = -1) {
    Solvable *s = $self->pool->solvables + $self->id;
    Queue r;
    queue_init(&r);
    solvable_lookup_deparray(s, keyname, &r, marker);
    return r;
  }
  const char *lookup_location(unsigned int *OUTPUT) {
    return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
  }
  const char *lookup_sourcepkg() {
    return solvable_lookup_sourcepkg($self->pool->solvables + $self->id);
  }
  %newobject Dataiterator;
  Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
    return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
  }
#ifdef SWIGRUBY
  %rename("installable?") installable;
#endif
  bool installable() {
    return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
  }
#ifdef SWIGRUBY
  %rename("isinstalled?") isinstalled;
#endif
  bool isinstalled() {
    Pool *pool = $self->pool;
    return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
  }

  const char *name;
  %{
    SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
      Pool *pool = xs->pool;
      pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
    }
    SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
      Pool *pool = xs->pool;
      return pool_id2str(pool, pool->solvables[xs->id].name);
    }
  %}
  Id nameid;
  %{
    SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
      xs->pool->solvables[xs->id].name = nameid;
    }
    SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
      return xs->pool->solvables[xs->id].name;
    }
  %}
  const char *evr;
  %{
    SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
      Pool *pool = xs->pool;
      pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
    }
    SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
      Pool *pool = xs->pool;
      return pool_id2str(pool, pool->solvables[xs->id].evr);
    }
  %}
  Id evrid;
  %{
    SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
      xs->pool->solvables[xs->id].evr = evrid;
    }
    SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
      return xs->pool->solvables[xs->id].evr;
    }
  %}
  const char *arch;
  %{
    SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
      Pool *pool = xs->pool;
      pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
    }
    SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
      Pool *pool = xs->pool;
      return pool_id2str(pool, pool->solvables[xs->id].arch);
    }
  %}
  Id archid;
  %{
    SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
      xs->pool->solvables[xs->id].arch = archid;
    }
    SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
      return xs->pool->solvables[xs->id].arch;
    }
  %}
  const char *vendor;
  %{
    SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
      Pool *pool = xs->pool;
      pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
    }
    SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
      Pool *pool = xs->pool;
      return pool_id2str(pool, pool->solvables[xs->id].vendor);
    }
  %}
  Id vendorid;
  %{
    SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
      xs->pool->solvables[xs->id].vendor = vendorid;
    }
    SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
      return xs->pool->solvables[xs->id].vendor;
    }
  %}
  Repo * const repo;
  %{
    SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
      return xs->pool->solvables[xs->id].repo;
    }
  %}

  /* old interface, please use the generic add_deparray instead */
  void add_provides(DepId id, Id marker = -1) {
    Solvable *s = $self->pool->solvables + $self->id;
    marker = solv_depmarker(SOLVABLE_PROVIDES, marker);
    s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
  }
  void add_obsoletes(DepId id) {
    Solvable *s = $self->pool->solvables + $self->id;
    s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
  }
  void add_conflicts(DepId id) {
    Solvable *s = $self->pool->solvables + $self->id;
    s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
  }
  void add_requires(DepId id, Id marker = -1) {
    Solvable *s = $self->pool->solvables + $self->id;
    marker = solv_depmarker(SOLVABLE_REQUIRES, marker);
    s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
  }
  void add_recommends(DepId id) {
    Solvable *s = $self->pool->solvables + $self->id;
    s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
  }
  void add_suggests(DepId id) {
    Solvable *s = $self->pool->solvables + $self->id;
    s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
  }
  void add_supplements(DepId id) {
    Solvable *s = $self->pool->solvables + $self->id;
    s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
  }
  void add_enhances(DepId id) {
    Solvable *s = $self->pool->solvables + $self->id;
    s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
  }

  void unset(Id keyname) {
    Solvable *s = $self->pool->solvables + $self->id;
    repo_unset(s->repo, $self->id, keyname);
  }

  void add_deparray(Id keyname, DepId id, Id marker = -1) {
    Solvable *s = $self->pool->solvables + $self->id;
    solvable_add_deparray(s, keyname, id, marker);
  }

  %newobject Selection;
  Selection *Selection(int setflags=0) {
    Selection *sel = new_Selection($self->pool);
    queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
    return sel;
  }

#ifdef SWIGRUBY
  %rename("identical?") identical;
#endif
  bool identical(XSolvable *s2) {
    return solvable_identical($self->pool->solvables + $self->id, s2->pool->solvables + s2->id);
  }
  int evrcmp(XSolvable *s2) {
    return pool_evrcmp($self->pool, $self->pool->solvables[$self->id].evr, s2->pool->solvables[s2->id].evr, EVRCMP_COMPARE);
  }
#ifdef SWIGRUBY
  %rename("matchesdep?") matchesdep;
#endif
  bool matchesdep(Id keyname, DepId id, Id marker = -1) {
    return solvable_matchesdep($self->pool->solvables + $self->id, keyname, id, marker);
  }

  bool __eq__(XSolvable *s) {
    return $self->pool == s->pool && $self->id == s->id;
  }
  bool __ne__(XSolvable *s) {
    return !XSolvable___eq__($self, s);
  }
#if defined(SWIGPYTHON)
  int __hash__() {
    return $self->id;
  }
#endif
  const char *__str__() {
    return pool_solvid2str($self->pool, $self->id);
  }
  %newobject __repr__;
  const char *__repr__() {
    char buf[20];
    sprintf(buf, "<Solvable #%d ", $self->id);
    return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
  }
}

%extend Problem {
  Problem(Solver *solv, Id id) {
    Problem *p;
    p = solv_calloc(1, sizeof(*p));
    p->solv = solv;
    p->id = id;
    return p;
  }
  %newobject findproblemrule;
  XRule *findproblemrule() {
    Id r = solver_findproblemrule($self->solv, $self->id);
    return new_XRule($self->solv, r);
  }
  %newobject findallproblemrules;
  %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
  Queue findallproblemrules(int unfiltered=0) {
    Solver *solv = $self->solv;
    Id probr;
    int i, j;
    Queue q;
    queue_init(&q);
    solver_findallproblemrules(solv, $self->id, &q);
    if (!unfiltered)
      {
        for (i = j = 0; i < q.count; i++)
          {
            SolverRuleinfo rclass;
            probr = q.elements[i];
            rclass = solver_ruleclass(solv, probr);
            if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
              continue;
            q.elements[j++] = probr;
          }
        if (j)
          queue_truncate(&q, j);
      }
    return q;
  }
  int solution_count() {
    return solver_solution_count($self->solv, $self->id);
  }
  %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
  %newobject solutions;
  Queue solutions() {
    Queue q;
    int i, cnt;
    queue_init(&q);
    cnt = solver_solution_count($self->solv, $self->id);
    for (i = 1; i <= cnt; i++)
      queue_push(&q, i);
    return q;
  }
  %typemap(out) Queue get_learnt Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
  %newobject get_learnt;
  Queue get_learnt() {
    Queue q;
    queue_init(&q);
    solver_get_learnt($self->solv, $self->id, SOLVER_DECISIONLIST_PROBLEM, &q);
    return q;
  }
  %typemap(out) Queue get_decisionlist Queue2Array(Decision *, 3, new_Decision(arg1->solv, id, idp[1], idp[2]));
  %newobject get_decisionlist;
  Queue get_decisionlist() {
    Queue q;
    queue_init(&q);
    solver_get_decisionlist($self->solv, $self->id, SOLVER_DECISIONLIST_PROBLEM | SOLVER_DECISIONLIST_SORTED, &q);
    return q;
  }
  %typemap(out) Queue get_decisionsetlist Queue2Array(Decisionset *, 1, decisionset_fromids(arg1->solv, idp + id, idp[1] - id + 1));
  %newobject get_decisionsetlist;
  Queue get_decisionsetlist() {
    Queue q;
    queue_init(&q);
    solver_get_decisionlist($self->solv, $self->id, SOLVER_DECISIONLIST_PROBLEM | SOLVER_DECISIONLIST_SORTED | SOLVER_DECISIONLIST_WITHINFO | SOLVER_DECISIONLIST_MERGEDINFO, &q);
    prepare_decisionset_queue($self->solv, &q);
    return q;
  }
  const char *__str__() {
    return solver_problem2str($self->solv, $self->id);
  }
}

%extend Solution {
  Solution(Problem *p, Id id) {
    Solution *s;
    s = solv_calloc(1, sizeof(*s));
    s->solv = p->solv;
    s->problemid = p->id;
    s->id = id;
    return s;
  }
  int element_count() {
    return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
  }
  %typemap(out) Queue elements Queue2Array(Solutionelement *, 3, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2]));
  %newobject elements;
  Queue elements(bool expandreplaces=0) {
    Queue q;
    queue_init(&q);
    solver_all_solutionelements($self->solv, $self->problemid, $self->id, expandreplaces, &q);
    return q;
  }
}

%extend Solutionelement {
  Solutionelement(Solver *solv, Id problemid, Id solutionid, Id type, Id p, Id rp) {
    Solutionelement *e;
    e = solv_calloc(1, sizeof(*e));
    e->solv = solv;
    e->problemid = problemid;
    e->solutionid = solutionid;
    e->type = type;
    e->p = p;
    e->rp = rp;
    return e;
  }
  /* legacy */
  const char *str() {
    return solver_solutionelementtype2str($self->solv, $self->type, $self->p, $self->rp);
  }
  const char *__str__() {
    return solver_solutionelementtype2str($self->solv, $self->type, $self->p, $self->rp);
  }
  %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, id, arg1->p, arg1->rp));
  %newobject replaceelements;
  Queue replaceelements() {
    Queue q;
    int illegal;

    queue_init(&q);
    if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
      illegal = 0;
    else
      illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
    if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
      queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
    if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
      queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
    if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
      queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
    if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0)
      queue_push(&q, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
    if (!q.count)
      queue_push(&q, $self->type);
    return q;
  }
  int illegalreplace() {
    if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
      return 0;
    return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
  }
  %newobject solvable;
  XSolvable * const solvable;
  %newobject replacement;
  XSolvable * const replacement;
  int const jobidx;
  %{
    SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
      return new_XSolvable(e->solv->pool, e->p);
    }
    SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
      return new_XSolvable(e->solv->pool, e->rp);
    }
    SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
      if (e->type != SOLVER_SOLUTION_JOB && e->type != SOLVER_SOLUTION_POOLJOB)
        return -1;
      return (e->p - 1) / 2;
    }
  %}
  %newobject Job;
  Job *Job() {
    Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
    if ($self->type == SOLVER_SOLUTION_JOB || $self->type == SOLVER_SOLUTION_POOLJOB)
      return new_Job($self->solv->pool, SOLVER_NOOP, 0);
    if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
      return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_NOTBYUSER|extraflags, $self->p);
    if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
      return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_NOTBYUSER|extraflags, $self->rp);
    if ($self->type == SOLVER_SOLUTION_ERASE)
      return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
    return 0;
  }
}

%extend Solver {
  static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
  static const int SOLVER_RULE_PKG = SOLVER_RULE_PKG;
  static const int SOLVER_RULE_PKG_NOT_INSTALLABLE = SOLVER_RULE_PKG_NOT_INSTALLABLE;
  static const int SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP = SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP;
  static const int SOLVER_RULE_PKG_REQUIRES = SOLVER_RULE_PKG_REQUIRES;
  static const int SOLVER_RULE_PKG_SELF_CONFLICT = SOLVER_RULE_PKG_SELF_CONFLICT;
  static const int SOLVER_RULE_PKG_CONFLICTS = SOLVER_RULE_PKG_CONFLICTS;
  static const int SOLVER_RULE_PKG_SAME_NAME = SOLVER_RULE_PKG_SAME_NAME;
  static const int SOLVER_RULE_PKG_OBSOLETES = SOLVER_RULE_PKG_OBSOLETES;
  static const int SOLVER_RULE_PKG_IMPLICIT_OBSOLETES = SOLVER_RULE_PKG_IMPLICIT_OBSOLETES;
  static const int SOLVER_RULE_PKG_INSTALLED_OBSOLETES = SOLVER_RULE_PKG_INSTALLED_OBSOLETES;
  static const int SOLVER_RULE_PKG_RECOMMENDS = SOLVER_RULE_PKG_RECOMMENDS;
  static const int SOLVER_RULE_PKG_CONSTRAINS = SOLVER_RULE_PKG_CONSTRAINS;
  static const int SOLVER_RULE_PKG_SUPPLEMENTS = SOLVER_RULE_PKG_SUPPLEMENTS;
  static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
  static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
  static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
  static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
  static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
  static const int SOLVER_RULE_JOB_UNKNOWN_PACKAGE = SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
  static const int SOLVER_RULE_JOB_UNSUPPORTED = SOLVER_RULE_JOB_UNSUPPORTED;
  static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
  static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
  static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
  static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
  static const int SOLVER_RULE_BEST  = SOLVER_RULE_BEST;
  static const int SOLVER_RULE_YUMOBS = SOLVER_RULE_YUMOBS;
  static const int SOLVER_RULE_RECOMMENDS = SOLVER_RULE_RECOMMENDS;
  static const int SOLVER_RULE_BLACK = SOLVER_RULE_BLACK;
  static const int SOLVER_RULE_STRICT_REPO_PRIORITY = SOLVER_RULE_STRICT_REPO_PRIORITY;

  static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
  static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
  static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
  static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
  static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
  static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
  static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
  static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
  static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
  static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
  static const int SOLVER_SOLUTION_REPLACE_NAMECHANGE = SOLVER_SOLUTION_REPLACE_NAMECHANGE;

  static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
  static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
  static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
  static const int POLICY_ILLEGAL_NAMECHANGE = POLICY_ILLEGAL_NAMECHANGE;

  static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
  static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
  static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
  static const int SOLVER_FLAG_ALLOW_NAMECHANGE = SOLVER_FLAG_ALLOW_NAMECHANGE;
  static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
  static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
  static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
  static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
  static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
  static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
  static const int SOLVER_FLAG_BEST_OBEY_POLICY = SOLVER_FLAG_BEST_OBEY_POLICY;
  static const int SOLVER_FLAG_NO_AUTOTARGET = SOLVER_FLAG_NO_AUTOTARGET;
  static const int SOLVER_FLAG_DUP_ALLOW_DOWNGRADE = SOLVER_FLAG_DUP_ALLOW_DOWNGRADE;
  static const int SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE = SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE;
  static const int SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE = SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE;
  static const int SOLVER_FLAG_DUP_ALLOW_NAMECHANGE = SOLVER_FLAG_DUP_ALLOW_NAMECHANGE;
  static const int SOLVER_FLAG_KEEP_ORPHANS = SOLVER_FLAG_KEEP_ORPHANS;
  static const int SOLVER_FLAG_BREAK_ORPHANS = SOLVER_FLAG_BREAK_ORPHANS;
  static const int SOLVER_FLAG_FOCUS_INSTALLED = SOLVER_FLAG_FOCUS_INSTALLED;
  static const int SOLVER_FLAG_YUM_OBSOLETES = SOLVER_FLAG_YUM_OBSOLETES;
  static const int SOLVER_FLAG_NEED_UPDATEPROVIDE = SOLVER_FLAG_NEED_UPDATEPROVIDE;
  static const int SOLVER_FLAG_FOCUS_BEST = SOLVER_FLAG_FOCUS_BEST;
  static const int SOLVER_FLAG_STRONG_RECOMMENDS = SOLVER_FLAG_STRONG_RECOMMENDS;
  static const int SOLVER_FLAG_INSTALL_ALSO_UPDATES = SOLVER_FLAG_INSTALL_ALSO_UPDATES;
  static const int SOLVER_FLAG_ONLY_NAMESPACE_RECOMMENDED = SOLVER_FLAG_ONLY_NAMESPACE_RECOMMENDED;
  static const int SOLVER_FLAG_STRICT_REPO_PRIORITY = SOLVER_FLAG_STRICT_REPO_PRIORITY;
  static const int SOLVER_FLAG_FOCUS_NEW = SOLVER_FLAG_FOCUS_NEW;

  static const int SOLVER_REASON_UNRELATED = SOLVER_REASON_UNRELATED;
  static const int SOLVER_REASON_UNIT_RULE = SOLVER_REASON_UNIT_RULE;
  static const int SOLVER_REASON_KEEP_INSTALLED = SOLVER_REASON_KEEP_INSTALLED;
  static const int SOLVER_REASON_RESOLVE_JOB = SOLVER_REASON_RESOLVE_JOB;
  static const int SOLVER_REASON_UPDATE_INSTALLED = SOLVER_REASON_UPDATE_INSTALLED;
  static const int SOLVER_REASON_CLEANDEPS_ERASE = SOLVER_REASON_CLEANDEPS_ERASE;
  static const int SOLVER_REASON_RESOLVE = SOLVER_REASON_RESOLVE;
  static const int SOLVER_REASON_WEAKDEP = SOLVER_REASON_WEAKDEP;
  static const int SOLVER_REASON_RESOLVE_ORPHAN = SOLVER_REASON_RESOLVE_ORPHAN;
  static const int SOLVER_REASON_RECOMMENDED = SOLVER_REASON_RECOMMENDED;
  static const int SOLVER_REASON_SUPPLEMENTED = SOLVER_REASON_SUPPLEMENTED;
  static const int SOLVER_REASON_UNSOLVABLE = SOLVER_REASON_UNSOLVABLE;
  static const int SOLVER_REASON_PREMISE = SOLVER_REASON_PREMISE;

  /* legacy */
  static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;

  ~Solver() {
    solver_free($self);
  }

  int set_flag(int flag, int value) {
    return solver_set_flag($self, flag, value);
  }
  int get_flag(int flag) {
    return solver_get_flag($self, flag);
  }

  %typemap(out) Queue solve Queue2Array(Problem *, 1, new_Problem(arg1, id));
  %newobject solve;
  Queue solve(Queue solvejobs) {
    Queue q;
    int i, cnt;
    queue_init(&q);
    solver_solve($self, &solvejobs);
    cnt = solver_problem_count($self);
    for (i = 1; i <= cnt; i++)
      queue_push(&q, i);
    return q;
  }

  %newobject transaction;
  Transaction *transaction() {
    return solver_create_transaction($self);
  }

  /* legacy, use get_decision */
  int describe_decision(XSolvable *s, XRule **OUTPUT) {
    Id ruleid;
    int reason = solver_describe_decision($self, s->id, &ruleid);
    *OUTPUT = new_XRule($self, ruleid);
    return reason;
  }
  /* legacy, use get_decision and the info/allinfos method */
  %newobject describe_weakdep_decision_raw;
  Queue describe_weakdep_decision_raw(XSolvable *s) {
    Queue q;
    queue_init(&q);
    solver_describe_weakdep_decision($self, s->id, &q);
    return q;
  }
#if defined(SWIGPYTHON)
  %pythoncode {
    def describe_weakdep_decision(self, s):
      d = iter(self.describe_weakdep_decision_raw(s))
      return [ (t, XSolvable(self.pool, sid), Dep(self.pool, id)) for t, sid, id in zip(d, d, d) ]
  }
#endif
#if defined(SWIGPERL)
  %perlcode {
    sub solv::Solver::describe_weakdep_decision {
      my ($self, $s) = @_;
      my $pool = $self->{'pool'};
      my @res;
      my @d = $self->describe_weakdep_decision_raw($s);
      push @res, [ splice(@d, 0, 3) ] while @d;
      return map { [ $_->[0], solv::XSolvable->new($pool, $_->[1]), solv::Dep->new($pool, $_->[2]) ] } @res;
    }
  }
#endif
#if defined(SWIGRUBY)
%init %{
rb_eval_string(
    "class Solv::Solver\n"
    "  def describe_weakdep_decision(s)\n"
    "    self.describe_weakdep_decision_raw(s).each_slice(3).map { |t, sid, id| [ t, Solv::XSolvable.new(self.pool, sid), Solv::Dep.new(self.pool, id)] }\n"
    "  end\n"
    "end\n"
  );
%}
#endif

  int alternatives_count() {
    return solver_alternatives_count($self);
  }

  %newobject get_alternative;
  Alternative *get_alternative(Id aid) {
    Alternative *a = solv_calloc(1, sizeof(*a));
    a->solv = $self;
    queue_init(&a->choices);
    a->type = solver_get_alternative($self, aid, &a->dep_id, &a->from_id, &a->chosen_id, &a->choices, &a->level);
    if (!a->type) {
      queue_free(&a->choices);
      solv_free(a);
      return 0;
    }
    if (a->type == SOLVER_ALTERNATIVE_TYPE_RULE) {
      a->rid = a->dep_id;
      a->dep_id = 0;
    }
    return a;
  }

  %typemap(out) Queue alternatives Queue2Array(Alternative *, 1, Solver_get_alternative(arg1, id));
  %newobject alternatives;
  Queue alternatives() {
    Queue q;
    int i, cnt;
    queue_init(&q);
    cnt = solver_alternatives_count($self);
    for (i = 1; i <= cnt; i++)
      queue_push(&q, i);
    return q;
  }

  bool write_testcase(const char *dir) {
    return testcase_write($self, dir, TESTCASE_RESULT_TRANSACTION | TESTCASE_RESULT_PROBLEMS, 0, 0);
  }

  Queue raw_decisions(int filter=0) {
    Queue q;
    queue_init(&q);
    solver_get_decisionqueue($self, &q);
    if (filter) {
      int i, j;
      for (i = j = 0; i < q.count; i++)
        if ((filter > 0 && q.elements[i] > 1) ||
            (filter < 0 && q.elements[i] < 0))
          q.elements[j++] = q.elements[i];
      queue_truncate(&q, j);
    }
    return q;
  }

  %typemap(out) Queue all_decisions Queue2Array(Decision *, 3, new_Decision(arg1, id, idp[1], idp[2]));
  %newobject all_decisions;
  Queue all_decisions(int filter=0) {
    int i, j, cnt;
    Queue q;
    queue_init(&q);
    solver_get_decisionqueue($self, &q);
    if (filter) {
      for (i = j = 0; i < q.count; i++)
        if ((filter > 0 && q.elements[i] > 1) ||
            (filter < 0 && q.elements[i] < 0))
          q.elements[j++] = q.elements[i];
      queue_truncate(&q, j);
    }
    cnt = q.count;
    for (i = 0; i < cnt; i++) {
      Id ruleid, p = q.elements[i];
      int reason;
      if (p == 0 || p == 1)
        continue;       /* ignore system solvable */
      reason = solver_describe_decision($self, p > 0 ? p : -p, &ruleid);
      queue_push(&q, p);
      queue_push2(&q, reason, ruleid);
    }
    queue_deleten(&q, 0, cnt);
    return q;
  }

  %newobject get_decision;
  Decision *get_decision(XSolvable *s) {
    Id info;
    int lvl = solver_get_decisionlevel($self, s->id);
    Id p = lvl > 0 ? s->id : -s->id;
    int reason = solver_describe_decision($self, p, &info);
    return new_Decision($self, p, reason, info);
  }

  %typemap(out) Queue get_learnt Queue2Array(XRule *, 1, new_XRule(arg1, id));
  %newobject get_learnt;
  Queue get_learnt(XSolvable *s) {
    Queue q;
    queue_init(&q);
    solver_get_learnt($self, s->id, SOLVER_DECISIONLIST_SOLVABLE, &q);
    return q;
  }
  %typemap(out) Queue get_decisionlist Queue2Array(Decision *, 3, new_Decision(arg1, id, idp[1], idp[2]));
  %newobject get_decisionlist;
  Queue get_decisionlist(XSolvable *s) {
    Queue q;
    queue_init(&q);
    solver_get_decisionlist($self, s->id, SOLVER_DECISIONLIST_SOLVABLE, &q);
    return q;
  }

  %typemap(out) Queue get_recommended Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
  %newobject get_recommended;
  Queue get_recommended(bool noselected=0) {
    Queue q;
    queue_init(&q);
    solver_get_recommendations($self, &q, NULL, noselected);
    return q;
  }
  %typemap(out) Queue get_suggested Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
  %newobject get_suggested;
  Queue get_suggested(bool noselected=0) {
    Queue q;
    queue_init(&q);
    solver_get_recommendations($self, NULL, &q, noselected);
    return q;
  }
}

%extend Transaction {
  static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
  static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
  static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
  static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
  static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
  static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
  static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
  static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
  static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
  static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
  static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
  static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
  static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
  static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
  static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
  static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
  static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
  static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
  static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
  static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
  static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
  static const int SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE = SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
  static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
  static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
  static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
  static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
  static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
  static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
  ~Transaction() {
    transaction_free($self);
  }
#ifdef SWIGRUBY
  %rename("isempty?") isempty;
#endif
  bool isempty() {
    return $self->steps.count == 0;
  }

  %newobject othersolvable;
  XSolvable *othersolvable(XSolvable *s) {
    Id op = transaction_obs_pkg($self, s->id);
    return new_XSolvable($self->pool, op);
  }

  %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
  %newobject allothersolvables;
  Queue allothersolvables(XSolvable *s) {
    Queue q;
    queue_init(&q);
    transaction_all_obs_pkgs($self, s->id, &q);
    return q;
  }

  %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
  %newobject classify;
  Queue classify(int mode = 0) {
    Queue q;
    queue_init(&q);
    transaction_classify($self, mode, &q);
    return q;
  }

  /* deprecated, use newsolvables instead */
  %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
  %newobject newpackages;
  Queue newpackages() {
    Queue q;
    int cut;
    queue_init(&q);
    cut = transaction_installedresult(self, &q);
    queue_truncate(&q, cut);
    return q;
  }

  /* deprecated, use keptsolvables instead */
  %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
  %newobject keptpackages;
  Queue keptpackages() {
    Queue q;
    int cut;
    queue_init(&q);
    cut = transaction_installedresult(self, &q);
    if (cut)
      queue_deleten(&q, 0, cut);
    return q;
  }

  %typemap(out) Queue newsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
  %newobject newsolvables;
  Queue newsolvables() {
    Queue q;
    int cut;
    queue_init(&q);
    cut = transaction_installedresult(self, &q);
    queue_truncate(&q, cut);
    return q;
  }

  %typemap(out) Queue keptsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
  %newobject keptsolvables;
  Queue keptsolvables() {
    Queue q;
    int cut;
    queue_init(&q);
    cut = transaction_installedresult(self, &q);
    if (cut)
      queue_deleten(&q, 0, cut);
    return q;
  }

  %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
  %newobject steps;
  Queue steps() {
    Queue q;
    queue_init_clone(&q, &$self->steps);
    return q;
  }

  int steptype(XSolvable *s, int mode) {
    return transaction_type($self, s->id, mode);
  }
  long long calc_installsizechange() {
    return transaction_calc_installsizechange($self);
  }
  void order(int flags=0) {
    transaction_order($self, flags);
  }
}

%extend TransactionClass {
  TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
    TransactionClass *cl = solv_calloc(1, sizeof(*cl));
    cl->transaction = trans;
    cl->mode = mode;
    cl->type = type;
    cl->count = count;
    cl->fromid = fromid;
    cl->toid = toid;
    return cl;
  }
  %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
  %newobject solvables;
  Queue solvables() {
    Queue q;
    queue_init(&q);
    transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
    return q;
  }
  const char * const fromstr;
  const char * const tostr;
  %{
    SWIGINTERN const char *TransactionClass_fromstr_get(TransactionClass *cl) {
      return pool_id2str(cl->transaction->pool, cl->fromid);
    }
    SWIGINTERN const char *TransactionClass_tostr_get(TransactionClass *cl) {
      return pool_id2str(cl->transaction->pool, cl->toid);
    }
  %}
}

%extend XRule {
  XRule(Solver *solv, Id id) {
    if (!id)
      return 0;
    XRule *xr = solv_calloc(1, sizeof(*xr));
    xr->solv = solv;
    xr->id = id;
    return xr;
  }
  int const type;
  %{
    SWIGINTERN int XRule_type_get(XRule *xr) {
      return solver_ruleclass(xr->solv, xr->id);
    }
  %}
  %newobject info;
  Ruleinfo *info() {
    Id type, source, target, dep;
    type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
    return new_Ruleinfo($self->solv, $self->id, type, source, target, dep);
  }
  %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1->solv, arg1->id, id, idp[1], idp[2], idp[3]));
  %newobject allinfos;
  Queue allinfos() {
    Queue q;
    queue_init(&q);
    solver_allruleinfos($self->solv, $self->id, &q);
    return q;
  }

  %typemap(out) Queue get_learnt Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
  %newobject get_learnt;
  Queue get_learnt() {
    Queue q;
    queue_init(&q);
    solver_get_learnt($self->solv, $self->id, SOLVER_DECISIONLIST_LEARNTRULE, &q);
    return q;
  }
  %typemap(out) Queue get_decisionlist Queue2Array(Decision *, 3, new_Decision(arg1->solv, id, idp[1], idp[2]));
  %newobject get_decisionlist;
  Queue get_decisionlist() {
    Queue q;
    queue_init(&q);
    solver_get_decisionlist($self->solv, $self->id, SOLVER_DECISIONLIST_LEARNTRULE | SOLVER_DECISIONLIST_SORTED, &q);
    return q;
  }
  %typemap(out) Queue get_decisionsetlist Queue2Array(Decisionset *, 1, decisionset_fromids(arg1->solv, idp + id, idp[1] - id + 1));
  %newobject get_decisionsetlist;
  Queue get_decisionsetlist() {
    Queue q;
    queue_init(&q);
    solver_get_decisionlist($self->solv, $self->id, SOLVER_DECISIONLIST_LEARNTRULE | SOLVER_DECISIONLIST_SORTED | SOLVER_DECISIONLIST_WITHINFO | SOLVER_DECISIONLIST_MERGEDINFO, &q);
    prepare_decisionset_queue($self->solv, &q);
    return q;
  }

  bool __eq__(XRule *xr) {
    return $self->solv == xr->solv && $self->id == xr->id;
  }
  bool __ne__(XRule *xr) {
    return !XRule___eq__($self, xr);
  }
#if defined(SWIGPYTHON)
  int __hash__() {
    return $self->id;
  }
#endif
  %newobject __repr__;
  const char *__repr__() {
    char buf[20];
    sprintf(buf, "<Rule #%d>", $self->id);
    return solv_strdup(buf);
  }
}

%extend Ruleinfo {
  Ruleinfo(Solver *solv, Id rid, Id type, Id source, Id target, Id dep_id) {
    Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
    ri->solv = solv;
    ri->rid = rid;
    ri->type = type;
    ri->source = source;
    ri->target = target;
    ri->dep_id = dep_id;
    return ri;
  }
  %newobject solvable;
  XSolvable * const solvable;
  %newobject othersolvable;
  XSolvable * const othersolvable;
  %newobject dep;
  Dep * const dep;
  %{
    SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
      return new_XSolvable(ri->solv->pool, ri->source);
    }
    SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
      return new_XSolvable(ri->solv->pool, ri->target);
    }
    SWIGINTERN Dep *Ruleinfo_dep_get(Ruleinfo *ri) {
      return new_Dep(ri->solv->pool, ri->dep_id);
    }
  %}
  const char *problemstr() {
    return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
  }
  const char *__str__() {
    return solver_ruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
  }
}

%extend XRepodata {
  XRepodata(Repo *repo, Id id) {
    XRepodata *xr = solv_calloc(1, sizeof(*xr));
    xr->repo = repo;
    xr->id = id;
    return xr;
  }
  Id new_handle() {
    return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
  }
  void set_id(Id solvid, Id keyname, DepId id) {
    repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
  }
  void set_num(Id solvid, Id keyname, unsigned long long num) {
    repodata_set_num(repo_id2repodata($self->repo, $self->id), solvid, keyname, num);
  }
  void set_str(Id solvid, Id keyname, const char *str) {
    repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
  }
  void set_void(Id solvid, Id keyname) {
    repodata_set_void(repo_id2repodata($self->repo, $self->id), solvid, keyname);
  }
  void set_poolstr(Id solvid, Id keyname, const char *str) {
    repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
  }
  void add_idarray(Id solvid, Id keyname, DepId id) {
    repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
  }
  void add_flexarray(Id solvid, Id keyname, Id handle) {
    repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
  }
  void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
    const unsigned char *buf = solv_chksum_get(chksum, 0);
    if (buf)
      repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
  }
  void set_sourcepkg(Id solvid, const char *sourcepkg) {
    repodata_set_sourcepkg(repo_id2repodata($self->repo, $self->id), solvid, sourcepkg);
  }
  void set_location(Id solvid, unsigned int mediano, const char *location) {
    repodata_set_location(repo_id2repodata($self->repo, $self->id), solvid, mediano, 0, location);
  }
  void unset(Id solvid, Id keyname) {
    repodata_unset(repo_id2repodata($self->repo, $self->id), solvid, keyname);
  }
  const char *lookup_str(Id solvid, Id keyname) {
    return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
  }
  Id lookup_id(Id solvid, Id keyname) {
    return repodata_lookup_id(repo_id2repodata($self->repo, $self->id), solvid, keyname);
  }
  unsigned long long lookup_num(Id solvid, Id keyname, unsigned long long notfound = 0) {
    return repodata_lookup_num(repo_id2repodata($self->repo, $self->id), solvid, keyname, notfound);
  }
  bool lookup_void(Id solvid, Id keyname) {
    return repodata_lookup_void(repo_id2repodata($self->repo, $self->id), solvid, keyname);
  }
  Queue lookup_idarray(Id solvid, Id keyname) {
    Queue r;
    queue_init(&r);
    repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
    return r;
  }
  %newobject lookup_checksum;
  Chksum *lookup_checksum(Id solvid, Id keyname) {
    Id type = 0;
    const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
    return solv_chksum_create_from_bin(type, b);
  }
  void internalize() {
    repodata_internalize(repo_id2repodata($self->repo, $self->id));
  }
  void create_stubs() {
    Repodata *data = repo_id2repodata($self->repo, $self->id);
    data = repodata_create_stubs(data);
    $self->id = data->repodataid;
  }
  bool write(FILE *fp) {
    return repodata_write(repo_id2repodata($self->repo, $self->id), fp) == 0;
  }
  Id str2dir(const char *dir, bool create=1) {
    Repodata *data = repo_id2repodata($self->repo, $self->id);
    return repodata_str2dir(data, dir, create);
  }
  const char *dir2str(Id did, const char *suf = 0) {
    Repodata *data = repo_id2repodata($self->repo, $self->id);
    return repodata_dir2str(data, did, suf);
  }
  void add_dirstr(Id solvid, Id keyname, Id dir, const char *str) {
    Repodata *data = repo_id2repodata($self->repo, $self->id);
    repodata_add_dirstr(data, solvid, keyname, dir, str);
  }
  bool add_solv(FILE *fp, int flags = 0) {
    Repodata *data = repo_id2repodata($self->repo, $self->id);
    int r, oldstate = data->state;
    data->state = REPODATA_LOADING;
    r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
    if (r || data->state == REPODATA_LOADING)
      data->state = oldstate;
    return r == 0;
  }
  void extend_to_repo() {
    Repodata *data = repo_id2repodata($self->repo, $self->id);
    repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
  }
  bool __eq__(XRepodata *xr) {
    return $self->repo == xr->repo && $self->id == xr->id;
  }
  bool __ne__(XRepodata *xr) {
    return !XRepodata___eq__($self, xr);
  }
#if defined(SWIGPYTHON)
  int __hash__() {
    return $self->id;
  }
#endif
  %newobject __repr__;
  const char *__repr__() {
    char buf[20];
    sprintf(buf, "<Repodata #%d>", $self->id);
    return solv_strdup(buf);
  }
}

#ifdef ENABLE_PUBKEY
%extend Solvsig {
  Solvsig(FILE *fp) {
    return solvsig_create(fp);
  }
  ~Solvsig() {
    solvsig_free($self);
  }
  %newobject Chksum;
  Chksum *Chksum() {
    return $self->htype ? (Chksum *)solv_chksum_create($self->htype) : 0;
  }
#ifdef ENABLE_PGPVRFY
  %newobject verify;
  XSolvable *verify(Repo *repo, Chksum *chksum) {
    Id p = solvsig_verify($self, repo, chksum);
    return new_XSolvable(repo->pool, p);
  }
#endif
}
#endif

%extend Alternative {
  static const int SOLVER_ALTERNATIVE_TYPE_RULE = SOLVER_ALTERNATIVE_TYPE_RULE;
  static const int SOLVER_ALTERNATIVE_TYPE_RECOMMENDS = SOLVER_ALTERNATIVE_TYPE_RECOMMENDS;
  static const int SOLVER_ALTERNATIVE_TYPE_SUGGESTS = SOLVER_ALTERNATIVE_TYPE_SUGGESTS;

  ~Alternative() {
    queue_free(&$self->choices);
    solv_free($self);
  }
  %newobject chosen;
  XSolvable * const chosen;
  %newobject rule;
  XRule * const rule;
  %newobject depsolvable;
  XSolvable * const depsolvable;
  %newobject dep;
  Dep * const dep;
  %{
    SWIGINTERN XSolvable *Alternative_chosen_get(Alternative *a) {
      return new_XSolvable(a->solv->pool, a->chosen_id);
    }
    SWIGINTERN XRule *Alternative_rule_get(Alternative *a) {
      return new_XRule(a->solv, a->rid);
    }
    SWIGINTERN XSolvable *Alternative_depsolvable_get(Alternative *a) {
      return new_XSolvable(a->solv->pool, a->from_id);
    }
    SWIGINTERN Dep *Alternative_dep_get(Alternative *a) {
      return new_Dep(a->solv->pool, a->dep_id);
    }
  %}
  Queue choices_raw() {
    Queue q;
    queue_init_clone(&q, &$self->choices);
    return q;
  }
  %typemap(out) Queue choices Queue2Array(XSolvable *, 1, new_XSolvable(arg1->solv->pool, id));
  Queue choices() {
    int i;
    Queue q;
    queue_init_clone(&q, &$self->choices);
    for (i = 0; i < q.count; i++)
      if (q.elements[i] < 0)
        q.elements[i] = -q.elements[i];
    return q;
  }
  const char *__str__() {
    return solver_alternative2str($self->solv, $self->type, $self->type == SOLVER_ALTERNATIVE_TYPE_RULE ? $self->rid : $self->dep_id, $self->from_id);
  }
}

%extend Decision {
  Decision(Solver *solv, Id p, int reason, Id infoid) {
    Decision *d = solv_calloc(1, sizeof(*d));
    d->solv = solv;
    d->p = p;
    d->reason = reason;
    d->infoid = infoid;
    return d;
  }
  %newobject rule;
  XRule * const rule;
  %newobject solvable;
  XSolvable * const solvable;
  %{
    SWIGINTERN XRule *Decision_rule_get(Decision *d) {
      return d->reason == SOLVER_REASON_WEAKDEP || d->infoid <= 0 ? 0 : new_XRule(d->solv, d->infoid);
    }
    SWIGINTERN XSolvable *Decision_solvable_get(Decision *d) {
      return new_XSolvable(d->solv->pool, d->p >= 0 ? d->p : -d->p);
    }
  %}
  %newobject info;
  Ruleinfo *info() {
    Id type, source, target, dep;
    if ($self->reason == SOLVER_REASON_WEAKDEP) {
      type = solver_weakdepinfo($self->solv, $self->p, &source, &target, &dep);
    } else if ($self->infoid) {
      type = solver_ruleinfo($self->solv, $self->infoid, &source, &target, &dep);
    } else {
      return 0;
    }
    return new_Ruleinfo($self->solv, $self->infoid, type, source, target, dep);
  }
  %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1->solv, arg1->infoid, id, idp[1], idp[2], idp[3]));
  %newobject allinfos;
  Queue allinfos() {
    Queue q;
    queue_init(&q);
    if ($self->reason == SOLVER_REASON_WEAKDEP) {
      solver_allweakdepinfos($self->solv, $self->p, &q);
    } else if ($self->infoid) {
      solver_allruleinfos($self->solv, $self->infoid, &q);
    }
    return q;
  }
  const char *reasonstr(bool noinfo=0) {
    if (noinfo)
      return solver_reason2str($self->solv, $self->reason);
    return solver_decisionreason2str($self->solv, $self->p, $self->reason, $self->infoid);
  }
  const char *__str__() {
    Pool *pool = $self->solv->pool;
    if ($self->p == 0 && $self->reason == SOLVER_REASON_UNSOLVABLE)
      return "unsolvable";
    if ($self->p >= 0)
      return pool_tmpjoin(pool, "install ", pool_solvid2str(pool, $self->p), 0);
    else
      return pool_tmpjoin(pool, "conflict ", pool_solvid2str(pool, -$self->p), 0);
  }
}

%extend Decisionset {
  Decisionset(Solver *solv) {
    Decisionset *d = solv_calloc(1, sizeof(*d));
    d->solv = solv;
    queue_init(&d->decisionlistq);
    return d;
  }
  ~Decisionset() {
    queue_free(&$self->decisionlistq);
    solv_free($self);
  }
  %newobject info;
  Ruleinfo *info() {
    return new_Ruleinfo($self->solv, $self->infoid, $self->type, $self->source, $self->target, $self->dep_id);
  }
  %newobject dep;
  Dep * const dep;
  %{
    SWIGINTERN Dep *Decisionset_dep_get(Decisionset *d) {
      return new_Dep(d->solv->pool, d->dep_id);
    }
  %}
  %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->solv->pool, id));
  %newobject solvables;
  Queue solvables() {
    Queue q;
    int i;
    queue_init(&q);
    for (i = 0; i < $self->decisionlistq.count; i += 3)
      if ($self->decisionlistq.elements[i] != 0)
        queue_push(&q, $self->decisionlistq.elements[i] > 0 ? $self->decisionlistq.elements[i] : -$self->decisionlistq.elements[i]);
    return q;
  }
  %typemap(out) Queue decisions Queue2Array(Decision *, 3, new_Decision(arg1->solv, id, idp[1], idp[2]));
  %newobject decisions;
  Queue decisions() {
    Queue q;
    queue_init_clone(&q, &$self->decisionlistq);
    return q;
  }
  const char *reasonstr(bool noinfo=0) {
    if (noinfo || !$self->type)
      return solver_reason2str($self->solv, $self->reason);
    return solver_decisioninfo2str($self->solv, $self->bits, $self->type, $self->source, $self->target, $self->dep_id);
  }
  const char *__str__() {
    Pool *pool = $self->solv->pool;
    Queue q;
    int i;
    const char *s;
    if (!$self->decisionlistq.elements)
      return "";
    if ($self->p == 0 && $self->reason == SOLVER_REASON_UNSOLVABLE)
      return "unsolvable";
    queue_init(&q);
    for (i = 0; i < $self->decisionlistq.count; i += 3)
      if ($self->decisionlistq.elements[i] != 0)
        queue_push(&q, $self->decisionlistq.elements[i] > 0 ? $self->decisionlistq.elements[i] : -$self->decisionlistq.elements[i]);
    s = pool_solvidset2str(pool, &q);
    queue_free(&q);
    return pool_tmpjoin(pool, $self->p >= 0 ? "install " : "conflict ", s, 0);
  }
}


#if defined(SWIGTCL)
%init %{
  Tcl_Eval(interp,
"proc solv::iter {varname iter body} {\n"\
"  while 1 {\n"\
"    set value [$iter __next__]\n"\
"    if {$value eq \"NULL\"} { break }\n"\
"    uplevel [list set $varname $value]\n"\
"    set code [catch {uplevel $body} result]\n"\
"    switch -exact -- $code {\n"\
"      0 {}\n"\
"      3 { return }\n"\
"      4 {}\n"\
"      default { return -code $code $result }\n"\
"    }\n"\
"  }\n"\
"}\n"
  );
%}
#endif