5 ms·
From skimming wikipedia and the code, it looks like a trellis is more or less a VList where each array in the VList is represented by a complete binary tree of
by munificent 16y ago
From skimming wikipedia and the code, it looks like a trellis is more or less a VList where each array in the VList is represented by a complete binary tree of an appropriate depth. That gives you the VList's O(1) average performance to find the right tree, but then you have to do an O(log n) walk down the tree to the desired element.
Am I interpreting that right?
- daniel-cussen 16y agoPretty much. Finding the right tree takes O(logn) as long as walking down that tree.