🚀 go-pugleaf

>Hi,
>
>does someone knows how to sort the items in a JList?
>
>alex
>

Hello

Here is a sorted list model that I created.  It is not fully complete
because I only needed a sorted list from a to z.


use it like this:


    SortedListModel definedKeys = new SortedListModel();
    definedKeys.addSorted(keyList);
    jlist1.setModel(definedKeys); // give it a list model


------------------------------------------------
//Title:        Utils
//Version:
//Copyright:    Copyright (c) 1997
//Author:       Alexander Anguiano
//Company:      Matrix Computing
//Description:

package utils;

import com.sun.java.swing.DefaultListModel;
import java.util.*;

public class SortedListModel extends DefaultListModel {

  private boolean ignoreDuplicates;

  public SortedListModel() {
    ignoreDuplicates = true;
  }

  /*
  public SortedListModel(SortFunction) {
  }
  */

  public void setIgnoreDuplicates(boolean ignoreDuplicates) {
    this.ignoreDuplicates = ignoreDuplicates;
  }

  public boolean isIgnoreDuplicates() {
   return ignoreDuplicates;
  }

  // add just keeps the thing sorted
  public void addSorted(Object Item1) {

     int nTop;
     int nBottom;
     int nMiddle;
     int nLocation;
     int CompareResults = 0;
     int nSize;


     nSize = size();

     if (nSize < 1)
       nLocation = 0;
    else {
      nTop = nSize - 1;
      nBottom = 0;
      nMiddle =  (nTop - nBottom) / 2;

      while (true) {
        Object Item2 = elementAt(nMiddle);
        CompareResults = Item1.toString().compareTo(Item2.toString());
         if (CompareResults < 0) {
             if (nTop == nMiddle)
                nTop = nMiddle - 1;
             else nTop = nMiddle;
         }
         else if (CompareResults > 0) {
             if (nBottom == nMiddle)
                nBottom = nMiddle + 1;
             else nBottom = nMiddle;
         }
         else {
           if (ignoreDuplicates)
             return;

  //             if (!duplicates)
  //               return -1;
           nTop = nMiddle;
           nBottom = nMiddle;
         }

        if ( ((nBottom == nTop) && (nTop == nMiddle)) || (nTop < nBottom) )
            break;
        nMiddle = (nTop - nBottom) / 2 + nBottom;
      } // while

    if (CompareResults > 0)
        nLocation = nMiddle + 1;
    else nLocation = nMiddle;
  }  // if
  insertElementAt(Item1,nLocation);
  }


  public void addSorted(Vector list) {
    for (int i= 0; i < list.size(); i++) {
      addSorted(list.elementAt(i));
    }
  }
}