private int getMaximum ( ) { int max = 0 ; for ( int x = 0 ; x <= T . length - 1 ; x ++ ) { if ( T [ x ] > max ) max = T [ x ] ; if ( A [ x ] > max ) max = A [ x ] ; if ( C [ x ] > max ) max = C [ x ] ; if ( G [ x ] > max ) max = G [ x ] ; } return max ; }
Get the maximum height of any of the traces . The data is persisted for performance in the event of multiple calls but it initialized lazily .