@Override protected V getItemInSlot(int slot) { return getValue(slot); } };
@Override protected V getItemInSlot(int slot) { return getValue(slot); } };
@Override protected V getItemInSlot(int slot) { return getValue(slot); } };
@Override protected Entry<K, V> getItemInSlot(int slot) { return new AbstractMap.SimpleEntry<>(getKey(slot), getValue(slot)); } };
@Override protected Entry<K, V> getItemInSlot(int slot) { return new AbstractMap.SimpleEntry<>(getKey(slot), getValue(slot)); } };
@Override protected Entry<K, V> getItemInSlot(int slot) { return new AbstractMap.SimpleEntry<>(getKey(slot), getValue(slot)); } };
@Override @SuppressWarnings("unchecked") public Iterator<AbstractStatement> getStatementsThatUse(PointsToSetVariable v) { if (v == null) { throw new IllegalArgumentException("v is null"); } int number = v.getGraphNodeId(); if (number == -1) { return EmptyIterator.instance(); } Iterator<INodeWithNumber> result = delegateGraph.getSuccNodes(v); for (int i = 0; i < invImplicitUnaryMap.size(); i++) { UnaryOperator op = invImplicitUnaryMap.getKey(i); IBinaryNaturalRelation R = invImplicitUnaryMap.getValue(i); IntSet s = R.getRelated(number); if (s != null) { result = new CompoundIterator<>(new ImplicitUseIterator(op, v, s), result); } } List<AbstractStatement> list = new ArrayList<>(); while (result.hasNext()) { list.add((AbstractStatement) result.next()); } return list.iterator(); }
@Override @SuppressWarnings("unchecked") public Iterator<AbstractStatement> getStatementsThatDef(PointsToSetVariable v) { if (v == null) { throw new IllegalArgumentException("v is null"); } int number = v.getGraphNodeId(); if (number == -1) { return EmptyIterator.instance(); } Iterator<INodeWithNumber> result = delegateGraph.getPredNodes(v); for (int i = 0; i < implicitUnaryMap.size(); i++) { UnaryOperator op = implicitUnaryMap.getKey(i); IBinaryNaturalRelation R = implicitUnaryMap.getValue(i); IntSet s = R.getRelated(number); if (s != null) { result = new CompoundIterator<>(new ImplicitDefIterator(op, s, v), result); } } List<AbstractStatement> list = new ArrayList<>(); while (result.hasNext()) { list.add((AbstractStatement) result.next()); } return list.iterator(); }
@Override @SuppressWarnings("unchecked") public Iterator<AbstractStatement> getStatementsThatDef(PointsToSetVariable v) { if (v == null) { throw new IllegalArgumentException("v is null"); } int number = v.getGraphNodeId(); if (number == -1) { return EmptyIterator.instance(); } Iterator<INodeWithNumber> result = delegateGraph.getPredNodes(v); for (int i = 0; i < implicitUnaryMap.size(); i++) { UnaryOperator op = implicitUnaryMap.getKey(i); IBinaryNaturalRelation R = implicitUnaryMap.getValue(i); IntSet s = R.getRelated(number); if (s != null) { result = new CompoundIterator<>(new ImplicitDefIterator(op, s, v), result); } } List<AbstractStatement> list = new ArrayList<>(); while (result.hasNext()) { list.add((AbstractStatement) result.next()); } return list.iterator(); }
@Override @SuppressWarnings("unchecked") public Iterator<AbstractStatement> getStatementsThatUse(PointsToSetVariable v) { if (v == null) { throw new IllegalArgumentException("v is null"); } int number = v.getGraphNodeId(); if (number == -1) { return EmptyIterator.instance(); } Iterator<INodeWithNumber> result = delegateGraph.getSuccNodes(v); for (int i = 0; i < invImplicitUnaryMap.size(); i++) { UnaryOperator op = invImplicitUnaryMap.getKey(i); IBinaryNaturalRelation R = invImplicitUnaryMap.getValue(i); IntSet s = R.getRelated(number); if (s != null) { result = new CompoundIterator<>(new ImplicitUseIterator(op, v, s), result); } } List<AbstractStatement> list = new ArrayList<>(); while (result.hasNext()) { list.add((AbstractStatement) result.next()); } return list.iterator(); }