CountSortTool

java 代码

package org.jh.app.count;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Set;

import org.apache.commons.collections.Bag;
import org.apache.commons.collections.BagUtils;
import org.apache.commons.collections.bag.HashBag;

public class CountSortTool {
    static public class Sort implements Comparable<Sort> {
        Object key;

        int num = 1;

        Sort(Object key) {
            this.key = key;
        }

        public Sort(Object o, int count) {
            this.key = o;
            num = count;
        }

        public String toString() {
            return key + ":" + num + "\n";
        }

        public boolean equals(Object obj) {
            System.out.println("equals");
            if (this == obj)
                return true;
            if (obj instanceof Sort) {
                Sort s = (Sort) obj;
                if (s.key.equals(s.key)) {
                    num++;
                    s.num++;
                    return true;
                }
            }
            return false;
        }

        public Object getKey() {
            return key;
        }

        public void setKey(Object key) {
            this.key = key;
        }

        public int getNum() {
            return num;
        }

        public void setNum(int num) {
            this.num = num;
        }

        public int compareTo(Sort o) {
            return -num + o.num;
        }

    }
    public void push(String key) {
        bag.add(key);
    }

    Bag bag = BagUtils.typedBag(new HashBag(), String.class);

    public List<Sort> sort() {

        Set objs = bag.uniqueSet();
        List<Sort> listR = new ArrayList<Sort> ();
        for (Object o : objs) {
            listR.add(new Sort(o, bag.getCount(o)));
        }
        Collections.sort(listR);
        return listR;
    }
}

分享到：

Using the Oracle Bulk Loader -2 | 现场视频：Bob Lee 谈 Guice开源代码

• 2007-06-28 23:50
• 浏览 1480
• 评论(1)
• 查看更多

评论

1 楼 phantom 2007-06-28  

package org.jh.app.count;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Set;

import org.apache.commons.collections.Bag;
import org.apache.commons.collections.BagUtils;
import org.apache.commons.collections.bag.HashBag;

public class CountSortTool {
	static public class Sort implements Comparable<Sort> {
		Object key;

		int num = 1;

		Sort(Object key) {
			this.key = key;
		}

		public Sort(Object o, int count) {
			this.key = o;
			num = count;
		}

		public String toString() {
			return key + ":" + num + "\n";
		}

		public boolean equals(Object obj) {
			System.out.println("equals");
			if (this == obj)
				return true;
			if (obj instanceof Sort) {
				Sort s = (Sort) obj;
				if (s.key.equals(s.key)) {
					num++;
					s.num++;
					return true;
				}
			}
			return false;
		}

		public Object getKey() {
			return key;
		}

		public void setKey(Object key) {
			this.key = key;
		}

		public int getNum() {
			return num;
		}

		public void setNum(int num) {
			this.num = num;
		}

		public int compareTo(Sort o) {
			return -num + o.num;
		}

	}
	public void push(String key) {
		bag.add(key);
	}

	Bag bag = BagUtils.typedBag(new HashBag(), String.class);

	public List<Sort> sort() {

		Set objs = bag.uniqueSet();
		List<Sort> listR = new ArrayList<Sort> ();
		for (Object o : objs) {
			listR.add(new Sort(o, bag.getCount(o)));
		}
		Collections.sort(listR);
		return listR;
	}
}