1 files changed, 85 insertions, 0 deletions
diff --git a/systemtap/org.eclipse.linuxtools.systemtap.ui.structures.tests/src/org/eclipse/linuxtools/systemtap/ui/structures/SortTest.java b/systemtap/org.eclipse.linuxtools.systemtap.ui.structures.tests/src/org/eclipse/linuxtools/systemtap/ui/structures/SortTest.java
new file mode 100644
index 0000000000..2747b73a83
--- /dev/null
+++ b/systemtap/org.eclipse.linuxtools.systemtap.ui.structures.tests/src/org/eclipse/linuxtools/systemtap/ui/structures/SortTest.java
@@ -0,0 +1,85 @@
+/*******************************************************************************
+ * Copyright (c) 2006 IBM Corporation.
+ * All rights reserved. This program and the accompanying materials
+ * are made available under the terms of the Eclipse Public License v1.0
+ * which accompanies this distribution, and is available at
+ * http://www.eclipse.org/legal/epl-v10.html
+ *
+ * Contributors:
+ *     IBM Corporation - Jeff Briggs, Henry Hughes, Ryan Morse
+ *******************************************************************************/
+
+package org.eclipse.linuxtools.systemtap.ui.structures;
+
+import org.eclipse.linuxtools.systemtap.ui.structures.Sort;
+
+import junit.framework.TestCase;
+
+public class SortTest extends TestCase {
+	public SortTest(String name) {
+		super(name);
+	}
+
+	protected void setUp() throws Exception {
+		super.setUp();
+	}
+
+	public void testQuicksort() {
+		String blank = "";
+		String[] s0 = null;
+		String[] s1 = new String[0];
+		String[] s2 = new String[] {blank};
+		String[] s3 = new String[] {"a"};
+		String[] s4 = new String[] {"a", "b", "c", "d"};
+		String[] s5 = new String[] {"d", "c", "b", "a"};
+		String[] s6 = new String[] {"c", "d", "a", "b"};
+		String[] s7 = new String[] {"a", "d", "a", "b"};
+		
+		Sort.quicksort(s0, 0, 0);
+		assertNull("Sort null list", s0);
+
+		Sort.quicksort(s1, 0, 0);
+		assertEquals("Sort empty list", 0, s1.length);
+		
+		Sort.quicksort(s2, 0, s2.length-1);
+		assertEquals("Sort blank list", 1, s2.length);
+		assertEquals("Blank item same", blank, s2[0]);
+
+		Sort.quicksort(s3, 0, s3.length-1);
+		assertEquals("Sort single item list", 1, s3.length);
+		assertTrue("Single item same", "a".equals(s3[0]));
+
+		Sort.quicksort(s4, 0, s4.length-1);
+		assertEquals("Sort ordered list", 4, s4.length);
+		assertTrue("Single item same", "a".equals(s4[0]));
+		assertTrue("Single item same", "b".equals(s4[1]));
+		assertTrue("Single item same", "c".equals(s4[2]));
+		assertTrue("Single item same", "d".equals(s4[3]));
+
+		Sort.quicksort(s5, 0, s5.length-1);
+		assertEquals("Sort reversed list", 4, s5.length);
+		assertTrue("Single item same", "a".equals(s5[0]));
+		assertTrue("Single item same", "b".equals(s5[1]));
+		assertTrue("Single item same", "c".equals(s5[2]));
+		assertTrue("Single item same", "d".equals(s5[3]));
+
+		Sort.quicksort(s6, 0, s6.length-1);
+		assertEquals("Sort random list", 4, s6.length);
+		assertTrue("Single item same", "a".equals(s6[0]));
+		assertTrue("Single item same", "b".equals(s6[1]));
+		assertTrue("Single item same", "c".equals(s6[2]));
+		assertTrue("Single item same", "d".equals(s6[3]));
+
+		Sort.quicksort(s7, 0, s7.length-1);
+		assertEquals("Sort duplicate item list", 4, s7.length);
+		assertTrue("Single item same", "a".equals(s7[0]));
+		assertTrue("Single item same", "a".equals(s7[1]));
+		assertTrue("Single item same", "b".equals(s7[2]));
+		assertTrue("Single item same", "d".equals(s7[3]));
+	}
+	
+	protected void tearDown() throws Exception {
+		super.tearDown();
+	}
+	
+}