{
Assert(n.getType().isBag());
d_bags.insert(n);
- if (n.getKind() == TABLE_GROUP)
- {
- std::shared_ptr<context::CDHashSet<Node>> set =
- std::make_shared<context::CDHashSet<Node>>(d_env.getUserContext());
- d_partElementSkolems[n] = set;
- }
}
void SolverState::registerCountTerm(Node bag, Node element, Node skolem)
}
}
+void SolverState::registerGroupTerm(Node n)
+{
+ std::shared_ptr<context::CDHashSet<Node>> set =
+ std::make_shared<context::CDHashSet<Node>>(d_env.getUserContext());
+ d_partElementSkolems[n] = set;
+}
+
void SolverState::registerCardinalityTerm(Node n, Node skolem)
{
Assert(n.getKind() == BAG_CARD);
*/
void registerCountTerm(Node bag, Node element, Node skolem);
+ /** register a table.group term */
+ void registerGroupTerm(Node n);
+
/**
* store cardinality term and its skolem in a cahce
* @param n has the form (bag.card A) where A is a representative
regress1/bags/intersection_min1.smt2
regress1/bags/intersection_min2.smt2
regress1/bags/issue5759.smt2
+ regress1/bags/issue_8959.smt2
regress1/bags/map1.smt2
regress1/bags/map2.smt2
regress1/bags/map3.smt2