#if defined(SWIGRUBY)
%rename("to_s") *::__str__;
#endif
-
+#if defined(SWIGPERL) || defined(SWIGTCL)
+%rename("str") __str__;
+#endif
%typemap(in,numinputs=0,noblock=1) XRule **OUTPUT ($*1_ltype temp) {
$1 = &temp;
bool __ne__(Job *j) {
return !Job___eq__($self, j);
}
-#if defined(SWIGPERL) || defined(SWIGTCL)
- %rename("str") __str__;
-#endif
const char *__str__() {
return pool_job2str($self->pool, $self->how, $self->what, 0);
}
return q;
}
-#if defined(SWIGPERL) || defined(SWIGTCL)
- %rename("str") __str__;
-#endif
const char *__str__() {
return pool_selection2str($self->pool, &$self->q, 0);
}
bool __ne__(Chksum *chk) {
return !solv_chksum_cmp($self, chk);
}
-#if defined(SWIGPERL) || defined(SWIGTCL)
- %rename("str") __str__;
-#endif
%newobject __str__;
const char *__str__() {
const char *str;
int __hash__() {
return $self->repoid;
}
-#endif
-#if defined(SWIGPERL) || defined(SWIGTCL)
- %rename("str") __str__;
#endif
%newobject __str__;
const char *__str__() {
int __hash__() {
return $self->id;
}
-#endif
-#if defined(SWIGPERL) || defined(SWIGTCL)
- %rename("str") __str__;
#endif
const char *__str__() {
return pool_dep2str($self->pool, $self->id);
int __hash__() {
return $self->id;
}
-#endif
-#if defined(SWIGPERL) || defined(SWIGTCL)
- %rename("str") __str__;
#endif
const char *__str__() {
return pool_solvid2str($self->pool, $self->id);
prepare_decisionset_queue($self->solv, &q);
return q;
}
-#if defined(SWIGPERL) || defined(SWIGTCL)
- %rename("str") __str__;
-#endif
const char *__str__() {
return solver_problem2str($self->solv, $self->id);
}
const char *problemstr() {
return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
}
-#if defined(SWIGPERL) || defined(SWIGTCL)
- %rename("str") __str__;
-#endif
const char *__str__() {
return solver_ruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
}
q.elements[i] = -q.elements[i];
return q;
}
-#if defined(SWIGPERL) || defined(SWIGTCL)
- %rename("str") __str__;
-#endif
const char *__str__() {
return solver_alternative2str($self->solv, $self->type, $self->type == SOLVER_ALTERNATIVE_TYPE_RULE ? $self->rid : $self->dep_id, $self->from_id);
}
return solver_reason2str($self->solv, $self->reason);
return solver_decisionreason2str($self->solv, $self->p, $self->reason, $self->infoid);
}
-#if defined(SWIGPERL) || defined(SWIGTCL)
- %rename("str") __str__;
-#endif
const char *__str__() {
Pool *pool = $self->solv->pool;
if ($self->p == 0 && $self->reason == SOLVER_REASON_UNSOLVABLE)
return solver_reason2str($self->solv, $self->reason);
return solver_decisioninfo2str($self->solv, $self->bits, $self->type, $self->source, $self->target, $self->dep_id);
}
-#if defined(SWIGPERL) || defined(SWIGTCL)
- %rename("str") __str__;
-#endif
const char *__str__() {
Pool *pool = $self->solv->pool;
Queue q;