1 /*
2 * The Apache Software License, Version 1.1
3 *
4 * Copyright (c) 2002 The Apache Software Foundation. All rights
5 * reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 *
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 *
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in
16 * the documentation and/or other materials provided with the
17 * distribution.
18 *
19 * 3. The end-user documentation included with the redistribution,
20 * if any, must include the following acknowledgment:
21 * "This product includes software developed by the
22 * Apache Software Foundation (http://www.apache.org/)."
23 * Alternately, this acknowledgment may appear in the software itself,
24 * if and wherever such third-party acknowledgments normally appear.
25 *
26 * 4. The names "Apache" and "Apache Software Foundation" must
27 * not be used to endorse or promote products derived from this
28 * software without prior written permission. For written
29 * permission, please contact apache@apache.org.
30 *
31 * 5. Products derived from this software may not be called "Apache",
32 * nor may "Apache" appear in their name, without prior written
33 * permission of the Apache Software Foundation.
34 *
35 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
36 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
37 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
38 * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
39 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
40 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
41 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
42 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
43 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
44 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
45 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
46 * SUCH DAMAGE.
47 * ====================================================================
48 *
49 * This software consists of voluntary contributions made by many
50 * individuals on behalf of the Apache Software Foundation. For more
51 * information on the Apache Software Foundation, please see
52 * <http://www.apache.org/>;.
53 */
54 package net.sf.cglib.util;
55
56 import net.sf.cglib.CodeGenTestCase;
57 import java.io.*;
58 import java.lang.reflect.Method;
59 import java.util.*;
60 import junit.framework.*;
61
62 /***
63 * @author Chris Nokleberg <a href="mailto:chris@nokleberg.com">chris@nokleberg.com</a>
64 * @version $Id: TestParallelSorter.java,v 1.2 2003/09/18 17:23:29 herbyderby Exp $
65 */
66 public class TestParallelSorter extends CodeGenTestCase {
67 public void testSorts() throws Throwable {
68 Object[] data1 = getTestData();
69 Object[] data2 = copy(data1);
70 Object[] data3 = copy(data1);
71 int[] idx1 = getIndexes(data1.length);
72 int[] idx2 = getIndexes(data1.length);
73 int[] idx3 = getIndexes(data1.length);
74 ParallelSorter p1 = ParallelSorter.create(new Object[]{ data1, idx1 });
75 ParallelSorter p2 = ParallelSorter.create(new Object[]{ data2, idx2 });
76 p1.quickSort(0);
77 p2.mergeSort(0);
78 compare(data1, data2);
79 compare(idx1, idx2);
80 p1.quickSort(1);
81 compare(idx1, idx3);
82 compare(data1, data3);
83 }
84
85 private void compare(Object[] data1, Object[] data2) {
86 assertTrue(data1.length == data2.length);
87 for (int i = 0; i < data1.length; i++) {
88 assertTrue(data1[i].equals(data2[i]));
89 }
90 }
91
92 private void compare(int[] data1, int[] data2) {
93 assertTrue(data1.length == data2.length);
94 for (int i = 0; i < data1.length; i++) {
95 assertTrue(data1[i] == data2[i]);
96 }
97 }
98
99 private int[] getIndexes(int len) {
100 int[] idx = new int[len];
101 for (int i = 0; i < len; i++) {
102 idx[i] = i;
103 }
104 return idx;
105 }
106
107 private Object[] getTestData() throws IOException {
108 InputStream in = getClass().getResourceAsStream("words.txt");
109 BufferedReader r = new BufferedReader(new InputStreamReader(in));
110 List list = new ArrayList();
111 String line;
112 int c = 0;
113 while ((line = r.readLine()) != null) {
114 list.add(line);
115 if (c++ == 20) break;
116 }
117 return list.toArray();
118 }
119
120 private Object[] copy(Object[] data) {
121 Object[] copy = new Object[data.length];
122 System.arraycopy(data, 0, copy, 0, data.length);
123 return copy;
124 }
125
126 public TestParallelSorter(String testName) {
127 super(testName);
128 }
129
130 public static void main(String[] args) {
131 junit.textui.TestRunner.run(suite());
132 }
133
134 public static Test suite() {
135 return new TestSuite(TestParallelSorter.class);
136 }
137 }
This page was automatically generated by Maven