On 5. Sep 2019, at 23:40, Marshall Schor <[email protected]> wrote: > > The normal way to get the "binary search" kind of behavior is to get a plain > iterator over the sorted index, and then use the moveTo method, specifying a > target FS as the one to move to. The target FS can be a "temporary" FS, one > that is never added to the indexes, itself; it is just used to supply values > used in the comparison.
Is there a way to do this using a "temporary" FS which does not take up CAS heap space in UIMAv2? -- Richard
