/** * The hash code of an enhanced node is defined to be the same as the underlying node. * @return The hashcode as an int */ @Override final public int hashCode() { return node.hashCode(); }
/** hash function override */ @Override public int hashCode() { int hash = 0; if (!(subject instanceof Node_RuleVariable)) hash ^= (subject.hashCode() >> 1); if (!(predicate instanceof Node_RuleVariable)) hash ^= predicate.hashCode(); if (!(object instanceof Node_RuleVariable)) hash ^= (object.hashCode() << 1); return hash; // return (subject.hashCode() >> 1) ^ predicate.hashCode() ^ (object.hashCode() << 1); }
@Override public int hashCode() { return node.hashCode() ^ hashLink; } }
/** hash function override */ @Override public int hashCode() { int hash = 0; for ( Node n : environment ) { hash = ( hash << 1 ) ^ ( n == null ? 0x537c : n.hashCode() ); } return hash; }
@Override public int hashCode() { int result = 0 ; for ( Node n: nodes ) result ^= (n == null) ? 0 : n.hashCode() ; return result ; }
/** Return the munged hashCodes of the specified nodes, an exclusive-or of the slightly-shifted component hashcodes; this means (almost) all of the bits count, and the order matters, so (S @P O) has a different hash from (O @P S), etc. */ public static int hashCode( Node s, Node p, Node o ) { return (s.hashCode() >> 1) ^ p.hashCode() ^ (o.hashCode() << 1); }
FixedResource(Node n) { hash = n.hashCode(); node = n; } @Override
/** hash function override */ @Override public int hashCode() { int hash = 0; if (!(subject instanceof Node_RuleVariable)) hash ^= (subject.hashCode() >> 1); if (!(predicate instanceof Node_RuleVariable)) hash ^= predicate.hashCode(); if (!(object instanceof Node_RuleVariable)) hash ^= (object.hashCode() << 1); return hash; // return (subject.hashCode() >> 1) ^ predicate.hashCode() ^ (object.hashCode() << 1); }
/** Return the munged hashCodes of the specified nodes, an exclusive-or of the slightly-shifted component hashcodes; this means (almost) all of the bits count, and the order matters, so (S @P O) has a different hash from (O @P S), etc. */ public static int hashCode( Node s, Node p, Node o ) { return (s.hashCode() >> 1) ^ p.hashCode() ^ (o.hashCode() << 1); }
/** * The hash code of an enhanced node is defined to be the same as the underlying node. * @return The hashcode as an int */ @Override final public int hashCode() { return node.hashCode(); }
@Override public int hashCode() { if ( isNode() ) return arg.hashCode() ; return argList.hashCode() ; }
@Override public int hashCode() { final int prime = 31 ; int result = 1 ; result = prime * result + ((decl == null) ? 0 : decl.hashCode()) ; // OK since a URI. result = prime * result + ((graphIRI == null) ? 0 : graphIRI.hashCode()) ; return result ; }
public static long hash(Var v, Node x) { long h = 17; if ( v != null ) h = h ^ v.hashCode(); if ( x != null ) h = h ^ x.hashCode(); return h; }
private static int hashNode(Node node) { if ( node == null ) return 37 ; if ( node.isBlank() ) return 59 ; return node.hashCode() ; }
@Override public int hashCode() { // Use get() rather than accessing the field directly because the node // field is lazily instantiated from the Thrift term Node n = this.get(); return n != null ? this.get().hashCode() : 0; }
public static int hashCode(Binding bind) { int hash = 0xC0; for ( Iterator<Var> iter = bind.vars() ; iter.hasNext() ; ) { Var var = iter.next(); Node node = bind.get(var); hash ^= var.hashCode(); hash ^= node.hashCode(); } return hash; }