arrays.cc

Go to the documentation of this file.

/*
 * LSST Data Management System
 * Copyright 2008-2017  AURA/LSST.
 *
 * 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 <https://www.lsstcorp.org/LegalNotices/>.
 */

#include "pybind11/pybind11.h"
#include "pybind11/stl.h"

#include "ndarray/pybind11.h"

#include "lsst/utils/python.h"
#include "lsst/afw/table/Key.h"
#include "lsst/afw/table/BaseRecord.h"
#include "lsst/afw/table/FunctorKey.h"
#include "lsst/afw/table/arrays.h"

namespace py = pybind11;
using namespace pybind11::literals;

namespace lsst {
namespace afw {
namespace table {
namespace {

// We don't expose base classes (e.g. FunctorKey) to Python, since they're just used to
// define a CRTP interface in C++ and in Python that's just duck-typing.

template <typename T>
using PyArrayKey = py::class_<ArrayKey<T>, std::shared_ptr<ArrayKey<T>>>;

template <typename T>
void declareArrayKey(py::module &mod, std::string const &suffix) {
    PyArrayKey<T> cls(mod, ("Array" + suffix + "Key").c_str());

    cls.def(py::init<>());
    cls.def(py::init<Key<Array<T>> const &>());
    cls.def(py::init<SubSchema const &>());
    cls.def(py::init<std::vector<Key<T>> const &>());

    cls.def_static("addFields", (ArrayKey<T>(*)(Schema &, std::string const &, std::string const &,
                                                std::string const &, std::vector<T> const &)) &
                                        ArrayKey<T>::addFields,
                   "schema"_a, "name"_a, "doc"_a, "unit"_a, "docData"_a);
    cls.def_static("addFields", (ArrayKey<T>(*)(Schema &, std::string const &, std::string const &,
                                                std::string const &, int size)) &
                                        ArrayKey<T>::addFields,
                   "schema"_a, "name"_a, "doc"_a, "unit"_a, "size"_a);
    cls.def("get", &ArrayKey<T>::get);
    cls.def("set", &ArrayKey<T>::set);
    cls.def("isValid", &ArrayKey<T>::isValid);
    cls.def("__eq__", &ArrayKey<T>::operator==, py::is_operator());
    cls.def("__ne__", &ArrayKey<T>::operator!=, py::is_operator());
    cls.def("__getitem__",
            // Special implementation of __getitem__ to support ints and slices
            [](ArrayKey<T> const &self, py::object const &index) -> py::object {
                if (py::isinstance<py::slice>(index)) {
                    py::slice slice(index);
                    py::size_t start = 0, stop = 0, step = 0, length = 0;
                    bool valid = slice.compute(self.getSize(), &start, &stop, &step, &length);
                    if (!valid) throw py::error_already_set();
                    if (step != 1) {
                        throw py::index_error("Step for ArrayKey must be 1.");
                    }
                    return py::cast(self.slice(start, stop));
                } else {
                    std::size_t n = utils::python::cppIndex(self.getSize(), py::cast<std::ptrdiff_t>(index));
                    return py::cast(self[n]);
                }
            });
    cls.def("getSize", &ArrayKey<T>::getSize);
    cls.def("slice", &ArrayKey<T>::slice);
};

PYBIND11_MODULE(arrays, mod) {
    py::module::import("lsst.afw.table.base");

    declareArrayKey<float>(mod, "F");
    declareArrayKey<double>(mod, "D");
}
}
}
}
}  // namespace lsst::afw::table::<anonymous>