On 1/7/2016 2:31 PM, Richard Eckart de Castilho wrote: > On 07.01.2016, at 15:21, Marshall Schor <[email protected]> wrote: >> The trick is to use an augmented sort comparator for internal operations >> which >> adds one more field, that differentiates the actual FSs, like the FS >> address. >> This would be used when needing to find the "exact" match - and that >> operation >> would also be a log-2(size) kind of operation because it would use the same >> binary search algorithm. > That wouldn't be functionally equivalent to the present implementation, would > it? I think it would. Perhaps I didn't explain this well enough... > > It would be able to quickly figure out if a specific FS instance has already > been > added to an index, but what we currently have is testing whether an equivalent > (via feature-by-feature comparison, not via index features) annotation is > being > added, right? Maybe I misread the code. We have "both" styles. The feature-by-feature comparison is the normal way, but the (in)famous method to (linearly) go to the exact match is the other style, I think.
> > Anyway, I believe checking if a specific instance was added twice would be > completely > sufficient. Yes, and the question is, how to do this (more efficiently). The current approach does a linear scan, which could be giant, in the use case you cited where all the begin / end features are the same. -Marshall > > -- Richard
