public void add(Address sender, long low_seqno, long highest_delivered_seqno) { checkSealed(); add(sender, low_seqno, highest_delivered_seqno, -1); }
public void replace(Digest d) { if(d != null) { clear(); add(d); } }
public void add(Digest digest) { if(digest != null) { checkSealed(); Map.Entry<Address,Entry> entry; Address key; Entry val; for(Iterator<Map.Entry<Address,Entry>> it=digest.senders.entrySet().iterator(); it.hasNext();) { entry=it.next(); key=entry.getKey(); val=entry.getValue(); add(key, val.getLow(), val.getHighestDeliveredSeqno(), val.getHighestReceivedSeqno()); } } }
public void add(Address sender, long low_seqno, long highest_delivered_seqno, long highest_received_seqno) { checkSealed(); add(sender, new Digest.Entry(low_seqno, highest_delivered_seqno, highest_received_seqno)); }
/** * Similar to add(), but if the sender already exists, its seqnos will be modified (no new entry) as follows: * <ol> * <li>this.low_seqno=min(this.low_seqno, low_seqno) * <li>this.highest_delivered_seqno=max(this.highest_delivered_seqno, highest_delivered_seqno) * <li>this.highest_received_seqno=max(this.highest_received_seqno, highest_received_seqno) * </ol> * If the sender doesn not exist, a new entry will be added (provided there is enough space) */ public void merge(Address sender, long low_seqno, long highest_delivered_seqno, long highest_received_seqno) { if(sender == null) { if(log.isErrorEnabled()) log.error("sender == null"); return; } checkSealed(); Entry entry=senders.get(sender); if(entry == null) { add(sender, low_seqno, highest_delivered_seqno, highest_received_seqno); } else { Entry new_entry=new Entry(Math.min(entry.getLow(), low_seqno), Math.max(entry.getHighestDeliveredSeqno(), highest_delivered_seqno), Math.max(entry.getHighestReceivedSeqno(), highest_received_seqno)); senders.put(sender, new_entry); } }