Examples of gnu.trove.list.array.TIntArrayList.toArray()

Class gnu.trove.list.array.TIntArrayList

Examples of gnu.trove.list.array.TIntArrayList.toArray()

gnu.trove.list.array.TIntArrayList.toArray()
{@inheritDoc}

      } else {
        LOG.info("Seed token \"" + token
            + "\" could not be found in the term list!");
      }
    }
    seedIndices = list.toArray();
  }


  /**
   * Starts the static thresholding algorithm and returns the expandedset of
   * newly found related tokens.

View Full Code Here

      } else {
        break;
      }
    }


    return list.toArray();
  }


  /**
   * Computes the relevance for each term in U (universe of entities) to the
   * terms in the seedset.

View Full Code Here

      double val = relevanceScores.get(i);
      if (val > threshold) {
        list.add(i);
      }
    }
    return list.toArray();
  }


}

View Full Code Here

                    }
                    return true;
                }
            });


            return new BlockMeshPart(vertices, normals, texCoords, indices.toArray());
        }
    }


}

View Full Code Here

    }
    finally
    {
      DbUtils.closeQuietly(con, st, rs);
    }
    int[] extracted = objectIds.toArray();
    Arrays.sort(extracted);
    _log.info("IdFactory: Extracted total " + extracted.length + " used id's.");
    return extracted;
  }

View Full Code Here

    if ((subClassesList == null) || subClassesList.isEmpty())
    {
      return new int[0];
    }
    loop:
    for (int clsId : subClassesList.toArray())
    {
      ClassId subClassId = ClassId.VALUES[clsId];
      
      for (SubClass playerSubClass : player.getSubClassList().values())
      {

View Full Code Here

          subClassesList.remove(clsId);
          continue;
        }
      }
    }
    return subClassesList.toArray();
  }
  
  /**
   * Method areClassesComportable.
   * @param baseClassId ClassId

View Full Code Here

    if ((dualClassesList == null) || dualClassesList.isEmpty() || haveDouble == null)
    {
      return new int[0];
    }
    loop:
    for (int clsId : dualClassesList.toArray())
    {
      int baseClassId = player.getBaseSubClass().getClassId();
      if(clsId == baseClassId)
      {
        dualClassesList.remove(clsId);

View Full Code Here

      {
        dualClassesList.remove(clsId);
        continue loop;
      }
    }
    return dualClassesList.toArray();
  }
}

View Full Code Here


    // copy edges
    int[][] edges = new int[nodes.size()][];
    for (int i = 0; i < nodes.size(); i++) {
      TIntArrayList list = nodes.get(i);
      edges[i] = list.toArray();
    }


    init(edges, labelsArray);
    this.stemSizes = new int[numOfStems];
    for (int i = 0; i < this.stemSizes.length; i++) {

View Full Code Here

0 1 2

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.