ifc.bim.openecg.jtools.jparser
Class Sect000

java.lang.Object
  |
  +--ifc.bim.openecg.jtools.jparser.SectGen
        |
        +--ifc.bim.openecg.jtools.jparser.Sect000

public class Sect000

extends SectGen

The structure of Section 0 with methods to parse data

Nested Class Summary

class

Sect000.Pointer The structure of a section pointer

Field Summary

Sect000.Pointer[]

ptrs Stores the sections' pointers

Fields inherited from class ifc.bim.openecg.jtools.jparser.SectGen

data, head, indx, log

Constructor Summary

Sect000()
Constructs a Sect0 with an anonymous logger

Sect000(java.util.logging.Logger log)
Constructs a Sect0 that uses a specific logger

Method Summary

(package private) void	mergesort(Sect000.Pointer[] a, int low, int high) An implementation of the "mergesort" iterative sorting algorithm
void	Parse(int lNum) Parse the data part retrieving the value of single fields
void	PrnInfo() Prints basic useful informations about this section

Methods inherited from class ifc.bim.openecg.jtools.jparser.SectGen

Load, readByte, readFully, readInt, readShort

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

ptrs

public Sect000.Pointer[] ptrs

Stores the sections' pointers

Constructor Detail

Sect000

public Sect000()

Constructs a Sect0 with an anonymous logger

Sect000

public Sect000(java.util.logging.Logger log)

Constructs a Sect0 that uses a specific logger

Parameters:

log - the logger to be used

Method Detail

Parse

public void Parse(int lNum)
           throws java.lang.Exception

Parse the data part retrieving the value of single fields

Overrides:

Parse in class SectGen

Parameters:

lNum - total number of leads stored in the SCP-ECG record (irrilevant for this section)

Throws:

java.lang.Exception - if any error occours during the operation

PrnInfo

public void PrnInfo()

Prints basic useful informations about this section

Overrides:

PrnInfo in class SectGen

mergesort

void mergesort(Sect000.Pointer[] a,
               int low,
               int high)

An implementation of the "mergesort" iterative sorting algorithm

Parameters:

a - the array to be sorted

low - the lowest boundary of the sub-array to be sorted

high - the highest boundary of the sub-array to be sorted