Package org.teiid.common.buffer

Examples of org.teiid.common.buffer.IndexedTupleSource

95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
      }
      leftSource.getSource().reset();
      super.openLeft();
    }
   
    IndexedTupleSource its = leftSource.getIterator();
   
    while (its.hasNext() || leftSource.getCurrentTuple() != null) {
     
      List<?> leftTuple = leftSource.getCurrentTuple();
      if (leftTuple == null) {
        leftTuple = leftSource.saveNext();
      }
      updateContext(leftTuple, leftSource.getSource().getElements());
     
      if (rightMap != null && !rightSource.open) {
        for (Map.Entry<ElementSymbol, Expression> entry : rightMap.asMap().entrySet()) {
          joinNode.getContext().getVariableContext().setValue(entry.getKey(), eval.evaluate(entry.getValue(), null));
        }
        rightSource.getSource().reset();
        super.openRight();
      }
     
      IndexedTupleSource right = rightSource.getIterator();
     
      while (right.hasNext() || rightSource.getCurrentTuple() != null) {
       
        List<?> rightTuple = rightSource.getCurrentTuple();
        if (rightTuple == null) {
          rightTuple = rightSource.saveNext();
        }
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
    /**
     * @throws TeiidComponentException
     * @see org.teiid.query.sql.util.ValueIteratorSource#getValueIterator(org.teiid.query.sql.symbol.Expression)
     */
    public ValueIterator getValueIterator(Expression valueExpression) throws  TeiidComponentException {
      IndexedTupleSource its = buffer.createIndexedTupleSource();
      int index = 0;
      if (valueExpression != null) {
        index = buffer.getSchema().indexOf(valueExpression);
        Assertion.assertTrue(index != -1);
      }
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
      }
      if (result == null) {
      if (buffer.getRowCount() > buffer.getBatchSize()) {
        return null;
      }
      IndexedTupleSource its = buffer.createIndexedTupleSource();
          int index = 0;
          if (valueExpression != null) {
            index = buffer.getSchema().indexOf(valueExpression);
          }
          Assertion.assertTrue(index != -1);
          if (((SingleElementSymbol)buffer.getSchema().get(index)).getType() == DataTypeManager.DefaultDataClasses.BIG_DECIMAL) {
            result = new TreeSet<Object>();
        } else {
          result = new HashSet<Object>();
        }
          while (its.hasNext()) {
            Object value = its.nextTuple().get(index);
            if (value != null) {
              result.add(value);
            }
          }
          its.closeSource();
          if (cachedSets == null) {
            cachedSets = new HashMap<Expression, Set<Object>>();
          }
        cachedSets.put(valueExpression, result);
      }
View Full Code Here
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
      index = this.joinNode.getBufferManager().createSTree(reordered, this.joinNode.getConnectionID(), keyLength);
      index.setPreferMemory(true);
      if (!state.isDistinct()) {
        index.getComparator().setDistinctIndex(keyLength-2);
      }
      IndexedTupleSource its = state.getTupleBuffer().createIndexedTupleSource(!joinNode.isDependent());
      int rowId = 0;
      List<?> lastTuple = null;
      boolean sortedDistinct = sorted && !state.isDistinct();
      int sizeHint = index.getExpectedHeight(state.getTupleBuffer().getRowCount());
      outer: while (its.hasNext()) {
        //detect if sorted and distinct
        List<?> originalTuple = its.nextTuple();
        //remove the tuple if it has null
        for (int i : state.getExpressionIndexes()) {
          if (originalTuple.get(i) == null) {
            continue outer;
          }
        }
        if (sortedDistinct && lastTuple != null && this.compare(lastTuple, originalTuple, state.getExpressionIndexes(), state.getExpressionIndexes()) == 0) {
          sortedDistinct = false;
        }
        lastTuple = originalTuple;
        List<Object> tuple = (List<Object>) RelationalNode.projectTuple(reorderedSortIndex, originalTuple);
        if (!state.isDistinct()) {
          tuple.add(keyLength - 1, rowId++);
        }
        index.insert(tuple, sorted?InsertMode.ORDERED:InsertMode.NEW, sizeHint);
      }
      if (!sorted) {
        index.compact();
      }
      its.closeSource();
      this.reverseIndexes = new int[elements.size()];
      for (int i = 0; i < reverseIndexes.length; i++) {
        int oldIndex = reorderedSortIndex[i];
        this.reverseIndexes[oldIndex] = i + (!state.isDistinct()&&i>=keyLength-1?1:0);
      }
View Full Code Here
TOP

Related Classes of org.teiid.common.buffer.IndexedTupleSource

  • org.teiid.query.processor.relational.DependentValueSource
  • org.teiid.query.processor.relational.EnhancedSortMergeJoinStrategy
  • org.teiid.query.processor.relational.NestedTableJoinStrategy
    • Copyright © 2018 www.massapicom. 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.