VertexResult.java

/**
 * Autogenerated by Thrift Compiler (0.8.0)
 *
 * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING
 *  @generated
 */
package org.opentripplanner.api.thrift.definition;

import org.apache.thrift.scheme.IScheme;
import org.apache.thrift.scheme.SchemeFactory;
import org.apache.thrift.scheme.StandardScheme;

import org.apache.thrift.scheme.TupleScheme;
import org.apache.thrift.protocol.TTupleProtocol;
import java.util.List;
import java.util.ArrayList;
import java.util.Map;
import java.util.HashMap;
import java.util.EnumMap;
import java.util.Set;
import java.util.HashSet;
import java.util.EnumSet;
import java.util.Collections;
import java.util.BitSet;
import java.nio.ByteBuffer;
import java.util.Arrays;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

public class VertexResult implements org.apache.thrift.TBase<VertexResult, VertexResult._Fields>, java.io.Serializable, Cloneable {
  private static final org.apache.thrift.protocol.TStruct STRUCT_DESC = new org.apache.thrift.protocol.TStruct("VertexResult");

  private static final org.apache.thrift.protocol.TField NEAREST_VERTEX_FIELD_DESC = new org.apache.thrift.protocol.TField("nearest_vertex", org.apache.thrift.protocol.TType.STRUCT, (short)1);

  private static final Map<Class<? extends IScheme>, SchemeFactory> schemes = new HashMap<Class<? extends IScheme>, SchemeFactory>();
  static {
    schemes.put(StandardScheme.class, new VertexResultStandardSchemeFactory());
    schemes.put(TupleScheme.class, new VertexResultTupleSchemeFactory());
  }

  private org.opentripplanner.api.thrift.definition.GraphVertex nearest_vertex; // optional

  /** The set of fields this struct contains, along with convenience methods for finding and manipulating them. */
  public enum _Fields implements org.apache.thrift.TFieldIdEnum {
    NEAREST_VERTEX((short)1, "nearest_vertex");

    private static final Map<String, _Fields> byName = new HashMap<String, _Fields>();

    static {
      for (_Fields field : EnumSet.allOf(_Fields.class)) {
        byName.put(field.getFieldName(), field);
      }
    }

    /**
     * Find the _Fields constant that matches fieldId, or null if its not found.
     */
    public static _Fields findByThriftId(int fieldId) {
      switch(fieldId) {
        case 1: // NEAREST_VERTEX
          return NEAREST_VERTEX;
        default:
          return null;
      }
    }

    /**
     * Find the _Fields constant that matches fieldId, throwing an exception
     * if it is not found.
     */
    public static _Fields findByThriftIdOrThrow(int fieldId) {
      _Fields fields = findByThriftId(fieldId);
      if (fields == null) throw new IllegalArgumentException("Field " + fieldId + " doesn't exist!");
      return fields;
    }

    /**
     * Find the _Fields constant that matches name, or null if its not found.
     */
    public static _Fields findByName(String name) {
      return byName.get(name);
    }

    private final short _thriftId;
    private final String _fieldName;

    _Fields(short thriftId, String fieldName) {
      _thriftId = thriftId;
      _fieldName = fieldName;
    }

    public short getThriftFieldId() {
      return _thriftId;
    }

    public String getFieldName() {
      return _fieldName;
    }
  }

  // isset id assignments
  private _Fields optionals[] = {_Fields.NEAREST_VERTEX};
  public static final Map<_Fields, org.apache.thrift.meta_data.FieldMetaData> metaDataMap;
  static {
    Map<_Fields, org.apache.thrift.meta_data.FieldMetaData> tmpMap = new EnumMap<_Fields, org.apache.thrift.meta_data.FieldMetaData>(_Fields.class);
    tmpMap.put(_Fields.NEAREST_VERTEX, new org.apache.thrift.meta_data.FieldMetaData("nearest_vertex", org.apache.thrift.TFieldRequirementType.OPTIONAL, 
        new org.apache.thrift.meta_data.FieldValueMetaData(org.apache.thrift.protocol.TType.STRUCT        , "GraphVertex")));
    metaDataMap = Collections.unmodifiableMap(tmpMap);
    org.apache.thrift.meta_data.FieldMetaData.addStructMetaDataMap(VertexResult.class, metaDataMap);
  }

  public VertexResult() {
  }

  /**
   * Performs a deep copy on <i>other</i>.
   */
  public VertexResult(VertexResult other) {
    if (other.isSetNearest_vertex()) {
      this.nearest_vertex = other.nearest_vertex;
    }
  }

  public VertexResult deepCopy() {
    return new VertexResult(this);
  }

  @Override
  public void clear() {
    this.nearest_vertex = null;
  }

  public org.opentripplanner.api.thrift.definition.GraphVertex getNearest_vertex() {
    return this.nearest_vertex;
  }

  public void setNearest_vertex(org.opentripplanner.api.thrift.definition.GraphVertex nearest_vertex) {
    this.nearest_vertex = nearest_vertex;
  }

  public void unsetNearest_vertex() {
    this.nearest_vertex = null;
  }

  /** Returns true if field nearest_vertex is set (has been assigned a value) and false otherwise */
  public boolean isSetNearest_vertex() {
    return this.nearest_vertex != null;
  }

  public void setNearest_vertexIsSet(boolean value) {
    if (!value) {
      this.nearest_vertex = null;
    }
  }

  public void setFieldValue(_Fields field, Object value) {
    switch (field) {
    case NEAREST_VERTEX:
      if (value == null) {
        unsetNearest_vertex();
      } else {
        setNearest_vertex((org.opentripplanner.api.thrift.definition.GraphVertex)value);
      }
      break;

    }
  }

  public Object getFieldValue(_Fields field) {
    switch (field) {
    case NEAREST_VERTEX:
      return getNearest_vertex();

    }
    throw new IllegalStateException();
  }

  /** Returns true if field corresponding to fieldID is set (has been assigned a value) and false otherwise */
  public boolean isSet(_Fields field) {
    if (field == null) {
      throw new IllegalArgumentException();
    }

    switch (field) {
    case NEAREST_VERTEX:
      return isSetNearest_vertex();
    }
    throw new IllegalStateException();
  }

  @Override
  public boolean equals(Object that) {
    if (that == null)
      return false;
    if (that instanceof VertexResult)
      return this.equals((VertexResult)that);
    return false;
  }

  public boolean equals(VertexResult that) {
    if (that == null)
      return false;

    boolean this_present_nearest_vertex = true && this.isSetNearest_vertex();
    boolean that_present_nearest_vertex = true && that.isSetNearest_vertex();
    if (this_present_nearest_vertex || that_present_nearest_vertex) {
      if (!(this_present_nearest_vertex && that_present_nearest_vertex))
        return false;
      if (!this.nearest_vertex.equals(that.nearest_vertex))
        return false;
    }

    return true;
  }

  @Override
  public int hashCode() {
    return 0;
  }

  public int compareTo(VertexResult other) {
    if (!getClass().equals(other.getClass())) {
      return getClass().getName().compareTo(other.getClass().getName());
    }

    int lastComparison = 0;
    VertexResult typedOther = (VertexResult)other;

    lastComparison = Boolean.valueOf(isSetNearest_vertex()).compareTo(typedOther.isSetNearest_vertex());
    if (lastComparison != 0) {
      return lastComparison;
    }
    if (isSetNearest_vertex()) {
      lastComparison = org.apache.thrift.TBaseHelper.compareTo(this.nearest_vertex, typedOther.nearest_vertex);
      if (lastComparison != 0) {
        return lastComparison;
      }
    }
    return 0;
  }

  public _Fields fieldForId(int fieldId) {
    return _Fields.findByThriftId(fieldId);
  }

  public void read(org.apache.thrift.protocol.TProtocol iprot) throws org.apache.thrift.TException {
    schemes.get(iprot.getScheme()).getScheme().read(iprot, this);
  }

  public void write(org.apache.thrift.protocol.TProtocol oprot) throws org.apache.thrift.TException {
    schemes.get(oprot.getScheme()).getScheme().write(oprot, this);
  }

  @Override
  public String toString() {
    StringBuilder sb = new StringBuilder("VertexResult(");
    boolean first = true;

    if (isSetNearest_vertex()) {
      sb.append("nearest_vertex:");
      if (this.nearest_vertex == null) {
        sb.append("null");
      } else {
        sb.append(this.nearest_vertex);
      }
      first = false;
    }
    sb.append(")");
    return sb.toString();
  }

  public void validate() throws org.apache.thrift.TException {
    // check for required fields
  }

  private void writeObject(java.io.ObjectOutputStream out) throws java.io.IOException {
    try {
      write(new org.apache.thrift.protocol.TCompactProtocol(new org.apache.thrift.transport.TIOStreamTransport(out)));
    } catch (org.apache.thrift.TException te) {
      throw new java.io.IOException(te);
    }
  }

  private void readObject(java.io.ObjectInputStream in) throws java.io.IOException, ClassNotFoundException {
    try {
      read(new org.apache.thrift.protocol.TCompactProtocol(new org.apache.thrift.transport.TIOStreamTransport(in)));
    } catch (org.apache.thrift.TException te) {
      throw new java.io.IOException(te);
    }
  }

  private static class VertexResultStandardSchemeFactory implements SchemeFactory {
    public VertexResultStandardScheme getScheme() {
      return new VertexResultStandardScheme();
    }
  }

  private static class VertexResultStandardScheme extends StandardScheme<VertexResult> {

    public void read(org.apache.thrift.protocol.TProtocol iprot, VertexResult struct) throws org.apache.thrift.TException {
      org.apache.thrift.protocol.TField schemeField;
      iprot.readStructBegin();
      while (true)
      {
        schemeField = iprot.readFieldBegin();
        if (schemeField.type == org.apache.thrift.protocol.TType.STOP) { 
          break;
        }
        switch (schemeField.id) {
          case 1: // NEAREST_VERTEX
            if (schemeField.type == org.apache.thrift.protocol.TType.STRUCT) {
              struct.nearest_vertex = new org.opentripplanner.api.thrift.definition.GraphVertex();
              struct.nearest_vertex.read(iprot);
              struct.setNearest_vertexIsSet(true);
            } else { 
              org.apache.thrift.protocol.TProtocolUtil.skip(iprot, schemeField.type);
            }
            break;
          default:
            org.apache.thrift.protocol.TProtocolUtil.skip(iprot, schemeField.type);
        }
        iprot.readFieldEnd();
      }
      iprot.readStructEnd();
      struct.validate();
    }

    public void write(org.apache.thrift.protocol.TProtocol oprot, VertexResult struct) throws org.apache.thrift.TException {
      struct.validate();

      oprot.writeStructBegin(STRUCT_DESC);
      if (struct.nearest_vertex != null) {
        if (struct.isSetNearest_vertex()) {
          oprot.writeFieldBegin(NEAREST_VERTEX_FIELD_DESC);
          struct.nearest_vertex.write(oprot);
          oprot.writeFieldEnd();
        }
      }
      oprot.writeFieldStop();
      oprot.writeStructEnd();
    }

  }

  private static class VertexResultTupleSchemeFactory implements SchemeFactory {
    public VertexResultTupleScheme getScheme() {
      return new VertexResultTupleScheme();
    }
  }

  private static class VertexResultTupleScheme extends TupleScheme<VertexResult> {

    @Override
    public void write(org.apache.thrift.protocol.TProtocol prot, VertexResult struct) throws org.apache.thrift.TException {
      TTupleProtocol oprot = (TTupleProtocol) prot;
      BitSet optionals = new BitSet();
      if (struct.isSetNearest_vertex()) {
        optionals.set(0);
      }
      oprot.writeBitSet(optionals, 1);
      if (struct.isSetNearest_vertex()) {
        struct.nearest_vertex.write(oprot);
      }
    }

    @Override
    public void read(org.apache.thrift.protocol.TProtocol prot, VertexResult struct) throws org.apache.thrift.TException {
      TTupleProtocol iprot = (TTupleProtocol) prot;
      BitSet incoming = iprot.readBitSet(1);
      if (incoming.get(0)) {
        struct.nearest_vertex = new org.opentripplanner.api.thrift.definition.GraphVertex();
        struct.nearest_vertex.read(iprot);
        struct.setNearest_vertexIsSet(true);
      }
    }
  }

}