summaryrefslogtreecommitdiffstats
path: root/tools/testfiles/tindicessub1.ddl
Commit message (Collapse)AuthorAgeFilesLines
* [svn-r20869] Purpose:Jonathan Kim2011-05-191-3/+0
| | | | | | | | | | | HDFFV-7514 - GMQS: h5dump - improve effectiveness of testing scripts for handling expected output files Description: Fist phase for h5dump test update. Next phase will be for h5ls. This is prerequisite for 'HDFFV-7602 Tools - upgrade tools' test scripts to share test files among tools, providing framework for test file re-usability.' Tested: jam (linux32-LE), koala (linux64-LE), heiwa (linuxppc64-BE), linew (solaris-BE), Windows (32-LE), Cmake (jam)
* [svn-r14437] bug fix for h5dump subsetting (deal with blocks)and new test runsPedro Vicente Nunes2008-01-161-1/+1
| | | | | | | | | | | | | | | | | | | | | | | | | add a check for block overlap after the command line parsing * Algorithm * * In a inner loop, the parameters from SSET are translated into temporary * variables so that 1 row is printed at a time (getting the coordinate indices * at each row). * We define the stride, count and block to be 1 in the row dimension to achieve * this and advance until all points are printed. * An outer loop for cases where dimensionality is greater than 2D is made. * In each iteration, the 2D block is displayed in the inner loop. The remaining * slower dimensions above the first 2 are incremented one at a time in the outer loop * * The element position is obtained from the matrix according to: * 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 * tested: windows, linux
* [svn-r14409] more progress on the block hyperslab bug, clean code Pedro Vicente Nunes2008-01-141-8/+6
| | | | | | modified the 1D test case for subsetting with block and stride factors tested: windows, linux
* [svn-r13134] Pedro Vicente Nunes2007-01-101-40/+3
| | | | | | | | | | 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.
* [svn-r13064] Pedro Vicente Nunes2006-12-141-0/+57
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