1 package com.daffodilwoods.daffodildb.utils.comparator; 2 3 import java.util.Comparator ; 4 import com.daffodilwoods.daffodildb.utils.field.FieldBase; 5 import com.daffodilwoods.database.resource.DException; 6 import com.daffodilwoods.daffodildb.server.sql99.common.*; 7 8 public class CJoDpnqbsbups extends SuperComparator { 9 10 private SuperComparator[] idpnqbsbupst; 11 public CJoDpnqbsbups(SuperComparator[] comparators0,boolean nullSortedHigh) { 12 super(nullSortedHigh); 13 idpnqbsbupst = comparators0; 14 } 15 16 public CJoDpnqbsbups(SuperComparator[] comparators0) { 17 idpnqbsbupst = comparators0; 18 } 19 20 21 public int compare(Object leftFieldBases, Object o2) throws DException{ 22 Object [] rightFieldBases = (Object [])o2; 23 int cmp = -1; 24 if(rightFieldBases.length > 0){ 25 if(rightFieldBases[0] instanceof Object []){ 26 for (int i = 0, length = rightFieldBases.length; i < length; i++) { 27 Object [] obj=(Object [])rightFieldBases[i]; 28 for (int j = 0; j < obj.length; j++) { 29 cmp = idpnqbsbupst[i].compare(leftFieldBases, obj[j]); 30 if (cmp == 0) 31 return cmp; 32 } 33 } 34 }else{ 35 for (int i = 0, length = rightFieldBases.length; i < length; i++) { 36 cmp = idpnqbsbupst[i].compare(leftFieldBases, rightFieldBases[i]); 37 if (cmp == 0) 38 return cmp; 39 } 40 } 41 } 42 43 return cmp; 44 } 45 46 public int compareOLD(Object leftFieldBases, Object o2) throws DException{ 47 Object [] rightFieldBases = (Object [])o2; 48 int cmp = -1; 49 for (int i = 0, length = rightFieldBases.length; i < length; i++) { 50 cmp = idpnqbsbupst[i].compare(leftFieldBases, rightFieldBases[i]); 51 if (cmp == 0) 52 return cmp; 53 } 54 return cmp; 55 } 56 57 public String toString() { 58 String str = "CJoDpnqbsbups : [Length of Comparators is " + idpnqbsbupst.length + " ]"; 59 for (int i = 0; i < idpnqbsbupst.length; i++) { 60 str += " [ " + idpnqbsbupst[i] + " ] "; 61 } 62 return str; 63 } 64 65 public static FieldBase[] changeIntoFieldBase(Object []array) throws DException { 66 if(array == null) 67 return null; 68 int length = array.length; 69 FieldBase [] fieldBase = new FieldBase[length]; 70 for(int i = 0; i < length; ++i) 71 fieldBase[i] = (FieldBase)array[i]; 72 return fieldBase; 73 } 74 75 } 76 77 | Popular Tags |