for (int inabor=0; inabor<nnabor; ++inabor) { Node nb = nabors[inabor]; if (edgeSet.add(na,nb,null,null)) { Tet tet = findTet(na,nb); Edge edge = new Edge(tet,na,nb);
/** * Doubles the capacity of the set. */ private void doubleCapacity() { //trace("EdgeSet.doubleCapacity"); EdgeSet set = new EdgeSet(2*_nmax,_factor); if (_n>0) { for (int i=0; i<_nmax; ++i) { if (_filled[i]) set.add(_a[i],_b[i],_c[i],_nabc[i]); } } _a = set._a; _b = set._b; _c = set._c; _nabc = set._nabc; _filled = set._filled; _nmax = set._nmax; _n = set._n; _factor = set._factor; _shift = set._shift; _mask = set._mask; _index = set._index; } }