NodeStore implements Collection<Node>, NodeIterable { @Override public NodeStoreIterator iterator() { return new NodeStoreIterator(); } NodeStore();  NodeStore(final EdgeStore edgeStore, final GraphLock lock, final GraphViewStore viewStore, final GraphVersion graphVersion); NodeImpl get(final int id); NodeImpl get(final Object id); @Override void clear(); @Override int size(); @Override boolean isEmpty(); @Override NodeStoreIterator iterator(); @Override NodeImpl[] toArray(); @Override T[] toArray(T[] array); @Override Collection<Node> toCollection(); @Override boolean add(final Node n); @Override boolean remove(final Object o); @Override boolean contains(final Object o); boolean containsId(final Object id); @Override boolean containsAll(final Collection<?> c); @Override boolean addAll(final Collection<? extends Node> c); @Override boolean removeAll(final Collection<?> c); @Override boolean retainAll(final Collection<?> c); int deepHashCode(); boolean deepEquals(NodeStore obj); @Override void doBreak();  }
@Test public void testIterator() { NodeStore nodeStore = new NodeStore(); NodeImpl[] nodes = new NodeImpl[] { new NodeImpl("0"), new NodeImpl("1"), new NodeImpl("2") }; nodeStore.addAll(Arrays.asList(nodes)); NodeStore.NodeStoreIterator itr = nodeStore.iterator(); int index = 0; while (itr.hasNext()) { NodeImpl n = itr.next(); Assert.assertSame(n, nodes[index++]); } Assert.assertEquals(index, nodes.length); }
@Test public void testIteratorEmpty() { NodeStore nodeStore = new NodeStore(); NodeStore.NodeStoreIterator itr = nodeStore.iterator(); Assert.assertFalse(itr.hasNext()); }