Examples of com.carrotsearch.hppc.IntOpenHashSet$EntryIterator

com.carrotsearch.hppc.IntOpenHashSet
An iterator implementation for {@link #iterator}.

    final ErrorCollector collector = new ErrorCollectorImpl();
    final List<TransferPair> transfers = Lists.newArrayList();


    final ClassGenerator<Projector> cg = CodeGenerator.getRoot(Projector.TEMPLATE_DEFINITION, context.getFunctionRegistry());


    IntOpenHashSet transferFieldIds = new IntOpenHashSet();


    boolean isAnyWildcard = false;


    ClassifierResult result = new ClassifierResult();
    boolean classify = isClassificationNeeded(exprs);


    for (int i = 0; i < exprs.size(); i++) {
      final NamedExpression namedExpression = exprs.get(i);
      result.clear();


      if (classify && namedExpression.getExpr() instanceof SchemaPath) {
        classifyExpr(namedExpression, incoming, result);


        if (result.isStar) {
          isAnyWildcard = true;
          Integer value = result.prefixMap.get(result.prefix);
          if (value != null && value.intValue() == 1) {
            int k = 0;
            for (VectorWrapper<?> wrapper : incoming) {
              ValueVector vvIn = wrapper.getValueVector();
              SchemaPath originalPath = vvIn.getField().getPath();
              if (k > result.outputNames.size()-1) {
                assert false;
              }
              String name = result.outputNames.get(k++);  // get the renamed column names
              if (name == EMPTY_STRING) {
                continue;
              }
              FieldReference ref = new FieldReference(name);
              ValueVector vvOut = container.addOrGet(MaterializedField.create(ref, vvIn.getField().getType()));
              TransferPair tp = vvIn.makeTransferPair(vvOut);
              transfers.add(tp);
            }
          } else if (value != null && value.intValue() > 1) { // subsequent wildcards should do a copy of incoming valuevectors
            int k = 0;
            for (VectorWrapper<?> wrapper : incoming) {
              ValueVector vvIn = wrapper.getValueVector();
              SchemaPath originalPath = vvIn.getField().getPath();
              if (k > result.outputNames.size()-1) {
                assert false;
              }
              String name = result.outputNames.get(k++);  // get the renamed column names
              if (name == EMPTY_STRING) {
                continue;
              }


              final LogicalExpression expr = ExpressionTreeMaterializer.materialize(originalPath, incoming, collector, context.getFunctionRegistry() );
              if (collector.hasErrors()) {
                throw new SchemaChangeException(String.format("Failure while trying to materialize incoming schema.  Errors:\n %s.", collector.toErrorString()));
              }


              MaterializedField outputField = MaterializedField.create(name, expr.getMajorType());
              ValueVector vv = container.addOrGet(outputField);
              allocationVectors.add(vv);
              TypedFieldId fid = container.getValueVectorId(outputField.getPath());
              ValueVectorWriteExpression write = new ValueVectorWriteExpression(fid, expr, true);
              HoldingContainer hc = cg.addExpr(write);


              cg.getEvalBlock()._if(hc.getValue().eq(JExpr.lit(0)))._then()._return(JExpr.FALSE);
            }
          }
          continue;
        }
      }


      String outputName = getRef(namedExpression).getRootSegment().getPath();
      if (result != null && result.outputNames != null && result.outputNames.size() > 0) {
        for (int j = 0; j < result.outputNames.size(); j++) {
          if (!result.outputNames.get(j).equals(EMPTY_STRING)) {
            outputName = result.outputNames.get(j);
            break;
          }
        }
      }


      final LogicalExpression expr = ExpressionTreeMaterializer.materialize(namedExpression.getExpr(), incoming, collector, context.getFunctionRegistry(), true);
      final MaterializedField outputField = MaterializedField.create(outputName, expr.getMajorType());
      if (collector.hasErrors()) {
        throw new SchemaChangeException(String.format("Failure while trying to materialize incoming schema.  Errors:\n %s.", collector.toErrorString()));
      }


      // add value vector to transfer if direct reference and this is allowed, otherwise, add to evaluation stack.
      if (expr instanceof ValueVectorReadExpression && incoming.getSchema().getSelectionVectorMode() == SelectionVectorMode.NONE
          && !((ValueVectorReadExpression) expr).hasReadPath()
          && !isAnyWildcard
          && !transferFieldIds.contains(((ValueVectorReadExpression) expr).getFieldId().getFieldIds()[0])) {


        ValueVectorReadExpression vectorRead = (ValueVectorReadExpression) expr;
        TypedFieldId id = vectorRead.getFieldId();
        ValueVector vvIn = incoming.getValueAccessorById(id.getIntermediateClass(), id.getFieldIds()).getValueVector();
        Preconditions.checkNotNull(incoming);


        FieldReference ref = getRef(namedExpression);
        ValueVector vvOut = container.addOrGet(MaterializedField.create(ref, vectorRead.getMajorType()));
        TransferPair tp = vvIn.makeTransferPair(vvOut);
        transfers.add(tp);
        transferFieldIds.add(vectorRead.getFieldId().getFieldIds()[0]);
        logger.debug("Added transfer for project expression.");
      } else if (expr instanceof DrillFuncHolderExpr &&
          ((DrillFuncHolderExpr) expr).isComplexWriterFuncHolder())  {
        // Need to process ComplexWriter function evaluation.
        // Lazy initialization of the list of complex writers, if not done yet.

View Full Code Here


    public int timePerturbed(int reps)
    {
        int count = 0;
        while (reps-- > 0) {
            IntOpenHashSet set = new IntOpenHashSet();
            for (int i = size; --i >= 0;)
            {
                set.add(i);
            }
            count += set.size();
        }
        return count;
    }

View Full Code Here


    public int timeUnperturbed(int reps)
    {
        int count = 0;
        while (reps-- > 0) {
            IntOpenHashSet set = new IntOpenHashSet() {
                protected int computePerturbationValue(int capacity)
                {
                    return 0;
                }
            };
            for (int i = size; --i >= 0;)
            {
                set.add(i);
            }
            count += set.size();
        }
        return count;
    }

View Full Code Here

public class HppcMaxHashMapSize
{
    public static void main(String [] args)
    throws Exception
    {
        IntOpenHashSet set = new IntOpenHashSet(0x40000000, 0.75f);


        for (int i = 0;; i++) {
            try {
                set.add(i);
            } catch (RuntimeException e) {
                System.out.println("Max capacity: " + set.size());
            } catch (OutOfMemoryError e) {
                System.out.println("OOM hit at size: " + set.size()  + " (0x" + Integer.toHexString(set.size()));
            }
        }
    }

View Full Code Here


public class IteratingOverSets
{
    IntOpenHashSet prepare(int size)
    {
        final IntOpenHashSet set = new IntOpenHashSet(size);
        for (int i = 0; i < size / 2; i++)
        {
            set.add(i);
        }
        return set;
    }

View Full Code Here

    @Test
    public void testIterableCursor()
    {
        // [[[start:iteration-sets-using-iterator]]]
        // Prepare some set to iterate over
        final IntOpenHashSet set = prepare(10);
        
        // Sets implement the Iterable interface that returns [type]Cursor elements.
        // The cursor contains the index and value of the current element. 
        for (IntCursor c : set)
        {

View Full Code Here

    
    @Test
    public void testWithProcedureClosure()
    {
        // [[[start:iteration-sets-using-procedures]]]
        final IntOpenHashSet set = prepare(10);


        // Sets also support iteration through [type]Procedure interfaces.
        // The apply() method will be called once for each element in the set.
        
        // Iteration from head to tail
        set.forEach(new IntProcedure()
        {
            public void apply(int value)
            {
                System.out.println(value);
            }

View Full Code Here


    @Test
    public void testDirectBufferLoop() throws Exception
    {
        // [[[start:iteration-sets-using-direct-buffer-access]]]
        final IntOpenHashSet set = prepare(10);
        
        // For the fastest iteration, you can access the sets's data buffers directly.
        final int [] keys = set.keys;
        final boolean [] allocated = set.allocated;

View Full Code Here

    return true;
  }
  
  static public IntOpenHashSet intersection(IntContainer c1, IntContainer c2)
  {
    IntOpenHashSet s1 = new IntOpenHashSet(c1);
    IntOpenHashSet s2 = new IntOpenHashSet(c2);
    
    s1.retainAll(s2);
    return s1;
  }

View Full Code Here

    return list;
  }
  
  public IntOpenHashSet getSubTerminalIdSet()
  {
    IntOpenHashSet set = new IntOpenHashSet();
    
    for (CTNode node : getSubTerminals())
      set.add(node.getTerminalId());
    
    return set;
  }

View Full Code Here

0 1 2 3 4

TOP

Related Classes of com.carrotsearch.hppc.IntOpenHashSet$EntryIterator

com.carrotsearch.hppc.caliper.BenchmarkPerturbedVsHashedOnly

com.carrotsearch.hppc.examples.IteratingOverSets

com.carrotsearch.hppc.misc.HppcMaxHashMapSize

com.caucho.quercus.env.Value

com.clearnlp.clustering.Kmeans

com.clearnlp.component.state.DEPState

com.clearnlp.component.state.ParseState

com.clearnlp.component.state.SRLState

com.clearnlp.constituent.CTNode

com.clearnlp.dependency.DEPNode

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.