summaryrefslogtreecommitdiffstats
path: root/sandbox/ctrezzo/Map-Reduce-Java/src/main/java/services/IntermediateCollectorImpl.java
diff options
context:
space:
mode:
Diffstat (limited to 'sandbox/ctrezzo/Map-Reduce-Java/src/main/java/services/IntermediateCollectorImpl.java')
-rw-r--r--sandbox/ctrezzo/Map-Reduce-Java/src/main/java/services/IntermediateCollectorImpl.java71
1 files changed, 71 insertions, 0 deletions
diff --git a/sandbox/ctrezzo/Map-Reduce-Java/src/main/java/services/IntermediateCollectorImpl.java b/sandbox/ctrezzo/Map-Reduce-Java/src/main/java/services/IntermediateCollectorImpl.java
new file mode 100644
index 0000000000..5fd5661ea2
--- /dev/null
+++ b/sandbox/ctrezzo/Map-Reduce-Java/src/main/java/services/IntermediateCollectorImpl.java
@@ -0,0 +1,71 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you 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 services;
+
+import java.util.Iterator;
+import java.util.Vector;
+
+import org.osoa.sca.annotations.Reference;
+
+public class IntermediateCollectorImpl implements IntermediateCollector {
+
+private Vector<KeyValuePair> table = new Vector<KeyValuePair>();
+
+ @Reference
+ public Reducer myReducer;
+
+
+ public void collect(String key, int value) {
+ table.add(new KeyValuePair(key, value));
+ }
+
+ public void reducePhase() {
+ java.util.Collections.sort(table);
+
+ Iterator<KeyValuePair> it = table.iterator();
+
+ //no data
+ if(!it.hasNext()) {
+ return;
+ }
+
+ Vector<Integer> values = new Vector<Integer>();
+ KeyValuePair last = it.next();
+ values.add(last.value);
+ while(it.hasNext()) {
+ KeyValuePair curr = it.next();
+ if(last.compareTo(curr) == 0) {
+ values.add(curr.value);
+ last = curr;
+ }
+ else {
+ myReducer.reduce(last.key, values.iterator());
+ values.clear();
+ values.add(curr.value);
+ last = curr;
+
+ }
+ }
+
+ myReducer.reduce(last.key, values.iterator());
+
+ }
+
+}