private static boolean canCombine(List<Proposal> todo) { Proposal first = todo.get(0); for (int i = 1; i < todo.size(); i++) { if (!canCombine(first, todo.get(i))) { return false; } } return true; }
ProposalRound(KetchLeader leader, LogIndex head, List<Proposal> todo, @Nullable RefTree tree) { super(leader, head); this.todo = todo; if (tree != null && canCombine(todo)) { this.queuedTree = tree; } else { leader.roundHoldsReferenceToRefTree = false; } }
private static boolean canCombine(Proposal a, Proposal b) { String aMsg = nullToEmpty(a.getMessage()); String bMsg = nullToEmpty(b.getMessage()); return aMsg.equals(bMsg) && canCombine(a.getAuthor(), b.getAuthor()); }
private static boolean canCombine(List<Proposal> todo) { Proposal first = todo.get(0); for (int i = 1; i < todo.size(); i++) { if (!canCombine(first, todo.get(i))) { return false; } } return true; }
private static boolean canCombine(List<Proposal> todo) { Proposal first = todo.get(0); for (int i = 1; i < todo.size(); i++) { if (!canCombine(first, todo.get(i))) { return false; } } return true; }
ProposalRound(KetchLeader leader, LogIndex head, List<Proposal> todo, @Nullable RefTree tree) { super(leader, head); this.todo = todo; if (tree != null && canCombine(todo)) { this.queuedTree = tree; } else { leader.roundHoldsReferenceToRefTree = false; } }
ProposalRound(KetchLeader leader, LogIndex head, List<Proposal> todo, @Nullable RefTree tree) { super(leader, head); this.todo = todo; if (tree != null && canCombine(todo)) { this.queuedTree = tree; } else { leader.roundHoldsReferenceToRefTree = false; } }
private static boolean canCombine(Proposal a, Proposal b) { String aMsg = nullToEmpty(a.getMessage()); String bMsg = nullToEmpty(b.getMessage()); return aMsg.equals(bMsg) && canCombine(a.getAuthor(), b.getAuthor()); }
private static boolean canCombine(Proposal a, Proposal b) { String aMsg = nullToEmpty(a.getMessage()); String bMsg = nullToEmpty(b.getMessage()); return aMsg.equals(bMsg) && canCombine(a.getAuthor(), b.getAuthor()); }