csv-blobs improvements: windows binary, more speed, dramatically less memory

Comments are moderated. It may take a few minutes before your comment appears.
Markdown is supported in your comments.

How is it so fast? It uses a single pass algorithm based on sorted quadruply linked lists. Most other algorithms work one pixel at a time, while QuickBlob operates on run-length-encoded line segments. It only holds at most a single RLE-ed row of data in memory at any given moment. This particular implementation allocates the maximum amount of memory possible from the start for best cache spatial locality.

Mail: (not shown)

Please type this: