Mercurial Hosting > nabble

comparison src/fschmidt/util/java/Sorter.java @ 68:00520880ad02

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
add fschmidt source
author Franklin Schmidt <fschmidt@gmail.com>
date Sun, 05 Oct 2025 17:24:15 -0600
parents
children
comparison
equal deleted inserted replaced
67:9d0fefce6985 68:00520880ad02
1 /*
2 Copyright (c) 2008 Franklin Schmidt <fschmidt@gmail.com>
3
4 Permission is hereby granted, free of charge, to any person obtaining a copy
5 of this software and associated documentation files (the "Software"), to deal
6 in the Software without restriction, including without limitation the rights
7 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
8 copies of the Software, and to permit persons to whom the Software is
9 furnished to do so, subject to the following conditions:
10
11 The above copyright notice and this permission notice shall be included in
12 all copies or substantial portions of the Software.
13
14 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
17 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
18 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
19 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
20 THE SOFTWARE.
21 */
22
23 package fschmidt.util.java;
24
25 import java.util.List;
26 import java.util.ArrayList;
27
28
29 public final class Sorter<K extends Comparable<K>,V> {
30 private final List<K> keyList = new ArrayList<K>();
31 private final List<V> valueList = new ArrayList<V>();
32 private final int limit;
33
34 public Sorter() {
35 this(0);
36 }
37
38 public Sorter(int limit) {
39 this.limit = limit;
40 }
41
42 private int position(K obj) {
43 int n = keyList.size();
44 for( int i=0; i<n; i++ ) {
45 if( obj.compareTo(keyList.get(i)) <= 0 )
46 return i;
47 }
48 return n;
49 }
50
51 public void put(K key,V value) {
52 int i = position(key);
53 if( limit>0 && i==limit )
54 return;
55 keyList.add(i,key);
56 valueList.add(i,value);
57 if( limit>0 && size()>limit )
58 remove(limit);
59 }
60
61 public List<V> values() {
62 return valueList;
63 }
64
65 public int size() {
66 return valueList.size();
67 }
68
69 public void remove(int index) {
70 keyList.remove(index);
71 valueList.remove(index);
72 }
73
74 public V getValue(int index) {
75 return valueList.get(index);
76 }
77
78 public K getKey(int index) {
79 return keyList.get(index);
80 }
81
82 }