IssueVertex.java

Go to the documentation of this file.

/*
 * Turró i Cutiller Foundation. License notice.
 * Copyright (C) 2022 Lluis Turró Cutiller <http://www.turro.org/>
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 
package org.turro.dossier.graph;
 
import java.util.HashSet;
import java.util.Objects;
import java.util.Set;
import java.util.stream.Collectors;
import org.turro.dossier.db.DossierPU;
import org.turro.dossier.task.Tasks;
 
public class IssueVertex {
 
  private final IssueGraph graph;
  private final Set<IssueItem> tasks;
  private final IssueItem item;
 
  public IssueVertex(IssueGraph graph, IssueItem item) {
    this.graph = graph;
    this.tasks = new HashSet<>();
    this.item = item;
  }
 
  public Set<IssueItem> getTasks() {
    return tasks;
  }
 
  public IssueItem getItem() {
    return item;
  }
  
  public String getName() {
    return item.getIssue().getDescription();
  }
  
  public boolean isMilestone() {
    return item.getIssue().isMilestone();
  }
  
  public boolean isAchieved() {
    return item.getIssue().getStatus().isFinished();
  }
  
  public boolean isLeaf() {
    return graph.outgoingEdgesOf(this).isEmpty();
  }
  
  public boolean hasDates() {
    return item.getIssue().getStartDate() != null &&
           item.getIssue().getDelivery() != null; 
  }
  
  public Set<IssueVertex> getIncoming() {
    return graph.incomingEdgesOf(this).stream().map(e -> e.getSource()).collect(Collectors.toSet());
  }
  
  public Set<IssueVertex> getOutgoing() {
    return graph.outgoingEdgesOf(this).stream().map(e -> e.getTarget()).collect(Collectors.toSet());
  }
  
  public String getEntityPath() {
    return DossierPU.getObjectPath(item.getIssue());
  }
  
  /* Done */
 
  private double pcdone = - 1;
  
  public double percentDone() {
    if(pcdone == -1) {
      pcdone = Tasks.from(item.getIssue(), false, false).getPercentTasksDone();
    }
    return pcdone;
  }
  
  /* Utils */
 
  @Override
  public int hashCode() {
    int hash = 3;
    hash = 67 * hash + Objects.hashCode(this.item);
    return hash;
  }
 
  @Override
  public boolean equals(Object obj) {
    if (this == obj) {
      return true;
    }
    if (obj == null) {
      return false;
    }
    if (getClass() != obj.getClass()) {
      return false;
    }
    final IssueVertex other = (IssueVertex) obj;
    return Objects.equals(this.item, other.item);
  }
  
}