🚀 go-pugleaf

Hello Everybody,

Here you may find my prg:

import java.util.*;

public class TestSort {
  Vector                          myV;
  HashMap               myHashMap;
  TreeMap               myTreeMap;

  public Vector getVector() {
    return myV;
  }

  public TestSort() {
    myV           = new Vector();
  }

  public static void main(String[] args) {
    TestSort testSort = new TestSort();
    final int nNbIter = 20;
    testSort.invokedStandalone = true;

    for (int i = 0 ; i < nNbIter; i++) {
      String myStr = "toto" + String.valueOf(i);
      testSort.getVector().addElement(myStr);
    }

   Object[] mySA = testSort.getVector().toArray();
   System.out.println("Array before sorting = " );
   for (int i = 0; i < mySA.length; i++)
      System.out.print((String)mySA[i] + "|");
   Arrays.sort(mySA);
   System.out.println("Array after sorting = ");
   for (int i = 0; i < mySA.length; i++)
      System.out.print((String)mySA[i] + "|");
   System.out.println("");

   String sToSearch = "toto9";
   int nPos = Arrays.binarySearch(mySA, sToSearch);
   if ( nPos >= 0 )
    System.out.println("Object found = " + (String)mySA[nPos] + ", and
nPos = " + nPos);
  }
  private boolean invokedStandalone = false;
}


Output :
Sortie :
Array before sorting =
toto0|toto1|toto2|toto3|toto4|toto5|toto6|toto7|toto8|toto9|toto10|toto11|toto12|toto13|toto14|toto15|toto16|toto17|toto18|toto19|

Array after sorting =
toto0|toto1|toto10|toto11|toto12|toto13|toto14|toto15|toto16|toto17|toto18|toto19|toto2|toto3|toto4|toto5|toto6|toto7|toto8|toto9|

Object found = toto9, and nPos = 19


The pb is that I have not the same order !!! May I have to write a new
compareTo method in a String derived class. So, is there anybody who may

give me a solution ?

Best Regards.