Tue, 12 Feb 2013 19:25:09 +0000
8007464: Add graph inference support
Summary: Add support for more aggressive type-inference scheme
Reviewed-by: jjg
duke@1 | 1 | /* |
jjg@1362 | 2 | * Copyright (c) 1999, 2012, Oracle and/or its affiliates. All rights reserved. |
duke@1 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@1 | 4 | * |
duke@1 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@1 | 6 | * under the terms of the GNU General Public License version 2 only, as |
ohair@554 | 7 | * published by the Free Software Foundation. Oracle designates this |
duke@1 | 8 | * particular file as subject to the "Classpath" exception as provided |
ohair@554 | 9 | * by Oracle in the LICENSE file that accompanied this code. |
duke@1 | 10 | * |
duke@1 | 11 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@1 | 12 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@1 | 13 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@1 | 14 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@1 | 15 | * accompanied this code). |
duke@1 | 16 | * |
duke@1 | 17 | * You should have received a copy of the GNU General Public License version |
duke@1 | 18 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@1 | 19 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@1 | 20 | * |
ohair@554 | 21 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
ohair@554 | 22 | * or visit www.oracle.com if you need additional information or have any |
ohair@554 | 23 | * questions. |
duke@1 | 24 | */ |
duke@1 | 25 | |
duke@1 | 26 | package com.sun.tools.javac.util; |
duke@1 | 27 | |
duke@1 | 28 | import java.lang.reflect.Array; |
duke@1 | 29 | import java.util.ArrayList; |
duke@1 | 30 | import java.util.Collection; |
duke@1 | 31 | import java.util.Collections; |
duke@1 | 32 | import java.util.Iterator; |
duke@1 | 33 | import java.util.AbstractCollection; |
duke@1 | 34 | import java.util.ListIterator; |
duke@1 | 35 | import java.util.NoSuchElementException; |
duke@1 | 36 | |
duke@1 | 37 | /** A class for generic linked lists. Links are supposed to be |
duke@1 | 38 | * immutable, the only exception being the incremental construction of |
duke@1 | 39 | * lists via ListBuffers. List is the main container class in |
duke@1 | 40 | * GJC. Most data structures and algorthms in GJC use lists rather |
duke@1 | 41 | * than arrays. |
duke@1 | 42 | * |
duke@1 | 43 | * <p>Lists are always trailed by a sentinel element, whose head and tail |
duke@1 | 44 | * are both null. |
duke@1 | 45 | * |
jjg@581 | 46 | * <p><b>This is NOT part of any supported API. |
jjg@581 | 47 | * If you write code that depends on this, you do so at your own risk. |
duke@1 | 48 | * This code and its internal interfaces are subject to change or |
duke@1 | 49 | * deletion without notice.</b> |
duke@1 | 50 | */ |
duke@1 | 51 | public class List<A> extends AbstractCollection<A> implements java.util.List<A> { |
duke@1 | 52 | |
duke@1 | 53 | /** The first element of the list, supposed to be immutable. |
duke@1 | 54 | */ |
duke@1 | 55 | public A head; |
duke@1 | 56 | |
duke@1 | 57 | /** The remainder of the list except for its first element, supposed |
duke@1 | 58 | * to be immutable. |
duke@1 | 59 | */ |
duke@1 | 60 | //@Deprecated |
duke@1 | 61 | public List<A> tail; |
duke@1 | 62 | |
duke@1 | 63 | /** Construct a list given its head and tail. |
duke@1 | 64 | */ |
duke@1 | 65 | List(A head, List<A> tail) { |
duke@1 | 66 | this.tail = tail; |
duke@1 | 67 | this.head = head; |
duke@1 | 68 | } |
duke@1 | 69 | |
duke@1 | 70 | /** Construct an empty list. |
duke@1 | 71 | */ |
duke@1 | 72 | @SuppressWarnings("unchecked") |
duke@1 | 73 | public static <A> List<A> nil() { |
mcimadamore@184 | 74 | return (List<A>)EMPTY_LIST; |
duke@1 | 75 | } |
mcimadamore@184 | 76 | |
vromero@1442 | 77 | private static final List<?> EMPTY_LIST = new List<Object>(null,null) { |
duke@1 | 78 | public List<Object> setTail(List<Object> tail) { |
duke@1 | 79 | throw new UnsupportedOperationException(); |
duke@1 | 80 | } |
duke@1 | 81 | public boolean isEmpty() { |
duke@1 | 82 | return true; |
duke@1 | 83 | } |
duke@1 | 84 | }; |
duke@1 | 85 | |
mcimadamore@1347 | 86 | /** Returns the list obtained from 'l' after removing all elements 'elem' |
mcimadamore@1347 | 87 | */ |
mcimadamore@1347 | 88 | public static <A> List<A> filter(List<A> l, A elem) { |
mcimadamore@1347 | 89 | Assert.checkNonNull(elem); |
mcimadamore@1347 | 90 | List<A> res = List.nil(); |
mcimadamore@1347 | 91 | for (A a : l) { |
mcimadamore@1347 | 92 | if (a != null && !a.equals(elem)) { |
mcimadamore@1347 | 93 | res = res.prepend(a); |
mcimadamore@1347 | 94 | } |
mcimadamore@1347 | 95 | } |
mcimadamore@1347 | 96 | return res.reverse(); |
mcimadamore@1347 | 97 | } |
mcimadamore@1347 | 98 | |
mcimadamore@1550 | 99 | public List<A> intersect(List<A> that) { |
mcimadamore@1550 | 100 | ListBuffer<A> buf = ListBuffer.lb(); |
mcimadamore@1550 | 101 | for (A el : this) { |
mcimadamore@1550 | 102 | if (that.contains(el)) { |
mcimadamore@1550 | 103 | buf.append(el); |
mcimadamore@1550 | 104 | } |
mcimadamore@1550 | 105 | } |
mcimadamore@1550 | 106 | return buf.toList(); |
mcimadamore@1550 | 107 | } |
mcimadamore@1550 | 108 | |
mcimadamore@1550 | 109 | public List<A> diff(List<A> that) { |
mcimadamore@1550 | 110 | ListBuffer<A> buf = ListBuffer.lb(); |
mcimadamore@1550 | 111 | for (A el : this) { |
mcimadamore@1550 | 112 | if (!that.contains(el)) { |
mcimadamore@1550 | 113 | buf.append(el); |
mcimadamore@1550 | 114 | } |
mcimadamore@1550 | 115 | } |
mcimadamore@1550 | 116 | return buf.toList(); |
mcimadamore@1550 | 117 | } |
mcimadamore@1550 | 118 | |
duke@1 | 119 | /** Construct a list consisting of given element. |
duke@1 | 120 | */ |
duke@1 | 121 | public static <A> List<A> of(A x1) { |
duke@1 | 122 | return new List<A>(x1, List.<A>nil()); |
duke@1 | 123 | } |
duke@1 | 124 | |
duke@1 | 125 | /** Construct a list consisting of given elements. |
duke@1 | 126 | */ |
duke@1 | 127 | public static <A> List<A> of(A x1, A x2) { |
duke@1 | 128 | return new List<A>(x1, of(x2)); |
duke@1 | 129 | } |
duke@1 | 130 | |
duke@1 | 131 | /** Construct a list consisting of given elements. |
duke@1 | 132 | */ |
duke@1 | 133 | public static <A> List<A> of(A x1, A x2, A x3) { |
duke@1 | 134 | return new List<A>(x1, of(x2, x3)); |
duke@1 | 135 | } |
duke@1 | 136 | |
duke@1 | 137 | /** Construct a list consisting of given elements. |
duke@1 | 138 | */ |
mcimadamore@795 | 139 | @SuppressWarnings({"varargs", "unchecked"}) |
duke@1 | 140 | public static <A> List<A> of(A x1, A x2, A x3, A... rest) { |
duke@1 | 141 | return new List<A>(x1, new List<A>(x2, new List<A>(x3, from(rest)))); |
duke@1 | 142 | } |
duke@1 | 143 | |
duke@1 | 144 | /** |
duke@1 | 145 | * Construct a list consisting all elements of given array. |
duke@1 | 146 | * @param array an array; if {@code null} return an empty list |
duke@1 | 147 | */ |
duke@1 | 148 | public static <A> List<A> from(A[] array) { |
duke@1 | 149 | List<A> xs = nil(); |
duke@1 | 150 | if (array != null) |
duke@1 | 151 | for (int i = array.length - 1; i >= 0; i--) |
duke@1 | 152 | xs = new List<A>(array[i], xs); |
duke@1 | 153 | return xs; |
duke@1 | 154 | } |
duke@1 | 155 | |
mcimadamore@1347 | 156 | public static <A> List<A> from(Iterable<? extends A> coll) { |
mcimadamore@1347 | 157 | List<A> xs = nil(); |
mcimadamore@1347 | 158 | for (A a : coll) { |
mcimadamore@1347 | 159 | xs = new List<A>(a, xs); |
mcimadamore@1347 | 160 | } |
mcimadamore@1347 | 161 | return xs; |
mcimadamore@1347 | 162 | } |
mcimadamore@1347 | 163 | |
duke@1 | 164 | /** Construct a list consisting of a given number of identical elements. |
duke@1 | 165 | * @param len The number of elements in the list. |
duke@1 | 166 | * @param init The value of each element. |
duke@1 | 167 | */ |
duke@1 | 168 | @Deprecated |
duke@1 | 169 | public static <A> List<A> fill(int len, A init) { |
duke@1 | 170 | List<A> l = nil(); |
duke@1 | 171 | for (int i = 0; i < len; i++) l = new List<A>(init, l); |
duke@1 | 172 | return l; |
duke@1 | 173 | } |
duke@1 | 174 | |
duke@1 | 175 | /** Does list have no elements? |
duke@1 | 176 | */ |
duke@1 | 177 | @Override |
duke@1 | 178 | public boolean isEmpty() { |
duke@1 | 179 | return tail == null; |
duke@1 | 180 | } |
duke@1 | 181 | |
duke@1 | 182 | /** Does list have elements? |
duke@1 | 183 | */ |
duke@1 | 184 | //@Deprecated |
duke@1 | 185 | public boolean nonEmpty() { |
duke@1 | 186 | return tail != null; |
duke@1 | 187 | } |
duke@1 | 188 | |
duke@1 | 189 | /** Return the number of elements in this list. |
duke@1 | 190 | */ |
duke@1 | 191 | //@Deprecated |
duke@1 | 192 | public int length() { |
duke@1 | 193 | List<A> l = this; |
duke@1 | 194 | int len = 0; |
duke@1 | 195 | while (l.tail != null) { |
duke@1 | 196 | l = l.tail; |
duke@1 | 197 | len++; |
duke@1 | 198 | } |
duke@1 | 199 | return len; |
duke@1 | 200 | } |
duke@1 | 201 | @Override |
duke@1 | 202 | public int size() { |
duke@1 | 203 | return length(); |
duke@1 | 204 | } |
duke@1 | 205 | |
duke@1 | 206 | public List<A> setTail(List<A> tail) { |
duke@1 | 207 | this.tail = tail; |
duke@1 | 208 | return tail; |
duke@1 | 209 | } |
duke@1 | 210 | |
duke@1 | 211 | /** Prepend given element to front of list, forming and returning |
duke@1 | 212 | * a new list. |
duke@1 | 213 | */ |
duke@1 | 214 | public List<A> prepend(A x) { |
duke@1 | 215 | return new List<A>(x, this); |
duke@1 | 216 | } |
duke@1 | 217 | |
duke@1 | 218 | /** Prepend given list of elements to front of list, forming and returning |
duke@1 | 219 | * a new list. |
duke@1 | 220 | */ |
duke@1 | 221 | public List<A> prependList(List<A> xs) { |
duke@1 | 222 | if (this.isEmpty()) return xs; |
duke@1 | 223 | if (xs.isEmpty()) return this; |
duke@1 | 224 | if (xs.tail.isEmpty()) return prepend(xs.head); |
duke@1 | 225 | // return this.prependList(xs.tail).prepend(xs.head); |
duke@1 | 226 | List<A> result = this; |
duke@1 | 227 | List<A> rev = xs.reverse(); |
jjg@816 | 228 | Assert.check(rev != xs); |
duke@1 | 229 | // since xs.reverse() returned a new list, we can reuse the |
duke@1 | 230 | // individual List objects, instead of allocating new ones. |
duke@1 | 231 | while (rev.nonEmpty()) { |
duke@1 | 232 | List<A> h = rev; |
duke@1 | 233 | rev = rev.tail; |
duke@1 | 234 | h.setTail(result); |
duke@1 | 235 | result = h; |
duke@1 | 236 | } |
duke@1 | 237 | return result; |
duke@1 | 238 | } |
duke@1 | 239 | |
duke@1 | 240 | /** Reverse list. |
duke@1 | 241 | * If the list is empty or a singleton, then the same list is returned. |
duke@1 | 242 | * Otherwise a new list is formed. |
duke@1 | 243 | */ |
duke@1 | 244 | public List<A> reverse() { |
duke@1 | 245 | // if it is empty or a singleton, return itself |
duke@1 | 246 | if (isEmpty() || tail.isEmpty()) |
duke@1 | 247 | return this; |
duke@1 | 248 | |
duke@1 | 249 | List<A> rev = nil(); |
duke@1 | 250 | for (List<A> l = this; l.nonEmpty(); l = l.tail) |
duke@1 | 251 | rev = new List<A>(l.head, rev); |
duke@1 | 252 | return rev; |
duke@1 | 253 | } |
duke@1 | 254 | |
duke@1 | 255 | /** Append given element at length, forming and returning |
duke@1 | 256 | * a new list. |
duke@1 | 257 | */ |
duke@1 | 258 | public List<A> append(A x) { |
duke@1 | 259 | return of(x).prependList(this); |
duke@1 | 260 | } |
duke@1 | 261 | |
duke@1 | 262 | /** Append given list at length, forming and returning |
duke@1 | 263 | * a new list. |
duke@1 | 264 | */ |
duke@1 | 265 | public List<A> appendList(List<A> x) { |
duke@1 | 266 | return x.prependList(this); |
duke@1 | 267 | } |
duke@1 | 268 | |
duke@1 | 269 | /** |
duke@1 | 270 | * Append given list buffer at length, forming and returning a new |
duke@1 | 271 | * list. |
duke@1 | 272 | */ |
duke@1 | 273 | public List<A> appendList(ListBuffer<A> x) { |
duke@1 | 274 | return appendList(x.toList()); |
duke@1 | 275 | } |
duke@1 | 276 | |
duke@1 | 277 | /** Copy successive elements of this list into given vector until |
duke@1 | 278 | * list is exhausted or end of vector is reached. |
duke@1 | 279 | */ |
duke@1 | 280 | @Override @SuppressWarnings("unchecked") |
duke@1 | 281 | public <T> T[] toArray(T[] vec) { |
duke@1 | 282 | int i = 0; |
duke@1 | 283 | List<A> l = this; |
duke@1 | 284 | Object[] dest = vec; |
duke@1 | 285 | while (l.nonEmpty() && i < vec.length) { |
duke@1 | 286 | dest[i] = l.head; |
duke@1 | 287 | l = l.tail; |
duke@1 | 288 | i++; |
duke@1 | 289 | } |
duke@1 | 290 | if (l.isEmpty()) { |
duke@1 | 291 | if (i < vec.length) |
duke@1 | 292 | vec[i] = null; |
duke@1 | 293 | return vec; |
duke@1 | 294 | } |
duke@1 | 295 | |
duke@1 | 296 | vec = (T[])Array.newInstance(vec.getClass().getComponentType(), size()); |
duke@1 | 297 | return toArray(vec); |
duke@1 | 298 | } |
duke@1 | 299 | |
duke@1 | 300 | public Object[] toArray() { |
duke@1 | 301 | return toArray(new Object[size()]); |
duke@1 | 302 | } |
duke@1 | 303 | |
duke@1 | 304 | /** Form a string listing all elements with given separator character. |
duke@1 | 305 | */ |
duke@1 | 306 | public String toString(String sep) { |
duke@1 | 307 | if (isEmpty()) { |
duke@1 | 308 | return ""; |
duke@1 | 309 | } else { |
jjg@1362 | 310 | StringBuilder buf = new StringBuilder(); |
duke@1 | 311 | buf.append(head); |
duke@1 | 312 | for (List<A> l = tail; l.nonEmpty(); l = l.tail) { |
duke@1 | 313 | buf.append(sep); |
duke@1 | 314 | buf.append(l.head); |
duke@1 | 315 | } |
duke@1 | 316 | return buf.toString(); |
duke@1 | 317 | } |
duke@1 | 318 | } |
duke@1 | 319 | |
duke@1 | 320 | /** Form a string listing all elements with comma as the separator character. |
duke@1 | 321 | */ |
duke@1 | 322 | @Override |
duke@1 | 323 | public String toString() { |
duke@1 | 324 | return toString(","); |
duke@1 | 325 | } |
duke@1 | 326 | |
duke@1 | 327 | /** Compute a hash code, overrides Object |
duke@1 | 328 | * @see java.util.List#hashCode |
duke@1 | 329 | */ |
duke@1 | 330 | @Override |
duke@1 | 331 | public int hashCode() { |
duke@1 | 332 | List<A> l = this; |
duke@1 | 333 | int h = 1; |
duke@1 | 334 | while (l.tail != null) { |
duke@1 | 335 | h = h * 31 + (l.head == null ? 0 : l.head.hashCode()); |
duke@1 | 336 | l = l.tail; |
duke@1 | 337 | } |
duke@1 | 338 | return h; |
duke@1 | 339 | } |
duke@1 | 340 | |
duke@1 | 341 | /** Is this list the same as other list? |
duke@1 | 342 | * @see java.util.List#equals |
duke@1 | 343 | */ |
duke@1 | 344 | @Override |
duke@1 | 345 | public boolean equals(Object other) { |
duke@1 | 346 | if (other instanceof List<?>) |
duke@1 | 347 | return equals(this, (List<?>)other); |
duke@1 | 348 | if (other instanceof java.util.List<?>) { |
duke@1 | 349 | List<A> t = this; |
duke@1 | 350 | Iterator<?> oIter = ((java.util.List<?>) other).iterator(); |
duke@1 | 351 | while (t.tail != null && oIter.hasNext()) { |
duke@1 | 352 | Object o = oIter.next(); |
duke@1 | 353 | if ( !(t.head == null ? o == null : t.head.equals(o))) |
duke@1 | 354 | return false; |
duke@1 | 355 | t = t.tail; |
duke@1 | 356 | } |
duke@1 | 357 | return (t.isEmpty() && !oIter.hasNext()); |
duke@1 | 358 | } |
duke@1 | 359 | return false; |
duke@1 | 360 | } |
duke@1 | 361 | |
duke@1 | 362 | /** Are the two lists the same? |
duke@1 | 363 | */ |
mcimadamore@184 | 364 | public static boolean equals(List<?> xs, List<?> ys) { |
duke@1 | 365 | while (xs.tail != null && ys.tail != null) { |
duke@1 | 366 | if (xs.head == null) { |
duke@1 | 367 | if (ys.head != null) return false; |
duke@1 | 368 | } else { |
duke@1 | 369 | if (!xs.head.equals(ys.head)) return false; |
duke@1 | 370 | } |
duke@1 | 371 | xs = xs.tail; |
duke@1 | 372 | ys = ys.tail; |
duke@1 | 373 | } |
duke@1 | 374 | return xs.tail == null && ys.tail == null; |
duke@1 | 375 | } |
duke@1 | 376 | |
duke@1 | 377 | /** Does the list contain the specified element? |
duke@1 | 378 | */ |
duke@1 | 379 | @Override |
duke@1 | 380 | public boolean contains(Object x) { |
duke@1 | 381 | List<A> l = this; |
duke@1 | 382 | while (l.tail != null) { |
duke@1 | 383 | if (x == null) { |
duke@1 | 384 | if (l.head == null) return true; |
duke@1 | 385 | } else { |
duke@1 | 386 | if (l.head.equals(x)) return true; |
duke@1 | 387 | } |
duke@1 | 388 | l = l.tail; |
duke@1 | 389 | } |
duke@1 | 390 | return false; |
duke@1 | 391 | } |
duke@1 | 392 | |
duke@1 | 393 | /** The last element in the list, if any, or null. |
duke@1 | 394 | */ |
duke@1 | 395 | public A last() { |
duke@1 | 396 | A last = null; |
duke@1 | 397 | List<A> t = this; |
duke@1 | 398 | while (t.tail != null) { |
duke@1 | 399 | last = t.head; |
duke@1 | 400 | t = t.tail; |
duke@1 | 401 | } |
duke@1 | 402 | return last; |
duke@1 | 403 | } |
duke@1 | 404 | |
duke@1 | 405 | @SuppressWarnings("unchecked") |
duke@1 | 406 | public static <T> List<T> convert(Class<T> klass, List<?> list) { |
duke@1 | 407 | if (list == null) |
duke@1 | 408 | return null; |
duke@1 | 409 | for (Object o : list) |
duke@1 | 410 | klass.cast(o); |
duke@1 | 411 | return (List<T>)list; |
duke@1 | 412 | } |
duke@1 | 413 | |
vromero@1442 | 414 | private static final Iterator<?> EMPTYITERATOR = new Iterator<Object>() { |
duke@1 | 415 | public boolean hasNext() { |
duke@1 | 416 | return false; |
duke@1 | 417 | } |
duke@1 | 418 | public Object next() { |
duke@1 | 419 | throw new java.util.NoSuchElementException(); |
duke@1 | 420 | } |
duke@1 | 421 | public void remove() { |
duke@1 | 422 | throw new UnsupportedOperationException(); |
duke@1 | 423 | } |
duke@1 | 424 | }; |
duke@1 | 425 | |
duke@1 | 426 | @SuppressWarnings("unchecked") |
duke@1 | 427 | private static <A> Iterator<A> emptyIterator() { |
mcimadamore@184 | 428 | return (Iterator<A>)EMPTYITERATOR; |
duke@1 | 429 | } |
duke@1 | 430 | |
duke@1 | 431 | @Override |
duke@1 | 432 | public Iterator<A> iterator() { |
duke@1 | 433 | if (tail == null) |
duke@1 | 434 | return emptyIterator(); |
duke@1 | 435 | return new Iterator<A>() { |
duke@1 | 436 | List<A> elems = List.this; |
duke@1 | 437 | public boolean hasNext() { |
duke@1 | 438 | return elems.tail != null; |
duke@1 | 439 | } |
duke@1 | 440 | public A next() { |
duke@1 | 441 | if (elems.tail == null) |
duke@1 | 442 | throw new NoSuchElementException(); |
duke@1 | 443 | A result = elems.head; |
duke@1 | 444 | elems = elems.tail; |
duke@1 | 445 | return result; |
duke@1 | 446 | } |
duke@1 | 447 | public void remove() { |
duke@1 | 448 | throw new UnsupportedOperationException(); |
duke@1 | 449 | } |
duke@1 | 450 | }; |
duke@1 | 451 | } |
duke@1 | 452 | |
duke@1 | 453 | public A get(int index) { |
duke@1 | 454 | if (index < 0) |
duke@1 | 455 | throw new IndexOutOfBoundsException(String.valueOf(index)); |
duke@1 | 456 | |
duke@1 | 457 | List<A> l = this; |
duke@1 | 458 | for (int i = index; i-- > 0 && !l.isEmpty(); l = l.tail) |
duke@1 | 459 | ; |
duke@1 | 460 | |
duke@1 | 461 | if (l.isEmpty()) |
duke@1 | 462 | throw new IndexOutOfBoundsException("Index: " + index + ", " + |
duke@1 | 463 | "Size: " + size()); |
duke@1 | 464 | return l.head; |
duke@1 | 465 | } |
duke@1 | 466 | |
duke@1 | 467 | public boolean addAll(int index, Collection<? extends A> c) { |
duke@1 | 468 | if (c.isEmpty()) |
duke@1 | 469 | return false; |
duke@1 | 470 | throw new UnsupportedOperationException(); |
duke@1 | 471 | } |
duke@1 | 472 | |
duke@1 | 473 | public A set(int index, A element) { |
duke@1 | 474 | throw new UnsupportedOperationException(); |
duke@1 | 475 | } |
duke@1 | 476 | |
duke@1 | 477 | public void add(int index, A element) { |
duke@1 | 478 | throw new UnsupportedOperationException(); |
duke@1 | 479 | } |
duke@1 | 480 | |
duke@1 | 481 | public A remove(int index) { |
duke@1 | 482 | throw new UnsupportedOperationException(); |
duke@1 | 483 | } |
duke@1 | 484 | |
duke@1 | 485 | public int indexOf(Object o) { |
duke@1 | 486 | int i = 0; |
duke@1 | 487 | for (List<A> l = this; l.tail != null; l = l.tail, i++) { |
duke@1 | 488 | if (l.head == null ? o == null : l.head.equals(o)) |
duke@1 | 489 | return i; |
duke@1 | 490 | } |
duke@1 | 491 | return -1; |
duke@1 | 492 | } |
duke@1 | 493 | |
duke@1 | 494 | public int lastIndexOf(Object o) { |
duke@1 | 495 | int last = -1; |
duke@1 | 496 | int i = 0; |
duke@1 | 497 | for (List<A> l = this; l.tail != null; l = l.tail, i++) { |
duke@1 | 498 | if (l.head == null ? o == null : l.head.equals(o)) |
duke@1 | 499 | last = i; |
duke@1 | 500 | } |
duke@1 | 501 | return last; |
duke@1 | 502 | } |
duke@1 | 503 | |
duke@1 | 504 | public ListIterator<A> listIterator() { |
duke@1 | 505 | return Collections.unmodifiableList(new ArrayList<A>(this)).listIterator(); |
duke@1 | 506 | } |
duke@1 | 507 | |
duke@1 | 508 | public ListIterator<A> listIterator(int index) { |
duke@1 | 509 | return Collections.unmodifiableList(new ArrayList<A>(this)).listIterator(index); |
duke@1 | 510 | } |
duke@1 | 511 | |
duke@1 | 512 | public java.util.List<A> subList(int fromIndex, int toIndex) { |
duke@1 | 513 | if (fromIndex < 0 || toIndex > size() || fromIndex > toIndex) |
duke@1 | 514 | throw new IllegalArgumentException(); |
duke@1 | 515 | |
duke@1 | 516 | ArrayList<A> a = new ArrayList<A>(toIndex - fromIndex); |
duke@1 | 517 | int i = 0; |
duke@1 | 518 | for (List<A> l = this; l.tail != null; l = l.tail, i++) { |
duke@1 | 519 | if (i == toIndex) |
duke@1 | 520 | break; |
duke@1 | 521 | if (i >= fromIndex) |
duke@1 | 522 | a.add(l.head); |
duke@1 | 523 | } |
duke@1 | 524 | |
duke@1 | 525 | return Collections.unmodifiableList(a); |
duke@1 | 526 | } |
duke@1 | 527 | } |