--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/src/fschmidt/util/java/Sorter.java	Sun Oct 05 17:24:15 2025 -0600
@@ -0,0 +1,82 @@
+/*
+Copyright (c) 2008  Franklin Schmidt <fschmidt@gmail.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+*/
+
+package fschmidt.util.java;
+
+import java.util.List;
+import java.util.ArrayList;
+
+
+public final class Sorter<K extends Comparable<K>,V> {
+	private final List<K> keyList = new ArrayList<K>();
+	private final List<V> valueList = new ArrayList<V>();
+	private final int limit;
+
+	public Sorter() {
+		this(0);
+	}
+
+	public Sorter(int limit) {
+		this.limit = limit;
+	}
+
+	private int position(K obj) {
+		int n = keyList.size();
+		for( int i=0; i<n; i++ ) {
+			if( obj.compareTo(keyList.get(i)) <= 0 )
+				return i;
+		}
+		return n;
+	}
+
+	public void put(K key,V value) {
+		int i = position(key);
+		if( limit>0 && i==limit )
+			return;
+		keyList.add(i,key);
+		valueList.add(i,value);
+		if( limit>0 && size()>limit )
+			remove(limit);
+	}
+
+	public List<V> values() {
+		return valueList;
+	}
+
+	public int size() {
+		return valueList.size();
+	}
+
+	public void remove(int index) {
+		keyList.remove(index);
+		valueList.remove(index);
+	}
+
+	public V getValue(int index) {
+		return valueList.get(index);
+	}
+
+	public K getKey(int index) {
+		return keyList.get(index);
+	}
+
+}