io.fluo.stress.trie.Node Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of fluo-stress Show documentation

This module contains Fluo stress tests. Stress tests are different than integration tests in that they are designed to run on a cluster while integration tests only run on MiniFluo in a local environment. This module produces the jar needed to run a stress test on a cluster. Currently, this module only has one stress test (the Trie test) but other tests could be added to this module in the future.

The newest version!

/*
 * Copyright 2014 Fluo authors (see AUTHORS)
 *
 * 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 io.fluo.stress.trie;

import static com.google.common.base.Preconditions.checkArgument;

/** Utility class that represents trie node
 */
public class Node {
  
  private final Number number; 
  private final int level;
  private final int nodeSize;
  
  public Node(Number number, int level, int nodeSize) {
    this.number = number;
    this.level = level;
    this.nodeSize = nodeSize;
  }
  
  public Node(String rowId) {
    checkArgument(validRowId(rowId), "Invalid row id - "+ rowId);
    String[] rowArgs = rowId.toString().split(":");
    this.level = Integer.parseInt(rowArgs[0]);
    this.nodeSize = Integer.parseInt(rowArgs[1]);
    this.number = parseNumber(rowArgs[2]);
  }
  
  public Number getNumber() {
    return number;
  }
  
  public int getLevel() {
    return level;
  }
  
  public boolean isRoot() {
    return level == 0;
  }
  
  public int getNodeSize() {
    return nodeSize;
  }
  
  private Number parseNumber(String numStr) {
    if (numStr.equals("root")) {
      return null;
    } else if (numStr.length() == 16) {
      return Long.parseLong(numStr, 16);
    } else {
      return Integer.parseInt(numStr, 16);
    }
  }
  
  public String getRowId() {
    if (level == 0) {
      return String.format("00:%02d:root", nodeSize); 
    } else { 
      if (number instanceof Integer) {
        return String.format("%02d:%02d:%08x", level, nodeSize, number);
      } else {
        return String.format("%02d:%02d:%016x", level, nodeSize, number);
      }
    }
  }
  
  public Node getParent() {
    if (level == 1) {
      return new Node(null, 0, nodeSize);
    } else {   
      if (number instanceof Long) {
        int shift = (((64 / nodeSize) - level) * nodeSize) + nodeSize;
        Long parent = (number.longValue() >> shift) << shift;
        return new Node(parent, level-1, nodeSize);
      } else {
        int shift = (((32 / nodeSize) - level) * nodeSize) + nodeSize;
        Integer parent = (number.intValue() >> shift) << shift;
        return new Node(parent, level-1, nodeSize);
      }
    }  
  }
    
  private boolean validRowId(String rowId) {
    String[] rowArgs = rowId.toString().split(":");
    return ((rowArgs.length == 3) && (rowArgs[0] != null) 
        && (rowArgs[1] != null) && (rowArgs[2] != null));
  }
  
  public static String generateRootId(int nodeSize) {
    return (new Node(null, 0, nodeSize)).getRowId();
  }
}