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.

1 files changed, 2 insertions, 1 deletions

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
 };