@Override public void voidVisitInt(final ATermInt i) { final String txt = String.valueOf(i.getInt()); stream.write(txt); position += txt.length(); }
/** * Serializes the given int. Ints will always be serialized in one piece. * * @see openllet.aterm.ATermFwdVoid#voidVisitInt(ATermInt) */ @Override public void voidVisitInt(final ATermInt arg) { _currentBuffer.put(getHeader(arg)); writeInt(arg.getInt()); }
@Override public void visitCard(final ATermAppl term) { _out.print("("); visit((ATermAppl) term.getArgument(0)); _out.print(" exactly " + ((ATermInt) term.getArgument(1)).getInt()); _out.print(")"); }
@Override public void visitCard(final ATermAppl term) { _out.print("("); visit((ATermAppl) term.getArgument(0)); _out.print(" exactly " + ((ATermInt) term.getArgument(1)).getInt()); _out.print(")"); }
@Override public boolean equivalent(final SharedObject obj) { if (obj instanceof ATermInt) { final ATermInt peer = (ATermInt) obj; if (peer.getType() != getType()) return false; return peer.getInt() == _value; } return false; }
final static public ATermAppl makeMax(final ATerm r, final ATermInt n, final ATerm c) { assertTrue(n.getInt() >= 0); return factory.makeAppl(MAXFUN, r, n, c); }
final static public ATermAppl makeMin(final ATerm r, final ATermInt n, final ATerm c) { assertTrue(n.getInt() >= 0); return factory.makeAppl(MINFUN, r, n, c); }
final static public ATermAppl makeMin(final ATerm r, final ATermInt n, final ATerm c) { assertTrue(n.getInt() >= 0); return factory.makeAppl(MINFUN, r, n, c); }
final static public ATermAppl makeMax(final ATerm r, final ATermInt n, final ATerm c) { assertTrue(n.getInt() >= 0); return factory.makeAppl(MAXFUN, r, n, c); }
@Override public void visitMax(final ATermAppl term) { _out.print("("); visit((ATermAppl) term.getArgument(0)); _out.print(" max " + ((ATermInt) term.getArgument(1)).getInt() + " "); visit((ATermAppl) term.getArgument(2)); _out.print(")"); }
@Override public void visitMin(final ATermAppl term) { _out.print("("); visit((ATermAppl) term.getArgument(0)); _out.print(" min " + ((ATermInt) term.getArgument(1)).getInt() + " "); visit((ATermAppl) term.getArgument(2)); _out.print(")"); }
@Override public void visitMax(final ATermAppl term) { _out.print("("); visit((ATermAppl) term.getArgument(0)); _out.print(" max " + ((ATermInt) term.getArgument(1)).getInt() + " "); visit((ATermAppl) term.getArgument(2)); _out.print(")"); }
@Override public void visitMin(final ATermAppl term) { _out.print("("); visit((ATermAppl) term.getArgument(0)); _out.print(" min " + ((ATermInt) term.getArgument(1)).getInt() + " "); visit((ATermAppl) term.getArgument(2)); _out.print(")"); }
final static public ATermAppl makeExactCard(final ATerm r, final ATermInt n, final ATerm c) { final ATermAppl max = makeMax(r, n, c); if (n.getInt() == 0) return max; final ATermAppl min = makeMin(r, n, c); return makeAnd(min, max); }
final static public ATermAppl makeExactCard(final ATerm r, final ATermInt n, final ATerm c) { final ATermAppl max = makeMax(r, n, c); if (n.getInt() == 0) return max; final ATermAppl min = makeMin(r, n, c); return makeAnd(min, max); }
private static Bool checkMaxClash(final KnowledgeBase kb, final ATermAppl mc, final CachedNode root, final CachedNode otherRoot) { final ATermAppl maxCard = (ATermAppl) mc.getArgument(0); final Role maxR = kb.getRole(maxCard.getArgument(0)); final int max = ((ATermInt) maxCard.getArgument(1)).getInt() - 1; final int n1 = getRNeighbors(root, maxR).size(); final int n2 = getRNeighbors(otherRoot, maxR).size(); if (n1 + n2 > max) { if (_logger.isLoggable(Level.FINE)) _logger.fine(root + " has " + mc + " " + otherRoot + " has R-_neighbor"); return Bool.UNKNOWN; } return null; }
private static Bool checkMaxClash(final KnowledgeBase kb, final ATermAppl mc, final CachedNode root, final CachedNode otherRoot) { final ATermAppl maxCard = (ATermAppl) mc.getArgument(0); final Role maxR = kb.getRole(maxCard.getArgument(0)); final int max = ((ATermInt) maxCard.getArgument(1)).getInt() - 1; final int n1 = getRNeighbors(root, maxR).size(); final int n2 = getRNeighbors(otherRoot, maxR).size(); if (n1 + n2 > max) { if (_logger.isLoggable(Level.FINE)) _logger.fine(root + " has " + mc + " " + otherRoot + " has R-_neighbor"); return Bool.UNKNOWN; } return null; }
public int getMinCard(final Role r, final ATermAppl c) { int maxOfMins = 0; for (final ATermAppl minCard : _types[MIN]) { final Role minR = _abox.getRole(minCard.getArgument(0)); final int min = ((ATermInt) minCard.getArgument(1)).getInt(); final ATermAppl minC = (ATermAppl) minCard.getArgument(2); if (minR.isSubRoleOf(r) && maxOfMins < min && (minC.equals(c) || c.equals(TOP))) maxOfMins = min; } return maxOfMins; }
public int getMinCard(final Role r, final ATermAppl c) { int maxOfMins = 0; for (final ATermAppl minCard : _types[MIN]) { final Role minR = _abox.getRole(minCard.getArgument(0)); final int min = ((ATermInt) minCard.getArgument(1)).getInt(); final ATermAppl minC = (ATermAppl) minCard.getArgument(2); if (minR.isSubRoleOf(r) && maxOfMins < min && (minC.equals(c) || c.equals(TOP))) maxOfMins = min; } return maxOfMins; }
@Test public void testMakeInt() { final ATermInt[] term = new ATermInt[2]; term[0] = _factory.makeInt(3); term[1] = _factory.makeInt(3); assertTrue(term[0].getType() == ATerm.INT); assertTrue(term[0].getInt() == 3); assertTrue(term[0] == term[1]); assertTrue(term[0].toString().equals("3")); List<Object> result = term[0].match("3"); assertTrue(result != null && result.size() == 0); result = term[0].match("<int>"); assertTrue(result != null && result.size() == 1 && result.get(0).equals(new Integer(3))); // System.out.println("pass: testMakeInt"); }