The examples that I wrote / finished yesterday ended up with a program called "Zoe" in Java, which read all the records in an access log file, created an object for each of them (which, sensibly would have been called a Hit but we called a "Zoe"), and reported on that object creation.

To finish off that example this morning, I sorted the objects (and I chose to do so based on the web server returned status codes, and where they were the same, the visiting host name), and printed them out. Th efollowing changes were made to the source code:

1. Set the class to implement "Comparable" which means that we have added a compareTo method which returns an integer (-ve, 0, +ve)

2. Called Collections.Sort on the ArrayList object (Collections.Sort is a static method of the Collection object type in java.util)

3. Provided a toString method so that we can easily display an Aileen (that's the new name of the class that I used as I wanted to leave Zoe available for delegates to look back at the intermediate stage) object.

4. Looped through our ArrayList after sorting in to output all the members in it.

In code terms:

public class Aileen implements Comparable {

Within the main program / test harness:

Collections.sort(Visits);
for (int k=0; k<Visits.size(); k++) {
  System.out.println(Visits.get(k));
  }

And new methods within the class:

public int compareTo(Object that) {
 // Can we differentiate by status?
 int newstate = this.status - ((Aileen)that).status;
 if (newstate != 0) return newstate;
 // If we can't, differentiate on host name
 return (this.Host.compareTo(((Aileen)that).Host));
 }
 
public String toString() {
 String rezult = Host + " " + /* Request + " " + */
   Time + " " + status;
 return rezult;
 }

You can sorted other ordered collection types in Java using the same mechanism, but you cannot sort any of the Hash types (Hash, HashMap, HashSet) - if you want their members in order, copy the keys to a Vector or an ArrayList.

You can also provide a Comparator object as a parameter to your call to Collections.Sort; be default, objects are sorted into what is know as their natural sort order by reference to the compareTo method, but if you provide Comparators you can have different ways of sorting them.

Full source code here.
(written 2009-09-25)

 J714 - Java - Fundamental classes
  [42] Do languages change? - (2004-09-08)
  [1062] Java sorting - comparable v comparator - (2007-02-02)
  [1502] Java, sorting, ArrayList example, generics - (2008-01-11)
  [1910] Java - Generics - (2008-11-27)
  [2323] Java Collection Objects in the java.util package - (2009-08-05)
  [2418] Viv.java uses unchecked or unsafe operations - explanation and cure - (2009-09-24)
  [2649] Length, size or capacity in Java? - (2010-02-24)
  [2734] for and foreach in Java - (2010-04-22)
  [2920] Sorting - naturally, or into a different order - (2010-08-14)
  [3048] String handling - from first steps to practical examples - (2010-11-13)
  [4330] Java - factory method, encapsulation, hashmap example - (2014-11-27)
  [4396] Java Utility class - flexible replacement for array. Also cacheing in objects and multiple catch clauses example. - (2015-01-16)
  [4421] How healthy are the stars of stage and screen? - (2015-02-09)
  [4431] A Java servlet that is also a stand alone program. And a server that is also a web client. - (2015-02-19)

Back to Exceptions in Java - why and how

Previous and next or Horse's mouth home

Forward to Looking inside Java classes - javap and javadoc

Weekend and Christmas Promotion - Well House Manor Hotel, Melksham
A Winter Weekend Special at Well House Manor
What is a JVM, a JRE, a JDK - components of the core Java Environment
Looking inside Java classes - javap and javadoc
Sorting Collections of Objects in Java
Exceptions in Java - why and how
Where is my Java class?
Java Programming Fundamentals
Automating access to a page obscured behind a holding page