summaryrefslogtreecommitdiffstats
path: root/c++/examples/create.cpp
blob: 6ccba16fc6e80752178c19011905cdf64e9db5bf (plain)
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
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
  * Copyright by the Board of Trustees of the University of Illinois.         *
  * All rights reserved.                                                      *
  *                                                                           *
  * This file is part of HDF5.  The full HDF5 copyright notice, including     *
  * terms governing use, modification, and redistribution, is contained in    *
  * the files COPYING and Copyright.html.  COPYING can be found at the root   *
  * of the source code distribution tree; Copyright.html can be found at the  *
  * root level of an installed copy of the electronic HDF5 document set and   *
  * is linked from the top-level documents page.  It can also be found at     *
  * http://hdf.ncsa.uiuc.edu/HDF5/doc/Copyright.html.  If you do not have     *
  * access to either file, you may request a copy from hdfhelp@ncsa.uiuc.edu. *
  * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

//  
//  This example writes a dataset to a new HDF5 file.
//
 
#include <string>
#ifndef H5_NO_NAMESPACE
using namespace std;
#endif

#ifdef OLD_HEADER_FILENAME
#include <iostream.h>
#else
#include <iostream>
#endif
#include "H5Cpp.h"

#ifndef H5_NO_NAMESPACE
using namespace H5;
#endif

const string	FILE_NAME( "SDS.h5" );
const string	DATASET_NAME( "IntArray" );
const int 	NX = 5;                    // dataset dimensions
const int 	NY = 6;
const int 	RANK = 2;

int main (void)
{
   // 
   // Data initialization. 
   //
   int i, j;
   int data[NX][NY];          // buffer for data to write
   for (j = 0; j < NX; j++)
   {
      for (i = 0; i < NY; i++)
	 data[j][i] = i + j;
   }     
   //
   // 0 1 2 3 4 5 
   // 1 2 3 4 5 6
   // 2 3 4 5 6 7
   // 3 4 5 6 7 8
   // 4 5 6 7 8 9
   //

   // Try block to detect exceptions raised by any of the calls inside it
   try
   {
      //
      // Create a new file using H5F_ACC_TRUNC access,
      // default file creation properties, and default file
      // access properties.
      //
      H5File file( FILE_NAME, H5F_ACC_TRUNC );

      //
      // Define the size of the array and create the data space for fixed
      // size dataset. 
      //
      hsize_t     dimsf[2];              // dataset dimensions
      dimsf[0] = NX;
      dimsf[1] = NY;
      DataSpace dataspace( RANK, dimsf ); 

      // 
      // Define datatype for the data in the file.
      // We will store little endian INT numbers.
      //
      IntType datatype( PredType::NATIVE_INT );
      datatype.setOrder( H5T_ORDER_LE );

      //
      // Create a new dataset within the file using defined dataspace and
      // datatype and default dataset creation properties.
      //
      DataSet dataset = file.createDataSet( DATASET_NAME, datatype, dataspace );

      //
      // Write the data to the dataset using default memory space, file
      // space, and transfer properties.
      //
      dataset.write( data, PredType::NATIVE_INT );
   }  // end of try block

   // catch failure caused by the H5File operations
   catch( FileIException error )
   {
      error.printError();
   }

   // catch failure caused by the DataSet operations
   catch( DataSetIException error )
   {
      error.printError();
   }

   // catch failure caused by the DataSpace operations
   catch( DataSpaceIException error )
   {
      error.printError();
   }

   // catch failure caused by the DataSpace operations
   catch( DataTypeIException error )
   {
      error.printError();
   }

   return 0;  // successfully terminated
}