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

package com.sibirjak.asperform.collectiontests.as3commons {
	import com.sibirjak.asperform.collectiontests.CollectionTestCase;

	import org.as3commons.collections.Treap;
	import org.as3commons.collections.framework.IIterator;

	/**
	 * @author jes 25.03.2010
	 */
	public class AS3CommonsTreapTest extends CollectionTestCase {

		private var _treap : Treap;

		/*
		 * Test neutralisation
		 */

		override protected function createCollection() : * {
			_treap = new Treap(new TestComparator());
			return _treap;
		}

		override protected function fill() : void {
			for (var i : uint = 0; i < _numItems; i++) {
				_treap.add(_data[i]);
			}
		}

		override protected function get size() : uint {
			return _treap.size;
		}

		/*
		 * Tests
		 */

		public function test_create() : void {
			for (var i : uint = 0; i < iterations; i++) {
				_treap = new Treap(new TestComparator());
			}
		}

		public function test_add() : void {
			for (var i : uint = 0; i < _numItems; i++) {
				_treap.add(_data[i]);
			}
		}

		public function test_has() : void {
			for (var i : uint = 0; i < _numItems; i++) {
				_treap.has(_data[i]);
			}
		}

		public function test_first() : void {
			for (var i : uint = 0; i < _numItems; i++) {
				_treap.first;
			}
		}

		public function test_iterate() : void {
			for (var i : uint = 0; i < iterations; i++) {
				var iterator : IIterator = _treap.iterator();
				while (iterator.hasNext()) {
					iterator.next();
				}
			}
		}

		public function test_remove() : void {
			for (var i : uint = 0; i < _numItems; i++) {
				_treap.remove(_data[i]);
			}
		}

		public function test_removeFirst() : void {
			for (var i : uint = 0; i < _numItems; i++) {
				_treap.removeFirst();
			}
		}

		public function test_removeLast() : void {
			for (var i : uint = 0; i < _numItems; i++) {
				_treap.removeLast();
			}
		}

	}
}