List of strongHashCode() Examples

The strong hashcode of an fg-node is computed as follows:
For every nt-molecule is serialized to a string, if the nt-molecules has an ifp as predicate its URIRef is bracketed with < and > and appended to the StringBuffer otherwise (i.e. when the predicate is an fp) the letter "i" is appended prior to the bracketed URIRef, after this a space-character is added to the buffer. If the grounding part of the nt-molecule is a literal or a named node it is appended to the buffer the same way as it would appear in an N-Triple document and followed by a space. If the grounding part is itself an fg-node the process is done recursilvely, but if an fg-node is encountered which was already processed as an- fg-node directly or indirectly containing it, it is not reprocesses instead the position at which it is already in the buffer is appended as a decimal number.
The strings for the individual fg-nodes are sorted using the natural order of StringS, joined and put between '[' and ']' to form a predictable serialization of an fg-node The resulting String is converted to a byte array using the UTF-8 encoding,the strong hashcode is the sha1-digest of this string. @return the strong hashcode of the fg-node.

Examples of strongHashCode()

Examples of org.wymiwyg.rdf.graphs.fgnodes.FunctionallyGroundedNode.strongHashCode()