/** * Creates a new graph. * * @param countRegs {@code >= 0;} the start count of registers in * the namespace. New registers can be added subsequently. */ public InterferenceGraph(int countRegs) { interference = new ArrayList<IntSet>(countRegs); for (int i = 0; i < countRegs; i++) { interference.add(SetFactory.makeInterferenceSet(countRegs)); } }
/** * Creates a new graph. * * @param countRegs {@code >= 0;} the start count of registers in * the namespace. New registers can be added subsequently. */ public InterferenceGraph(int countRegs) { interference = new ArrayList<IntSet>(countRegs); for (int i = 0; i < countRegs; i++) { interference.add(SetFactory.makeInterferenceSet(countRegs)); } }
/** * Creates a new graph. * * @param countRegs {@code >= 0;} the start count of registers in * the namespace. New registers can be added subsequently. */ public InterferenceGraph(int countRegs) { interference = new ArrayList<IntSet>(countRegs); for (int i = 0; i < countRegs; i++) { interference.add(SetFactory.makeInterferenceSet(countRegs)); } }
/** * Creates a new graph. * * @param countRegs {@code >= 0;} the start count of registers in * the namespace. New registers can be added subsequently. */ public InterferenceGraph(int countRegs) { interference = new ArrayList<IntSet>(countRegs); for (int i = 0; i < countRegs; i++) { interference.add(SetFactory.makeInterferenceSet(countRegs)); } }
/** * Creates a new graph. * * @param countRegs {@code >= 0;} the start count of registers in * the namespace. New registers can be added subsequently. */ public InterferenceGraph(int countRegs) { interference = new ArrayList<IntSet>(countRegs); for (int i = 0; i < countRegs; i++) { interference.add(SetFactory.makeInterferenceSet(countRegs)); } }
/** * Creates a new graph. * * @param countRegs {@code >= 0;} the start count of registers in * the namespace. New registers can be added subsequently. */ public InterferenceGraph(int countRegs) { interference = new ArrayList<IntSet>(countRegs); for (int i = 0; i < countRegs; i++) { interference.add(SetFactory.makeInterferenceSet(countRegs)); } }
/** * Creates a new graph. * * @param countRegs {@code >= 0;} the start count of registers in * the namespace. New registers can be added subsequently. */ public InterferenceGraph(int countRegs) { interference = new ArrayList<IntSet>(countRegs); for (int i = 0; i < countRegs; i++) { interference.add(SetFactory.makeInterferenceSet(countRegs)); } }
/** * Creates a new graph. * * @param countRegs {@code >= 0;} the start count of registers in * the namespace. New registers can be added subsequently. */ public InterferenceGraph(int countRegs) { interference = new ArrayList<IntSet>(countRegs); for (int i = 0; i < countRegs; i++) { interference.add(SetFactory.makeInterferenceSet(countRegs)); } }
/** * Ensures that the interference graph is appropriately sized. * * @param size requested minumum size */ private void ensureCapacity(int size) { int countRegs = interference.size(); interference.ensureCapacity(size); for (int i = countRegs; i < size; i++) { interference.add(SetFactory.makeInterferenceSet(size)); } } }
/** * Ensures that the interference graph is appropriately sized. * * @param size requested minumum size */ private void ensureCapacity(int size) { int countRegs = interference.size(); interference.ensureCapacity(size); for (int i = countRegs; i < size; i++) { interference.add(SetFactory.makeInterferenceSet(size)); } } }
/** * Ensures that the interference graph is appropriately sized. * * @param size requested minumum size */ private void ensureCapacity(int size) { int countRegs = interference.size(); interference.ensureCapacity(size); for (int i = countRegs; i < size; i++) { interference.add(SetFactory.makeInterferenceSet(size)); } } }
/** * Ensures that the interference graph is appropriately sized. * * @param size requested minumum size */ private void ensureCapacity(int size) { int countRegs = interference.size(); interference.ensureCapacity(size); for (int i = countRegs; i < size; i++) { interference.add(SetFactory.makeInterferenceSet(size)); } } }
/** * Ensures that the interference graph is appropriately sized. * * @param size requested minumum size */ private void ensureCapacity(int size) { int countRegs = interference.size(); interference.ensureCapacity(size); for (int i = countRegs; i < size; i++) { interference.add(SetFactory.makeInterferenceSet(size)); } } }
/** * Ensures that the interference graph is appropriately sized. * * @param size requested minumum size */ private void ensureCapacity(int size) { int countRegs = interference.size(); interference.ensureCapacity(size); for (int i = countRegs; i < size; i++) { interference.add(SetFactory.makeInterferenceSet(size)); } } }
/** * Ensures that the interference graph is appropriately sized. * * @param size requested minumum size */ private void ensureCapacity(int size) { int countRegs = interference.size(); interference.ensureCapacity(size); for (int i = countRegs; i < size; i++) { interference.add(SetFactory.makeInterferenceSet(size)); } } }
/** * Ensures that the interference graph is appropriately sized. * * @param size requested minumum size */ private void ensureCapacity(int size) { int countRegs = interference.size(); interference.ensureCapacity(size); for (int i = countRegs; i < size; i++) { interference.add(SetFactory.makeInterferenceSet(size)); } } }