+// Copyright 2006 all rights reserved; see LICENSE file for BSD-style license
+
package edu.berkeley.sbp.meta;
import edu.berkeley.sbp.util.*;
import edu.berkeley.sbp.*;
}
if (sequences.length==1) break;
Sequence seq = Sequence.create(u2);
- for(Sequence s : bad2) seq = seq.not(s);
+ for(Sequence s : bad2) seq = seq.andnot(s);
u.add(seq);
bad2.add(Sequence.create(u2));
}
}
if (sequences.length==1) break;
Sequence seq = Sequence.create(u2);
- for(Sequence s : bad2) seq = seq.not(s);
+ for(Sequence s : bad2) seq = seq.andnot(s);
u.add(seq);
bad2.add(Sequence.create(u2));
}
public Sequence build(Context cx, Union u, NonTerminalNode cnt) {
Sequence ret = build0(cx, cnt);
for(Seq s : and) { Sequence dork = s.build(cx, u, cnt); ret = ret.and(dork); }
- for(Seq s : not) { Sequence dork = s.build(cx, u, cnt); ret = ret.not(dork); }
+ for(Seq s : not) { Sequence dork = s.build(cx, u, cnt); ret = ret.andnot(dork); }
u.add(ret);
return ret;
}