/*
* *************************************************************************************
* Copyright (C) 2008 EsperTech, Inc. All rights reserved. *
* http://esper.codehaus.org *
* http://www.espertech.com *
* ---------------------------------------------------------------------------------- *
* The software in this package is published under the terms of the GPL license *
* a copy of which has been included with this distribution in the license.txt file. *
* *************************************************************************************
*/
package com.espertech.esper.epl.enummethod.eval;
import com.espertech.esper.client.EventBean;
import com.espertech.esper.client.EventType;
import com.espertech.esper.epl.expression.ExprEvaluator;
import com.espertech.esper.epl.expression.ExprEvaluatorContext;
import com.espertech.esper.event.arr.ObjectArrayEventBean;
import com.espertech.esper.event.arr.ObjectArrayEventType;
import java.util.*;
public class EnumEvalOrderByAscDescScalarLambda extends EnumEvalBase implements EnumEval {
private final boolean descending;
private final ObjectArrayEventType resultEventType;
public EnumEvalOrderByAscDescScalarLambda(ExprEvaluator innerExpression, int streamCountIncoming, boolean descending, ObjectArrayEventType resultEventType) {
super(innerExpression, streamCountIncoming);
this.descending = descending;
this.resultEventType = resultEventType;
}
public Object evaluateEnumMethod(EventBean[] eventsLambda, Collection target, boolean isNewData, ExprEvaluatorContext context) {
TreeMap<Comparable, Object> sort = new TreeMap<Comparable, Object>();
boolean hasColl = false;
ObjectArrayEventBean resultEvent = new ObjectArrayEventBean(new Object[1], resultEventType);
Collection<Object> values = (Collection<Object>) target;
for (Object next : values) {
resultEvent.getProperties()[0] = next;
eventsLambda[streamNumLambda] = resultEvent;
Comparable comparable = (Comparable) innerExpression.evaluate(eventsLambda, isNewData, context);
Object entry = sort.get(comparable);
if (entry == null) {
sort.put(comparable, next);
continue;
}
if (entry instanceof Collection) {
((Collection) entry).add(next);
continue;
}
Deque<Object> coll = new ArrayDeque<Object>();
coll.add(entry);
coll.add(next);
sort.put(comparable, coll);
hasColl = true;
}
Map<Comparable, Object> sorted;
if (descending) {
sorted = sort.descendingMap();
}
else {
sorted = sort;
}
if (!hasColl) {
return sorted.values();
}
Deque<Object> coll = new ArrayDeque<Object>();
for (Map.Entry<Comparable, Object> entry : sorted.entrySet()) {
if (entry.getValue() instanceof Collection) {
coll.addAll((Collection) entry.getValue());
}
else {
coll.add(entry.getValue());
}
}
return coll;
}
}