- Author
- Lluis TurrĂ³ Cutiller lluis.nosp@m.@tur.nosp@m.ro.or.nosp@m.g
Definition at line 32 of file IssueVertex.java.
◆ IssueVertex()
◆ equals()
boolean org.turro.dossier.graph.IssueVertex.equals |
( |
Object |
obj | ) |
|
Definition at line 106 of file IssueVertex.java.
113 if (getClass() != obj.getClass()) {
117 return Objects.equals(this.item, other.item);
IssueVertex(IssueGraph graph, IssueItem item)
◆ getEntityPath()
String org.turro.dossier.graph.IssueVertex.getEntityPath |
( |
| ) |
|
◆ getIncoming()
Set<IssueVertex> org.turro.dossier.graph.IssueVertex.getIncoming |
( |
| ) |
|
Definition at line 73 of file IssueVertex.java.
74 return graph.incomingEdgesOf(
this).stream().map(e -> e.getSource()).collect(Collectors.toSet());
◆ getItem()
IssueItem org.turro.dossier.graph.IssueVertex.getItem |
( |
| ) |
|
◆ getName()
String org.turro.dossier.graph.IssueVertex.getName |
( |
| ) |
|
◆ getOutgoing()
Set<IssueVertex> org.turro.dossier.graph.IssueVertex.getOutgoing |
( |
| ) |
|
Definition at line 77 of file IssueVertex.java.
78 return graph.outgoingEdgesOf(
this).stream().map(e -> e.getTarget()).collect(Collectors.toSet());
◆ getTasks()
Set<IssueItem> org.turro.dossier.graph.IssueVertex.getTasks |
( |
| ) |
|
◆ hasDates()
boolean org.turro.dossier.graph.IssueVertex.hasDates |
( |
| ) |
|
◆ hashCode()
int org.turro.dossier.graph.IssueVertex.hashCode |
( |
| ) |
|
Definition at line 99 of file IssueVertex.java.
101 hash = 67 * hash + Objects.hashCode(this.item);
◆ isAchieved()
boolean org.turro.dossier.graph.IssueVertex.isAchieved |
( |
| ) |
|
◆ isLeaf()
boolean org.turro.dossier.graph.IssueVertex.isLeaf |
( |
| ) |
|
Definition at line 64 of file IssueVertex.java.
65 return graph.outgoingEdgesOf(
this).isEmpty();
◆ isMilestone()
boolean org.turro.dossier.graph.IssueVertex.isMilestone |
( |
| ) |
|
◆ percentDone()
double org.turro.dossier.graph.IssueVertex.percentDone |
( |
| ) |
|
The documentation for this class was generated from the following file: