/** * Return a uniq name for the graph * * @return */ public String getQualifiedName() { return node.getQualifiedName(); }
/** * @see java.lang.Object#hashCode() */ @Override public int hashCode() { return getQualifiedName().hashCode(); }
/** * Two nodes are equals if qualified names matches * @see java.lang.Object#equals(java.lang.Object) */ @Override public boolean equals(Object obj) { if (this == obj) { return true; } else if (obj == null || getClass() != obj.getClass()) { return false; } else { return getQualifiedName().equals(obj); } }
public boolean acceptGraph(GraphNode graph, String path) { boolean accepted = false; // An explicit graph is always accepted if(names.contains(graph.getQualifiedName())) accepted = true; // if neither tags or path, it's refused else if(!tags.isEmpty() || !goodPaths.isEmpty()) accepted = (acceptPath(path) && acceptTag(graph.getProbe())); if(logger.isTraceEnabled()) logger.trace(Util.delayedFormatString("Tried to accept : %s=%s, %s: %b", path, graph.getQualifiedName(), graph.getProbe() != null ? graph.getProbe().getTags() : "", accepted)); return accepted; }
String qualifiedGraphName = gn.getQualifiedName(); Element graph = (Element) graphs.appendChild(document.createElement("graphname")); graph.setTextContent(qualifiedGraphName);
for(GraphNode gn: p.getGraphList()) { w.object(); w.key("id").value(gn.getQualifiedName().hashCode()); w.key("name").value(gn.getQualifiedName()); w.endObject();
glist.add(p.getGraphList().iterator().next().getQualifiedName()); Sum s = new Sum("A sum test", glist); s.configure(hl);