快速业务通道

linux系统网卡的配置与激活

作者 佚名技术 来源 Linux系统 浏览 发布时间 2012-07-04
mpty();    }    public Iterator iterator() {      return new BagIterator(this, extractList().iterator());    }    static class BagIterator implements Iterator {      private DefaultMapBag _parent = null;      private Iterator _support = null;//圻兵亨旗匂      private Object _current = null;//輝念圷殆      private int _mods = 0;      public BagIterator(DefaultMapBag parent, Iterator support) {        _parent = parent;        _support = support;        _current = null;        _mods = parent.modCount();      }      public boolean hasNext() {        return _support.hasNext();      }      public Object next() {        if (_parent.modCount() != _mods) {          throw new ConcurrentModificationException();        }        _current = _support.next();        return _current;      }      public void remove() {        if (_parent.modCount() != _mods) {          throw new ConcurrentModificationException();        }        _support.remove();        _parent.remove(_current, 1);        _mods++;      }    }    public boolean remove(Object object) {      return remove(object, getCount(object));    }    public boolean remove(Object object, int nCopies) {      _mods++;      boolean result = false;      int count = getCount(object);      if (nCopies <= 0) {        result = false;      } else if (count > nCopies) {        _map.put(object, new Integer(count - nCopies));        result = true;        _total -= nCopies;      } else { // count > 0 && count <= i         // need to remove all        result = (_map.remove(object) != null);        _total -= count;      }      return result;    }    public boolean removeAll(Collection coll) {      boolean result = false;      if (coll != null) {        Iterator i = coll.iterator();        while (i.hasNext()) {          boolean changed = remove(i.next(), 1);          result = result || changed;        }      }      return result;    }    public boolean retainAll(Collection coll) {      return retainAll(new HashBag(coll));    }    public boolean retainAll(Bag other) {      boolean result = false;      Bag excess = new HashBag();      Iterator i = uniqueSet().iterator();      while (i.hasNext()) {        Object current = i.next();        int myCount = getCount(current);        int otherCount = other.getCount(current);        if (1 <= otherCount && otherCount <= myCount) {          excess.add(current, myCount - otherCount);        } else {          excess.add(current, myCount);        }      }      if (!excess.isEmpty()) {        result = removeAll(excess);      }      return result;    }    publi

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