.class abstract Lcom/google/common/graph/AbstractBaseGraph; .super Ljava/lang/Object; .source "AbstractBaseGraph.java" # interfaces .implements Lcom/google/common/graph/BaseGraph; # annotations .annotation runtime Lcom/google/common/graph/ElementTypesAreNonnullByDefault; .end annotation .annotation system Ldalvik/annotation/Signature; value = { "", "Ljava/lang/Object;", "Lcom/google/common/graph/BaseGraph<", "TN;>;" } .end annotation # direct methods .method public constructor ()V .locals 0 .line 1 invoke-direct {p0}, Ljava/lang/Object;->()V return-void .end method # virtual methods .method public degree(Ljava/lang/Object;)I .locals 2 .annotation system Ldalvik/annotation/Signature; value = { "(TN;)I" } .end annotation .line 1 invoke-interface {p0}, Lcom/google/common/graph/BaseGraph;->isDirected()Z move-result v0 if-eqz v0, :cond_0 .line 2 invoke-interface {p0, p1}, Lcom/google/common/graph/BaseGraph;->predecessors(Ljava/lang/Object;)Ljava/util/Set; move-result-object v0 invoke-interface {v0}, Ljava/util/Set;->size()I move-result v0 invoke-interface {p0, p1}, Lcom/google/common/graph/BaseGraph;->successors(Ljava/lang/Object;)Ljava/util/Set; move-result-object p1 invoke-interface {p1}, Ljava/util/Set;->size()I move-result p1 invoke-static {v0, p1}, Lcom/google/common/math/IntMath;->saturatedAdd(II)I move-result p1 return p1 .line 3 :cond_0 invoke-interface {p0, p1}, Lcom/google/common/graph/BaseGraph;->adjacentNodes(Ljava/lang/Object;)Ljava/util/Set; move-result-object v0 .line 4 invoke-interface {p0}, Lcom/google/common/graph/BaseGraph;->allowsSelfLoops()Z move-result v1 if-eqz v1, :cond_1 invoke-interface {v0, p1}, Ljava/util/Set;->contains(Ljava/lang/Object;)Z move-result p1 if-eqz p1, :cond_1 const/4 p1, 0x1 goto :goto_0 :cond_1 const/4 p1, 0x0 .line 5 :goto_0 invoke-interface {v0}, Ljava/util/Set;->size()I move-result v0 invoke-static {v0, p1}, Lcom/google/common/math/IntMath;->saturatedAdd(II)I move-result p1 return p1 .end method .method public edgeCount()J .locals 7 .line 1 invoke-interface {p0}, Lcom/google/common/graph/BaseGraph;->nodes()Ljava/util/Set; move-result-object v0 invoke-interface {v0}, Ljava/util/Set;->iterator()Ljava/util/Iterator; move-result-object v0 const-wide/16 v1, 0x0 move-wide v3, v1 :goto_0 invoke-interface {v0}, Ljava/util/Iterator;->hasNext()Z move-result v5 if-eqz v5, :cond_0 invoke-interface {v0}, Ljava/util/Iterator;->next()Ljava/lang/Object; move-result-object v5 .line 2 invoke-virtual {p0, v5}, Lcom/google/common/graph/AbstractBaseGraph;->degree(Ljava/lang/Object;)I move-result v5 int-to-long v5, v5 add-long/2addr v3, v5 goto :goto_0 :cond_0 const-wide/16 v5, 0x1 and-long/2addr v5, v3 cmp-long v0, v5, v1 const/4 v1, 0x1 if-nez v0, :cond_1 move v0, v1 goto :goto_1 :cond_1 const/4 v0, 0x0 .line 3 :goto_1 invoke-static {v0}, Lcom/google/common/base/Preconditions;->checkState(Z)V ushr-long v0, v3, v1 return-wide v0 .end method .method public edges()Ljava/util/Set; .locals 1 .annotation system Ldalvik/annotation/Signature; value = { "()", "Ljava/util/Set<", "Lcom/google/common/graph/EndpointPair<", "TN;>;>;" } .end annotation .line 1 new-instance v0, Lcom/google/common/graph/AbstractBaseGraph$1; invoke-direct {v0, p0}, Lcom/google/common/graph/AbstractBaseGraph$1;->(Lcom/google/common/graph/AbstractBaseGraph;)V return-object v0 .end method .method public hasEdgeConnecting(Lcom/google/common/graph/EndpointPair;)Z .locals 3 .annotation system Ldalvik/annotation/Signature; value = { "(", "Lcom/google/common/graph/EndpointPair<", "TN;>;)Z" } .end annotation .line 4 invoke-static {p1}, Lcom/google/common/base/Preconditions;->checkNotNull(Ljava/lang/Object;)Ljava/lang/Object; .line 5 invoke-virtual {p0, p1}, Lcom/google/common/graph/AbstractBaseGraph;->isOrderingCompatible(Lcom/google/common/graph/EndpointPair;)Z move-result v0 const/4 v1, 0x0 if-nez v0, :cond_0 return v1 .line 6 :cond_0 invoke-virtual {p1}, Lcom/google/common/graph/EndpointPair;->nodeU()Ljava/lang/Object; move-result-object v0 .line 7 invoke-virtual {p1}, Lcom/google/common/graph/EndpointPair;->nodeV()Ljava/lang/Object; move-result-object p1 .line 8 invoke-interface {p0}, Lcom/google/common/graph/BaseGraph;->nodes()Ljava/util/Set; move-result-object v2 invoke-interface {v2, v0}, Ljava/util/Set;->contains(Ljava/lang/Object;)Z move-result v2 if-eqz v2, :cond_1 invoke-interface {p0, v0}, Lcom/google/common/graph/BaseGraph;->successors(Ljava/lang/Object;)Ljava/util/Set; move-result-object v0 invoke-interface {v0, p1}, Ljava/util/Set;->contains(Ljava/lang/Object;)Z move-result p1 if-eqz p1, :cond_1 const/4 v1, 0x1 :cond_1 return v1 .end method .method public hasEdgeConnecting(Ljava/lang/Object;Ljava/lang/Object;)Z .locals 1 .annotation system Ldalvik/annotation/Signature; value = { "(TN;TN;)Z" } .end annotation .line 1 invoke-static {p1}, Lcom/google/common/base/Preconditions;->checkNotNull(Ljava/lang/Object;)Ljava/lang/Object; .line 2 invoke-static {p2}, Lcom/google/common/base/Preconditions;->checkNotNull(Ljava/lang/Object;)Ljava/lang/Object; .line 3 invoke-interface {p0}, Lcom/google/common/graph/BaseGraph;->nodes()Ljava/util/Set; move-result-object v0 invoke-interface {v0, p1}, Ljava/util/Set;->contains(Ljava/lang/Object;)Z move-result v0 if-eqz v0, :cond_0 invoke-interface {p0, p1}, Lcom/google/common/graph/BaseGraph;->successors(Ljava/lang/Object;)Ljava/util/Set; move-result-object p1 invoke-interface {p1, p2}, Ljava/util/Set;->contains(Ljava/lang/Object;)Z move-result p1 if-eqz p1, :cond_0 const/4 p1, 0x1 goto :goto_0 :cond_0 const/4 p1, 0x0 :goto_0 return p1 .end method .method public inDegree(Ljava/lang/Object;)I .locals 1 .annotation system Ldalvik/annotation/Signature; value = { "(TN;)I" } .end annotation .line 1 invoke-interface {p0}, Lcom/google/common/graph/BaseGraph;->isDirected()Z move-result v0 if-eqz v0, :cond_0 invoke-interface {p0, p1}, Lcom/google/common/graph/BaseGraph;->predecessors(Ljava/lang/Object;)Ljava/util/Set; move-result-object p1 invoke-interface {p1}, Ljava/util/Set;->size()I move-result p1 goto :goto_0 :cond_0 invoke-virtual {p0, p1}, Lcom/google/common/graph/AbstractBaseGraph;->degree(Ljava/lang/Object;)I move-result p1 :goto_0 return p1 .end method .method public incidentEdgeOrder()Lcom/google/common/graph/ElementOrder; .locals 1 .annotation system Ldalvik/annotation/Signature; value = { "()", "Lcom/google/common/graph/ElementOrder<", "TN;>;" } .end annotation .line 1 invoke-static {}, Lcom/google/common/graph/ElementOrder;->unordered()Lcom/google/common/graph/ElementOrder; move-result-object v0 return-object v0 .end method .method public incidentEdges(Ljava/lang/Object;)Ljava/util/Set; .locals 2 .annotation system Ldalvik/annotation/Signature; value = { "(TN;)", "Ljava/util/Set<", "Lcom/google/common/graph/EndpointPair<", "TN;>;>;" } .end annotation .line 1 invoke-static {p1}, Lcom/google/common/base/Preconditions;->checkNotNull(Ljava/lang/Object;)Ljava/lang/Object; .line 2 invoke-interface {p0}, Lcom/google/common/graph/BaseGraph;->nodes()Ljava/util/Set; move-result-object v0 invoke-interface {v0, p1}, Ljava/util/Set;->contains(Ljava/lang/Object;)Z move-result v0 const-string v1, "Node %s is not an element of this graph." invoke-static {v0, v1, p1}, Lcom/google/common/base/Preconditions;->checkArgument(ZLjava/lang/String;Ljava/lang/Object;)V .line 3 new-instance v0, Lcom/google/common/graph/AbstractBaseGraph$2; invoke-direct {v0, p0, p0, p1}, Lcom/google/common/graph/AbstractBaseGraph$2;->(Lcom/google/common/graph/AbstractBaseGraph;Lcom/google/common/graph/BaseGraph;Ljava/lang/Object;)V return-object v0 .end method .method public final isOrderingCompatible(Lcom/google/common/graph/EndpointPair;)Z .locals 0 .annotation system Ldalvik/annotation/Signature; value = { "(", "Lcom/google/common/graph/EndpointPair<", "*>;)Z" } .end annotation .line 1 invoke-virtual {p1}, Lcom/google/common/graph/EndpointPair;->isOrdered()Z move-result p1 if-nez p1, :cond_1 invoke-interface {p0}, Lcom/google/common/graph/BaseGraph;->isDirected()Z move-result p1 if-nez p1, :cond_0 goto :goto_0 :cond_0 const/4 p1, 0x0 goto :goto_1 :cond_1 :goto_0 const/4 p1, 0x1 :goto_1 return p1 .end method .method public outDegree(Ljava/lang/Object;)I .locals 1 .annotation system Ldalvik/annotation/Signature; value = { "(TN;)I" } .end annotation .line 1 invoke-interface {p0}, Lcom/google/common/graph/BaseGraph;->isDirected()Z move-result v0 if-eqz v0, :cond_0 invoke-interface {p0, p1}, Lcom/google/common/graph/BaseGraph;->successors(Ljava/lang/Object;)Ljava/util/Set; move-result-object p1 invoke-interface {p1}, Ljava/util/Set;->size()I move-result p1 goto :goto_0 :cond_0 invoke-virtual {p0, p1}, Lcom/google/common/graph/AbstractBaseGraph;->degree(Ljava/lang/Object;)I move-result p1 :goto_0 return p1 .end method .method public final validateEndpoints(Lcom/google/common/graph/EndpointPair;)V .locals 1 .annotation system Ldalvik/annotation/Signature; value = { "(", "Lcom/google/common/graph/EndpointPair<", "*>;)V" } .end annotation .line 1 invoke-static {p1}, Lcom/google/common/base/Preconditions;->checkNotNull(Ljava/lang/Object;)Ljava/lang/Object; .line 2 invoke-virtual {p0, p1}, Lcom/google/common/graph/AbstractBaseGraph;->isOrderingCompatible(Lcom/google/common/graph/EndpointPair;)Z move-result p1 const-string v0, "Mismatch: unordered endpoints cannot be used with directed graphs" invoke-static {p1, v0}, Lcom/google/common/base/Preconditions;->checkArgument(ZLjava/lang/Object;)V return-void .end method