holes

    public int calcHolesConverted(int[] grid) {
        int underMask     = 0;
        int lneighborMask = 0;
        int rneighborMask = 0;
        int foundHoles    = 0;
        int minY = 0;
        while ( minY < ysize && grid[minY] == EMPTY_ROW ) {
            minY++;
        }

        for (int y = minY; y < ysize; y++) {
            int line   = grid[y];
            int filled = ~line & EMPTY_ROW;

            underMask     |= filled;
            lneighborMask |= (filled << 1);
            rneighborMask |= (filled >> 1);
            //(ysize-y)
            foundHoles += (ysize-y)*setOnes[underMask & line];
            foundHoles += (ysize-y)*setOnes[lneighborMask & line];
            foundHoles += (ysize-y)*setOnes[rneighborMask & line];
        }
        return foundHoles;
    }