Tabnine Logo
GrowQueue_I64
Code IndexAdd Tabnine to your IDE (free)

How to use
GrowQueue_I64
in
org.ddogleg.struct

Best Java code snippets using org.ddogleg.struct.GrowQueue_I64 (Showing top 20 results out of 315)

origin: org.ddogleg/ddogleg

/**
 * Gets the value at the index which corresponds to the specified fraction
 * @param fraction 0 to 1 inclusive
 * @return value at fraction
 */
public long getFraction( double fraction ) {
  return get( (int)((size-1)*fraction) );
}
origin: org.ddogleg/ddogleg

@Override
public GrowQueue_I64 copy() {
  GrowQueue_I64 ret = new GrowQueue_I64(size);
  ret.setTo(this);
  return ret;
}
origin: org.ddogleg/ddogleg

public void add(long value) {
  push(value);
}
origin: org.ddogleg/ddogleg

@Override
public void setTo( GrowQueue_I64 original ) {
  resize(original.size);
  System.arraycopy(original.data, 0, data, 0, size());
}
origin: lessthanoptimal/ddogleg

@Test
public void addAll_queue() {
  GrowQueue_I64 queue0 = new GrowQueue_I64(2);
  GrowQueue_I64 queue1 = new GrowQueue_I64(3);
  queue0.add(1);
  queue0.add(2);
  queue1.add(3);
  queue1.add(4);
  queue1.add(5);
  assertEquals(2,queue0.size);
  queue0.addAll(queue1);
  assertEquals(5,queue0.size);
  for( int i = 0; i < queue0.size; i++ ) {
    assertEquals(queue0.get(i),i+1);
  }
  queue0.reset();
  queue0.addAll(queue1);
  assertEquals(3,queue0.size);
  for( int i = 0; i < queue0.size; i++ ) {
    assertEquals(queue0.get(i),i+3);
  }
}
origin: lessthanoptimal/ddogleg

@Test
public void reset() {
  GrowQueue_I64 alg = new GrowQueue_I64(10);
  alg.push(1);
  alg.push(3);
  alg.push(-2);
  assertTrue(1.0 == alg.get(0));
  assertEquals(3,alg.size);
  alg.reset();
  assertEquals(0,alg.size);
}
origin: lessthanoptimal/ddogleg

@Test
public void remove_one() {
  GrowQueue_I64 alg = new GrowQueue_I64(10);
  alg.push(1);
  alg.push(3);
  alg.push(4);
  alg.push(5);
  alg.remove(1);
  assertEquals(3,alg.size);
  assertEquals(1,alg.get(0));
  assertEquals(4,alg.get(1));
  assertEquals(5,alg.get(2));
}
origin: lessthanoptimal/ddogleg

@Test
public void sort() {
  GrowQueue_I64 alg = new GrowQueue_I64(6);
  alg.push(8);
  alg.push(2);
  alg.push(4);
  alg.push(3);
  alg.sort();
  assertEquals(4,alg.size);
  assertEquals(2,alg.get(0));
  assertEquals(3,alg.get(1));
  assertEquals(4,alg.get(2));
  assertEquals(8,alg.get(3));
}
origin: lessthanoptimal/ddogleg

@Test
public void auto_grow() {
  GrowQueue_I64 alg = new GrowQueue_I64(3);
  assertEquals(3,alg.data.length);
  for( int i = 0; i < 10; i++ )
    alg.push(i);
  assertEquals(10,alg.size);
  for( int i = 0; i < 10; i++ )
    assertEquals(i,alg.get(i),1e-8);
}
origin: lessthanoptimal/ddogleg

@Test
public void indexOf() {
  GrowQueue_I64 alg = new GrowQueue_I64(10);
  alg.push(1);
  alg.push(3);
  alg.push(4);
  alg.push(5);
  assertEquals(1,alg.indexOf(3));
  assertEquals(-1,alg.indexOf(8));
}
origin: lessthanoptimal/ddogleg

@Test
public void push_pop() {
  GrowQueue_I64 alg = new GrowQueue_I64(10);
  alg.push(1);
  alg.push(3);
  assertEquals(2,alg.size);
  assertTrue(3==alg.pop());
  assertTrue(1==alg.pop());
  assertEquals(0, alg.size);
}
origin: lessthanoptimal/ddogleg

  @Test
  public void getFraction() {
    GrowQueue_I64 alg = new GrowQueue_I64(20);

    for (int i = 0; i < 20; i++) {
      alg.add(i);
    }

    assertEquals(0,alg.getFraction(0.0));
    assertEquals(0,alg.getFraction(0.02));
    assertEquals(0,alg.getFraction(0.03));
    assertEquals(1,alg.getFraction(1.0/19.0));
    assertEquals(1,alg.getFraction(1.7/19.0));
    assertEquals(19/2,alg.getFraction(0.5));
    assertEquals(19,alg.getFraction(1.0));
  }
}
origin: org.ddogleg/ddogleg

/**
 * Creates a queue with the specified length as its size filled with all zeros
 */
public static GrowQueue_I64 zeros( int length ) {
  GrowQueue_I64 out = new GrowQueue_I64(length);
  out.size = length;
  return out;
}
origin: lessthanoptimal/BoofAndroidDemo

listPose.reset();
listWidths.reset();
listIDs.reset();
  listPose.grow().set(targetToCamera);
  listWidths.add(detector.getWidth(i));
  listIDs.add(detector.getId(i));
origin: lessthanoptimal/ddogleg

public static GrowQueue_I64 array( long ...values ) {
  GrowQueue_I64 out = zeros(values.length);
  for (int i = 0; i < values.length; i++) {
    out.data[i] = values[i];
  }
  return out;
}
origin: lessthanoptimal/ddogleg

@Test
public void addAll_array() {
  GrowQueue_I64 queue0 = new GrowQueue_I64(2);
  long[] array = new long[]{3,4,5};
  queue0.add(1);
  queue0.add(2);
  assertEquals(2,queue0.size);
  queue0.addAll(array,0,3);
  assertEquals(5,queue0.size);
  for( int i = 0; i < queue0.size; i++ ) {
    assertEquals(queue0.get(i),i+1,1e-8);
  }
  queue0.reset();
  queue0.addAll(array,1,3);
  assertEquals(2,queue0.size);
  for( int i = 0; i < queue0.size; i++ ) {
    assertEquals(queue0.get(i),i+4,1e-8);
  }
}
origin: lessthanoptimal/ddogleg

@Test
public void remove_two() {
  GrowQueue_I64 alg = new GrowQueue_I64(10);
  alg.push(1);
  alg.push(3);
  alg.push(4);
  alg.push(5);
  alg.push(6);
  alg.remove(1,1);
  assertEquals(4,alg.size);
  assertEquals(1,alg.get(0));
  assertEquals(4,alg.get(1));
  assertEquals(5,alg.get(2));
  assertEquals(6,alg.get(3));
  alg.remove(0,1);
  assertEquals(2,alg.size);
  assertEquals(5,alg.get(0));
  assertEquals(6,alg.get(1));
}
origin: lessthanoptimal/ddogleg

@Override
public void setTo( GrowQueue_I64 original ) {
  resize(original.size);
  System.arraycopy(original.data, 0, data, 0, size());
}
origin: lessthanoptimal/ddogleg

/**
 * Creates a queue with the specified length as its size filled with all zeros
 */
public static GrowQueue_I64 zeros( int length ) {
  GrowQueue_I64 out = new GrowQueue_I64(length);
  out.size = length;
  return out;
}
origin: org.ddogleg/ddogleg

public static GrowQueue_I64 array( long ...values ) {
  GrowQueue_I64 out = zeros(values.length);
  for (int i = 0; i < values.length; i++) {
    out.data[i] = values[i];
  }
  return out;
}
org.ddogleg.structGrowQueue_I64

Javadoc

This is a queue that is composed of integers. Elements are added and removed from the tail

Most used methods

  • get
  • <init>
  • push
  • add
  • reset
  • resize
  • setTo
  • size
  • zeros
    Creates a queue with the specified length as its size filled with all zeros
  • addAll
  • getFraction
    Gets the value at the index which corresponds to the specified fraction
  • indexOf
    Returns the index of the first element with the specified 'value'. return -1 if it wasn't found
  • getFraction,
  • indexOf,
  • insert,
  • pop,
  • remove,
  • sort

Popular in Java

  • Start an intent from android
  • getOriginalFilename (MultipartFile)
    Return the original filename in the client's filesystem.This may contain path information depending
  • requestLocationUpdates (LocationManager)
  • scheduleAtFixedRate (Timer)
  • Table (com.google.common.collect)
    A collection that associates an ordered pair of keys, called a row key and a column key, with a sing
  • InputStreamReader (java.io)
    A class for turning a byte stream into a character stream. Data read from the source input stream is
  • Time (java.sql)
    Java representation of an SQL TIME value. Provides utilities to format and parse the time's represen
  • Set (java.util)
    A Set is a data structure which does not allow duplicate elements.
  • SortedSet (java.util)
    SortedSet is a Set which iterates over its elements in a sorted order. The order is determined eithe
  • Manifest (java.util.jar)
    The Manifest class is used to obtain attribute information for a JarFile and its entries.
  • 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