MCPcopy Create free account
hub / github.com/antlr/codebuff / hashCode

Method hashCode

corpus/java/training/guava/graph/Graph.java:291–291  ·  view source on GitHub ↗

Returns the hash code for this graph. The hash code of a graph is defined as the hash code of a map from each of the graph's nodes to their adjacent nodes. A reference implementation of this is provided by Graphs#hashCode(Graph). Note that by this definition, two graphs that are equa

()

Source from the content-addressed store, hash-verified

289 * direction will have the same hash code (but can still be differentiated by {@link #equals}.
290 */
291 @Override
292 int hashCode();
293}

Callers 15

hashCodeMethod · 0.65
hashCodeMethod · 0.65
hashCodeMethod · 0.65
hashCodeMethod · 0.65
hashCodeMethod · 0.65
hashCodeMethod · 0.65
hashCodeMethod · 0.65
hashCodeMethod · 0.65
hashCodeMethod · 0.65
hashCodeMethod · 0.65
hashCodeMethod · 0.65
hashCodeMethod · 0.65

Calls

no outgoing calls

Tested by

no test coverage detected