| | \n\n \n \n \n float max=o1+(n1-1)*d1 | \tmaximum value of time \n | \n \n\n \n \n \n float min=o1 | \tminimum value of time \n | \n \n\n \n \n \n int np=n1 | \tmaximum number of picks \n | \n \n\n \n \n \n file npicks= | \tauxiliary output file name \n | \n \n\n \n \n \n int nw=1 | \tnumber of windows \n | \n \n\n \n \n \n bool parab=n [y/n] | \tif y, parabolic interpolation \n | \n \n\n \n \n \n bool removal=y [y/n] | \tif y, remove adjacent events based on semblance \n | \n \n\n \n \n \n file semblance= | \tauxiliary input file name \n | \n \n\n \n \n \n float space=100. | \tminimum distance bewteen picked events \n | \n \n |