On Monday, October 14, 2019 at 9:11:36 PM UTC-5, Edward K. Ream wrote: > This is one place where speed is truly useful!! ... > The result is a spectacular collapse in the code.
The code is also *much* faster than before, because the code only looks up the tree for those nodes in c.all_positions_for_v(p.v). There are typically only a few such positions, so in practice less than a dozen or so positions are actually examined. In essence, the old code was perhaps O(N), where N is the size of the outline. The new code is typically O(1). This could well make a noticeable difference in performance. Edward -- You received this message because you are subscribed to the Google Groups "leo-editor" group. To unsubscribe from this group and stop receiving emails from it, send an email to leo-editor+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/leo-editor/6761ffe9-582b-4894-99f7-33fe4df20894%40googlegroups.com.
