int mask = 0;
int mask;
    public int contains(BoundingVolume bound) {        if (bound == null) { return INSIDE_FRUSTUM; }        int mask = 0;        int rVal = INSIDE_FRUSTUM;        for (int planeCounter = FRUSTUM_PLANES; planeCounter >= 0; planeCounter--) {          if ( planeCounter == bound.getCheckPlane())           continue; // we have already checked this plane at first iteration          int planeId = (planeCounter == FRUSTUM_PLANES) ? bound.getCheckPlane() : planeCounter;          mask = 1 << (planeId);          if ( (planeState & mask) == 0) {            int side = bound.whichSide(worldPlane[planeId]);            if (side == Plane.NEGATIVE_SIDE) {              //object is outside of frustum              bound.setCheckPlane(planeId);              return OUTSIDE_FRUSTUM;            } else if (side == Plane.POSITIVE_SIDE) {              //object is visible on *this* plane, so mark this plane              //so that we don't check it for sub nodes.              planeState |= mask;            } else {              rVal = INTERSECTS_FRUSTUM;            }          }        }        return rVal;    }