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 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449
|
#include <hdf5.h>
#include <visit-hdf5.h>
#if HDF5_VERSION_GE(1, 8, 1)
/**
* @file VsH5Meta.h
*
* @class VsH5Meta
*
* @brief VsH5Meta contains the VizSchema HDF5 data.
*
* groups and datasets that are meshes, datasets that are variables
* and variables with meshes.
*
* Copyright © 2007-2008 by Tech-X Corporation
*/
#ifndef VS_H5_META_H
#define VS_H5_META_H
// std includes
#include <map>
#include <iostream>
#include <string>
#include <vector>
// HDF5
#include <hdf5.h>
// Local
#include "VsUtils.h"
// Attribute metadata
struct VsAMeta {
VsAMeta() {
this->depth = 0;
}
// Virtual distructor
virtual ~VsAMeta() {
H5Aclose(aid);
}
// Name
std::string name;
// Numerical type
hid_t type;
// Dimensions
std::vector<int> dims;
// Total length
size_t getLength() {
size_t len = 1;
for (size_t i = 0; i < dims.size(); ++i) len *= dims[i];
return len;
}
// HDF5 Id
hid_t aid;
// Depth in the hierarchy
size_t depth;
void write(std::ostream& os, const std::string& x = "attribute ") const {
std::string offset = "";
for(size_t i = 0; i<depth; ++i) offset += " ";
os << offset<< "Attribute "<< this->name << std::endl;
os << offset<< " rank = " << dims.size() << std::endl;
}
};
// Metadata for interfaces (groups and datasets)
struct VsIMeta {
VsIMeta () {
this->isGroup = false;
this->isMesh = 0;
this->isVariable = 0;
this->isVariableWithMesh = 0;
this->depth = 0;
this->name = "error";
this->path = "error";
}
virtual ~VsIMeta() {
std::vector<VsAMeta*>::const_iterator i;
for (i = attribs.begin(); i != attribs.end(); ++i)
delete (*i);
attribs.clear();
}
// Name
std::string name;
// Fully qualified name
std::string path;
// HDF5 ID
hid_t iid;
// Depth in the hierarchy
size_t depth;
// List of attributes
std::vector<VsAMeta*> attribs;
std::string getFullName() const {
return makeCanonicalName(path, name);
}
// Write attributes
void write(std::ostream& os) const {
if (attribs.empty()) return;
std::vector<VsAMeta*>::const_iterator i;
for (i=attribs.begin(); i != attribs.end(); ++i)
(*i)->write(os);
}
// Find attribute by name, or return NULL if not found
const VsAMeta* find(const std::string name) const {
std::vector<VsAMeta*>::const_iterator i;
for (i=attribs.begin(); i != attribs.end(); ++i) {
if ((*i)->name == name) return *i;
}
return NULL;
}
// Is it a group or dataset
bool isGroup;
// Is it a variable
bool isVariable;
// Is it a variable with mesh
bool isVariableWithMesh;
// Is it a mesh
bool isMesh;
std::string getStringAttribute(std::string attName) const {
const VsAMeta* att = find(attName);
if (!att) {
return "";
}
std::string result;
getAttributeHelper(att->aid, &result, 0, 0);
return result;
}
};
// Metadata for datasets
struct VsDMeta : public VsIMeta {
// Virtual destructor
virtual ~VsDMeta() {
H5Dclose(iid);
}
// Dimensions
std::vector<int> dims;
// Total length
size_t getLength() {
size_t len = 1;
for (size_t i = 0; i < dims.size(); ++i) len *= dims[i];
return len;
}
// Numerical type
hid_t type;
void write(std::ostream& os) const {
std::string offset = "";
for(size_t i = 0; i<depth; ++i) offset += " ";
os << offset<< "Dataset "<< this->name << std::endl;
os << offset<<"Fully qualified name: " <<getFullName() <<std::endl;
VsIMeta::write(os);
}
};
// Metadata for groups
struct VsGMeta : public VsIMeta {
VsGMeta() {
isGroup= true;
isVsVars = false;
}
virtual ~VsGMeta () {
std::vector<VsDMeta*>::const_iterator i;
for (i = datasets.begin(); i != datasets.end(); ++i) delete (*i);
datasets.clear();
H5Gclose(iid);
}
// List of datasets
std::vector<VsDMeta*> datasets;
// Is it a vsVars group?
bool isVsVars;
void write(std::ostream& os) const {
std::string offset = "";
for(size_t i = 0; i<depth; ++i) offset += " ";
os << offset << "Group = " << name << std::endl;
std::vector<VsDMeta*>::const_iterator i;
for (i=datasets.begin(); i != datasets.end(); ++i) (*i)->write(os);
VsIMeta::write(os);
}
};
struct VsH5Meta {
// This struct is a list of all groups which are meshes,
// all datasets that are meshes, varsWithMeshes and variables.
// Each such dataset and group has a list of their attributes only.
VsH5Meta() : ptr(NULL) {
}
virtual ~VsH5Meta() {
clear();
}
const bool hasObjects() const {
return !(gMeshes.empty() && dMeshes.empty() && vars.empty() && varsWithMesh.empty() && vsVars.empty());
}
//list of all datasets
std::map<std::string, VsDMeta*> datasets;
const VsDMeta* getDataset (const std::string& name) const {
// Make name fully qualified
std::string fullName = makeCanonicalName(name);
// std::cerr << "Datasets - Looking for " << fullName << " from " << name << std::endl;
// std::map<std::string, VsDMeta*>::const_iterator i;
// for (i = datasets.begin(); i != datasets.end(); ++i) std::cerr << (const std::string)i->first << std::endl;
//look for fully qualified name
std::map<std::string, VsDMeta*>::const_iterator it = datasets.find(fullName);
if (it != datasets.end()) {
//found it!
return (const VsDMeta*)it->second;
}
return NULL;
}
//list of "orphaned" datasets - i.e. have no known parent
std::vector<VsDMeta*> orphanDatasets;
// List of group-meshes
std::map<std::string, VsGMeta*> gMeshes;
const VsGMeta* getGMesh(const std::string& name) const {
//if the name does not start with a "/",
// it is not fully qualified
// and we assume it is in the root group
// If not found in root, we search the namespace
// and if we find that mesh, and it's unique, we return it
// If there is a name conflict, we return 0
// Make name fully qualified
std::string fullName = makeCanonicalName(name);
//look for fully qualified name
std::map<std::string, VsGMeta*>::const_iterator it = gMeshes.find(fullName);
if (it != gMeshes.end()) {
//found it!
return (const VsGMeta*)it->second;
}
//Didn't find fully qualified name, do a global search for simple name
VsGMeta* foundMesh = 0;
for (it = gMeshes.begin(); it != gMeshes.end(); ++it) {
VsGMeta* candidate = it->second;
if (candidate->name.compare(name) == 0) {
//Found a matching name
//But have we already found a match, and this is a conflict?
if (foundMesh != 0) {
//THIS NAME IS A CONFLICT IN A FLATTENED NAMESPACE
//so we're unable to decide which to return
return 0;
}
foundMesh = candidate;
}
} //end loop
return (const VsGMeta*)foundMesh; //might still be zero
}
// List of dataset-meshes
std::map<std::string, VsDMeta*> dMeshes;
const VsDMeta* getDMesh(const std::string& name) const {
//if the name does not start with a "/",
// it is not fully qualified
// and we assume it is in the root group
// If not found in root, we search the namespace
// and if we find that mesh, and it's unique, we return it
// If there is a name conflict, we return 0
// Make name fully qualified
std::string fullName = makeCanonicalName(name);
//look for fully qualified name
std::map<std::string, VsDMeta*>::const_iterator it = dMeshes.find(fullName);
if (it != dMeshes.end()) {
//found it!
return (const VsDMeta*)it->second;
}
//not found, do global search
VsDMeta* foundMesh = 0;
for (it = dMeshes.begin(); it != dMeshes.end(); ++it) {
VsDMeta* candidate = it->second;
if (candidate->name.compare(name) == 0) {
//Found a matching name
//But have we already found a match, and this is a conflict?
if (foundMesh != 0) {
//THIS NAME IS A CONFLICT IN A FLATTENED NAMESPACE
//so we're unable to decide which to return
return 0;
}
foundMesh = candidate;
}
} //end loop
return (const VsDMeta*)foundMesh; //might be zero
}
// List of dataset-variables
std::map<std::string, VsDMeta*> vars;
const VsDMeta* getVar(const std::string& name) const {
//if the name does not start with a "/",
// it is not fully qualified
// and we assume it is in the root group
// If not found in root, we search the namespace
// and if we find that mesh, and it's unique, we return it
// If there is a name conflict, we return 0
// Make name fully qualified
std::string fullName = makeCanonicalName(name);
//look for fully qualified name
std::map<std::string, VsDMeta*>::const_iterator it = vars.find(fullName);
if (it != vars.end()) {
//found it
return (const VsDMeta*)it->second;
}
//not found, do global search
VsDMeta* foundVar = 0;
for (it = vars.begin(); it != vars.end(); ++it) {
VsDMeta* candidate = it->second;
if (candidate->name.compare(name) == 0) {
//Found a matching name
//But have we already found a match, and this is a conflict?
if (foundVar != 0) {
//THIS NAME IS A CONFLICT IN A FLATTENED NAMESPACE
//so we're unable to decide which to return
return 0;
}
foundVar = candidate;
}
} //end loop
return (const VsDMeta*)foundVar; //might be zero
}
// List of dataset-variable with meshes
std::map<std::string, VsDMeta*> varsWithMesh;
// List of vsVars groups
std::map<std::string, VsGMeta*> vsVars;
// Pointer to the last iterated group
void* ptr;
// Clean itself
void clear() {
// Need to delete all pointers
std::map<std::string, VsGMeta*>::const_iterator i;
for (i=gMeshes.begin(); i != gMeshes.end(); ++i)
delete i->second;
for(i=vsVars.begin(); i !=vsVars.end(); ++i)
delete i->second;
std::map<std::string, VsDMeta*>::const_iterator k;
for (k=dMeshes.begin(); k != dMeshes.end(); ++k)
delete k->second;
for (k=vars.begin(); k != vars.end(); ++k)
delete k->second;
for (k=varsWithMesh.begin(); k != varsWithMesh.end(); ++k)
delete k->second;
std::vector<VsDMeta*>::const_iterator j;
for (j=orphanDatasets.begin(); j != orphanDatasets.end(); ++j)
delete (*j);
// Clean lists
gMeshes.clear();
dMeshes.clear();
vars.clear();
varsWithMesh.clear();
vsVars.clear();
orphanDatasets.clear();
}
// Write
void write(std::ostream& os) const {
std::map<std::string, VsGMeta*>::const_iterator i;
if (gMeshes.size()) os << "gMeshes"<<std::endl;
for (i=gMeshes.begin(); i != gMeshes.end(); ++i) {
i->second->write(os);
}
std::map<std::string, VsDMeta*>::const_iterator k;
if (dMeshes.size()) os <<"dMeshes"<< std::endl;
for (k=dMeshes.begin(); k != dMeshes.end(); ++k) {
k->second->write(os);
}
if (vars.size()) os << "vars" << std::endl;
for (k=vars.begin(); k != vars.end(); ++k) {
k->second->write(os);
}
if (varsWithMesh.size()) os << "varsWithMesh" << std::endl;
for (k=varsWithMesh.begin(); k != varsWithMesh.end(); ++k) {
k->second->write(os);
}
if (vsVars.size()) os <<"vsVars" << std::endl;
for (i=vsVars.begin(); i !=vsVars.end(); ++i) {
i->second->write(os);
}
}
};
#endif
#endif
|