File r37/lisp/csl/jlisp/PDSEntry.java artifact 232844c454 part of check-in 3af273af29

//
// This file is part of the Jlisp implementation of Standard Lisp
// Copyright \u00a9 (C) Codemist Ltd, 1998-2000.
//

import java.io.*;
import java.util.*;

class PDSEntry implements Comparable
{
    String name; // name of this member
    int loc;     // location within the PDS (only 32 bits boo hiss!)
    int len;     // size of this member (also only 32 bits)
    long date;   // time last updated (64 bits)

    static final int orderName = 0;
    static final int orderLoc  = 1;
    static final int orderSize = 2;
    static final int orderDate = 3;
// The STATIC field here controls what ordering will be applied
// if I make an array of PDSEntry values and go Arrays.sort() on it.
    static int ordering = orderName;

public int compareTo(Object aa)
{
    if (!(aa instanceof PDSEntry)) return -1;
    PDSEntry a = (PDSEntry)aa;
    int r;
    switch (ordering)
    {
case orderName:
default:
        r = name.compareTo(a.name);
        if (r != 0) return r;
        else break;
case orderLoc:
        if (loc != a.loc) return a.loc - loc;
        else break;
case orderSize:
        if (len != a.len) return a.len - len;
        else break;
case orderDate:
        if (date != a.date) return (a.date < date) ? -1 : 1;
        else break;
    }
// If the primary key does not distinguish I will try the others in
// order to apply at least some ordering.
    r = name.compareTo(a.name);
    if (r != 0) return r;
    if (date != a.date) return (a.date < date) ? -1 : 1;
    if (len != a.len) return a.len - len;
    if (loc != a.loc) return a.loc - loc;
    return 0;
}

PDSEntry(String name, int loc, int len, long date)
{
    this.name = name;
    this.loc = loc;
    this.len = len;
    this.date = date;
}

}

// end of PDSEntry.java