VN2DGridQuery.h

/*
 *   Repast for High Performance Computing (Repast HPC)
 *
 *   Copyright (c) 2010 Argonne National Laboratory
 *   All rights reserved.
 *
 *   Redistribution and use in source and binary forms, with
 *   or without modification, are permitted provided that the following
 *   conditions are met:
 *
 *     Redistributions of source code must retain the above copyright notice,
 *     this list of conditions and the following disclaimer.
 *
 *     Redistributions in binary form must reproduce the above copyright notice,
 *     this list of conditions and the following disclaimer in the documentation
 *     and/or other materials provided with the distribution.
 *
 *     Neither the name of the Argonne National Laboratory nor the names of its
 *     contributors may be used to endorse or promote products derived from
 *     this software without specific prior written permission.
 *
 *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 *   ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
 *   PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE TRUSTEES OR
 *   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 *   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 *   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 *   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 *   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 *   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
 *   EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 *
 *  VN2DGridQuery.h
 *
 *  Created on: Aug 12, 2010
 *      Author: nick
 */
 
#ifndef VN2DGRIDQUERY_H_
#define VN2DGRIDQUERY_H_
 
#include "Grid2DQuery.h"
 
namespace repast {
 
template<typename T>
class VN2DGridQuery: public Grid2DQuery<T> {
 
public:
 
        VN2DGridQuery(const Grid<T, int>* grid);
        virtual ~VN2DGridQuery() {
        }
 
        virtual void query(const Point<int>& center, int range, bool includeCenter, std::vector<T*>& out) const;
};
 
template<typename T>
VN2DGridQuery<T>::VN2DGridQuery(const Grid<T, int>* grid) :
        Grid2DQuery<T> (grid) {
}
 
template<typename T>
void VN2DGridQuery<T>::query(const Point<int>& center, int range, bool includeCenter, std::vector<T*>& out) const {
        if (includeCenter) {
                Grid2DQuery<T>::_grid->getObjectsAt(center, out);
        }
 
        int yMin = center[1] - range;
        if (!Grid2DQuery<T>::_grid->isPeriodic() && yMin < Grid2DQuery<T>::minMax[1][0])
                yMin = Grid2DQuery<T>::minMax[1][0];
 
        int yMax = center[1];
        for (int y = yMin; y < yMax; y++) {
                Grid2DQuery<T>::_grid->getObjectsAt(Point<int> (center[0], y), out);
        }
 
        yMax = center[1] + range + 1;
        if (!Grid2DQuery<T>::_grid->isPeriodic() && yMax >= Grid2DQuery<T>::minMax[1][1])
                yMax = Grid2DQuery<T>::minMax[1][1];
        // skip the center
        yMin = center[1] + 1;
        for (int y = yMin; y < yMax; y++) {
                Grid2DQuery<T>::_grid->getObjectsAt(Point<int> (center[0], y), out);
        }
 
        int xMin = center[0] - range;
        if (!Grid2DQuery<T>::_grid->isPeriodic() && xMin < Grid2DQuery<T>::minMax[0][0])
                xMin = Grid2DQuery<T>::minMax[0][0];
        for (int x = xMin; x < center[0]; x++) {
                Grid2DQuery<T>::_grid->getObjectsAt(Point<int> (x, center[1]), out);
        }
 
        int xMax = center[0] + range + 1;
        if (!Grid2DQuery<T>::_grid->isPeriodic() && xMax >= Grid2DQuery<T>::minMax[0][1])
                xMax = Grid2DQuery<T>::minMax[0][1];
        xMin = center[0] + 1;
        for (int x = xMin; x < xMax; x++) {
                Grid2DQuery<T>::_grid->getObjectsAt(Point<int> (x, center[1]), out);
        }
}
 
}
 
#endif /* VN2DGRIDQUERY_H_ */