Tabnine Logo
GrowQueue_I64.<init>
Code IndexAdd Tabnine to your IDE (free)

How to use
org.ddogleg.struct.GrowQueue_I64
constructor

Best Java code snippets using org.ddogleg.struct.GrowQueue_I64.<init> (Showing top 15 results out of 315)

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/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

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

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

@Override
public GrowQueue_I64 declare(int maxsize) {
  return new GrowQueue_I64(maxsize);
}
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 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 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 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 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 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 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 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 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: 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));
}
org.ddogleg.structGrowQueue_I64<init>

Popular methods of GrowQueue_I64

  • get
  • 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
  • insert
    Inserts the value at the specified index and shifts all the other values down.
  • indexOf,
  • insert,
  • pop,
  • remove,
  • sort

Popular in Java

  • Parsing JSON documents to java classes using gson
  • scheduleAtFixedRate (ScheduledExecutorService)
  • getResourceAsStream (ClassLoader)
  • getSystemService (Context)
  • Proxy (java.net)
    This class represents proxy server settings. A created instance of Proxy stores a type and an addres
  • Time (java.sql)
    Java representation of an SQL TIME value. Provides utilities to format and parse the time's represen
  • Format (java.text)
    The base class for all formats. This is an abstract base class which specifies the protocol for clas
  • Deque (java.util)
    A linear collection that supports element insertion and removal at both ends. The name deque is shor
  • UUID (java.util)
    UUID is an immutable representation of a 128-bit universally unique identifier (UUID). There are mul
  • JList (javax.swing)
  • Top plugins for WebStorm
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