KernelPsfFactory.h

Go to the documentation of this file.

// -*- lsst-c++ -*-

#include "lsst/meas/algorithms/KernelPsf.h"
#include "lsst/afw/table/io/InputArchive.h"
#include "lsst/afw/table/io/OutputArchive.h"
#include "lsst/afw/table/io/CatalogVector.h"

namespace lsst { namespace meas { namespace algorithms {

struct KernelPsfPersistenceHelper : private boost::noncopyable {
    afw::table::Schema schema;
    afw::table::Key<int> kernel;
    afw::table::Key<afw::table::Point<double> > averagePosition;

    static KernelPsfPersistenceHelper const & get();

private:
    KernelPsfPersistenceHelper();
};

template <typename T=KernelPsf, typename K=afw::math::Kernel>
class KernelPsfFactory : public afw::table::io::PersistableFactory {
public:

    virtual PTR(afw::table::io::Persistable)
    read(afw::table::io::InputArchive const & archive, afw::table::io::CatalogVector const & catalogs) const {
        static KernelPsfPersistenceHelper const & keys = KernelPsfPersistenceHelper::get();
        LSST_ARCHIVE_ASSERT(catalogs.size() == 1u);
        LSST_ARCHIVE_ASSERT(catalogs.front().size() == 1u);
        afw::table::BaseRecord const & record = catalogs.front().front();
        LSST_ARCHIVE_ASSERT(record.getSchema() == keys.schema);
        return PTR(T)(
            new T(
                archive.get<K>(record.get(keys.kernel)),
                record.get(keys.averagePosition)
            )
        );
    }

    KernelPsfFactory(std::string const & name) : afw::table::io::PersistableFactory(name) {}

};

}}} // namespace lsst::afw::detection