| /* |
| * Copyright (c) 2013 DataTorrent, Inc. ALL Rights Reserved. |
| * |
| * Licensed under the Apache License, Version 2.0 (the "License"); |
| * you may not use this file except in compliance with the License. |
| * You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| package com.datatorrent.lib.util; |
| |
| import com.datatorrent.api.DefaultOutputPort; |
| import com.datatorrent.api.Context.OperatorContext; |
| import com.datatorrent.api.Operator.Unifier; |
| |
| import java.util.ArrayList; |
| import java.util.HashMap; |
| import java.util.Map; |
| |
| /** |
| * This unifier consumes key value pairs in the form of a list of hash maps, |
| * where the key is an object and the value is an integer. |
| * The operator emits either the largest or smallest value associated with each key at the end of each application window. |
| * <p> |
| * The processing is done with sticky key partitioning, i.e. each one key belongs only to one partition. |
| * </p> |
| * @displayName Unifier Array Hash Map Frequent |
| * @category Algorithmic |
| * @tags numeric |
| * @since 0.3.3 |
| */ |
| public class UnifierArrayHashMapFrequent<K> implements Unifier<ArrayList<HashMap<K, Integer>>> |
| { |
| HashMap<K, Integer> mergedTuple = new HashMap<K, Integer>(); |
| /** |
| * This is the output port on which the smallest and largest values associated with each key are emitted. |
| */ |
| public final transient DefaultOutputPort<ArrayList<HashMap<K, Integer>>> mergedport = new DefaultOutputPort<ArrayList<HashMap<K, Integer>>>(); |
| |
| Integer lval; |
| boolean least = true; |
| /** |
| * combines the tuple into a single final tuple which is emitted in endWindow |
| * @param tuple incoming tuple from a partition |
| */ |
| @Override |
| public void process(ArrayList<HashMap<K, Integer>> tuples) |
| { |
| for (HashMap<K, Integer> tuple : tuples) { |
| if (mergedTuple.isEmpty()) { |
| mergedTuple.putAll(tuple); |
| for (Map.Entry<K, Integer> e: tuple.entrySet()) { |
| lval = e.getValue(); |
| break; |
| } |
| } |
| else { |
| for (Map.Entry<K, Integer> e: tuple.entrySet()) { |
| if ((least && (e.getValue() < lval)) |
| || (!least && (e.getValue() > lval))) { |
| mergedTuple.clear(); |
| mergedTuple.put(e.getKey(), e.getValue()); |
| break; |
| } |
| } |
| } |
| } |
| } |
| |
| /** |
| * getter function for combiner doing least (true) or most (false) compare |
| * @return least flag |
| */ |
| public boolean getLeast() |
| { |
| return least; |
| } |
| |
| /** |
| * setter funtion for combiner doing least (true) or most (false) compare |
| * @param b |
| */ |
| public void setLeast(boolean b) |
| { |
| least = b; |
| } |
| |
| /** |
| * a no op |
| * @param windowId |
| */ |
| @Override |
| public void beginWindow(long windowId) |
| { |
| } |
| |
| /** |
| * emits mergedTuple on mergedport if it is not empty |
| */ |
| @Override |
| public void endWindow() |
| { |
| if (!mergedTuple.isEmpty()) { |
| ArrayList<HashMap<K, Integer>> list = new ArrayList<HashMap<K, Integer>>(); |
| for (Map.Entry<K, Integer> entry : mergedTuple.entrySet()) { |
| HashMap<K, Integer> tuple = new HashMap<K, Integer>(); |
| tuple.put(entry.getKey(), entry.getValue()); |
| list.add(tuple); |
| } |
| mergedport.emit(list); |
| mergedTuple = new HashMap<K, Integer>(); |
| } |
| } |
| |
| /** |
| * a no-op |
| * @param context |
| */ |
| @Override |
| public void setup(OperatorContext context) |
| { |
| } |
| |
| /** |
| * a noop |
| */ |
| @Override |
| public void teardown() |
| { |
| } |
| } |