@Override public final EdgeRef[] getEdgeIdsForVertex(VertexRef vertex) { if (vertex == null) return new EdgeRef[0]; List<EdgeRef> retval = new ArrayList<EdgeRef>(); for (Edge edge : getEdges()) { // If the vertex is connected to the edge then add it if (new RefComparator().compare(edge.getSource().getVertex(), vertex) == 0 || new RefComparator().compare(edge.getTarget().getVertex(), vertex) == 0) { retval.add(edge); } } return retval.toArray(new EdgeRef[0]); }
@Override public Set<VertexRef> getVertices() { Set<VertexRef> vertices = new TreeSet<VertexRef>(new RefComparator()); vertices.add(new DefaultVertexRef("nodes", m_nodeId, getLabel())); return vertices; }
public static Map<VertexRef,Set<Vertex>> getMapOfVerticesToCollapsedVertices(CollapsibleCriteria[] criteria) { // Make a map of all of the vertices to their new collapsed representations Map<VertexRef,Set<Vertex>> vertexToCollapsedVertices = new TreeMap<VertexRef,Set<Vertex>>(new RefComparator()); for (CollapsibleCriteria criterium : criteria) { Set<VertexRef> criteriaVertices = criterium.getVertices(); if (criteriaVertices.size() > 0) { Vertex collapsedVertex = criterium.getCollapsedRepresentation(); for (VertexRef criteriaVertex : criteriaVertices) { Set<Vertex> collapsedVertices = vertexToCollapsedVertices.get(criteriaVertex); if (collapsedVertices == null) { collapsedVertices = new HashSet<Vertex>(); vertexToCollapsedVertices.put(criteriaVertex, collapsedVertices); } collapsedVertices.add(collapsedVertex); } } } return vertexToCollapsedVertices; }
@Override public final EdgeRef[] getEdgeIdsForVertex(VertexRef vertex) { if (vertex == null) return new EdgeRef[0]; List<EdgeRef> retval = new ArrayList<EdgeRef>(); for (Edge edge : getEdges()) { // If the vertex is connected to the edge then add it if (new RefComparator().compare(edge.getSource().getVertex(), vertex) == 0 || new RefComparator().compare(edge.getTarget().getVertex(), vertex) == 0) { retval.add(edge); } } return retval.toArray(new EdgeRef[0]); }
public static Map<VertexRef,Set<Vertex>> getMapOfVerticesToCollapsedVertices(CollapsibleCriteria[] criteria) { // Make a map of all of the vertices to their new collapsed representations Map<VertexRef,Set<Vertex>> vertexToCollapsedVertices = new TreeMap<VertexRef,Set<Vertex>>(new RefComparator()); for (CollapsibleCriteria criterium : criteria) { Set<VertexRef> criteriaVertices = criterium.getVertices(); if (criteriaVertices.size() > 0) { Vertex collapsedVertex = criterium.getCollapsedRepresentation(); for (VertexRef criteriaVertex : criteriaVertices) { Set<Vertex> collapsedVertices = vertexToCollapsedVertices.get(criteriaVertex); if (collapsedVertices == null) { collapsedVertices = new HashSet<Vertex>(); vertexToCollapsedVertices.put(criteriaVertex, collapsedVertices); } collapsedVertices.add(collapsedVertex); } } } return vertexToCollapsedVertices; }
@Override public final EdgeRef[] getEdgeIdsForVertex(VertexRef vertex) { if (vertex == null) return new EdgeRef[0]; List<EdgeRef> retval = new ArrayList<EdgeRef>(); for (Edge edge : getEdges()) { // If the vertex is connected to the edge then add it if (new RefComparator().compare(edge.getSource().getVertex(), vertex) == 0 || new RefComparator().compare(edge.getTarget().getVertex(), vertex) == 0) { retval.add(edge); } } return retval.toArray(new EdgeRef[0]); }
public static Map<VertexRef,Set<Vertex>> getMapOfVerticesToCollapsedVertices(CollapsibleCriteria[] criteria) { // Make a map of all of the vertices to their new collapsed representations Map<VertexRef,Set<Vertex>> vertexToCollapsedVertices = new TreeMap<VertexRef,Set<Vertex>>(new RefComparator()); for (CollapsibleCriteria criterium : criteria) { Set<VertexRef> criteriaVertices = criterium.getVertices(); if (criteriaVertices.size() > 0) { Vertex collapsedVertex = criterium.getCollapsedRepresentation(); for (VertexRef criteriaVertex : criteriaVertices) { Set<Vertex> collapsedVertices = vertexToCollapsedVertices.get(criteriaVertex); if (collapsedVertices == null) { collapsedVertices = new HashSet<Vertex>(); vertexToCollapsedVertices.put(criteriaVertex, collapsedVertices); } collapsedVertices.add(collapsedVertex); } } } return vertexToCollapsedVertices; }
@Override public Vertex getVertex(VertexRef reference, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { Vertex collapsed = criterium.getCollapsedRepresentation(); if (new RefComparator().compare(collapsed, reference) == 0) { return collapsed; } } return m_delegate.getVertex(reference, criteria); }
private Set<VertexRef> createVertices(List<OnmsAlarm> alarms) { Set<VertexRef> vertices = new TreeSet<VertexRef>(new RefComparator()); for (OnmsAlarm alarm : alarms) { OnmsNode node = alarm.getNode(); if (node == null) { continue; } vertices.add(new DefaultVertexRef("nodes", String.valueOf(node.getId()), node.getLabel())); } return vertices; }
@Override public boolean containsVertexId(VertexRef id, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { Vertex collapsed = criterium.getCollapsedRepresentation(); if (new RefComparator().compare(collapsed, id) == 0) { return true; } } return m_delegate.containsVertexId(id, criteria); }
private Set<VertexRef> createVertices(List<OnmsAlarm> alarms) { Set<VertexRef> vertices = new TreeSet<VertexRef>(new RefComparator()); for (OnmsAlarm alarm : alarms) { OnmsNode node = alarm.getNode(); if (node == null) { continue; } vertices.add(new DefaultVertexRef("nodes", String.valueOf(node.getId()), node.getLabel())); } return vertices; }
@Override public final Map<VertexRef, Set<EdgeRef>> getEdgeIdsForVertices(VertexRef... vertices) { List<Edge> edges = getEdges(); Map<VertexRef,Set<EdgeRef>> retval = new HashMap<VertexRef,Set<EdgeRef>>(); for (VertexRef vertex : vertices) { if (vertex == null) continue; Set<EdgeRef> edgeSet = new HashSet<EdgeRef>(); for (Edge edge : edges) { // If the vertex is connected to the edge then add it if (new RefComparator().compare(edge.getSource().getVertex(), vertex) == 0 || new RefComparator().compare(edge.getTarget().getVertex(), vertex) == 0) { edgeSet.add(edge); } } retval.put(vertex, edgeSet); } return retval; }
@Override public Set<VertexRef> getVertices() { CriteriaBuilder bldr = new CriteriaBuilder(OnmsIpInterface.class); bldr.iplike("ipAddr", m_ipQuery); List<OnmsIpInterface> ips = ipInterfaceProvider.findMatching(bldr.toCriteria()); Set<VertexRef> vertices = new TreeSet<VertexRef>(new RefComparator()); for (OnmsIpInterface ip : ips) { OnmsNode node = ip.getNode(); vertices.add(new DefaultVertexRef("nodes", String.valueOf(node.getId()), node.getLabel())); } return vertices; }
@Override public boolean containsVertexId(VertexRef id, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { Vertex collapsed = criterium.getCollapsedRepresentation(); if (new RefComparator().compare(collapsed, id) == 0) { return true; } } return m_delegate.containsVertexId(id, criteria); }
@Override public Set<VertexRef> getVertices() { CriteriaBuilder bldr = new CriteriaBuilder(OnmsIpInterface.class); bldr.iplike("ipAddr", m_ipQuery); List<OnmsIpInterface> ips = ipInterfaceProvider.findMatching(bldr.toCriteria()); Set<VertexRef> vertices = new TreeSet<VertexRef>(new RefComparator()); for (OnmsIpInterface ip : ips) { OnmsNode node = ip.getNode(); vertices.add(new DefaultVertexRef("nodes", String.valueOf(node.getId()), node.getLabel())); } return vertices; }
@Override public Vertex getVertex(VertexRef reference, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { Vertex collapsed = criterium.getCollapsedRepresentation(); if (new RefComparator().compare(collapsed, reference) == 0) { return collapsed; } } return m_delegate.getVertex(reference, criteria); }
@Override public Vertex getVertex(VertexRef reference, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { Vertex collapsed = criterium.getCollapsedRepresentation(); if (new RefComparator().compare(collapsed, reference) == 0) { return collapsed; } } return m_delegate.getVertex(reference, criteria); }
@Override public final Map<VertexRef, Set<EdgeRef>> getEdgeIdsForVertices(VertexRef... vertices) { List<Edge> edges = getEdges(); Map<VertexRef,Set<EdgeRef>> retval = new HashMap<VertexRef,Set<EdgeRef>>(); for (VertexRef vertex : vertices) { if (vertex == null) continue; Set<EdgeRef> edgeSet = new HashSet<EdgeRef>(); for (Edge edge : edges) { // If the vertex is connected to the edge then add it if (new RefComparator().compare(edge.getSource().getVertex(), vertex) == 0 || new RefComparator().compare(edge.getTarget().getVertex(), vertex) == 0) { edgeSet.add(edge); } } retval.put(vertex, edgeSet); } return retval; }
@Override public boolean containsVertexId(VertexRef id, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { Vertex collapsed = criterium.getCollapsedRepresentation(); if (new RefComparator().compare(collapsed, id) == 0) { return true; } } return m_delegate.containsVertexId(id, criteria); }
@Override public List<Vertex> getChildren(VertexRef group, Criteria... criteria) { for (CollapsibleCriteria criterium : getCollapsedCriteria(criteria)) { if (new RefComparator().compare(criterium.getCollapsedRepresentation(), group) == 0) { return getVertices(criterium.getVertices()); } } return Collections.emptyList(); }