Package org.apache.pig.data

Examples of org.apache.pig.data.DataBag.cardinality()

73
74
75
76
77
78
79
80
81
82
83
                //newData = new DataBag();
              newData = BagFactory.getInstance().newDefaultBag();
                newBaseData.put(load, newData);
            }
           
            int newDataBoundary = newData.cardinality();
           
            for(Iterator<Tuple> it = newData.iterator(); it.hasNext();) {
              ((ExampleTuple)it.next()).makeSynthetic();
            }
            // append oldData to newData
View Full Code Here
354
355
356
357
358
359
360
361
362
363
364
                inputConstraint.copyFrom(inputConst);
                if (inputConstraint != null) inputConstraints.add(inputConstraint);
            }
           
            // if necessary, insert a negative example (i.e. a tuple that does not pass the filter)
            if (outputData.cardinality() == inputData.cardinality()) {     // all tuples pass the filter; generate one input that will not pass the filter
                ExampleTuple inputConstraint = new ExampleTuple();
                Tuple inputConst = GenerateMatchingTuple(inputSchema, new NotCond(filterCond));
                //inputConstraint.copyFrom(inputConst);
                if (inputConst != null) {
                  inputConstraint.copyFrom(inputConst);
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
        if(overallRealness) {
          bag = exampleData.get(e.getKey());
        } else {
          bag = exampleData.get(op);
        }
        noTuples += bag.cardinality();
        for(Iterator<Tuple> it = bag.iterator(); it.hasNext();) {
          if(((ExampleTuple)it.next()).isSynthetic()) noSynthetic++;
        }
        if(!overallRealness) break;
View Full Code Here
61
62
63
64
65
66
67
68
69
70
71
    static float getConciseness(LogicalOperator op, Map<LogicalOperator, DataBag> exampleData, Map<LogicalOperator, Collection<IdentityHashSet<Tuple>>> OperatorToEqClasses, boolean overallConciseness) {
      DataBag bag = exampleData.get(op);

      int noEqCl = OperatorToEqClasses.get(op).size();
      int noTuples = bag.cardinality();
     
     
      float conciseness = 100*((float)noEqCl / (float)noTuples);
      if(!overallConciseness) {
     
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
        for(Map.Entry<LogicalOperator, Collection<IdentityHashSet<Tuple>>> e : OperatorToEqClasses.entrySet()) {
          //if(e.getKey() instanceof LORead) continue;
          noOperators++; //we need to keep a track of these and not use OperatorToEqClasses.size() as LORead shouldn't be considered a operator
          bag = exampleData.get(e.getKey());
     
          noTuples = bag.cardinality();
          noEqCl = e.getValue().size();
          float concise = 100*((float)noEqCl / (float)noTuples);
          concise = (concise > 100) ? 100 : concise;
          conciseness += concise;
        }
View Full Code Here
189
190
191
192
193
194
195
196
197
198
199
                isAcceptable = (group.getBagField(1).cardinality() >= 2);
            } else {                      // for co-group, need a group with at least one tuple from each input relation
                isAcceptable = true;
                for (int field = 1; field < group.arity(); field++) {
                    DataBag bag = group.getBagField(field);
                    if (bag.cardinality() == 0) {
                        isAcceptable = false;
                        break;
                    }
                }
            }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.