Tabnine Logo
CircularBuffer.size
Code IndexAdd Tabnine to your IDE (free)

How to use
size
method
in
org.apache.druid.utils.CircularBuffer

Best Java code snippets using org.apache.druid.utils.CircularBuffer.size (Showing top 7 results out of 315)

origin: apache/incubator-druid

public synchronized Counter getLastCounter()
{
 if (changes.size() > 0) {
  return changes.get(changes.size() - 1).counter;
 } else {
  return Counter.ZERO;
 }
}
origin: apache/incubator-druid

@Nullable
public static List<String> getMessagesFromSavedParseExceptions(CircularBuffer<Throwable> savedParseExceptions)
{
 if (savedParseExceptions == null) {
  return null;
 }
 List<String> events = new ArrayList<>();
 for (int i = 0; i < savedParseExceptions.size(); i++) {
  events.add(savedParseExceptions.getLatest(i).getMessage());
 }
 return events;
}
origin: apache/incubator-druid

int changeStartIndex = (int) (counter.counter + changes.size() - lastCounter.counter);
for (int i = changeStartIndex; i < changes.size(); i++) {
 result.add(changes.get(i).changeRequest);
return ChangeRequestsSnapshot.success(changes.get(changes.size() - 1).counter, result);
origin: apache/incubator-druid

Assert.assertEquals(1, circularBuffer.size());
Assert.assertEquals(1, (int) circularBuffer.get(0));
Assert.assertEquals(2, circularBuffer.size());
for (int i = 0; i < circularBuffer.size(); i++) {
 Assert.assertEquals(i + 1, (int) circularBuffer.get(i));
Assert.assertEquals(3, circularBuffer.size());
for (int i = 0; i < circularBuffer.size(); i++) {
 Assert.assertEquals(i + 1, (int) circularBuffer.get(i));
Assert.assertEquals(3, circularBuffer.size());
for (int i = 0; i < circularBuffer.size(); i++) {
 Assert.assertEquals(i + 2, (int) circularBuffer.get(i));
Assert.assertEquals(3, circularBuffer.size());
for (int i = 0; i < circularBuffer.size(); i++) {
 Assert.assertEquals(i + 3, (int) circularBuffer.get(i));
Assert.assertEquals(3, circularBuffer.size());
for (int i = 0; i < circularBuffer.size(); i++) {
 Assert.assertEquals(i + 4, (int) circularBuffer.get(i));
Assert.assertEquals(3, circularBuffer.size());
for (int i = 0; i < circularBuffer.size(); i++) {
 Assert.assertEquals(i + 5, (int) circularBuffer.get(i));
Assert.assertEquals(3, circularBuffer.size());
for (int i = 0; i < circularBuffer.size(); i++) {
origin: org.apache.druid/druid-server

public synchronized Counter getLastCounter()
{
 if (changes.size() > 0) {
  return changes.get(changes.size() - 1).counter;
 } else {
  return Counter.ZERO;
 }
}
origin: org.apache.druid/druid-indexing-service

@Nullable
public static List<String> getMessagesFromSavedParseExceptions(CircularBuffer<Throwable> savedParseExceptions)
{
 if (savedParseExceptions == null) {
  return null;
 }
 List<String> events = new ArrayList<>();
 for (int i = 0; i < savedParseExceptions.size(); i++) {
  events.add(savedParseExceptions.getLatest(i).getMessage());
 }
 return events;
}
origin: org.apache.druid/druid-server

int changeStartIndex = (int) (counter.counter + changes.size() - lastCounter.counter);
for (int i = changeStartIndex; i < changes.size(); i++) {
 result.add(changes.get(i).changeRequest);
return ChangeRequestsSnapshot.success(changes.get(changes.size() - 1).counter, result);
org.apache.druid.utilsCircularBuffersize

Popular methods of CircularBuffer

  • add
  • <init>
  • get
    Access object at a given index, starting from the earliest entry added and moving forward.
  • getLatest
    Access object at a given index, starting from the latest entry added and moving backwards.

Popular in Java

  • Running tasks concurrently on multiple threads
  • scheduleAtFixedRate (Timer)
  • setRequestProperty (URLConnection)
  • putExtra (Intent)
  • VirtualMachine (com.sun.tools.attach)
    A Java virtual machine. A VirtualMachine represents a Java virtual machine to which this Java vir
  • Component (java.awt)
    A component is an object having a graphical representation that can be displayed on the screen and t
  • FileReader (java.io)
    A specialized Reader that reads from a file in the file system. All read requests made by calling me
  • Hashtable (java.util)
    A plug-in replacement for JDK1.5 java.util.Hashtable. This version is based on org.cliffc.high_scale
  • TreeSet (java.util)
    TreeSet is an implementation of SortedSet. All optional operations (adding and removing) are support
  • CountDownLatch (java.util.concurrent)
    A synchronization aid that allows one or more threads to wait until a set of operations being perfor
  • Best IntelliJ plugins
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