Package org.pentaho.reporting.libraries.formula.operators

Examples of org.pentaho.reporting.libraries.formula.operators.InfixOperator

57
58
59
60
61
62
63
64
65
66
  {
    TypeValuePair result = optimizedHeadValue.evaluate();
    for (int i = 0; i < operandsArray.length; i++)
    {
      final LValue value = operandsArray[i];
      final InfixOperator op = operatorArray[i];
      result = op.evaluate(getContext(), result, value.evaluate());
    }
    return result;
  }
View Full Code Here
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
169
170
    while (true)
    {
      // now start to optimize everything.
      // first, search the operator with the highest priority..
      final InfixOperator op = (InfixOperator) operators.get(0);
      int level = op.getLevel();
      boolean moreThanOne = false;
      for (int i = 1; i < operators.size(); i++)
      {
        final InfixOperator operator = (InfixOperator) operators.get(i);
        final int opLevel = operator.getLevel();
        if (opLevel != level)
        {
          moreThanOne = true;
          level = Math.min(opLevel, level);
        }
      }

      if (moreThanOne == false)
      {
        // No need to optimize the operators ..
        break;
      }

      // There are at least two op-levels in this term.
      Term subTerm = null;
      for (int i = 0; i < operators.size(); i++)
      {
        final InfixOperator operator = (InfixOperator) operators.get(i);
        if (operator.getLevel() != level)
        {
          subTerm = null;
          continue;
        }
View Full Code Here
234
235
236
237
238
239
240
241
242
243
244
    b.append(headValue);
    if (operands != null && operators != null)
    {
      for (int i = 0; i < operands.size(); i++)
      {
        final InfixOperator op = (InfixOperator) operators.get(i);
        final LValue value = (LValue) operands.get(i);
        b.append(op);
        b.append(value);
      }
    }
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
    throw new Error("Missing return statement in function");
  }

  final public Term startTail(LValue retval) throws ParseException {
  LValue val = null;
  InfixOperator op = null;
  Term ex = null;
    op = getInfixOperator();
    val = getLValue();
      if (retval instanceof Term)
      {
View Full Code Here
375
376
377
378
379
380
381
382
383
384
385
     {if (true) return getOperatorFactory().createPostfixOperator(value.image);}
    throw new Error("Missing return statement in function");
  }

  final public InfixOperator getInfixOperator() throws ParseException {
  InfixOperator op = null;
  Token value = null;
    switch (jj_nt.kind) {
    case PLUS:
      value = jj_consume_token(PLUS);
      break;
View Full Code Here
69
70
71
72
73
74
75
76
77
78
  {
    TypeValuePair result = optimizedHeadValue.evaluate();
    for (int i = 0; i < operandsArray.length; i++)
    {
      final LValue value = operandsArray[i];
      final InfixOperator op = operatorArray[i];
      result = op.evaluate(getContext(), result, value.evaluate());
    }
    return result;
  }
View Full Code Here
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
    while (true)
    {
      // now start to optimize everything.
      // first, search the operator with the highest priority..
      final InfixOperator op = (InfixOperator) operators.get(0);
      int level = op.getLevel();
      boolean moreThanOne = false;
      for (int i = 1; i < operators.size(); i++)
      {
        final InfixOperator operator = (InfixOperator) operators.get(i);
        final int opLevel = operator.getLevel();
        if (opLevel != level)
        {
          moreThanOne = true;
          level = Math.min(opLevel, level);
        }
      }

      if (moreThanOne == false)
      {
        // No need to optimize the operators ..
        break;
      }

      // There are at least two op-levels in this term.
      Term subTerm = null;
      for (int i = 0; i < operators.size(); i++)
      {
        final InfixOperator operator = (InfixOperator) operators.get(i);
        if (operator.getLevel() != level)
        {
          subTerm = null;
          continue;
        }
View Full Code Here
227
228
229
230
231
232
233
234
235
236
237
    b.append(headValue);
    if (operands != null && operators != null)
    {
      for (int i = 0; i < operands.size(); i++)
      {
        final InfixOperator op = (InfixOperator) operators.get(i);
        final LValue value = (LValue) operands.get(i);
        b.append(op);
        b.append(value);
      }
    }
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
    throw new Error("Missing return statement in function");
  }

  final public Term startTail(LValue retval) throws ParseException {
  LValue val = null;
  InfixOperator op = null;
  Term ex = null;
    op = getInfixOperator();
    val = getLValue();
      if (retval instanceof Term)
      {
View Full Code Here
359
360
361
362
363
364
365
366
367
368
369
     {if (true) return getOperatorFactory().createPostfixOperator(value.image);}
    throw new Error("Missing return statement in function");
  }

  final public InfixOperator getInfixOperator() throws ParseException {
  InfixOperator op = null;
  Token value = null;
    switch (jj_nt.kind) {
    case PLUS:
      value = jj_consume_token(PLUS);
      break;
View Full Code Here
TOP

Related Classes of org.pentaho.reporting.libraries.formula.operators.InfixOperator

  • org.pentaho.reporting.libraries.formula.lvalues.Term
  • org.pentaho.reporting.libraries.formula.parser.GeneratedFormulaParser
    • 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.