/* * (c) Copyright 2008, 2009 Hewlett-Packard Development Company, LP * All rights reserved. * [See end of file] */ package org.openjena.atlas.iterator; import java.util.ArrayList ; import java.util.List ; import org.junit.Test ; import org.openjena.atlas.junit.BaseTest ; public class TestIteratorPeek extends BaseTest { List data0 = new ArrayList() ; List data1 = new ArrayList() ; { data1.add("a") ; } List data2 = new ArrayList() ; { data2.add("x") ; data2.add("y") ; data2.add("z") ; } @Test public void iter_01() { Iter iter = Iter.iter(data2) ; iter = iter.append(data2.iterator()) ; test(iter, "x", "y", "z", "x", "y", "z") ; } private void test(Iter iter, Object... items) { for ( Object x : items ) { assertTrue(iter.hasNext()) ; assertEquals(x, iter.next()) ; } assertFalse(iter.hasNext()) ; } private static PeekIterator create(String...a) { return new PeekIterator(IteratorArray.create(a)) ; } @Test public void peek_1() { PeekIterator peek = create("a", "b", "c") ; assertEquals("a", peek.peek()) ; test(Iter.iter(peek), "a", "b", "c") ; } @Test public void peek_2() { PeekIterator peek = create() ; assertFalse(peek.hasNext()) ; } @Test public void peek_3() { PeekIterator peek = create("a") ; assertEquals("a", peek.peek()) ; } @Test public void peek_4() { PeekIterator peek = create("a") ; assertEquals("a", peek.peek()) ; assertEquals("a", peek.peek()) ; assertEquals("a", peek.next()) ; assertFalse(peek.hasNext()) ; } @Test public void peek_5() { PeekIterator peek = create("a", "b") ; assertEquals("a", peek.peek()) ; assertEquals("a", peek.peek()) ; assertEquals("a", peek.next()) ; assertTrue(peek.hasNext()) ; assertEquals("b", peek.peek()) ; assertEquals("b", peek.peek()) ; assertEquals("b", peek.next()) ; assertFalse(peek.hasNext()) ; } } /* * (c) Copyright 2008, 2009 Hewlett-Packard Development Company, LP * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. The name of the author may not be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */