Examples of CombinationEnumeration

com.espertech.esper.collection.CombinationEnumeration
Provided a 2-dimensional array of values, provide all possible combinations:
```
 For example, an array { {1}, {"A", "B"}, {"X", "Y"} } provides these combinations: 1 A X 1 A Y 1 B X 1 B Y 
```
. Usage Note: Do not hold on to the returned object array as {@link #nextElement()} returns the same arraywith changed values for each enumeration.
Each array element must be non-null and length 1 or more.

Does not detect duplicates in values.

Allows any number for the first dimension.

The algorithm adds 1 to the right and overflows until done.

Examples of com.espertech.esper.collection.CombinationEnumeration

                combinations[i] = new Object[] {keyValues[i]};
            }
        }


        // enumerate combinations
        CombinationEnumeration enumeration = new CombinationEnumeration(combinations);
        HashSet<EventBean> events = new HashSet<EventBean>();
        for (;enumeration.hasMoreElements();) {
            Object[] keys = enumeration.nextElement();
            Collection<EventBean> result = fafTableLookup(virtualDataWindow, indexMultiKey, eventTable, keys, rangeValues, annotations);
            events.addAll(result);
        }
        return events;
    }

View Full Code Here

Examples of com.espertech.esper.collection.CombinationEnumeration

                combinations[i] = new Object[] {keyValues[i]};
            }
        }


        // enumerate combinations
        CombinationEnumeration enumeration = new CombinationEnumeration(combinations);
        HashSet<EventBean> events = new HashSet<EventBean>();
        for (;enumeration.hasMoreElements();) {
            Object[] keys = enumeration.nextElement();
            Collection<EventBean> result = fafTableLookup(virtualDataWindow, indexMultiKey, eventTable, keys, rangeValues, annotations);
            events.addAll(result);
        }
        return events;
    }

View Full Code Here

Examples of com.espertech.esper.collection.CombinationEnumeration

                throw new ExprValidationException("Failed to validate the group-by clause, found duplicate specification of expressions (" + writer.toString() + ")");
            }
        }


        // enumerate combinations building an index list
        CombinationEnumeration combinationEnumeration = new CombinationEnumeration(perNodeCombinations);
        Set<Integer> combination = new TreeSet<Integer>();
        Set<MultiKeyInt> indexList = new LinkedHashSet<MultiKeyInt>();
        for (;combinationEnumeration.hasMoreElements();) {
            combination.clear();
            Object[] combinationOA = combinationEnumeration.nextElement();
            for (Object indexes : combinationOA) {
                int[] indexarr = (int[]) indexes;
                for (int anIndex : indexarr) {
                    combination.add(anIndex);
                }

View Full Code Here

Examples of com.espertech.esper.collection.CombinationEnumeration

                combinations[i] = new Object[] {keyValues[i]};
            }
        }


        // enumerate combinations
        CombinationEnumeration enumeration = new CombinationEnumeration(combinations);
        HashSet<EventBean> events = new HashSet<EventBean>();
        for (;enumeration.hasMoreElements();) {
            Object[] keys = enumeration.nextElement();
            Collection<EventBean> result = fafTableLookup(virtualDataWindow, indexMultiKey, eventTable, keys, rangeValues, annotations);
            events.addAll(result);
        }
        return events;
    }

View Full Code Here

TOP

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.