Tabnine Logo
Digest$Entry.getLow
Code IndexAdd Tabnine to your IDE (free)

How to use
getLow
method
in
org.jgroups.util.Digest$Entry

Best Java code snippets using org.jgroups.util.Digest$Entry.getLow (Showing top 7 results out of 315)

origin: org.jgroups/com.springsource.org.jgroups

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());
    }
  }
}
origin: org.jgroups/com.springsource.org.jgroups

win=createNakReceiverWindow(sender, initial_seqno, val.getLow());
xmit_table.put(sender, win);
origin: org.jgroups/com.springsource.org.jgroups

low_seqno=val.getLow();
origin: org.jgroups/com.springsource.org.jgroups

mbr=entry.getKey();
val=entry.getValue();
low=val.getLow();
origin: org.jgroups/com.springsource.org.jgroups

/**
 * 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);
  }
}
origin: org.jgroups/com.springsource.org.jgroups

/**
 * Adds a digest to this digest. This digest must have enough space to add the other digest; otherwise an error
 * message will be written. For each sender in the other digest, the merge() method will be called.
 */
public void merge(Digest digest) {
  if(digest == null) {
    if(log.isErrorEnabled()) log.error("digest to be merged with is null");
    return;
  }
  checkSealed();
  Map.Entry<Address,Entry> entry;
  Address sender;
  Entry val;
  for(Iterator<Map.Entry<Address,Entry>> it=digest.senders.entrySet().iterator(); it.hasNext();) {
    entry=it.next();
    sender=entry.getKey();
    val=entry.getValue();
    if(val != null) {
      merge(sender, val.getLow(), val.getHighestDeliveredSeqno(), val.getHighestReceivedSeqno());
    }
  }
}
origin: org.jgroups/com.springsource.org.jgroups

/**
 * Increments the sender's high_seqno by 1.
 */
public void incrementHighestDeliveredSeqno(Address sender) {
  Entry entry=senders.get(sender);
  if(entry == null)
    return;
  checkSealed();
  Entry new_entry=new Entry(entry.getLow(), entry.getHighestDeliveredSeqno() +1, entry.getHighestReceivedSeqno());
  senders.put(sender, new_entry);
}
org.jgroups.utilDigest$EntrygetLow

Popular methods of Digest$Entry

  • <init>
  • getHighest
    Return the max of the highest delivered or highest received seqno
  • getHighestDeliveredSeqno
  • getHighestReceivedSeqno
  • getMember
  • check

Popular in Java

  • Start an intent from android
  • scheduleAtFixedRate (ScheduledExecutorService)
  • getExternalFilesDir (Context)
  • addToBackStack (FragmentTransaction)
  • HttpServer (com.sun.net.httpserver)
    This class implements a simple HTTP server. A HttpServer is bound to an IP address and port number a
  • URLConnection (java.net)
    A connection to a URL for reading or writing. For HTTP connections, see HttpURLConnection for docume
  • LinkedHashMap (java.util)
    LinkedHashMap is an implementation of Map that guarantees iteration order. All optional operations a
  • Collectors (java.util.stream)
  • Cipher (javax.crypto)
    This class provides access to implementations of cryptographic ciphers for encryption and decryption
  • LogFactory (org.apache.commons.logging)
    Factory for creating Log instances, with discovery and configuration features similar to that employ
  • CodeWhisperer alternatives
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now