congrats Icon
New! Announcing Tabnine Chat Beta
Learn More
Tabnine Logo
IntOpenHashSet.clear
Code IndexAdd Tabnine to your IDE (free)

How to use
clear
method
in
com.carrotsearch.hppc.IntOpenHashSet

Best Java code snippets using com.carrotsearch.hppc.IntOpenHashSet.clear (Showing top 8 results out of 315)

origin: com.clearnlp/clearnlp

public void reInit()
{
  initPrimitives();
     l_branches.clear();
   l_states.clear();
      for (List<DEPHead> list : l_2ndHeads)
     list.clear();
      Arrays.fill(n_2ndPos, 0);
   s_reduce.clear();
   d_tree.clearHeads();             
}

origin: com.clearnlp/clearnlp

public void reInit()
{
  initPrimitives();
     l_branches.clear();
   l_states.clear();
      for (List<DEPHead> list : l_2ndHeads)
     list.clear();
      Arrays.fill(n_2ndPos, 0);
   s_reduce.clear();
   d_tree.clearHeads();             
}

origin: clearnlp/clearnlp

public void reInit()
{
  initPrimitives();
     l_branches.clear();
   l_states.clear();
      for (List<DEPHead> list : l_2ndHeads)
     list.clear();
      Arrays.fill(n_2ndPos, 0);
   s_reduce.clear();
   d_tree.clearHeads();             
}

origin: clearnlp/clearnlp

public void reInit()
{
  initPrimitives();
     l_branches.clear();
   l_states.clear();
      for (List<DEPHead> list : l_2ndHeads)
     list.clear();
      Arrays.fill(n_2ndPos, 0);
   s_reduce.clear();
   d_tree.clearHeads();             
}

origin: clearnlp/clearnlp

public DEPNode moveToNextPredicate()
{
  DEPNode pred = d_tree.getNextPredicate(i_pred);
  
  if (pred != null)
  {
    i_pred = pred.id;
    d_lca  = pred;
    l_argns.clear();
    m_argns.clear();
    s_skip.clear();
    s_skip.add(i_pred);
    s_skip.add(DEPLib.ROOT_ID);
  }
    
  return pred;
}

origin: com.clearnlp/clearnlp

public DEPNode moveToNextPredicate()
{
  DEPNode pred = d_tree.getNextPredicate(i_pred);
  
  if (pred != null)
  {
    i_pred = pred.id;
    d_lca  = pred;
    l_argns.clear();
    m_argns.clear();
    s_skip.clear();
    s_skip.add(i_pred);
    s_skip.add(DEPLib.ROOT_ID);
  }
    
  return pred;
}

origin: com.googlecode.clearnlp/clearnlp

private void getPredicateIds(CTTree tree, IntOpenHashSet[] sets)
{
  for (IntOpenHashSet set : sets)
    set.clear();
      
  int idx;
  
  for (CTNode node : tree.getTokens())
  {
    idx = isVerbPredicate(tree, node);
    if (idx >= 0)	sets[idx].add(node.getTerminalId());
  }
}

origin: com.googlecode.clearnlp/clearnlp

private void label()
{
  DEPNode pred;
  
  while (i_pred < t_size)
  {
    pred = d_tree.get(i_pred);
    
    p_roleset = getRoleset(); 
    s_skip.clear();
    s_skip.add(i_pred);
    s_skip.add(DEPLib.ROOT_ID);
    l_argns.clear();
    m_argns.clear();
    
    d_lca = pred;
    do
    {
      labelAux(pred, d_lca);
      d_lca = d_lca.getHead();
    }
    while (d_lca != null);// && (pred.isDependentOf(d_lca) || s_up.contains(getDUPath(d_lca, pred))));
    
    i_pred = getNextPredId(i_pred);
  }
}

com.carrotsearch.hppcIntOpenHashSetclear

Popular methods of IntOpenHashSet

  • <init>
  • addAll
  • add
  • contains
  • size
  • clone
  • isEmpty
  • remove
  • removeAll
  • retainAll
  • toArray
  • from
  • toArray,
  • from

Popular in Java

  • Running tasks concurrently on multiple threads
  • getOriginalFilename (MultipartFile)
    Return the original filename in the client's filesystem.This may contain path information depending
  • requestLocationUpdates (LocationManager)
  • getApplicationContext (Context)
  • Component (java.awt)
    A component is an object having a graphical representation that can be displayed on the screen and t
  • Permission (java.security)
    Legacy security code; do not use.
  • Collections (java.util)
    This class consists exclusively of static methods that operate on or return collections. It contains
  • Comparator (java.util)
    A Comparator is used to compare two objects to determine their ordering with respect to each other.
  • ExecutorService (java.util.concurrent)
    An Executor that provides methods to manage termination and methods that can produce a Future for tr
  • Semaphore (java.util.concurrent)
    A counting semaphore. Conceptually, a semaphore maintains a set of permits. Each #acquire blocks if
  • 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