IdentList *
subst(IdentList *i1, IdentList *i2, IdentList *i3, Ident except)
{ // map i1 using i2->i3 (but leave 'except' unchanged)
invariant(i1 && i2 && i3 && i2->size() == i3->size());
IdentList *res = new IdentList;
for (IdentList::iterator j1 = i1->begin(); j1 != i1->end(); j1++)
if (*j1 == except)
res->push_back(*j1);
else
res->push_back(subst(*j1, i2, i3));
return res;
}
IdentList*
intersection(IdentList *i1, IdentList *i2)
// make sorted intersection of sorted identlists
{
if (!i1 || !i2)
return NULL;
IdentList *r = new IdentList;
Ident *id1 = i1->begin();
Ident *id2 = i2->begin();
while (id1 != i1->end() && id2 != i2->end()) {
if (*id1 < *id2)
id1++;
else if (*id1 > *id2)
id2++;
else {
r->push_back(*id1);
id1++;
id2++;
}
}
if (r->empty()) {
delete r;
r = NULL;
}
return r;
}
IdentList*
ident_union(IdentList *i1, IdentList *i2)
// merge sorted identlists into union
{
if ((!i1 || i1->empty()) && (!i2 || i2->empty()))
return NULL;
if (!i1)
return new IdentList(*i2);
if (!i2)
return new IdentList(*i1);
IdentList *r = new IdentList;
Ident *id1 = i1->begin();
Ident *id2 = i2->begin();
while (id1 != i1->end() && id2 != i2->end()) {
if (*id1 < *id2) {
r->push_back(*id1);
id1++;
}
else if (*id1 > *id2) {
r->push_back(*id2);
id2++;
}
else {
r->push_back(*id1);
id1++;
id2++;
}
}
while (id1 != i1->end()) {
r->push_back(*id1);
id1++;
}
while (id2 != i2->end()) {
r->push_back(*id2);
id2++;
}
return r;
}
