typedef struct rpmpsi_s * rpmpsi;
/** \ingroup rpmps
- * Unreference a problem set instance.
- * @param ps problem set
- * @return problem set
- */
-rpmps rpmpsUnlink (rpmps ps);
-
-/** \ingroup rpmps
* Reference a problem set instance.
* @param ps transaction set
* @return new transaction set reference
void rpmpsAppendProblem(rpmps ps, rpmProblem prob);
/** \ingroup rpmps
- * Append a problem to current set of problems.
- * @param ps problem set
- * @param type type of problem
- * @param pkgNEVR package name
- * @param key filename or python object address
- * @param dn directory name
- * @param bn file base name
- * @param altNEVR related (e.g. through a dependency) package name
- * @param number generic number attribute
- */
-void rpmpsAppend(rpmps ps, rpmProblemType type,
- const char * pkgNEVR,
- fnpyKey key,
- const char * dn, const char * bn,
- const char * altNEVR,
- uint64_t number);
-
-/** \ingroup rpmps
- * Filter a problem set.
- *
- * As the problem sets are generated in an order solely dependent
- * on the ordering of the packages in the transaction, and that
- * ordering can't be changed, the problem sets must be parallel to
- * one another. Additionally, the filter set must be a subset of the
- * target set, given the operations available on transaction set.
- * This is good, as it lets us perform this trim in linear time, rather
- * then logarithmic or quadratic.
- *
- * @param ps problem set
- * @param filter problem filter (or NULL)
- * @return 0 no problems, 1 if problems remain
+ * Merge problem set into another.
+ * @param dest destination problem set
+ * @param src source problem set
+ * @return number of problems merged
*/
-int rpmpsTrim(rpmps ps, rpmps filter);
+int rpmpsMerge(rpmps dest, rpmps src);
#ifdef __cplusplus
}