快速业务通道

Commons Collections僥楼永芝?屈? - 園殻秘壇利

作者 佚名技术 来源 NET编程 浏览 发布时间 2012-06-16
       }      }      if (array.length > size) {        array[size] = null;//舜僅謹噫議**了      }      return array;    }    public Set uniqueSet() {      if (uniqueSet == null) {        uniqueSet = UnmodifiableSet.decorate(map.keySet());      }      return uniqueSet;    }    protected void doWriteObject(ObjectOutputStream out) throws IOException {      out.writeInt(map.size());      for (Iterator it = map.entrySet().iterator(); it.hasNext();) {        Map.Entry entry = (Map.Entry) it.next();        out.writeObject(entry.getKey());        out.writeInt(((MutableInteger) entry.getValue()).value);      }    }    protected void doReadObject(Map map, ObjectInputStream in) throws IOException, ClassNotFoundException {      this.map = map;      int entrySize = in.readInt();      for (int i = 0; i < entrySize; i++) {        Object obj = in.readObject();        int count = in.readInt();        map.put(obj, new MutableInteger(count));        size += count;      }    }    public boolean equals(Object object) {      if (object == this) {        return true;      }      if (object instanceof Bag == false) {        return false;      }      Bag other = (Bag) object;      if (other.size() != size()) {        return false;      }      for (Iterator it = map.keySet().iterator(); it.hasNext();) {        Object element = it.next();        if (other.getCount(element) != getCount(element)) {          return false;        }      }      return true;    }    public int hashCode() {      int total = 0;      for (Iterator it = map.entrySet().iterator(); it.hasNext();) {        Map.Entry entry = (Map.Entry) it.next();        Object element = entry.getKey();        MutableInteger count = (MutableInteger) entry.getValue();        total += (element == null ? 0 : element.hashCode()) ^ count.value;      }      return total;    }    public String toString() {      if (size() == 0) {        return "[]";      }      StringBuffer buf = new StringBuffer();      buf.append(''['');      Iterator it = uniqueSet().iterator();      while (it.hasNext()) {        Object current = it.next();        int count = getCount(current);        buf.append(count);        buf.append('':'');        buf.append(current);        if (it.hasNext()) {          buf.append('','');        }      }      buf.append('']'');      return buf.toString();    } }

Commons Collections学习笔记(二)(2)

时间:2011-07-20 博客园 Phinecos

public class HashBag extends AbstractMapBag implements Bag, Serializable

{    private static final long serialVersionUID = -6561115435802554013L;    public HashBag() {      super(new HashMap());    }

凌众科技专业提供服务器租用、服务器托管、企业邮局、虚拟主机等服务,公司网站:http://www.lingzhong.cn 为了给广大客户了解更多的技术信息,本技术文章收集来源于网络,凌众科技尊重文章作者的版权,如果有涉及你的版权有必要删除你的文章,请和我们联系。以上信息与文章正文是不可分割的一部分,如果您要转载本文章,请保留以上信息,谢谢!

分享到: 更多

Copyright ©1999-2011 厦门凌众科技有限公司 厦门优通互联科技开发有限公司 All rights reserved

地址(ADD):厦门软件园二期望海路63号701E(东南融通旁) 邮编(ZIP):361008

电话:0592-5908028 传真:0592-5908039 咨询信箱:web@lingzhong.cn 咨询OICQ:173723134

《中华人民共和国增值电信业务经营许可证》闽B2-20100024  ICP备案:闽ICP备05037997号