/** * Checks if a constituent is a root node of a tree. It is assumed that the input constituent is * a member of a TreeView. */ public static boolean isRoot(Constituent c) { return c.getIncomingRelations().size() == 0; }
@Override public Boolean transform(Constituent input) { return input.getIncomingRelations().size() > 0; } };
/** * Checks if a constituent is a root node of a tree. It is assumed that the input constituent is * a member of a TreeView. */ public static boolean isRoot(Constituent c) { return c.getIncomingRelations().size() == 0; }
@Override public Boolean transform(Constituent input) { return input.getIncomingRelations().size() > 0; } };
@Override public Boolean transform(Constituent p) { boolean found = false; for (Relation r : c.getIncomingRelations()) { if (r.getSource() == p) { found = true; break; } } return found; } };
public List<Relation> getFilteredIncomingRelations(Constituent c) { List<Relation> filteredIncomingRelations = new ArrayList<>(); for (Relation r : c.getIncomingRelations()) { if (!Objects.equals(r.getRelationName(), viewName)) continue; filteredIncomingRelations.add(r); } return filteredIncomingRelations; }
/** * Gets the parent of a constituent. It is assumed that the input constiutent is a member of a * TreeView. */ public static Constituent getParent(Constituent constituent) { return constituent.getIncomingRelations().get(0).getSource(); }
public List<Relation> getFilteredIncomingRelations(Constituent c) { List<Relation> filteredIncomingRelations = new ArrayList<>(); for (Relation r : c.getIncomingRelations()) { if (!Objects.equals(r.getRelationName(), viewName)) continue; filteredIncomingRelations.add(r); } return filteredIncomingRelations; }
/** * force update of 'predicates' field. */ public void findPredicates() { predicates.clear(); // The hypothesis is that all nodes with no incoming edges are predicates. for (Constituent c : this.getConstituents()) { if (c.getIncomingRelations().size() == 0) this.predicates.add(c); } }
/** * Gets the parent of a constituent. It is assumed that the input constiutent is a member of a * TreeView. */ public static Constituent getParent(Constituent constituent) { return constituent.getIncomingRelations().get(0).getSource(); }
@Override public Boolean transform(Constituent p) { boolean found = false; for (Relation r : c.getIncomingRelations()) { if (r.getSource() == p) { found = true; break; } } return found; } };
@Override public List<Constituent> transform(Constituent input) { List<Constituent> c = new ArrayList<>(); for (Relation r : input.getIncomingRelations()) { c.add(addPointerToSource(input, r.getSource())); } return c; }
@Override public List<Constituent> transform(Constituent input) { List<Constituent> c = new ArrayList<>(); for (Relation r : input.getIncomingRelations()) { c.add(addPointerToSource(input, r.getSource())); } return c; }
/** * force update of 'predicates' field. */ public void findPredicates() { predicates.clear(); // The hypothesis is that all nodes with no incoming edges are predicates. for (Constituent c : this.getConstituents()) { if (c.getIncomingRelations().size() == 0) this.predicates.add(c); } }
public static Constituent getPredicate(Constituent argument) { return argument.getIncomingRelations().get(0).getSource(); }
public static Constituent getPredicate(Constituent argument) { return argument.getIncomingRelations().get(0).getSource(); }
private static List<Constituent> getGovernor(Constituent input, TreeView dependency) { List<Constituent> constituentsCovering = dependency.getConstituentsCovering(input); if (constituentsCovering.size() == 0) return new ArrayList<>(); Constituent c = constituentsCovering.get(0); List<Relation> incomingRelations = c.getIncomingRelations(); if (incomingRelations == null || incomingRelations.size() == 0) return new ArrayList<>(); else return Collections.singletonList(addPointerToSource(input, incomingRelations.get(0) .getSource())); }
private static List<Constituent> getGovernor(Constituent input, TreeView dependency) { List<Constituent> constituentsCovering = dependency.getConstituentsCovering(input); if (constituentsCovering.size() == 0) return new ArrayList<>(); Constituent c = constituentsCovering.get(0); List<Relation> incomingRelations = c.getIncomingRelations(); if (incomingRelations == null || incomingRelations.size() == 0) return new ArrayList<>(); else return Collections.singletonList(addPointerToSource(input, incomingRelations.get(0) .getSource())); }
public void removeAllRelations() { List<Constituent> allCorefCons = this.getConstituents(); for (Constituent c : allCorefCons) { for (Relation r : c.getIncomingRelations()) this.removeRelation(r); for (Relation r : c.getOutgoingRelations()) this.removeRelation(r); c.removeAllIncomingRelatons(); c.removeAllOutgoingRelaton(); } }
public void removeAllRelations() { List<Constituent> allCorefCons = this.getConstituents(); for (Constituent c : allCorefCons) { for (Relation r : c.getIncomingRelations()) this.removeRelation(r); for (Relation r : c.getOutgoingRelations()) this.removeRelation(r); c.removeAllIncomingRelatons(); c.removeAllOutgoingRelaton(); } }