lsst.sphgeom gbd998247f1+585e252eca
Loading...
Searching...
No Matches
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 <stdint.h>
38#include <vector>
39
40#include "Angle.h"
41#include "Box.h"
42
43
44namespace lsst {
45namespace sphgeom {
46
50struct SubChunks {
51 int32_t chunkId;
52 std::vector<int32_t> subChunkIds;
53
54 SubChunks() : chunkId(-1) {}
55
56 void swap(SubChunks & sc) {
57 std::swap(chunkId, sc.chunkId);
58 subChunkIds.swap(sc.subChunkIds);
59 }
60};
61
62
73class Chunker {
74public:
75 Chunker(int32_t numStripes,
76 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
90 int32_t getNumStripes() const {
91 return _numStripes;
92 }
93
96 int32_t getNumSubStripesPerStripe() const {
97 return _numSubStripesPerStripe;
98 }
99
102 std::vector<int32_t> getChunksIntersecting(Region const & r) const;
103
106 std::vector<SubChunks> getSubChunksIntersecting(Region const & r) const;
107
110 std::vector<int32_t> getAllChunks() const;
111
114 std::vector<int32_t> getAllSubChunks(int32_t chunkId) const;
115
117 bool valid(int32_t chunkId) const;
118
119 Box getChunkBoundingBox(int32_t stripe, int32_t chunk) const;
120 Box getSubChunkBoundingBox(int32_t subStripe, int32_t subChunk) const;
121
123 int32_t getStripe(int32_t chunkId) const {
124 return chunkId / (2 * _numStripes);
125 }
126
128 int32_t getChunk(int32_t chunkId, int32_t stripe) const {
129 return chunkId - stripe*2*_numStripes;
130 }
131
132private:
133 struct Stripe {
134 Angle chunkWidth;
135 int32_t numChunksPerStripe;
136 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 int32_t numSubChunksPerChunk;
148
149 SubStripe() : subChunkWidth(), numSubChunksPerChunk(0) {}
150 };
151
152 int32_t _getChunkId(int32_t stripe, int32_t chunk) const {
153 return stripe * 2 * _numStripes + chunk;
154 }
155
156 int32_t _getSubChunkId(int32_t stripe, int32_t subStripe,
157 int32_t chunk, int32_t subChunk) const {
158 int32_t y = subStripe - stripe * _numSubStripesPerStripe;
159 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 int32_t stripe,
168 int32_t chunk,
169 int32_t minSS,
170 int32_t maxSS) const;
171
172 int32_t _numStripes;
173 int32_t _numSubStripesPerStripe;
174 int32_t _numSubStripes;
175 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_
This file declares a class for representing angles.
This file declares a class for representing longitude/latitude angle boxes on the unit sphere.
Definition Angle.h:50
Definition Box.h:61
Definition Chunker.h:73
std::vector< int32_t > getAllChunks() const
Definition Chunker.cc:265
int32_t getStripe(int32_t chunkId) const
Return the stripe for the specified chunkId.
Definition Chunker.h:123
int32_t getNumSubStripesPerStripe() const
Definition Chunker.h:96
int32_t getChunk(int32_t chunkId, int32_t stripe) const
Return the chunk for the given chunkId and stripe.
Definition Chunker.h:128
std::vector< int32_t > getAllSubChunks(int32_t chunkId) const
Definition Chunker.cc:276
std::vector< SubChunks > getSubChunksIntersecting(Region const &r) const
Definition Chunker.cc:155
int32_t getNumStripes() const
Definition Chunker.h:90
bool valid(int32_t chunkId) const
Return 'true' if the specified chunk number is valid.
Definition Chunker.cc:292
std::vector< int32_t > getChunksIntersecting(Region const &r) const
Definition Chunker.cc:110
Definition Region.h:86
Definition Chunker.h:50