Set.java

public class Set {
    private int ways;
    enum POLICY = {LRU, FIFO};
    POLICY policy;
    private int index;
    private int lineSize;
    private CacheLine[] lines;

    public Set(int w, POLICY p, int l) {
        ways = w;
        policy = p;
        lineSize = l;
        lines = new CacheLine[ways];
        for (int i = 0; i < ways; i++) {
            lines[i] = new CacheLine(l, 0);
        }

    } 

    public CacheLine read(int tag) {
        for (int i = 0; i < ways; i++) {
            if (lines.isValid() && lines[i].getTag() == tag) {
                return lines[i];
            }
        }

        return null;
    }

    public int write(int tag, int word, int data) {
        int way = getEmpty();
        if (way == -1) {
            evict(tag, data);
        }
        else {
            lines[way] = new 
        }
    }

    public CacheLine getLine(int tag) {
        return lines[find(tag)];
    }

    public int findNext() {
        int max = -1;
        int l = -1;
        for (int i = 0; i < ways; i++) {
            if (!lines[i].isValid()) return i;
            if (lines[i].priority > max) {
                max = lines[i].priority;
                l = i;
            }
        }
        return l;
    }

    private int find(int tag) {
        for (int i = 0; i < lineSize; i++) {
            if (lines.isValid() && lines[i].getTag() == tag) {
                return i;
            }
        }
        return -1;
    }

    public void put(int tag, CacheLine c) {
        int loc = findEmpty();
        if (loc == -1) {
            loc = evict();
        }

        lines[loc] = c;
    }

    public int evict() {
        int loc = leaving();
        updatePriorities(sets[loc].priority);
        if (lines[loc].dirty) {

        }

    }


    private void updatePriorities(int p) {
        for (int i = 0; i < ways; i++) {
            if (lines[i].priority < p) lines[i].incrementP();
        }
    }

}