com.datatorrent.lib.testbench.TopOccurrence Maven / Gradle / Ivy

Go to download
/**
 * 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 com.datatorrent.lib.testbench;

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;

import com.datatorrent.api.DefaultInputPort;
import com.datatorrent.api.DefaultOutputPort;
import com.datatorrent.common.util.BaseOperator;

/**
 * This operator consumes key value pairs of strings and integers. 
 * If the value of a pair is greater than the specified threshold then the tuple is emitted.
 * 
 * @displayName Top Occurrence
 * @category Test Bench
 * @tags numeric, compare
 * @since 0.3.2
 */
public class TopOccurrence extends BaseOperator
{
  // n value
  private int n = 5;
  private int threshold = 5;

  /**
   *
   */
  public final transient DefaultOutputPort> outport = new DefaultOutputPort<>();
  /**
   *
   */
  public final transient DefaultOutputPort> gtThreshold = new DefaultOutputPort<>();

  // input port
  public final transient DefaultInputPort> inport = new DefaultInputPort>()
  {
    @Override
    public void process(Map tuple)
    {
      int numOuts = 0;
      if (tuple.size() < n) {
        for (Map.Entry entry : tuple.entrySet()) {
          Map out = new HashMap();
          String value = new StringBuilder(entry.getKey()).append("##").append(entry.getValue()).toString();
          out.put(numOuts++, value);
          outport.emit(out);
        }
        while (numOuts < n) {
          Map out = new HashMap();
          out.put(numOuts++, "");
          outport.emit(out);
        }
      } else {

        ArrayList values = new ArrayList();
        for (Map.Entry entry : tuple.entrySet()) {
          values.add(entry.getValue());
        }
        Collections.sort(values);

        for (int i = values.size() - 1; i >= 0; i--) {
          for (Map.Entry entry : tuple.entrySet()) {
            if (entry.getValue() == values.get(i)) {
              Map out = new HashMap();
              String value = new StringBuilder(entry.getKey()).append("##").append(entry.getValue()).toString();
              out.put(numOuts++, value);
              outport.emit(out);
            }
            if (numOuts >= n) {
              break;
            }
          }
          if (numOuts >= n) {
            break;
          }
        }
      }

      // output greater than threshold
      numOuts = 1;
      for (Map.Entry entry : tuple.entrySet()) {
        if (entry.getValue() > threshold) {
          Map out = new HashMap();
          String value = new StringBuilder(entry.getKey()).append("##").append(entry.getValue()).toString();
          out.put(numOuts++, value);
          gtThreshold.emit(out);
        }
      }
      Map out = new HashMap();
      out.put(0, new Integer(numOuts).toString());
      gtThreshold.emit(out);
    }
  };

  public int getN()
  {
    return n;
  }

  /**
   * Output n top values
   * @param n
  */
  public void setN(int n)
  {
    this.n = n;
  }

  public int getThreshold()
  {
    return threshold;
  }

  /**
   * Emit the tuples only if it's value is greater than the threshold.
   * @param threshold
  */
  public void setThreshold(int threshold)
  {
    this.threshold = threshold;
  }

}