The “Jump-counting” Skipfield Pattern A replacement for boolean skipfields yielding O(n) time complexity for iteration over unskipped elements Matthew Bentley

First Page		Document Content
Date: 2017-01-05 18:22:54		The “Jump-counting” Skipfield Pattern A replacement for boolean skipfields yielding O(n) time complexity for iteration over unskipped elements Matthew Bentley Add to Reading List Source URL: plflib.org Download Document from Source Website File Size: 529,70 KB Share Document on Facebook