summaryrefslogtreecommitdiff
path: root/israfil-foundation-collections/src/test/java/net/israfil/foundation/collections/RandomOrderIteratorTest.java
blob: 3b7de37eb3867834d79c3a5dc69c0f9524f146ac (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
/*
 * Copyright (c) 2003 - 2008 Israfil Consulting Services Corporation
 * Copyright (c) 2003 - 2008 Christian Edward Gruber
 * All Rights Reserved
 * 
 * This software is licensed under the Berkeley Standard Distribution license,
 * (BSD license), as defined below:
 * 
 * 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. Neither the name of Israfil Consulting Services nor the names of its contributors 
 *    may be used to endorse or promote products derived from this software without 
 *    specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 COPYRIGHT OWNER OR CONTRIBUTORS 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.
 * 
 * $Id: SoloCollectionTest.java 130 2006-12-31 23:22:17Z cgruber $
 */
package net.israfil.foundation.collections;

import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;
import java.util.Random;

import org.testng.Assert;
import org.testng.annotations.AfterMethod;
import org.testng.annotations.BeforeMethod;
import org.testng.annotations.Test;

/**
 * 
 * @author <a href="mailto:cgruber@israfil.net">Christian Edward Gruber </a>
 * @author Latest: $Author: cgruber $
 * @version $Revision: 76 $
 */
@Test
public class RandomOrderIteratorTest {

	Collection<String> c;
	final String string1 = "String1";
	final String string2 = "String2";
	final String string3 = "String3";

	@BeforeMethod
	protected void setUp() throws Exception {
		c = new ArrayList<String>();
		c.add(string1);
		c.add(string2);
		c.add(string3);
	}
	
	@AfterMethod
	public void tearDown() throws Exception {
		c = null;
	}	
	
	public void testRandomIteratorWithSeed0() {
		Iterator<String> i = new RandomOrderIterator<String>(c,new Random(0l));
		Assert.assertTrue(i.hasNext());
		Assert.assertSame(string1,i.next());
		Assert.assertTrue(i.hasNext());
		Assert.assertSame(string3,i.next());
		Assert.assertTrue(i.hasNext());
		Assert.assertSame(string2,i.next());
		Assert.assertFalse(i.hasNext());
	}
	public void testRandomIteratorWithSeed5() {
		Iterator<String> i = new RandomOrderIterator<String>(c,new Random(5l));
		Assert.assertTrue(i.hasNext());
		Assert.assertSame(string3,i.next());
		Assert.assertTrue(i.hasNext());
		Assert.assertSame(string1,i.next());
		Assert.assertTrue(i.hasNext());
		Assert.assertSame(string2,i.next());
		Assert.assertFalse(i.hasNext());
	}
	public void testRandomIteratorWithSeed92283842() {
		Iterator<String> i = new RandomOrderIterator<String>(c,new Random(92283842l));
		Assert.assertTrue(i.hasNext());
		Assert.assertSame(string2,i.next());
		Assert.assertTrue(i.hasNext());
		Assert.assertSame(string3,i.next());
		Assert.assertTrue(i.hasNext());
		Assert.assertSame(string1,i.next());
		Assert.assertFalse(i.hasNext());
	}
	
}