How to use

set

method

in

gnu.trove.list.TIntList

public int set( int index, int element) {
  synchronized( mutex ) { return list.set( index, element ); }
}
public void set( int offset, int[] values ) {

public void set( int offset, int[] values ) {
  synchronized( mutex ) { list.set( offset, values ); }
}
public void set( int offset, int[] values, int valOffset, int length ) {

public void set( int offset, int[] values, int valOffset, int length ) {
  synchronized( mutex ) { list.set( offset, values, valOffset, length ); }
}

void pokeAddress(int address) {
  addressStack.set(size() - 1, address);
}

@Override
public Integer set( int index, Integer value ) {
  int previous_value = list.set( index, value );
  if ( previous_value == list.getNoEntryValue() ) return null;
  else return Integer.valueOf( previous_value );
}

      if (hint.isUseContentWidth()) {
        Vector2i contentSize = contents.get(i).getPreferredContentSize(canvas, new Vector2i(remainingWidthPerElement, canvas.size().y));
        results.set(i, contentSize.x);
        totalWidthUsed += contentSize.x;
        unprocessedWidgets--;
for (int i = 0; i < results.size(); ++i) {
  if (results.get(i) == 0) {
    results.set(i, remainingWidthPerElement);

@Override
public void set( int offset, int[] values ) {
  synchronized( mutex ) { list.set( offset, values ); }
}
@Override

public void set( int offset, int[] values ) {
  synchronized( mutex ) { list.set( offset, values ); }
}
public void set( int offset, int[] values, int valOffset, int length ) {

@Override
public int set( int index, int element) {
  synchronized( mutex ) { return list.set( index, element ); }
}
@Override

public int set( int index, int element) {
  synchronized( mutex ) { return list.set( index, element ); }
}
public void set( int offset, int[] values ) {

/**
 * NOTE that this will have an effect on both edges in the bidirectional edge pair.
 */
public void setToVertex(int toVertexIndex) {
  if (isBackward) {
    fromVertices.set(pairIndex, toVertexIndex);
  } else {
    toVertices.set(pairIndex, toVertexIndex);
  }
}

/**
 * NOTE that this will have an effect on both edges in the bidirectional edge pair.
 */
public void setToVertex(int toVertexIndex) {
  if (isBackward) {
    fromVertices.set(pairIndex, toVertexIndex);
  } else {
    toVertices.set(pairIndex, toVertexIndex);
  }
}

/**
 * Set the length for the current edge pair (always the same in both directions).
 */
public void setLengthMm (int millimeters) {
  lengths_mm.set(pairIndex, millimeters);
}

@Override
public Integer set( int index, Integer value ) {
  int previous_value = list.set( index, value );
  if ( previous_value == list.getNoEntryValue() ) return null;
  else return Integer.valueOf( previous_value );
}

  @Override
  protected boolean goFurther( int nodeId )
  {
    list.set(nodeId, ref.incrementAndGet());
    return super.goFurther(nodeId);
  }
}.start(explorer, startNode);

@Override
public Integer set( int index, Integer value ) {
  int previous_value = list.set( index, value );
  if ( previous_value == list.getNoEntryValue() ) return null;
  else return Integer.valueOf( previous_value );
}

/**
 * Change the VM resource allocation.
 *
 * @param vmIdx the VM identifier
 * @param v     the amount to ask.
 * @return the retained value. May be bigger than {@code v} if a previous call asks for more
 */
public int minVMAllocation(int vmIdx, int v) {
  int vv = Math.max(v, vmAllocation.get(vmIdx));
  vmAllocation.set(vmIdx, vv);
  return vv;
}

@Override
public Integer set( int index, Integer value ) {
  int previous_value = list.set( index, value );
  if ( previous_value == list.getNoEntryValue() ) return null;
  else return Integer.valueOf( previous_value );
}

@Override
public int set (int index, int value) {
  if (index < base.size()) {
    throw new RuntimeException("Modifying the base graph is not allowed.");
  } else {
    return extension.set(index - base.size(), value);
  }
}

public static Graph shuffle( Graph g, Graph sortedGraph )
{
  int len = g.getNodes();
  TIntList list = new TIntArrayList(len, -1);
  list.fill(0, len, -1);
  for (int i = 0; i < len; i++)
  {
    list.set(i, i);
  }
  list.shuffle(new Random());
  return createSortedGraph(g, sortedGraph, list);
}