LSSTApplications  19.0.0-14-gb0260a2+72efe9b372,20.0.0+7927753e06,20.0.0+8829bf0056,20.0.0+995114c5d2,20.0.0+b6f4b2abd1,20.0.0+bddc4f4cbe,20.0.0-1-g253301a+8829bf0056,20.0.0-1-g2b7511a+0d71a2d77f,20.0.0-1-g5b95a8c+7461dd0434,20.0.0-12-g321c96ea+23efe4bbff,20.0.0-16-gfab17e72e+fdf35455f6,20.0.0-2-g0070d88+ba3ffc8f0b,20.0.0-2-g4dae9ad+ee58a624b3,20.0.0-2-g61b8584+5d3db074ba,20.0.0-2-gb780d76+d529cf1a41,20.0.0-2-ged6426c+226a441f5f,20.0.0-2-gf072044+8829bf0056,20.0.0-2-gf1f7952+ee58a624b3,20.0.0-20-geae50cf+e37fec0aee,20.0.0-25-g3dcad98+544a109665,20.0.0-25-g5eafb0f+ee58a624b3,20.0.0-27-g64178ef+f1f297b00a,20.0.0-3-g4cc78c6+e0676b0dc8,20.0.0-3-g8f21e14+4fd2c12c9a,20.0.0-3-gbd60e8c+187b78b4b8,20.0.0-3-gbecbe05+48431fa087,20.0.0-38-ge4adf513+a12e1f8e37,20.0.0-4-g97dc21a+544a109665,20.0.0-4-gb4befbc+087873070b,20.0.0-4-gf910f65+5d3db074ba,20.0.0-5-gdfe0fee+199202a608,20.0.0-5-gfbfe500+d529cf1a41,20.0.0-6-g64f541c+d529cf1a41,20.0.0-6-g9a5b7a1+a1cd37312e,20.0.0-68-ga3f3dda+5fca18c6a4,20.0.0-9-g4aef684+e18322736b,w.2020.45
LSSTDataManagementBasePackage
Histo2d.cc
Go to the documentation of this file.
1 // -*- LSST-C++ -*-
2 /*
3  * This file is part of jointcal.
4  *
5  * Developed for the LSST Data Management System.
6  * This product includes software developed by the LSST Project
7  * (https://www.lsst.org).
8  * See the COPYRIGHT file at the top-level directory of this distribution
9  * for details of code ownership.
10  *
11  * This program is free software: you can redistribute it and/or modify
12  * it under the terms of the GNU General Public License as published by
13  * the Free Software Foundation, either version 3 of the License, or
14  * (at your option) any later version.
15  *
16  * This program is distributed in the hope that it will be useful,
17  * but WITHOUT ANY WARRANTY; without even the implied warranty of
18  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19  * GNU General Public License for more details.
20  *
21  * You should have received a copy of the GNU General Public License
22  * along with this program. If not, see <https://www.gnu.org/licenses/>.
23  */
24 
25 #include <iostream>
26 #include <cmath>
27 #include <string.h> /* for memset*/
28 
29 #include "lsst/log/Log.h"
30 #include "lsst/jointcal/Histo2d.h"
31 
32 namespace {
33 LOG_LOGGER _log = LOG_GET("jointcal.Histo2d");
34 }
35 
36 namespace lsst {
37 namespace jointcal {
38 
39 Histo2d::Histo2d(int nnx, float mminx, float mmaxx, int nny, float mminy, float mmaxy) {
40  nx = nnx;
41  ny = nny;
42  minx = mminx;
43  miny = mminy;
44  if (mmaxx != mminx)
45  scalex = nx / (mmaxx - mminx);
46  else {
47  LOGL_WARN(_log, "Histo2d: minx = maxx requested");
48  scalex = 1.0;
49  }
50  if (mmaxy != mminy)
51  scaley = ny / (mmaxy - mminy);
52  else {
53  LOGL_WARN(_log, "Histo2d: maxy = miny requested");
54  scaley = 1.0;
55  }
56  data.reset(new float[nx * ny]);
57  memset(data.get(), 0, nx * ny * sizeof(float));
58 }
59 
61  memcpy(this, &other, sizeof(Histo2d));
62  data.reset(new float[nx * ny]);
63  memcpy((data).get(), other.data.get(), nx * ny * sizeof(float));
64 }
65 
66 bool Histo2d::indices(double x, double y, int &ix, int &iy) const {
67  ix = (int)std::floor((x - minx) * scalex);
68  if (ix < 0 || ix >= nx) return false;
69  iy = (int)std::floor((y - miny) * scaley);
70  return (iy >= 0 && iy < ny);
71 }
72 
73 void Histo2d::fill(float x, float y, float weight) {
74  int ix, iy;
75  if (indices(x, y, ix, iy)) data[iy + ny * ix] += weight;
76 }
77 
78 double Histo2d::maxBin(double &x, double &y) const {
79  float *p, *pend;
80  int imax = 0;
81  float valmax = -1e30;
82 
83  for (p = data.get(), pend = p + nx * ny; pend - p; p++) {
84  if (*p > valmax) {
85  valmax = *p;
86  imax = p - (data.get());
87  }
88  }
89  int ix = imax / ny;
90  int iy = imax - ix * ny;
91  x = minx + ((float)ix + 0.5) / scalex;
92  y = miny + ((float)iy + 0.5) / scaley;
93  return valmax;
94 }
95 
96 void Histo2d::zeroBin(double x, double y) {
97  int ix, iy;
98  if (indices(x, y, ix, iy)) data[iy + ny * ix] = 0;
99 }
100 
101 double Histo2d::binContent(double x, double y) const {
102  int ix, iy;
103  if (indices(x, y, ix, iy)) return data[iy + ny * ix];
104  LOGL_WARN(_log, "Histo2D::binContent outside limits requested");
105  return -1e30;
106 }
107 } // namespace jointcal
108 } // namespace lsst
y
int y
Definition: SpanSet.cc:49
LOG_LOGGER
#define LOG_LOGGER
Definition: Log.h:703
std::floor
T floor(T... args)
lsst::jointcal::Histo2d::Histo2d
Histo2d()
Definition: Histo2d.h:33
Histo2d.h
LOGL_WARN
#define LOGL_WARN(logger, message...)
Definition: Log.h:536
LOG_GET
#define LOG_GET(logger)
Definition: Log.h:75
std::unique_ptr::get
T get(T... args)
std::unique_ptr::reset
T reset(T... args)
x
double x
Definition: ChebyshevBoundedField.cc:277
other
ItemVariant const * other
Definition: Schema.cc:56
lsst::jointcal
Definition: Associations.h:49
weight
afw::table::Key< double > weight
Definition: CoaddBoundedField.cc:166
lsst
A base class for image defects.
Definition: imageAlgorithm.dox:1
lsst::jointcal::Histo2d
Definition: Histo2d.h:31
lsst::jointcal::Histo2d::zeroBin
void zeroBin(double x, double y)
Definition: Histo2d.cc:96
lsst::jointcal::Histo2d::fill
void fill(float x, float y, float weight=1.)
Definition: Histo2d.cc:73
std::memcpy
T memcpy(T... args)
lsst::jointcal::Histo2d::binContent
double binContent(double x, double y) const
Definition: Histo2d.cc:101
lsst::jointcal::Histo2d::maxBin
double maxBin(double &x, double &y) const
Definition: Histo2d.cc:78
Log.h
LSST DM logging module built on log4cxx.
std::memset
T memset(T... args)