From 8161ac06785068da5234553b528ecbbc8339e232 Mon Sep 17 00:00:00 2001 From: Bobby Bingham Date: Sun, 2 Nov 2014 22:34:23 -0600 Subject: Fill buffer with smallest elements This avoids the need to distribute the buffer through the whole array at the end. It also allows us to skips most of the work for sorted and reverse-sorted inputs. --- counts.h | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) (limited to 'counts.h') diff --git a/counts.h b/counts.h index 46e2e18..b066647 100644 --- a/counts.h +++ b/counts.h @@ -4,9 +4,10 @@ enum { CURRENT, SORTNET, + CHECK_SORTED, + STEAL_BUF, LAST_OVERLAP, MERGE, - MOVE_BUFFER, DISTRIBUTE, MAX_COUNTS }; -- cgit v1.2.3