How to use

contains

method

in

com.carrotsearch.hppc.IntOpenHashSet

public void passAux()
{
  int i;
  
  for (i=i_lambda-1; i>=0; i--)
  {
    if (!s_reduce.contains(i))
    {
      i_lambda = i;
      return;
    }
  }
  
  i_lambda = i;
}

public boolean isSkip(DEPNode node)
{
  return s_skip.contains(node.id);
}

public void passAux()
{
  int i;
  
  for (i=i_lambda-1; i>=0; i--)
  {
    if (!s_reduce.contains(i))
    {
      i_lambda = i;
      return;
    }
  }
  
  i_lambda = i;
}

public void passAux()
{
  int i;
  
  for (i=i_lambda-1; i>=0; i--)
  {
    if (!s_reduce.contains(i))
    {
      i_lambda = i;
      return;
    }
  }
  
  i_lambda = i;
}

public boolean isSkip(DEPNode node)
{
  return s_skip.contains(node.id);
}

protected void passAux()
{
  int i;
  
  for (i=i_lambda-1; i>=0; i--)
  {
    if (!s_reduce.contains(i))
    {
      i_lambda = i;
      return;
    }
  }
  
  i_lambda = i;
}

public void passAux()
{
  int i;
  
  for (i=i_lambda-1; i>=0; i--)
  {
    if (!s_reduce.contains(i))
    {
      i_lambda = i;
      return;
    }
  }
  
  i_lambda = i;
}

/** Called by {@link #getGoldLabel()}. */
private boolean isGoldShift()
{
  if (g_labels[i_beta].i < i_lambda)
    return false;
  
  int i;
  
  for (i=i_lambda-1; i>0; i--)
  {
    if (s_reduce.contains(i))
      continue;
    
    if (g_labels[i].i == i_beta)
      return false;
  }
  
  return true;
}

/** Called by {@link AbstractDEPParser#getGoldLabel()}. */
private boolean isGoldShift()
{
  if (g_heads[i_beta].i < i_lambda)
    return false;
  
  int i;
  
  for (i=i_lambda-1; i>0; i--)
  {
    if (s_reduce.contains(i))
      continue;
    
    if (g_heads[i].i == i_beta)
      return false;
  }
  
  return true;
}

/** Called by {@link #getGoldLabel()}. */
private boolean isGoldShift()
{
  if (g_labels[i_beta].i < i_lambda)
    return false;
  
  int i;
  
  for (i=i_lambda-1; i>0; i--)
  {
    if (s_reduce.contains(i))
      continue;
    
    if (g_labels[i].i == i_beta)
      return false;
  }
  
  return true;
}

/** Called by {@link #getGoldLabel()}. */
private boolean isGoldShift()
{
  if (g_labels[i_beta].i < i_lambda)
    return false;
  
  int i;
  
  for (i=i_lambda-1; i>0; i--)
  {
    if (s_reduce.contains(i))
      continue;
    
    if (g_labels[i].i == i_beta)
      return false;
  }
  
  return true;
}

private <T extends DEPArc>void removeEditedHeads(List<T> heads, IntOpenHashSet set)
{
  List<T> remove = Lists.newArrayList();
  
  for (T arc : heads)
  {
    if (set.contains(arc.getNode().id))
      remove.add(arc);
  }
  
  heads.removeAll(remove);
}

private <T extends DEPArc>void removeEditedHeads(List<T> heads, IntOpenHashSet set)
{
  List<T> remove = Lists.newArrayList();
  
  for (T arc : heads)
  {
    if (set.contains(arc.getNode().id))
      remove.add(arc);
  }
  
  heads.removeAll(remove);
}

private <T extends DEPArc>void removeEditedHeads(List<T> heads, IntOpenHashSet set)
{
  List<T> remove = Lists.newArrayList();
  
  for (T arc : heads)
  {
    if (set.contains(arc.getNode().id))
      remove.add(arc);
  }
  
  heads.removeAll(remove);
}

/** Called by {@link #getNode(FtrToken)}. */
private DEPNode getNodeStack(FtrToken token)
{
  if (token.offset == 0)
    return d_tree.get(i_lambda);
  
  int offset = Math.abs(token.offset), i;
  int dir = (token.offset < 0) ? -1 : 1;
        
  for (i=i_lambda+dir; 0<i && i<i_beta; i+=dir)
  {
    if (!s_reduce.contains(i) && --offset == 0)
      return d_tree.get(i);
  }
  
  return null;
}

/** Called by {@link #getNode(FtrToken)}. */
private DEPNode getNodeStack(FtrToken token)
{
  if (token.offset == 0)
    return d_tree.get(i_lambda);
  
  int offset = Math.abs(token.offset), i;
  int dir = (token.offset < 0) ? -1 : 1;
        
  for (i=i_lambda+dir; 0<i && i<i_beta; i+=dir)
  {
    if (!s_reduce.contains(i) && --offset == 0)
      return d_tree.get(i);
  }
  
  return null;
}

/** Called by {@link #getNode(FtrToken)}. */
private DEPNode getNodeStack(FtrToken token)
{
  if (token.offset == 0)
    return d_tree.get(i_lambda);
  
  int offset = Math.abs(token.offset), i;
  int dir = (token.offset < 0) ? -1 : 1;
        
  for (i=i_lambda+dir; 0<i && i<i_beta; i+=dir)
  {
    if (!s_reduce.contains(i) && --offset == 0)
      return d_tree.get(i);
  }
  
  return null;
}

/** Called by {@link AbstractDEPParser#getNode(FtrToken)}. */
private DEPNode getNodeStack(FtrToken token)
{
  if (token.offset == 0)
    return d_tree.get(i_lambda);
  
  int offset = Math.abs(token.offset), i;
  int dir    = (token.offset < 0) ? -1 : 1;
        
  for (i=i_lambda+dir; 0<i && i<i_beta; i+=dir)
  {
    if (!s_reduce.contains(i) && --offset == 0)
      return d_tree.get(i);
  }
  
  return null;
}

/** Called by {@link #getNode(FtrToken)}. */
private DEPNode getNodeStack(FtrToken token)
{
  if (token.offset == 0)
    return d_tree.get(i_lambda);
  
  int offset = Math.abs(token.offset), i;
  int dir = (token.offset < 0) ? -1 : 1;
        
  for (i=i_lambda+dir; 0<i && i<i_beta; i+=dir)
  {
    if (!s_reduce.contains(i) && --offset == 0)
      return d_tree.get(i);
  }
  
  return null;
}

/** Called by {@link AbstractSRLabeler#label(DEPTree)}. */
private void labelAux(DEPNode pred, DEPNode head)
{
  if (!s_skip.contains(head.id))
  {
    i_arg = head.id;
    addArgument(getLabel(getDirIndex()));    
  }
  
  labelDown(pred, head.getDependents());
}