183b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com/* 283b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * [The "BSD licence"] 300fc68adf2e39aeb9fed35293f2576bbe729ec4bJesusFreke@JesusFreke.com * Copyright (c) 2010 Ben Gruver (JesusFreke) 483b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * All rights reserved. 583b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * 683b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * Redistribution and use in source and binary forms, with or without 783b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * modification, are permitted provided that the following conditions 883b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * are met: 983b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * 1. Redistributions of source code must retain the above copyright 1083b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * notice, this list of conditions and the following disclaimer. 1183b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * 2. Redistributions in binary form must reproduce the above copyright 1283b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * notice, this list of conditions and the following disclaimer in the 1383b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * documentation and/or other materials provided with the distribution. 1483b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * 3. The name of the author may not be used to endorse or promote products 1583b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * derived from this software without specific prior written permission. 1683b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * 1783b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 1883b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 1983b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 2083b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 2183b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 2283b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 2383b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 2483b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 2583b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 2683b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 2783b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com */ 2883b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com 2983b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.compackage org.jf.dexlib.Util; 3083b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com 3183b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.comimport java.util.Arrays; 3283b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.comimport java.util.Comparator; 3383b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com 3483b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.compublic class ArrayUtils { 3583b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com /** 3683b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * Utility method to sort two related arrays - that is, two arrays where the elements are related to each other 3783b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * by their position in the array. i.e. firstArray[0] is related to secondArray[0], firstArray[1] is related to 3883b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * secondArray[1], and so on. The first array is sorted based on its implementation of Comparable, and the 2nd 3983b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * array is sorted by it's related item in the first array, so that the same elements are still related to each 4083b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * other after the sort 4183b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * @param firstArray The first array, which contains the values to sort 4283b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * @param secondArray The second array, which will be sorted based on the values in the first array 4383b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * @param <A> The type of element in the first array 4483b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com * @param <B> the type of element in the second array 4583b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com */ 4683b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com public static <A extends Comparable<A>, B> void sortTwoArrays(A[] firstArray, B[] secondArray) 4783b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com { 4883b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com if (firstArray.length != secondArray.length) { 4983b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com throw new RuntimeException("Both arrays must be of the same length"); 5083b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com } 5183b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com 5283b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com class element 5383b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com { 5483b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com public A first; 5583b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com public B second; 5683b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com } 5783b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com 5883b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com element[] elements = new element[firstArray.length]; 5983b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com 6083b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com Arrays.sort(elements, new Comparator<element>(){ 6183b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com public int compare(element a, element b) { 6283b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com return a.first.compareTo(b.first); 6383b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com } 6483b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com }); 6583b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com 6683b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com for (int i=0; i<elements.length; i++) { 6783b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com firstArray[i] = elements[i].first; 6883b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com secondArray[i] = elements[i].second; 6983b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com } 7083b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com } 7183b80f81d311b233188c281059aad4a9f5e8b4e6JesusFreke@JesusFreke.com} 72