Tabnine Logo
RangeTombstoneList.insertFrom
Code IndexAdd Tabnine to your IDE (free)

How to use
insertFrom
method
in
org.apache.cassandra.db.RangeTombstoneList

Best Java code snippets using org.apache.cassandra.db.RangeTombstoneList.insertFrom (Showing top 10 results out of 315)

origin: com.facebook.presto.cassandra/cassandra-server

/**
 * Adds a new range tombstone.
 *
 * This method will be faster if the new tombstone sort after all the currently existing ones (this is a common use case),
 * but it doesn't assume it.
 */
public void add(Composite start, Composite end, long markedAt, int delTime)
{
  if (isEmpty())
  {
    addInternal(0, start, end, markedAt, delTime);
    return;
  }
  int c = comparator.compare(ends[size-1], start);
  // Fast path if we add in sorted order
  if (c < 0)
  {
    addInternal(size, start, end, markedAt, delTime);
  }
  else
  {
    // Note: insertFrom expect i to be the insertion point in term of interval ends
    int pos = Arrays.binarySearch(ends, 0, size, start, comparator);
    insertFrom((pos >= 0 ? pos : -pos-1), start, end, markedAt, delTime);
  }
  boundaryHeapSize += start.unsharedHeapSize() + end.unsharedHeapSize();
}
origin: org.apache.cassandra/cassandra-all

/**
 * Adds a new range tombstone.
 *
 * This method will be faster if the new tombstone sort after all the currently existing ones (this is a common use case),
 * but it doesn't assume it.
 */
public void add(ClusteringBound start, ClusteringBound end, long markedAt, int delTime)
{
  if (isEmpty())
  {
    addInternal(0, start, end, markedAt, delTime);
    return;
  }
  int c = comparator.compare(ends[size-1], start);
  // Fast path if we add in sorted order
  if (c <= 0)
  {
    addInternal(size, start, end, markedAt, delTime);
  }
  else
  {
    // Note: insertFrom expect i to be the insertion point in term of interval ends
    int pos = Arrays.binarySearch(ends, 0, size, start, comparator);
    insertFrom((pos >= 0 ? pos+1 : -pos-1), start, end, markedAt, delTime);
  }
  boundaryHeapSize += start.unsharedHeapSize() + end.unsharedHeapSize();
}
origin: jsevellec/cassandra-unit

/**
 * Adds a new range tombstone.
 *
 * This method will be faster if the new tombstone sort after all the currently existing ones (this is a common use case),
 * but it doesn't assume it.
 */
public void add(ClusteringBound start, ClusteringBound end, long markedAt, int delTime)
{
  if (isEmpty())
  {
    addInternal(0, start, end, markedAt, delTime);
    return;
  }
  int c = comparator.compare(ends[size-1], start);
  // Fast path if we add in sorted order
  if (c <= 0)
  {
    addInternal(size, start, end, markedAt, delTime);
  }
  else
  {
    // Note: insertFrom expect i to be the insertion point in term of interval ends
    int pos = Arrays.binarySearch(ends, 0, size, start, comparator);
    insertFrom((pos >= 0 ? pos+1 : -pos-1), start, end, markedAt, delTime);
  }
  boundaryHeapSize += start.unsharedHeapSize() + end.unsharedHeapSize();
}
origin: com.netflix.sstableadaptor/sstable-adaptor-cassandra

/**
 * Adds a new range tombstone.
 *
 * This method will be faster if the new tombstone sort after all the currently existing ones (this is a common use case),
 * but it doesn't assume it.
 */
public void add(ClusteringBound start, ClusteringBound end, long markedAt, int delTime)
{
  if (isEmpty())
  {
    addInternal(0, start, end, markedAt, delTime);
    return;
  }
  int c = comparator.compare(ends[size-1], start);
  // Fast path if we add in sorted order
  if (c <= 0)
  {
    addInternal(size, start, end, markedAt, delTime);
  }
  else
  {
    // Note: insertFrom expect i to be the insertion point in term of interval ends
    int pos = Arrays.binarySearch(ends, 0, size, start, comparator);
    insertFrom((pos >= 0 ? pos+1 : -pos-1), start, end, markedAt, delTime);
  }
  boundaryHeapSize += start.unsharedHeapSize() + end.unsharedHeapSize();
}
origin: com.strapdata.cassandra/cassandra-all

/**
 * Adds a new range tombstone.
 *
 * This method will be faster if the new tombstone sort after all the currently existing ones (this is a common use case),
 * but it doesn't assume it.
 */
public void add(ClusteringBound start, ClusteringBound end, long markedAt, int delTime)
{
  if (isEmpty())
  {
    addInternal(0, start, end, markedAt, delTime);
    return;
  }
  int c = comparator.compare(ends[size-1], start);
  // Fast path if we add in sorted order
  if (c <= 0)
  {
    addInternal(size, start, end, markedAt, delTime);
  }
  else
  {
    // Note: insertFrom expect i to be the insertion point in term of interval ends
    int pos = Arrays.binarySearch(ends, 0, size, start, comparator);
    insertFrom((pos >= 0 ? pos+1 : -pos-1), start, end, markedAt, delTime);
  }
  boundaryHeapSize += start.unsharedHeapSize() + end.unsharedHeapSize();
}
origin: com.facebook.presto.cassandra/cassandra-server

insertFrom(i, tombstones.starts[j], tombstones.ends[j], tombstones.markedAts[j], tombstones.delTimes[j]);
j++;
origin: org.apache.cassandra/cassandra-all

insertFrom(i, tombstones.starts[j], tombstones.ends[j], tombstones.markedAts[j], tombstones.delTimes[j]);
j++;
origin: jsevellec/cassandra-unit

insertFrom(i, tombstones.starts[j], tombstones.ends[j], tombstones.markedAts[j], tombstones.delTimes[j]);
j++;
origin: com.netflix.sstableadaptor/sstable-adaptor-cassandra

insertFrom(i, tombstones.starts[j], tombstones.ends[j], tombstones.markedAts[j], tombstones.delTimes[j]);
j++;
origin: com.strapdata.cassandra/cassandra-all

insertFrom(i, tombstones.starts[j], tombstones.ends[j], tombstones.markedAts[j], tombstones.delTimes[j]);
j++;
org.apache.cassandra.dbRangeTombstoneListinsertFrom

Popular methods of RangeTombstoneList

  • <init>
  • add
    Adds a new range tombstone. This method will be faster if the new tombstone sort after all the curre
  • addAll
    Adds all the range tombstones of tombstones to this RangeTombstoneList.
  • addInternal
  • capacity
  • comparator
  • copy
  • copyArrays
  • dataSize
  • grow
  • growToFree
  • isEmpty
  • growToFree,
  • isEmpty,
  • iterator,
  • maxMarkedAt,
  • moveElements,
  • rangeTombstone,
  • search,
  • searchInternal,
  • setInternal

Popular in Java

  • Updating database using SQL prepared statement
  • getOriginalFilename (MultipartFile)
    Return the original filename in the client's filesystem.This may contain path information depending
  • orElseThrow (Optional)
    Return the contained value, if present, otherwise throw an exception to be created by the provided s
  • getApplicationContext (Context)
  • System (java.lang)
    Provides access to system-related information and resources including standard input and output. Ena
  • URI (java.net)
    A Uniform Resource Identifier that identifies an abstract or physical resource, as specified by RFC
  • BitSet (java.util)
    The BitSet class implements abit array [http://en.wikipedia.org/wiki/Bit_array]. Each element is eit
  • Iterator (java.util)
    An iterator over a sequence of objects, such as a collection.If a collection has been changed since
  • Scanner (java.util)
    A parser that parses a text string of primitive types and strings with the help of regular expressio
  • LoggerFactory (org.slf4j)
    The LoggerFactory is a utility class producing Loggers for various logging APIs, most notably for lo
  • Github Copilot 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