Reply to thread

Message: [QUOTE="Mike Schilling, post: 3810809"] This even works with ArrayList if you write Object o1 = new Object(); Object o2 = new Object(); ArrayList al = new ArrayList(); aq.add(0, o1 ); Object o3 = aq.get( 0 ); // Zero aq.add( 0, o2 ); Object o4 = aq.get( 0 ); // Zero It's far less efficient, of course, since all the items in the List need to be moved to accomodate the next first item. Anyway, the point is that any particular List implementation can define methods that modify itself in any way it likes, e .g. class SillyList extends ArrayList { public void moveStuffAroundAtRandom(); } [/QUOTE]