hdf5/tools/testfiles/tindicessub1.ddl

#############################
Expected output for 'h5dump -d 1d -s 3 -c 40 taindices.h5'
#############################
HDF5 "taindices.h5" {
DATASET "1d" {
   DATATYPE  H5T_STD_I32LE
   DATASPACE  SIMPLE { ( 100 ) / ( 100 ) }
   SUBSET {
      START ( 3 );
      STRIDE ( 1 );
      COUNT ( 40 );
      BLOCK ( 1 );
      DATA {
      (3): 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
      (21): 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36,
      (37): 37, 38, 39, 40, 41, 42
      }
   }
}
}
[svn-r13064] Fix several bugs 1) the parsing of subsetting was using atoi to convert the parameter to an int, which caused problems for numbers greater that int. Substitute with atof 2) the printing of indices in the subsetting case was not being done. Solution: calculate the element position at the start of the subsetting using the algorythm Given an index I(z,y,x) its position from the beginning of an array of sizes A(size_z, size_y,size_x) is given by Position of I(z,y,x) = index_z * size_y * size_x + index_y * size_x + index_x And pass that position to the function that dumps data, h5tools_dump_simple_data. 3) several index counters were declared as int, use hsize_t instead 4) modified the test generation program so that it includes test cases for subsetting of 1d, 2d, 3d, and 4d arrays and add these tests to the shell script 2006-12-15 05:18:08 +08:00			`#############################`
			`Expected output for 'h5dump -d 1d -s 3 -c 40 taindices.h5'`
			`#############################`
			`HDF5 "taindices.h5" {`
			`DATASET "1d" {`
			`DATATYPE H5T_STD_I32LE`
			`DATASPACE SIMPLE { ( 100 ) / ( 100 ) }`
			`SUBSET {`
			`START ( 3 );`
			`STRIDE ( 1 );`
			`COUNT ( 40 );`
			`BLOCK ( 1 );`
			`DATA {`
[svn-r13134] New version of the function h5tools_dump_simple_subset, to display subsetting. The new algorithm is: Introduced an outer loop for cases where dimensionality is greater than 2D. In each iteration a 2D block is displayed by rows in a inner loop. The remainning slower dimensions above the first 2 are incremented one at a time in the outer loop Note: when blocks are introduced, the display is not correct. This is a bug that requires an improvement of the algorithm. 2007-01-11 03:15:16 +08:00			`(3): 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20,`
			`(21): 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36,`
			`(37): 37, 38, 39, 40, 41, 42`
[svn-r13064] Fix several bugs 1) the parsing of subsetting was using atoi to convert the parameter to an int, which caused problems for numbers greater that int. Substitute with atof 2) the printing of indices in the subsetting case was not being done. Solution: calculate the element position at the start of the subsetting using the algorythm Given an index I(z,y,x) its position from the beginning of an array of sizes A(size_z, size_y,size_x) is given by Position of I(z,y,x) = index_z * size_y * size_x + index_y * size_x + index_x And pass that position to the function that dumps data, h5tools_dump_simple_data. 3) several index counters were declared as int, use hsize_t instead 4) modified the test generation program so that it includes test cases for subsetting of 1d, 2d, 3d, and 4d arrays and add these tests to the shell script 2006-12-15 05:18:08 +08:00			`}`
			`}`
			`}`
			`}`