LSST Applications  21.0.0+04719a4bac,21.0.0-1-ga51b5d4+f5e6047307,21.0.0-11-g2b59f77+a9c1acf22d,21.0.0-11-ga42c5b2+86977b0b17,21.0.0-12-gf4ce030+76814010d2,21.0.0-13-g1721dae+760e7a6536,21.0.0-13-g3a573fe+768d78a30a,21.0.0-15-g5a7caf0+f21cbc5713,21.0.0-16-g0fb55c1+b60e2d390c,21.0.0-19-g4cded4ca+71a93a33c0,21.0.0-2-g103fe59+bb20972958,21.0.0-2-g45278ab+04719a4bac,21.0.0-2-g5242d73+3ad5d60fb1,21.0.0-2-g7f82c8f+8babb168e8,21.0.0-2-g8f08a60+06509c8b61,21.0.0-2-g8faa9b5+616205b9df,21.0.0-2-ga326454+8babb168e8,21.0.0-2-gde069b7+5e4aea9c2f,21.0.0-2-gecfae73+1d3a86e577,21.0.0-2-gfc62afb+3ad5d60fb1,21.0.0-25-g1d57be3cd+e73869a214,21.0.0-3-g357aad2+ed88757d29,21.0.0-3-g4a4ce7f+3ad5d60fb1,21.0.0-3-g4be5c26+3ad5d60fb1,21.0.0-3-g65f322c+e0b24896a3,21.0.0-3-g7d9da8d+616205b9df,21.0.0-3-ge02ed75+a9c1acf22d,21.0.0-4-g591bb35+a9c1acf22d,21.0.0-4-g65b4814+b60e2d390c,21.0.0-4-gccdca77+0de219a2bc,21.0.0-4-ge8a399c+6c55c39e83,21.0.0-5-gd00fb1e+05fce91b99,21.0.0-6-gc675373+3ad5d60fb1,21.0.0-64-g1122c245+4fb2b8f86e,21.0.0-7-g04766d7+cd19d05db2,21.0.0-7-gdf92d54+04719a4bac,21.0.0-8-g5674e7b+d1bd76f71f,master-gac4afde19b+a9c1acf22d,w.2021.13
LSST Data Management Base Package
Chunker.h
Go to the documentation of this file.
1 /*
2  * LSST Data Management System
3  * Copyright 2014-2015 AURA/LSST.
4  *
5  * This product includes software developed by the
6  * LSST Project (http://www.lsst.org/).
7  *
8  * This program is free software: you can redistribute it and/or modify
9  * it under the terms of the GNU General Public License as published by
10  * the Free Software Foundation, either version 3 of the License, or
11  * (at your option) any later version.
12  *
13  * This program is distributed in the hope that it will be useful,
14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16  * GNU General Public License for more details.
17  *
18  * You should have received a copy of the LSST License Statement and
19  * the GNU General Public License along with this program. If not,
20  * see <https://www.lsstcorp.org/LegalNotices/>.
21  */
22 
23 #ifndef LSST_SPHGEOM_CHUNKER_H_
24 #define LSST_SPHGEOM_CHUNKER_H_
25 
29 
30 #include <stdint.h>
31 #include <vector>
32 
33 #include "Angle.h"
34 #include "Box.h"
35 
36 
37 namespace lsst {
38 namespace sphgeom {
39 
43 struct SubChunks {
44  int32_t chunkId;
46 
47  SubChunks() : chunkId(-1) {}
48 
49  void swap(SubChunks & sc) {
52  }
53 };
54 
55 
66 class Chunker {
67 public:
68  Chunker(int32_t numStripes,
69  int32_t numSubStripesPerStripe);
70 
71  bool operator==(Chunker const & c) const {
72  return _numStripes == c._numStripes &&
73  _numSubStripesPerStripe == c._numSubStripesPerStripe;
74  }
75 
76  bool operator!=(Chunker const & c) const {
77  return _numStripes != c._numStripes ||
78  _numSubStripesPerStripe != c._numSubStripesPerStripe;
79  }
80 
83  int32_t getNumStripes() const {
84  return _numStripes;
85  }
86 
89  int32_t getNumSubStripesPerStripe() const {
90  return _numSubStripesPerStripe;
91  }
92 
96 
100 
104 
107  std::vector<int32_t> getAllSubChunks(int32_t chunkId) const;
108 
110  bool valid(int32_t chunkId) const;
111 
112  Box getChunkBoundingBox(int32_t stripe, int32_t chunk) const;
113  Box getSubChunkBoundingBox(int32_t subStripe, int32_t subChunk) const;
114 
116  int32_t getStripe(int32_t chunkId) const {
117  return chunkId / (2 * _numStripes);
118  }
119 
121  int32_t getChunk(int32_t chunkId, int32_t stripe) const {
122  return chunkId - stripe*2*_numStripes;
123  }
124 
125 private:
126  struct Stripe {
127  Angle chunkWidth;
128  int32_t numChunksPerStripe;
129  int32_t numSubChunksPerChunk;
130 
131  Stripe() :
132  chunkWidth(0),
133  numChunksPerStripe(0),
134  numSubChunksPerChunk(0)
135  {}
136  };
137 
138  struct SubStripe {
139  Angle subChunkWidth;
140  int32_t numSubChunksPerChunk;
141 
142  SubStripe() : subChunkWidth(), numSubChunksPerChunk(0) {}
143  };
144 
145  int32_t _getChunkId(int32_t stripe, int32_t chunk) const {
146  return stripe * 2 * _numStripes + chunk;
147  }
148 
149  int32_t _getSubChunkId(int32_t stripe, int32_t subStripe,
150  int32_t chunk, int32_t subChunk) const {
151  int32_t y = subStripe - stripe * _numSubStripesPerStripe;
152  int32_t x = subChunk -
153  chunk * _subStripes[subStripe].numSubChunksPerChunk;
154  return y * _maxSubChunksPerSubStripeChunk + x;
155  }
156 
157  void _getSubChunks(std::vector<SubChunks> & subChunks,
158  Region const & r,
159  NormalizedAngleInterval const & lon,
160  int32_t stripe,
161  int32_t chunk,
162  int32_t minSS,
163  int32_t maxSS) const;
164 
165  int32_t _numStripes;
166  int32_t _numSubStripesPerStripe;
167  int32_t _numSubStripes;
168  int32_t _maxSubChunksPerSubStripeChunk;
169  Angle _subStripeHeight;
170  std::vector<Stripe> _stripes;
171  std::vector<SubStripe> _subStripes;
172 };
173 
174 }} // namespace lsst::sphgeom
175 
176 #endif // LSST_SPHGEOM_CHUNKER_H_
double x
int y
Definition: SpanSet.cc:49
Angle represents an angle in radians.
Definition: Angle.h:43
Box represents a rectangle in spherical coordinate space that contains its boundary.
Definition: Box.h:54
Chunker subdivides the unit sphere into longitude-latitude boxes.
Definition: Chunker.h:66
std::vector< int32_t > getAllChunks() const
getAllChunks returns the complete set of chunk IDs for the unit sphere.
Definition: Chunker.cc:258
bool operator!=(Chunker const &c) const
Definition: Chunker.h:76
int32_t getStripe(int32_t chunkId) const
Return the stripe for the specified chunkId.
Definition: Chunker.h:116
Box getSubChunkBoundingBox(int32_t subStripe, int32_t subChunk) const
Definition: Chunker.cc:302
int32_t getNumSubStripesPerStripe() const
getNumSubStripesPerStripe returns the number of fixed-height latitude sub-intervals in each stripe.
Definition: Chunker.h:89
int32_t getChunk(int32_t chunkId, int32_t stripe) const
Return the chunk for the given chunkId and stripe.
Definition: Chunker.h:121
Chunker(int32_t numStripes, int32_t numSubStripesPerStripe)
Definition: Chunker.cc:57
std::vector< int32_t > getAllSubChunks(int32_t chunkId) const
getAllSubChunks returns the complete set of sub-chunk IDs for the given chunk.
Definition: Chunker.cc:269
bool operator==(Chunker const &c) const
Definition: Chunker.h:71
std::vector< SubChunks > getSubChunksIntersecting(Region const &r) const
getSubChunksIntersecting returns all the sub-chunks that potentially intersect the given region.
Definition: Chunker.cc:148
Box getChunkBoundingBox(int32_t stripe, int32_t chunk) const
Definition: Chunker.cc:291
int32_t getNumStripes() const
getNumStripes returns the number of fixed-height latitude intervals in the sky subdivision.
Definition: Chunker.h:83
bool valid(int32_t chunkId) const
Return 'true' if the specified chunk number is valid.
Definition: Chunker.cc:285
std::vector< int32_t > getChunksIntersecting(Region const &r) const
getChunksIntersecting returns all the chunks that potentially intersect the given region.
Definition: Chunker.cc:103
Region is a minimal interface for 2-dimensional regions on the unit sphere.
Definition: Region.h:79
lsst::geom::Angle Angle
Definition: misc.h:33
A base class for image defects.
This file declares a class for representing angles.
This file declares a class for representing longitude/latitude angle boxes on the unit sphere.
SubChunks represents a set of sub-chunks of a particular chunk.
Definition: Chunker.h:43
std::vector< int32_t > subChunkIds
Definition: Chunker.h:45
void swap(SubChunks &sc)
Definition: Chunker.h:49
T swap(T... args)