LSST Applications g013ef56533+7c9321ec0f,g042eb84c57+c6cfa41bc3,g199a45376c+0ba108daf9,g1fd858c14a+fcad0d0313,g210f2d0738+c0f94c6586,g262e1987ae+a7e710680e,g29ae962dfc+fb55f2edb0,g2ac17093b6+61d6563b1e,g2b1d02342f+df6f932764,g2cef7863aa+aef1011c0b,g2f7ad74990+c0f94c6586,g35bb328faa+8c5ae1fdc5,g3fd5ace14f+53cf87ae69,g47891489e3+4316d04fff,g511e8cfd20+baa56acf6c,g53246c7159+8c5ae1fdc5,g54cd7ddccb+fd7ad03fde,g64539dfbff+c0f94c6586,g67b6fd64d1+4316d04fff,g67fd3c3899+c0f94c6586,g6985122a63+4316d04fff,g74acd417e5+ca833bee28,g786e29fd12+668abc6043,g81db2e9a8d+b2ec8e584f,g87389fa792+8856018cbb,g89139ef638+4316d04fff,g8d7436a09f+0a24083b20,g8ea07a8fe4+760ca7c3fc,g90f42f885a+033b1d468d,g97be763408+11eb8fd5b8,gbf99507273+8c5ae1fdc5,gcdda8b9158+e4c84c9d5c,gce8aa8abaa+8c5ae1fdc5,gd7ef33dd92+4316d04fff,gdab6d2f7ff+ca833bee28,ge410e46f29+4316d04fff,geaed405ab2+c4bbc419c6,gf9a733ac38+8c5ae1fdc5,w.2025.40
LSST Data Management Base Package
Loading...
Searching...
No Matches
TrapezoidalPacker.cc
Go to the documentation of this file.
1// -*- LSST-C++ -*-
2/*
3 * LSST Data Management System
4 * Copyright 2008-2014 LSST Corporation.
5 *
6 * This product includes software developed by the
7 * LSST Project (http://www.lsst.org/).
8 *
9 * This program is free software: you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation, either version 3 of the License, or
12 * (at your option) any later version.
13 *
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
18 *
19 * You should have received a copy of the LSST License Statement and
20 * the GNU General Public License along with this program. If not,
21 * see <http://www.lsstcorp.org/LegalNotices/>.
22 */
23
25
26namespace lsst {
27namespace afw {
28namespace math {
29namespace detail {
30
32 : nx(ctrl.orderX + 1), ny(ctrl.orderY + 1) {
33 if (ctrl.triangular) {
34 if (nx >= ny) {
35 m = 0;
36 size = (nx - ny) * ny + (ny * (ny + 1)) / 2;
37 } else {
38 m = ny - nx;
39 size = m * nx + (nx * (nx + 1)) / 2;
40 }
41 } else {
42 m = ny;
43 size = nx * ny;
44 }
45}
46
47void TrapezoidalPacker::pack(ndarray::Array<double, 1, 1> const& out,
48 ndarray::Array<double const, 1, 1> const& tx,
49 ndarray::Array<double const, 1, 1> const& ty) const {
50 double* outIter = out.begin();
51 for (int i = 0; i < m; ++i) { // loop over rectangular part
52 for (int j = 0; j < nx; ++j, ++outIter) {
53 *outIter = ty[i] * tx[j];
54 }
55 }
56 for (int i = m; i < ny; ++i) { // loop over wide trapezoidal part
57 for (int j = 0, nj = nx + m - i; j < nj; ++j, ++outIter) {
58 *outIter = ty[i] * tx[j];
59 }
60 }
61}
62
63void TrapezoidalPacker::pack(ndarray::Array<double, 1, 1> const& out,
64 ndarray::Array<double const, 2, 2> const& unpacked) const {
65 double* outIter = out.begin();
66 for (int i = 0; i < m; ++i) { // loop over rectangular part
67 ndarray::Array<double const, 1, 1> unpackedRow = unpacked[i];
68 for (int j = 0; j < nx; ++j, ++outIter) {
69 *outIter = unpackedRow[j];
70 }
71 }
72 for (int i = m; i < ny; ++i) { // loop over wide trapezoidal part
73 ndarray::Array<double const, 1, 1> unpackedRow = unpacked[i];
74 for (int j = 0, nj = nx + m - i; j < nj; ++j, ++outIter) {
75 *outIter = unpackedRow[j];
76 }
77 }
78}
79
80void TrapezoidalPacker::unpack(ndarray::Array<double, 2, 2> const& out,
81 ndarray::Array<double const, 1, 1> const& packed) const {
82 out.deep() = 0.0;
83 double const* packedIter = packed.begin();
84 for (int i = 0; i < m; ++i) { // loop over rectangular part
85 ndarray::Array<double, 1, 1> outRow = out[i];
86 for (int j = 0; j < nx; ++j, ++packedIter) {
87 outRow[j] = *packedIter;
88 }
89 }
90 for (int i = m; i < ny; ++i) { // loop over wide trapezoidal part
91 ndarray::Array<double, 1, 1> outRow = out[i];
92 for (int j = 0, nj = nx + m - i; j < nj; ++j, ++packedIter) {
93 outRow[j] = *packedIter;
94 }
95 }
96}
97
98ndarray::Array<double, 2, 2> TrapezoidalPacker::unpack(
99 ndarray::Array<double const, 1, 1> const& packed) const {
100 ndarray::Array<double, 2, 2> out = ndarray::allocate(ny, nx);
101 unpack(out, packed);
102 return out;
103}
104} // namespace detail
105} // namespace math
106} // namespace afw
107} // namespace lsst
A control object used when fitting ChebyshevBoundedField to data (see ChebyshevBoundedField::fit)
bool triangular
"if true, only include terms where the sum of the x and y order " "is less than or equal to max(order...
TrapezoidalPacker(ChebyshevBoundedFieldControl const &ctrl)
void unpack(ndarray::Array< double, 2, 2 > const &out, ndarray::Array< double const, 1, 1 > const &packed) const
void pack(ndarray::Array< double, 1, 1 > const &out, ndarray::Array< double const, 1, 1 > const &tx, ndarray::Array< double const, 1, 1 > const &ty) const