1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332
|
// -*- mode: c++; c-basic-offset:4 -*-
// This file is part of libdap, A C++ implementation of the OPeNDAP Data
// Access Protocol.
// Copyright (c) 2002,2003 OPeNDAP, Inc.
// Author: James Gallagher <jgallagher@opendap.org>
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
//
// You can contact OPeNDAP, Inc. at PO Box 112, Saunderstown, RI. 02874-0112.
// (c) COPYRIGHT URI/MIT 1994-1999
// Please read the full copyright statement in the file COPYRIGHT_URI.
//
// Authors:
// jhrg,jimg James Gallagher <jgallagher@gso.uri.edu>
// Class for array variables. The dimensions of the array are stored in the
// list SHAPE.
//
// jhrg 9/6/94
#ifndef _array_h
#define _array_h 1
#include <string>
#include <vector>
#ifndef _dods_limits_h
#include "dods-limits.h"
#endif
#ifndef _vector_h
#include "Vector.h"
#endif
// #include "D4Dimensions.h"
namespace libdap {
class D4Group;
class D4Maps;
class XMLWriter;
class D4Dimension;
class D4Dimensions;
const int DODS_MAX_ARRAY = DODS_INT_MAX;
/** This class is used to hold arrays of data. The elements of the array can
be simple or compound data types. There is no limit on the number of
dimensions an array can have, or on the size of each dimension.
If desired, the user can give each dimension of an array a name. You can,
for example, have a 360x180 array of temperatures, covering the whole
globe with one-degree squares. In this case, you could name the first
dimension \e Longitude and the second dimension \e Latitude. This can
help prevent a great deal of confusion.
The Array is used as part of the Grid class, where the dimension names
are crucial to its structure. The dimension names correspond to \e Map
vectors, holding the actual values for that column of the array.
In DAP4, the Array may be a Coverage or a simple Array. In the former case
the Array will have both named dimensions and maps, where the maps (instances
of D4Map) are what make the Array a Coverage. Coverages are a generalization
of DAP2 Grids.
Each array dimension carries with it its own projection information. The
projection information takes the form of three integers: the start, stop,
and stride values. This is clearest with an example. Consider a
one-dimensional array 10 elements long. If the start value of the
dimension constraint is 3, then the constrained array appears to be seven
elements long. If the stop value is changed to 7, then the array appears
to be five elements long. If the stride is changed to two, the array will
appear to be 3 elements long. Array constraints are written as:
<b>[start:stride:stop]</b>.
\verbatim
A = [1 2 3 4 5 6 7 8 9 10]
A[3::] = [4 5 6 7 8 9 10]
A[3::7] = [4 5 6 7 8]
A[3:2:7] = [4 6 8]
A[0:3:9] = [1 4 7 10]
\endverbatim
@note Arrays use zero-based indexing.
@note This class is used for both DAP2 and DAP4.
@note An interesting 'feature' of the DAP4 Array is that its Maps are added
after construction. None of the Array constructors build the Maps, but the
copy ctor is _supposed_ to copy it correctly. The original design has pointers
for the parent and the source of the Map's value, but the actual 'parent'
array is the object being constructed, so it does not exist! I have thus replaced
the pointers with paths. Use the dataset's root group find_var() method to
get the objects. The root group can be found using the new BaseType::get_ancestor()
method. jhrg 9/16/22
@brief A multidimensional array of identical data types.
@see Grid
@see Vector
@see dimension */
class Array : public Vector {
public:
/** Information about a dimension. Each Array has one or more dimensions.
For each of an Array's dimensions, a corresponding instance of this
struct holds the natural size, name, constraint information and
constrained size.
@note Instead of using this struct's fields directly, use Array's
dimension accessor methods.
@note This struct is public because its type is used in public
typedefs. */
struct dimension {
// In DAP2, the name and size of a dimension is stored here, along
// with information about any constraint. In DAP4, either the name
// and size are stored in the two fields below _or_ the name and
// size information comes from a dimension object defined in a
// group that is referenced by the 'dim' pointer. Do not free this
// pointer; it is shared between the array and the Group where the
// Dimension is defined. To keep Array manageable to implement, size
// will be set here using the value from 'dim' if it is not null.
int64_t size; ///< The unconstrained dimension size.
string name; ///< The name of this dimension.
D4Dimension *dim; ///< If not null, a weak pointer to the D4Dimension
// when a DMR is printed for a data response, if an array uses shared
// dimensions and those sdims have been sliced, make sure to use those
// and get the syntax correct. That's what this field does - in every
// case the array records the sizes of its dimensions and their slices
// regardless of whether they were provided explicitly in a CE or inherited
// from a sliced sdim.
bool use_sdim_for_slice; ///< Used to control printing the DMR in data responses
int64_t start; ///< The constraint start index
int64_t stop; ///< The constraint end index
int64_t stride; ///< The constraint stride
int64_t c_size; ///< Size of dimension once constrained
dimension() : size(0), name(""), dim(0), use_sdim_for_slice(false) {
// this information changes with each constraint expression
start = 0;
stop = 0;
stride = 1;
c_size = size;
}
dimension(int64_t s, string n) : size(s), name(n), dim(0), use_sdim_for_slice(false) {
start = 0;
stop = size - 1;
stride = 1;
c_size = size;
}
explicit dimension(D4Dimension *d);
};
// The following two structs are for the direct IO optimization.
// The variable chunk and compression information need to be passed
// between two BES modules. The ideal approach is to use the
// dynamic_cast for a BES module to retrieve the information stored
// by another module. However, there are issues in the current BES
// that prevent us from implementing in this way.
// So we need to use libdap to do the job.
struct var_chunk_info_t {
unsigned int filter_mask;
unsigned long long chunk_direct_io_offset;
unsigned long long chunk_buffer_size;
vector<unsigned long long> chunk_coords;
};
struct var_storage_info {
string filter;
vector<unsigned int> deflate_levels;
vector<size_t> chunk_dims;
vector<var_chunk_info_t> var_chunk_info;
};
private:
D4Maps *d_maps = nullptr;
std::vector<dimension> _shape; // list of dimensions (i.e., the shape)
bool direct_io_flag = false;
var_storage_info vs_info;
void update_dimension_pointers(D4Dimensions *old_dims, D4Dimensions *new_dims);
friend class ArrayTest;
friend class D4Group;
protected:
void _duplicate(const Array &a);
uint64_t print_array(FILE *out, uint64_t index, unsigned int dims, uint64_t shape[]);
uint64_t print_array(ostream &out, uint64_t index, unsigned int dims, uint64_t shape[]);
std::vector<dimension> &shape() { return _shape; }
public:
/** A constant iterator used to access the various dimensions of an
Array.
@see dim_begin()
@see dim_end() */
typedef std::vector<dimension>::const_iterator Dim_citer;
/** An iterator used to access the various dimensions of an
Array. Most of the methods that access various properties of a
dimension use an instance of Dim_iter.
@see dim_begin()
@see dim_end() */
typedef std::vector<dimension>::iterator Dim_iter;
Array(const string &n, BaseType *v, bool is_dap4 = false);
Array(const string &n, const string &d, BaseType *v, bool is_dap4 = false);
Array(const Array &rhs);
virtual ~Array();
Array &operator=(const Array &rhs);
BaseType *ptr_duplicate() override;
bool is_dap2_grid();
void transform_to_dap4(D4Group *root, Constructor *container) override;
std::vector<BaseType *> *transform_to_dap2(AttrTable *parent_attr_table) override;
void add_var(BaseType *v, Part p = nil) override;
void add_var_nocopy(BaseType *v, Part p = nil) override;
void append_dim(int size, const string &name = "");
void append_dim_ll(int64_t size, const string &name = "");
void append_dim(D4Dimension *dim);
void prepend_dim(int size, const string &name = "");
void prepend_dim(D4Dimension *dim);
void clear_all_dims();
void rename_dim(const string &oldName = "", const string &newName = "");
virtual void add_constraint(Dim_iter i, int start, int stride, int stop);
virtual void add_constraint_ll(Dim_iter i, int64_t start, int64_t stride, int64_t stop);
virtual void add_constraint(Dim_iter i, D4Dimension *dim);
virtual void reset_constraint();
virtual void clear_constraint(); // deprecated
virtual void update_length(int size = 0); // should be used internally only
virtual void update_length_ll(unsigned long long size = 0); // should be used internally only
Dim_iter dim_begin();
Dim_iter dim_end();
virtual int dimension_size(Dim_iter i, bool constrained = false);
virtual int dimension_start(Dim_iter i, bool constrained = false);
virtual int dimension_stop(Dim_iter i, bool constrained = false);
virtual int dimension_stride(Dim_iter i, bool constrained = false);
virtual int64_t dimension_size_ll(Dim_iter i, bool constrained = false);
virtual int64_t dimension_start_ll(Dim_iter i, bool constrained = false);
virtual int64_t dimension_stop_ll(Dim_iter i, bool constrained = false);
virtual int64_t dimension_stride_ll(Dim_iter i, bool constrained = false);
virtual string dimension_name(Dim_iter i);
virtual D4Dimension *dimension_D4dim(Dim_iter i);
virtual unsigned int dimensions(bool constrained = false);
virtual D4Maps *maps();
void print_dap4(XMLWriter &xml, bool constrained = false) override;
// These are all DAP2 output methods
void print_decl(ostream &out, string space = " ", bool print_semi = true, bool constraint_info = false,
bool constrained = false) override;
void print_xml(ostream &out, string space = " ", bool constrained = false) override;
void print_xml_writer(XMLWriter &xml, bool constrained = false) override;
virtual void print_xml_writer_core(XMLWriter &out, bool constrained, string tag);
virtual void print_as_map_xml_writer(XMLWriter &xml, bool constrained);
virtual void print_xml_core(FILE *out, string space, bool constrained, string tag);
virtual void print_xml_core(ostream &out, string space, bool constrained, string tag);
// not used (?)
virtual void print_as_map_xml(ostream &out, string space = " ", bool constrained = false);
void print_val(ostream &out, string space = "", bool print_decl_p = true) override;
void print_xml(FILE *out, string space = " ", bool constrained = false) override;
virtual void print_as_map_xml(FILE *out, string space = " ", bool constrained = false);
void print_val(FILE *out, string space = "", bool print_decl_p = true) override;
void print_decl(FILE *out, string space = " ", bool print_semi = true, bool constraint_info = false,
bool constrained = false) override;
bool check_semantics(string &msg, bool all = false) override;
bool is_dap4_projected(std::vector<std::string> &projected_dap4_inventory) override;
void dump(ostream &strm) const override;
// The following methods are for direct IO optimization.
bool get_dio_flag() const { return direct_io_flag; }
void set_dio_flag(bool dio_flag_value = true) { direct_io_flag = dio_flag_value; }
var_storage_info &get_var_storage_info() { return vs_info; }
void set_var_storage_info(const var_storage_info &my_vs_info);
};
} // namespace libdap
#endif // _array_h
|