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

First Page	Meta Content
	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 Document Date: 2017-01-05 18:22:54 Open Document File Size: 529,70 KB Share Result on Facebook

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