Method loopi

source/src/vertmodel.h:260–275

        {
            hashtable<uint, uint> edges;
            loopi(numtris)
            {
                const tri &t = tris[i];
                loopj(3)
                {
                    uint e1 = shareverts[t.vert[j]], e2 = shareverts[t.vert[(j+1)%3]], shift = 0;
                    if(e1 > e2) { swap(e1, e2); shift = 16; }
                    uint &edge = edges.access(e1 | (e2<<16), ~0U);
                    if(((edge>>shift)&0xFFFF) != 0xFFFF) edge = 0;
                    else
                    {
                        edge &= 0xFFFF<<(16-shift);
                        edge |= i<<shift;
                    }
                }
            }
            loopi(numtris)
            {
                tri &t = tris[i];