Tabnine Logo
TIntList.isEmpty
Code IndexAdd Tabnine to your IDE (free)

How to use
isEmpty
method
in
gnu.trove.list.TIntList

Best Java code snippets using gnu.trove.list.TIntList.isEmpty (Showing top 16 results out of 315)

origin: MovingBlocks/Terasology

public int get(String forUseBy) {
  if (pool.isEmpty()) {
    IntBuffer buffer = BufferUtils.createIntBuffer(BUFFER_FETCH_SIZE);
    GL15.glGenBuffers(buffer);
    for (int i = 0; i < BUFFER_FETCH_SIZE; ++i) {
      pool.add(buffer.get(i));
    }
    totalPoolSize += BUFFER_FETCH_SIZE;
  }
  int result = pool.removeAt(pool.size() - 1);
  if (traceBufferUsage) {
    usageTracker.put(result, forUseBy);
  }
  return result;
}
origin: opentripplanner/OpenTripPlanner

if (skippedStops.isEmpty()) {
  LOG.warn("No stops found to skip on matched trip pattern {}", original);
  return Arrays.asList(original);
origin: opentripplanner/OpenTripPlanner

if (!removedStopSequences.isEmpty()) {
  LOG.warn(graph.addBuilderAnnotation(new RepeatedStops(trip, removedStopSequences)));
origin: opentripplanner/OpenTripPlanner

if (!transfers.isEmpty())
  transfersForStop.add(transfers.toArray());
else
origin: com.graphhopper/graphhopper

/**
 * Returns the list of all edges.
 */
public List<EdgeIteratorState> calcEdges()
{
  final List<EdgeIteratorState> edges = new ArrayList<EdgeIteratorState>(edgeIds.size());
  if (edgeIds.isEmpty())
    return edges;
  forEveryEdge(new EdgeVisitor()
  {
    @Override
    public void next( EdgeIteratorState eb, int i )
    {
      edges.add(eb);
    }
  });
  return edges;
}
origin: conveyal/r5

  if (newDistanceTable.isEmpty()) return null; // not near any points in sub pointset
  else return newDistanceTable.toArray();
})
origin: com.conveyal/r5

  if (newDistanceTable.isEmpty()) return null; // not near any points in sub pointset
  else return newDistanceTable.toArray();
})
origin: com.conveyal/gtfs-lib

Fun.Tuple2<String, String> routeKey = entry.getKey();
TIntList waitTimes = entry.getValue();
if (waitTimes.isEmpty()) {
  continue;
origin: com.conveyal/r5

if (modified && bin.isEmpty()) {
  bins.remove(mapKey);
  nBins--;
origin: conveyal/r5

if (modified && bin.isEmpty()) {
  bins.remove(mapKey);
  nBins--;
origin: voxelwind/voxelwind

public static List<IntRange> intoRanges(TIntList ids) {
  if (ids.isEmpty()) {
    throw new NoSuchElementException();
  }
  List<IntRange> ranges = new ArrayList<>();
  if (ids.size() == 1) {
    return ImmutableList.of(new IntRange(ids.get(0)));
  }
  ids.sort();
  int start = ids.get(0);
  int cur = start;
  for (int id : ids.subList(1, ids.size()).toArray()) {
    if (cur + 1 == id) {
      cur = id;
    } else {
      ranges.add(new IntRange(start, cur));
      start = id;
      cur = id;
    }
  }
  if (start == cur) {
    ranges.add(new IntRange(start));
  } else {
    ranges.add(new IntRange(start, cur));
  }
  return ranges;
}
origin: com.conveyal/gtfs-lib

if (deltas.isEmpty()) return -1;
origin: com.graphhopper/graphhopper

/**
 * @return the uncached node indices of the tower nodes in this path.
 */
public TIntList calcNodes()
{
  final TIntArrayList nodes = new TIntArrayList(edgeIds.size() + 1);
  if (edgeIds.isEmpty())
  {
    if (isFound())
    {
      nodes.add(endNode);
    }
    return nodes;
  }
  int tmpNode = getFromNode();
  nodes.add(tmpNode);
  forEveryEdge(new EdgeVisitor()
  {
    @Override
    public void next( EdgeIteratorState eb, int i )
    {
      nodes.add(eb.getAdjNode());
    }
  });
  return nodes;
}
origin: com.flowpowered/caustic-api

final boolean hasTextureCoords;
final boolean hasNormals;
if (!textureCoordIndices.isEmpty() && !rawTextureCoords.isEmpty()) {
  textureCoords.fill(0, positions.size() / positionSize * textureCoordSize, 0);
  hasTextureCoords = true;
  hasTextureCoords = false;
if (!normalIndices.isEmpty() && !rawNormalComponents.isEmpty()) {
  normals.fill(0, positions.size() / positionSize * normalSize, 0);
  hasNormals = true;
origin: com.graphhopper/graphhopper

if (edgeIds.isEmpty())
origin: com.graphhopper/graphhopper

if (edgeIds.isEmpty())
gnu.trove.listTIntListisEmpty

Javadoc

Tests whether this list contains any values.

Popular methods of TIntList

  • add
    Adds a subset of the values in the array vals to the end of the list, in order.
  • toArray
    Copies a slice of the list into a native array.
  • get
    Returns the value at the specified offset.
  • size
    Returns the number of values in the list.
  • sort
    Sort a slice of the list (ascending) using the Sun quicksort implementation.
  • iterator
  • set
    Replace the values in the list starting at offset withlength values from the values array, starting
  • clear
    Flushes the internal state of the list, resetting the capacity to the default.
  • remove
    Removes length values from the list, starting atoffset
  • reverse
    Reverse the order of the elements in the range of the list.
  • max
    Finds the maximum value in the list.
  • min
    Finds the minimum value in the list.
  • max,
  • min,
  • fill,
  • removeAt,
  • replace,
  • shuffle,
  • subList,
  • sum,
  • binarySearch

Popular in Java

  • Running tasks concurrently on multiple threads
  • orElseThrow (Optional)
    Return the contained value, if present, otherwise throw an exception to be created by the provided s
  • getExternalFilesDir (Context)
  • addToBackStack (FragmentTransaction)
  • Font (java.awt)
    The Font class represents fonts, which are used to render text in a visible way. A font provides the
  • Window (java.awt)
    A Window object is a top-level window with no borders and no menubar. The default layout for a windo
  • ConnectException (java.net)
    A ConnectException is thrown if a connection cannot be established to a remote host on a specific po
  • Format (java.text)
    The base class for all formats. This is an abstract base class which specifies the protocol for clas
  • Reference (javax.naming)
  • Join (org.hibernate.mapping)
  • 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