I realized, while writing the paper, that the most common transform would be to either perform a logical not or a sign inversion on data. For sign inversion, currently a tranform of "affine(-1,0)" would be required. It turns out, one of the things I realized when looking at the key names is that there is a lot of alias information stored in a typical results file and so it is important to key keep size small. The same applies to transforms. As such, I think we should refactor the transforms as follows:
"inv" - Simple transform that either changes the sign of numerical data or logically inverts booleans
"aff(s,o)" - Applies an affine transformation for the specified scale, s and offset, o.
I realized, while writing the paper, that the most common transform would be to either perform a logical not or a sign inversion on data. For sign inversion, currently a tranform of "affine(-1,0)" would be required. It turns out, one of the things I realized when looking at the key names is that there is a lot of alias information stored in a typical results file and so it is important to key keep size small. The same applies to transforms. As such, I think we should refactor the transforms as follows:
sand offset,o.