Loading [MathJax]/extensions/tex2jax.js
LSST Applications g0fba68d861+aa97b6e50c,g1ec0fe41b4+f536777771,g1fd858c14a+a9301854fb,g35bb328faa+fcb1d3bbc8,g4af146b050+a5c07d5b1d,g4d2262a081+78f4f01b60,g53246c7159+fcb1d3bbc8,g56a49b3a55+9c12191793,g5a012ec0e7+3632fc3ff3,g60b5630c4e+ded28b650d,g67b6fd64d1+ed4b5058f4,g78460c75b0+2f9a1b4bcd,g786e29fd12+cf7ec2a62a,g8352419a5c+fcb1d3bbc8,g87b7deb4dc+7b42cf88bf,g8852436030+e5453db6e6,g89139ef638+ed4b5058f4,g8e3bb8577d+d38d73bdbd,g9125e01d80+fcb1d3bbc8,g94187f82dc+ded28b650d,g989de1cb63+ed4b5058f4,g9d31334357+ded28b650d,g9f33ca652e+50a8019d8c,gabe3b4be73+1e0a283bba,gabf8522325+fa80ff7197,gb1101e3267+d9fb1f8026,gb58c049af0+f03b321e39,gb89ab40317+ed4b5058f4,gcf25f946ba+e5453db6e6,gcf6002c91b+2a0c9e9e84,gd6cbbdb0b4+bb83cc51f8,gdd1046aedd+ded28b650d,gde0f65d7ad+66b3a48cb7,ge278dab8ac+d65b3c2b70,ge410e46f29+ed4b5058f4,gf23fb2af72+b7cae620c0,gf5e32f922b+fcb1d3bbc8,gf67bdafdda+ed4b5058f4,w.2025.16
LSST Data Management Base Package
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Modules Pages
Chunker.h
Go to the documentation of this file.
1/*
2 * This file is part of sphgeom.
3 *
4 * Developed for the LSST Data Management System.
5 * This product includes software developed by the LSST Project
6 * (http://www.lsst.org).
7 * See the COPYRIGHT file at the top-level directory of this distribution
8 * for details of code ownership.
9 *
10 * This software is dual licensed under the GNU General Public License and also
11 * under a 3-clause BSD license. Recipients may choose which of these licenses
12 * to use; please see the files gpl-3.0.txt and/or bsd_license.txt,
13 * respectively. If you choose the GPL option then the following text applies
14 * (but note that there is still no warranty even if you opt for BSD instead):
15 *
16 * This program is free software: you can redistribute it and/or modify
17 * it under the terms of the GNU General Public License as published by
18 * the Free Software Foundation, either version 3 of the License, or
19 * (at your option) any later version.
20 *
21 * This program is distributed in the hope that it will be useful,
22 * but WITHOUT ANY WARRANTY; without even the implied warranty of
23 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
24 * GNU General Public License for more details.
25 *
26 * You should have received a copy of the GNU General Public License
27 * along with this program. If not, see <http://www.gnu.org/licenses/>.
28 */
29
30#ifndef LSST_SPHGEOM_CHUNKER_H_
31#define LSST_SPHGEOM_CHUNKER_H_
32
36
37#include <vector>
38#include <cstdint>
39
40#include "Angle.h"
41#include "Box.h"
42
43
44namespace lsst {
45namespace sphgeom {
46
61
62
73class Chunker {
74public:
75 Chunker(std::int32_t numStripes,
76 std::int32_t numSubStripesPerStripe);
77
78 bool operator==(Chunker const & c) const {
79 return _numStripes == c._numStripes &&
80 _numSubStripesPerStripe == c._numSubStripesPerStripe;
81 }
82
83 bool operator!=(Chunker const & c) const {
84 return _numStripes != c._numStripes ||
85 _numSubStripesPerStripe != c._numSubStripesPerStripe;
86 }
87
91 return _numStripes;
92 }
93
97 return _numSubStripesPerStripe;
98 }
99
103
107
111
115
117 bool valid(std::int32_t chunkId) const;
118
120 Box getSubChunkBoundingBox(std::int32_t subStripe, std::int32_t subChunk) const;
121
124 return chunkId / (2 * _numStripes);
125 }
126
129 return chunkId - stripe*2*_numStripes;
130 }
131
132private:
133 struct Stripe {
134 Angle chunkWidth;
135 std::int32_t numChunksPerStripe;
136 std::int32_t numSubChunksPerChunk;
137
138 Stripe() :
139 chunkWidth(0),
140 numChunksPerStripe(0),
141 numSubChunksPerChunk(0)
142 {}
143 };
144
145 struct SubStripe {
146 Angle subChunkWidth;
147 std::int32_t numSubChunksPerChunk;
148
149 SubStripe() : subChunkWidth(), numSubChunksPerChunk(0) {}
150 };
151
152 std::int32_t _getChunkId(std::int32_t stripe, std::int32_t chunk) const {
153 return stripe * 2 * _numStripes + chunk;
154 }
155
156 std::int32_t _getSubChunkId(std::int32_t stripe, std::int32_t subStripe,
157 std::int32_t chunk, std::int32_t subChunk) const {
158 std::int32_t y = subStripe - stripe * _numSubStripesPerStripe;
159 std::int32_t x = subChunk -
160 chunk * _subStripes[subStripe].numSubChunksPerChunk;
161 return y * _maxSubChunksPerSubStripeChunk + x;
162 }
163
164 void _getSubChunks(std::vector<SubChunks> & subChunks,
165 Region const & r,
166 NormalizedAngleInterval const & lon,
167 std::int32_t stripe,
168 std::int32_t chunk,
169 std::int32_t minSS,
170 std::int32_t maxSS) const;
171
172 std::int32_t _numStripes;
173 std::int32_t _numSubStripesPerStripe;
174 std::int32_t _numSubStripes;
175 std::int32_t _maxSubChunksPerSubStripeChunk;
176 Angle _subStripeHeight;
177 std::vector<Stripe> _stripes;
178 std::vector<SubStripe> _subStripes;
179};
180
181}} // namespace lsst::sphgeom
182
183#endif // LSST_SPHGEOM_CHUNKER_H_
Angle represents an angle in radians.
Definition Angle.h:50
Box represents a rectangle in spherical coordinate space that contains its boundary.
Definition Box.h:62
bool operator!=(Chunker const &c) const
Definition Chunker.h:83
std::int32_t getChunk(std::int32_t chunkId, std::int32_t stripe) const
Return the chunk for the given chunkId and stripe.
Definition Chunker.h:128
std::int32_t getNumSubStripesPerStripe() const
getNumSubStripesPerStripe returns the number of fixed-height latitude sub-intervals in each stripe.
Definition Chunker.h:96
std::vector< std::int32_t > getAllChunks() const
getAllChunks returns the complete set of chunk IDs for the unit sphere.
Definition Chunker.cc:265
Chunker(std::int32_t numStripes, std::int32_t numSubStripesPerStripe)
Definition Chunker.cc:64
std::int32_t getNumStripes() const
getNumStripes returns the number of fixed-height latitude intervals in the sky subdivision.
Definition Chunker.h:90
std::vector< std::int32_t > getAllSubChunks(std::int32_t chunkId) const
getAllSubChunks returns the complete set of sub-chunk IDs for the given chunk.
Definition Chunker.cc:276
std::int32_t getStripe(std::int32_t chunkId) const
Return the stripe for the specified chunkId.
Definition Chunker.h:123
std::vector< std::int32_t > getChunksIntersecting(Region const &r) const
getChunksIntersecting returns all the chunks that potentially intersect the given region.
Definition Chunker.cc:110
bool operator==(Chunker const &c) const
Definition Chunker.h:78
std::vector< SubChunks > getSubChunksIntersecting(Region const &r) const
getSubChunksIntersecting returns all the sub-chunks that potentially intersect the given region.
Definition Chunker.cc:155
Box getSubChunkBoundingBox(std::int32_t subStripe, std::int32_t subChunk) const
Definition Chunker.cc:309
Box getChunkBoundingBox(std::int32_t stripe, std::int32_t chunk) const
Definition Chunker.cc:298
bool valid(std::int32_t chunkId) const
Return 'true' if the specified chunk number is valid.
Definition Chunker.cc:292
Region is a minimal interface for 2-dimensional regions on the unit sphere.
Definition Region.h:89
lsst::geom::Angle Angle
Definition misc.h:33
This file declares a class for representing angles.
This file declares a class for representing longitude/latitude angle boxes on the unit sphere.
void swap(SubChunks &sc)
Definition Chunker.h:56
std::vector< std::int32_t > subChunkIds
Definition Chunker.h:52
std::int32_t chunkId
Definition Chunker.h:51
T swap(T... args)