()
| 365 | } |
| 366 | |
| 367 | public void testClear() { |
| 368 | Map m = new BinaryTree(); |
| 369 | LocalTestNode nodes[] = makeLocalNodes(); |
| 370 | |
| 371 | for (int k = 0; k < nodes.length; k++) |
| 372 | { |
| 373 | m.put(nodes[ k ].getKey(), nodes[ k ].getValue()); |
| 374 | assertTrue(!m.isEmpty()); |
| 375 | } |
| 376 | assertTrue(!m.isEmpty()); |
| 377 | for (int k = 0; k < nodes.length; k++) |
| 378 | { |
| 379 | assertTrue(m.containsKey(nodes[ k ].getKey())); |
| 380 | assertTrue(m.containsValue(nodes[ k ].getValue())); |
| 381 | } |
| 382 | m.clear(); |
| 383 | assertTrue(m.isEmpty()); |
| 384 | for (int k = 0; k < nodes.length; k++) |
| 385 | { |
| 386 | assertTrue(!m.containsKey(nodes[ k ].getKey())); |
| 387 | assertTrue(!m.containsValue(nodes[ k ].getValue())); |
| 388 | } |
| 389 | } |
| 390 | |
| 391 | public void testKeySet() { |
| 392 | testKeySet(new BinaryTree()); |
nothing calls this directly
no test coverage detected