Pixel_omp.cc

Go to the documentation of this file.

// -*- LSST-C++ -*-

/* 
 * LSST Data Management System
 * Copyright 2008, 2009, 2010 LSST Corporation.
 * 
 * This product includes software developed by the
 * LSST Project (http://www.lsst.org/).
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the LSST License Statement and 
 * the GNU General Public License along with this program.  If not, 
 * see <http://www.lsstcorp.org/LegalNotices/>.
 */

#include "lsst/meas/algorithms/shapelet/Pixel.h"

namespace lsst {
namespace meas {
namespace algorithms {
namespace shapelet {

    PixelList::PixelList() :
        _shouldUsePool(false), _v1(new std::vector<Pixel>()) 
    {}

    PixelList::PixelList(const int n) :
        _shouldUsePool(false), _v1(new std::vector<Pixel>(n)) 
    {}

    PixelList::PixelList(const PixelList& rhs) :
        _shouldUsePool(false), _v1(new std::vector<Pixel>(rhs.size())) 
    {
        if (rhs._shouldUsePool) 
            std::copy(rhs._v2->begin(),rhs._v2->end(),_v1->begin());
        else *_v1 = *rhs._v1;
    }

    PixelList& PixelList::operator=(const PixelList& rhs)
    {
        if (size() != rhs.size()) resize(rhs.size());

        if (_shouldUsePool) {
            if (rhs._shouldUsePool) *_v2 = *rhs._v2;
            else std::copy(rhs._v1->begin(),rhs._v1->end(),_v2->begin());
        } else {
            if (rhs._shouldUsePool) 
                std::copy(rhs._v2->begin(),rhs._v2->end(),_v1->begin());
            else *_v1 = *rhs._v1;
        }
        return *this;
    }

    PixelList::~PixelList()
    {
#ifdef _OPENMP
#pragma omp critical (PixelList)
#endif
        {
            _v2.reset();
        }
    }

    void PixelList::usePool() 
    {
#ifdef PIXELLIST_USE_POOL
        // This should be done before any elements are added.
        if (_v1.get()) Assert(_v1->size() == 0);
        if (_v2.get()) Assert(_v2->size() == 0);
        _v1.reset();
#ifdef _OPENMP
#pragma omp critical (PixelList)
#endif
        {
            _v2.reset(new std::vector<Pixel,PoolAllocPixel>());
        }
        _shouldUsePool = true; 
#endif
    }

    size_t PixelList::size() const
    {
        if (_shouldUsePool) return _v2->size();
        else return _v1->size();
    }

    void PixelList::reserve(const int n)
    {
        if (_shouldUsePool) {
#ifdef _OPENMP
#pragma omp critical (PixelList)
#endif
            {
                _v2->reserve(n);
            }
        } else {
            _v1->reserve(n);
        }
    }

    size_t PixelList::capacity() const
    { return _shouldUsePool ? _v2->capacity() : _v1->capacity(); }

    void PixelList::resize(const int n)
    {
        if (_shouldUsePool) {
#ifdef _OPENMP
#pragma omp critical (PixelList)
#endif
            {
                _v2->resize(n);
            }
        } else {
            _v1->resize(n);
        }
    }

    void PixelList::clear()
    {
        if (_shouldUsePool) {
#ifdef _OPENMP
#pragma omp critical (PixelList)
#endif
            {
                _v2->clear();
            }
        } else {
            _v1->clear();
        }
    }

    void PixelList::push_back(const Pixel& p)
    {
        if (_shouldUsePool) {
#ifdef _OPENMP
#pragma omp critical (PixelList)
#endif
            {
                _v2->push_back(p);
            }
        } else {
            _v1->push_back(p);
        }
    }

    Pixel& PixelList::operator[](const int i)
    {
        if (_shouldUsePool) return (*_v2)[i];
        else return (*_v1)[i];
    }

    const Pixel& PixelList::operator[](const int i) const
    {
        if (_shouldUsePool) return (*_v2)[i];
        else return (*_v1)[i];
    }

    struct PixelListSorter
    {
        Position _cen;
        PixelListSorter(const Position& cen) : _cen(cen) {}
        bool operator()(const Pixel& p1, const Pixel& p2) const
        { return std::norm(p1.getPos()-_cen) < std::norm(p2.getPos()-_cen); }
    };

    void PixelList::sort(const Position& cen) 
    {
        PixelListSorter sorter(cen);
        if (_shouldUsePool) std::sort(_v2->begin(),_v2->end(),sorter);
        else std::sort(_v1->begin(),_v1->end(),sorter);
    }

}}}}