java listmode_java集合ArrayList中modCount的作用

/*** The number of times this list has been structurally modified.

* Structural modifications are those that change the size of the

* list, or otherwise perturb it in such a fashion that iterations in

* progress may yield incorrect results.

*

*

This field is used by the iterator and list iterator implementation

* returned by the {@codeiterator} and {@codelistIterator} methods.

* If the value of this field changes unexpectedly, the iterator (or list

* iterator) will throw a {@codeConcurrentModificationException} in

* response to the {@codenext}, {@coderemove}, {@codeprevious},

* {@codeset} or {@codeadd} operations. This provides

* fail-fast behavior, rather than non-deterministic behavior in

* the face of concurrent modification during iteration.

*

*

Use of this field by subclasses is optional. If a subclass

* wishes to provide fail-fast iterators (and list iterators), then it

* merely has to increment this field in its {@codeadd(int, E)} and

* {@coderemove(int)} methods (and any other methods that it overrides

* that result in structural modifications to the list). A single call to

* {@codeadd(int, E)} or {@coderemove(int)} must add no more than

* one to this field, or the iterators (and list iterators) will throw

* bogus {@codeConcurrentModificationExceptions}. If an implementation

* does not wish to provide fail-fast iterators, this field may be

* ignored.

* MARK:

* 列表结构被修改的次数,在所有会修改列表的方法上都会 modCount++;

* 在迭代器中控制并发*/

protected transient int modCount = 0;

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值