Refine search
@Override public void endWindow() { int failureCount = 0; for (Map.Entry<K, Integer> e : map1.entrySet()) { K key = e.getKey(); int val = map2.get(key); if (val != e.getValue()) { failureCount++; } } if (failureCount != 0) { failurePort.emit(failureCount); } else { successPort.emit(map1.size()); } }
@Override public void endWindow() { outport.emit(result); int numOuts = 1; Integer total = 0; for (Map.Entry<k, Integer> entry : result.entrySet()) { Map<Integer, String> tuple = new HashMap<Integer, String>(); tuple.put(numOuts++, entry.getKey().toString()); redisport.emit(tuple); total += entry.getValue(); } Map<Integer, String> tuple = new HashMap<Integer, String>(); tuple.put(numOuts++, total.toString()); redisport.emit(tuple); tuple = new HashMap<Integer, String>(); tuple.put(0, new Integer(numOuts).toString()); redisport.emit(tuple); } }
@Override public void endWindow() { for (Map.Entry<String, Map<String, MutableDouble>> e : dataMap.entrySet()) { for (Map.Entry<String, MutableDouble> dimensionValObj : e.getValue().entrySet()) { Map<String, DimensionObject<String>> outputData = new HashMap<String, DimensionObject<String>>(); outputData.put(e.getKey(), new DimensionObject<String>(dimensionValObj.getValue(), dimensionValObj.getKey())); output.emit(outputData); } } dataMap.clear(); }
/** * 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>(); } }
@Override public void endWindow() { outport.emit(collect); long timestamp = new Date().getTime(); int allcount = 0; for (Map.Entry<k, Integer> entry : collect.entrySet()) { Map<String, Object> map = new HashMap<String, Object>(); map.put("timestamp", timestamp); map.put("item", entry.getKey()); map.put("view", entry.getValue()); dimensionOut.emit(map); allcount += entry.getValue(); } Map<String, Integer> map = new HashMap<String, Integer>(); map.put("total", new Integer(allcount)); total.emit(map); collect = null; collect = new HashMap<k, Integer>(); } }
/** * emits mergedTuple on mergedport if it is not empty */ @Override public void endWindow() { if (!mergedTuple.isEmpty()) { HashMap<K, V> stuples = new HashMap<K, V>(); for (Map.Entry<K, Double> e: mergedTuple.entrySet()) { stuples.put(e.getKey(), getValue(e.getValue())); } mergedport.emit(stuples); mergedTuple = new HashMap<K, Double>(); } }
/** * Emits all key,min value pairs. * Clears internal data. Node only works in windowed mode. */ @SuppressWarnings({ "unchecked", "rawtypes" }) @Override public void endWindow() { if (!mins.isEmpty()) { for (Map.Entry<K, V> e: mins.entrySet()) { min.emit(new KeyValPair(e.getKey(), e.getValue())); } mins.clear(); } } }