1 |
|
/* |
2 |
< |
* Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. |
2 |
> |
* Copyright 1997-2008 Sun Microsystems, Inc. All Rights Reserved. |
3 |
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 |
|
* |
5 |
|
* This code is free software; you can redistribute it and/or modify it |
179 |
|
modCount++; |
180 |
|
int oldCapacity = elementData.length; |
181 |
|
if (minCapacity > oldCapacity) { |
182 |
– |
Object oldData[] = elementData; |
182 |
|
int newCapacity = (oldCapacity * 3)/2 + 1; |
183 |
|
if (newCapacity < minCapacity) |
184 |
|
newCapacity = minCapacity; |
891 |
|
private final AbstractList<E> parent; |
892 |
|
private final int parentOffset; |
893 |
|
private final int offset; |
894 |
< |
private int size; |
894 |
> |
int size; |
895 |
|
|
896 |
|
SubList(AbstractList<E> parent, |
897 |
|
int offset, int fromIndex, int toIndex) { |
970 |
|
public ListIterator<E> listIterator(final int index) { |
971 |
|
checkForComodification(); |
972 |
|
rangeCheckForAdd(index); |
973 |
+ |
final int offset = this.offset; |
974 |
|
|
975 |
|
return new ListIterator<E>() { |
976 |
|
int cursor = index; |