public BitSet Or(BitSet a) { Debug.Assert(nbits == a.nbits); BitSet r = new BitSet(nbits); for (int j = 0; j < size; j++) r.bits[j] = bits[j] | a.bits[j]; return r; }
public BitSet(BitSet b) { nbits = b.nbits; size = b.size; bits = (int[])b.bits.Clone(); }
internal SearchSet(SearchSet s) { b = new BitSet(s.b); }
void doRelList(Index idx, RelList rellist) { int i; bool flag; SynSet synptr; BitSet outsenses = new BitSet(300); prflag = true; for (RelList rel = rellist; rel != null; rel = rel.next) { flag = false; for (i = 0; i < idx.offs.Length; i++) if (rel.senses[i] && !outsenses[i]) { flag = true; synptr = new SynSet(idx.offs[i], pos, "", this, i); synptr.strsns(i + 1); synptr.tracePtrs(PointerType.of("HYPERPTR"), pos, 0); synptr.frames.Clear(); // TDMS 03 Jul 2006 - frames get added in wordnet.cs after filtering // TDMS 11 Oct 2005 - build hierarchical results senses.Add(synptr); outsenses[i] = true; } if (flag) buf += "--------------\n"; } for (i = 0; i < idx.offs.Length; i++) if (!outsenses[i]) { synptr = new SynSet(idx.offs[i], pos, "", this, i); synptr.strsns(i + 1); synptr.tracePtrs(PointerType.of("HYPERPTR"), pos, 0); synptr.frames.Clear(); // TDMS 03 Jul 2006 - frames get added in wordnet.cs after filtering // TDMS 11 Oct 2005 - build hierarchical results senses.Add(synptr); buf += "---------------\n"; } }
internal SearchSet() { b = new BitSet(30); }