|
| 1 | +/******************************************************************************* |
| 2 | + * Java2Script Pacemaker (http://j2s.sourceforge.net) |
| 3 | + * |
| 4 | + * Copyright (c) 2006 ognize.com and others. |
| 5 | + * All rights reserved. This program and the accompanying materials |
| 6 | + * are made available under the terms of the Eclipse Public License v1.0 |
| 7 | + * which accompanies this distribution, and is available at |
| 8 | + * http://www.eclipse.org/legal/epl-v10.html |
| 9 | + * |
| 10 | + * Contributors: |
| 11 | + * ognize.com - initial API and implementation |
| 12 | + *******************************************************************************/ |
| 13 | + |
| 14 | +package net.sf.j2s.test.junit; |
| 15 | + |
| 16 | +import java.util.Arrays; |
| 17 | +import java.util.Comparator; |
| 18 | +import java.util.List; |
| 19 | +import junit.framework.TestCase; |
| 20 | + |
| 21 | +/** |
| 22 | + * @author zhou renjian |
| 23 | + * |
| 24 | + * 2006-12-30 |
| 25 | + */ |
| 26 | +public class ArraysTest extends TestCase { |
| 27 | + public void testArraysSort() { |
| 28 | + byte[] bs = new byte[] {13, 4, 56}; |
| 29 | + Arrays.sort(bs); |
| 30 | + for (int i = 0; i < bs.length; i++) { |
| 31 | + System.out.println(bs[i]); |
| 32 | + } |
| 33 | + assertEquals(4, bs[0]); |
| 34 | + assertEquals(13, bs[1]); |
| 35 | + assertEquals(56, bs[2]); |
| 36 | + } |
| 37 | + public void testArraysBinarySearch() { |
| 38 | + byte[] bs = new byte[] {11, 50, 45, 4, 13, 4, 56}; |
| 39 | + Arrays.sort(bs); |
| 40 | + int idx = Arrays.binarySearch(bs, (byte) 13); |
| 41 | + assertEquals(3, idx); |
| 42 | + } |
| 43 | + public void testArraysEquals() { |
| 44 | + byte[] bs1 = new byte[] {11, 50, 45, 4, 13, 4, 56}; |
| 45 | + byte[] bs2 = new byte[] {11, 50, 45, 4, 13, 4, 56}; |
| 46 | + assertTrue(Arrays.equals(bs1, bs2)); |
| 47 | + Arrays.sort(bs1); |
| 48 | + assertFalse(Arrays.equals(bs1, bs2)); |
| 49 | + } |
| 50 | + public void testArraysAsList() { |
| 51 | + List asList = Arrays.asList(11, 50, 45, 4, 13, 4, 56); |
| 52 | + assertEquals(7, asList.size()); |
| 53 | + assertEquals(4, asList.get(3)); |
| 54 | + } |
| 55 | + public void testArraysSortString() { |
| 56 | + String[] bs = new String[] {"Hello", "World", "JavaScript"}; |
| 57 | + Arrays.sort(bs); |
| 58 | + for (int i = 0; i < bs.length; i++) { |
| 59 | + System.out.println(bs[i]); |
| 60 | + } |
| 61 | + assertEquals("Hello", bs[0]); |
| 62 | + assertEquals("JavaScript", bs[1]); |
| 63 | + assertEquals("World", bs[2]); |
| 64 | + } |
| 65 | + public void testArraysBinarySearchString() { |
| 66 | + String[] bs = new String[] {"Hello", "World", "JavaScript", "AJAX", "SWT", "JavaScript"}; |
| 67 | + Arrays.sort(bs); |
| 68 | + int idx = Arrays.binarySearch(bs, "SWT"); |
| 69 | + assertEquals(4, idx); |
| 70 | + } |
| 71 | + public void testArraysEqualsString() { |
| 72 | + String[] bs1 = new String[] {"Hello", "World", "JavaScript", "AJAX", "SWT", "JavaScript"}; |
| 73 | + String[] bs2 = new String[] {"Hello", "World", "JavaScript", "AJAX", "SWT", "JavaScript"}; |
| 74 | + assertTrue(Arrays.equals(bs1, bs2)); |
| 75 | + Arrays.sort(bs1); |
| 76 | + assertFalse(Arrays.equals(bs1, bs2)); |
| 77 | + } |
| 78 | + public void testArraysSortString2() { |
| 79 | + String[] bs = new String[] {"Hello", "World", "JavaScript"}; |
| 80 | + Arrays.sort(bs, new Comparator<String>() { |
| 81 | + public int compare(String o1, String o2) { |
| 82 | + return o1.charAt(1) - o2.charAt(1); |
| 83 | + } |
| 84 | + }); |
| 85 | + for (int i = 0; i < bs.length; i++) { |
| 86 | + System.out.println(bs[i]); |
| 87 | + } |
| 88 | + assertEquals("JavaScript", bs[0]); |
| 89 | + assertEquals("Hello", bs[1]); |
| 90 | + assertEquals("World", bs[2]); |
| 91 | + } |
| 92 | + public void testArraysBinarySearchString2() { |
| 93 | + String[] bs = new String[] {"Hello", "World", "JavaScript", "AJAX", "SWT", "JavaScript"}; |
| 94 | + Arrays.sort(bs, new Comparator<String>() { |
| 95 | + public int compare(String o1, String o2) { |
| 96 | + return o1.charAt(1) - o2.charAt(1); |
| 97 | + } |
| 98 | + }); |
| 99 | + System.out.println(); |
| 100 | + for (int i = 0; i < bs.length; i++) { |
| 101 | + System.out.println(bs[i]); |
| 102 | + } |
| 103 | +// int idx = Arrays.binarySearch(bs, "SWT"); |
| 104 | +// assertEquals(1, idx); |
| 105 | + } |
| 106 | + public void testArraysEqualsString2() { |
| 107 | + String[] bs1 = new String[] {"Hello", "World", "JavaScript", "AJAX", "SWT", "JavaScript"}; |
| 108 | + String[] bs2 = new String[] {"Hello", "World", "JavaScript", "AJAX", "SWT", "JavaScript"}; |
| 109 | + assertTrue(Arrays.equals(bs1, bs2)); |
| 110 | + Arrays.sort(bs1, new Comparator<String>() { |
| 111 | + public int compare(String o1, String o2) { |
| 112 | + return o1.charAt(1) - o2.charAt(1); |
| 113 | + } |
| 114 | + }); |
| 115 | + assertFalse(Arrays.equals(bs1, bs2)); |
| 116 | + } |
| 117 | +} |
0 commit comments