| 1 |
|
/* |
| 2 |
< |
* Copyright 2003-2004 Sun Microsystems, Inc. All Rights Reserved. |
| 2 |
> |
* Copyright (c) 2003, 2004, Oracle and/or its affiliates. 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 |
| 16 |
|
* 2 along with this work; if not, write to the Free Software Foundation, |
| 17 |
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| 18 |
|
* |
| 19 |
< |
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
| 20 |
< |
* CA 95054 USA or visit www.sun.com if you need additional information or |
| 21 |
< |
* have any questions. |
| 19 |
> |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| 20 |
> |
* or visit www.oracle.com if you need additional information or have any |
| 21 |
> |
* questions. |
| 22 |
|
*/ |
| 23 |
|
|
| 24 |
|
/* |
| 95 |
|
Map m = newMap(); |
| 96 |
|
for (int i=0; i<mapSize; i++) |
| 97 |
|
if (m.put(new Integer(i), new Integer(2*i)) != null) |
| 98 |
< |
fail("put returns a non-null value erroenously."); |
| 98 |
> |
fail("put returns a non-null value erroneously."); |
| 99 |
|
for (int i=0; i<2*mapSize; i++) |
| 100 |
|
if (m.containsValue(new Integer(i)) != (i%2==0)) |
| 101 |
|
fail("contains value "+i); |
| 102 |
|
if (m.put(nil, nil) == null) |
| 103 |
< |
fail("put returns a null value erroenously."); |
| 103 |
> |
fail("put returns a null value erroneously."); |
| 104 |
|
Map m2 = newMap(); m2.putAll(m); |
| 105 |
|
if (!m.equals(m2)) |
| 106 |
|
fail("Clone not equal to original. (1)"); |
| 126 |
|
fail("clear failed."); |
| 127 |
|
|
| 128 |
|
Iterator i = m.entrySet().iterator(); |
| 129 |
< |
while(i.hasNext()) { |
| 129 |
> |
while (i.hasNext()) { |
| 130 |
|
i.next(); |
| 131 |
|
i.remove(); |
| 132 |
|
} |
