\n \n \n \n \n \n

\n Synopsis
		sfmpistack mode=0 verb=n seq=n nf= jf=1 of=0 shots= prefix= oname=

\nMode specifies whether to add, multiply, divide or subtract.
\n
\nmode=0 - add
\nmode=1 - multiply
\n
\nIf useprefix is set, then:
\n
\nassume that files are commonly named sequentially, e.g.:
\n
\nFile001.rsf
\nFile002.rsf
\nFile003.rsf ...
\nFileN.rsf
\n
\nSuch that all files can be represented as a prefix, which
\nis a printf like statement that will be evaluated for all
\nfiles to be included in a range.
\n
\nFor the above example the prefix would be:
\n
\nprefix="File%03d.rsf"
\n
\nThe nf, jf, and of parameters specify a range of numbers to evaluate the
\nprefix for, giving the program filenames to be used for summing
\ntogether. For example:
\n
\nnf=10,of=0,jf=1 --> (0,1,2,3,4,5,6,7,8,9,10)
\nnf=10,of=5,jf=2 --> (5,7,9,11,13,15,17,19,21,23)
\n
\nIf there are more files than processes, then this program will subdivide
\nthe files onto various processes, and run multiple rounds until
\neverything is done.
\n
\nThis program does not care about dimensionality! It treats every file
\nas a 1D array and writes out a 1D array, and then modifies the header
\nto match the input file size.
\n
\n\n

\n \n \n \n \n \n

\n Parameters
		\n \n \n \n   int jf=1 \tdelta between files \n \n \n\n \n \n \n   int mode=0 \toperation for stack \n \n \n\n \n \n \n   int nf= \tnumber of files to stack \n \n \n\n \n \n \n   int of=0 \torigin of files \n \n \n\n \n \n \n   string oname= \tname of output file \n \n \n\n \n \n \n   string prefix= \tprintf like prefix (printf like prefix) \n \n \n\n \n \n \n   bool seq=n [y/n] \tnot sequentially ordered files \n \n \n\n \n \n \n   string shots= \t \n \n \n\n \n \n \n   bool verb=n [y/n] \t \n \n \n

'