traininfo/util/IntSet.java

package dk.thoerup.traininfo.util;

import java.util.Set;
import java.util.TreeSet;

public class IntSet {
        private Set<Integer> ints = new TreeSet<Integer>();
        
        public boolean hasInt(int i) {
                return ints.contains(i);
        }
        
        public void add(int i) {
                ints.add(i);
        }
        
        public void remove(int i) {
                ints.remove(i);
        }
        
        public String toString() {
                StringBuffer sb = new StringBuffer();
                
                for (int i : ints) {
                        if (sb.length() > 0) {
                                sb.append(",");
                        }
                        sb.append(i);
                }       
                
                return sb.toString();
        }
        
        public int size() {
                return ints.size();
        }
        
        public void fromString(String intStr) {
                ints.clear();
                String parts[] = intStr.split(",");
                for (String istr : parts) {
                        ints.add( Integer.parseInt(istr));
                }
        }
        
}
1	package dk.thoerup.traininfo.util;
2
3	import java.util.Set;
4	import java.util.TreeSet;
5
6	public class IntSet {
7	private Set<Integer> ints = new TreeSet<Integer>();
8
9	public boolean hasInt(int i) {
10	return ints.contains(i);
11	}
12
13	public void add(int i) {
14	ints.add(i);
15	}
16
17	public void remove(int i) {
18	ints.remove(i);
19	}
20
21	public String toString() {
22	StringBuffer sb = new StringBuffer();
23
24	for (int i : ints) {
25	if (sb.length() > 0) {
26	sb.append(",");
27	}
28	sb.append(i);
29	}
30
31	return sb.toString();
32	}
33
34	public int size() {
35	return ints.size();
36	}
37
38	public void fromString(String intStr) {
39	ints.clear();
40	String parts[] = intStr.split(",");
41	for (String istr : parts) {
42	ints.add( Integer.parseInt(istr));
43	}
44	}
45
46	}