快速业务通道

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

作者 佚名技术 来源 NET编程 浏览 发布时间 2012-06-16
return new BagIterator(this);    } static class BagIterator implements Iterator {      private AbstractMapBag parent;      private Iterator entryIterator;      private Map.Entry current;      private int itemCount;      private final int mods;      private boolean canRemove;      public BagIterator(AbstractMapBag parent) {        this.parent = parent;        this.entryIterator = parent.map.entrySet().iterator();        this.current = null;        this.mods = parent.modCount;        this.canRemove = false;      }      public boolean hasNext() {        return (itemCount > 0 || entryIterator.hasNext());      }      public Object next() {        if (parent.modCount != mods) {          throw new ConcurrentModificationException();        }        if (itemCount == 0) {          current = (Map.Entry) entryIterator.next();          itemCount = ((MutableInteger) current.getValue()).value;        }        canRemove = true;        itemCount--;        return current.getKey();      }      public void remove() {        if (parent.modCount != mods) {          throw new ConcurrentModificationException();        }        if (canRemove == false) {          throw new IllegalStateException();        }        MutableInteger mut = (MutableInteger) current.getValue();        if (mut.value > 1) {          mut.value--;        } else {          entryIterator.remove();        }        parent.size--;        canRemove = false;      }    }    public boolean add(Object object) {      return add(object, 1);    }    public boolean add(Object object, int nCopies) {      modCount++;      if (nCopies > 0) {        MutableInteger mut = (MutableInteger) map.get(object);        size += nCopies;        if (mut == null) {          map.put(object, new MutableInteger(nCopies));          return true;        } else {          mut.value += nCopies;          return false;        }      } else {        return false;      }    }    public boolean addAll(Collection coll) {      boolean changed = false;      Iterator i = coll.iterator();      while (i.hasNext()) {        boolean added = add(i.next());        changed = changed || added;      }      return changed;    }    public void clear() {      modCount++;      map.clear();      size = 0;    }    public boolean remove(Object object) {      MutableInteger mut = (MutableInteger) map.get(object);      if (mut == null) {        return false;      }      modCount++;      map.remove(object);      size -= mut.value;      return true;    }    public boolean remove(Object object, int nCopies) {      Mutabl

凌众科技专业提供服务器租用、服务器托管、企业邮局、虚拟主机等服务,公司网站: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号