BulkFindNearestVertexRequest.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 BulkFindNearestVertexRequest implements org.apache.thrift.TBase<BulkFindNearestVertexRequest, BulkFindNearestVertexRequest._Fields>, java.io.Serializable, Cloneable {
  private static final org.apache.thrift.protocol.TStruct STRUCT_DESC = new org.apache.thrift.protocol.TStruct("BulkFindNearestVertexRequest");

  private static final org.apache.thrift.protocol.TField QUERIES_FIELD_DESC = new org.apache.thrift.protocol.TField("queries", org.apache.thrift.protocol.TType.LIST, (short)1);

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

  private List<org.opentripplanner.api.thrift.definition.VertexQuery> queries; // required

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

    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: // QUERIES
          return QUERIES;
        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
  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.QUERIES, new org.apache.thrift.meta_data.FieldMetaData("queries", org.apache.thrift.TFieldRequirementType.REQUIRED, 
        new org.apache.thrift.meta_data.ListMetaData(org.apache.thrift.protocol.TType.LIST, 
            new org.apache.thrift.meta_data.FieldValueMetaData(org.apache.thrift.protocol.TType.STRUCT            , "VertexQuery"))));
    metaDataMap = Collections.unmodifiableMap(tmpMap);
    org.apache.thrift.meta_data.FieldMetaData.addStructMetaDataMap(BulkFindNearestVertexRequest.class, metaDataMap);
  }

  public BulkFindNearestVertexRequest() {
  }

  public BulkFindNearestVertexRequest(
    List<org.opentripplanner.api.thrift.definition.VertexQuery> queries)
  {
    this();
    this.queries = queries;
  }

  /**
   * Performs a deep copy on <i>other</i>.
   */
  public BulkFindNearestVertexRequest(BulkFindNearestVertexRequest other) {
    if (other.isSetQueries()) {
      List<org.opentripplanner.api.thrift.definition.VertexQuery> __this__queries = new ArrayList<org.opentripplanner.api.thrift.definition.VertexQuery>();
      for (org.opentripplanner.api.thrift.definition.VertexQuery other_element : other.queries) {
        __this__queries.add(other_element);
      }
      this.queries = __this__queries;
    }
  }

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

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

  public int getQueriesSize() {
    return (this.queries == null) ? 0 : this.queries.size();
  }

  public java.util.Iterator<org.opentripplanner.api.thrift.definition.VertexQuery> getQueriesIterator() {
    return (this.queries == null) ? null : this.queries.iterator();
  }

  public void addToQueries(org.opentripplanner.api.thrift.definition.VertexQuery elem) {
    if (this.queries == null) {
      this.queries = new ArrayList<org.opentripplanner.api.thrift.definition.VertexQuery>();
    }
    this.queries.add(elem);
  }

  public List<org.opentripplanner.api.thrift.definition.VertexQuery> getQueries() {
    return this.queries;
  }

  public void setQueries(List<org.opentripplanner.api.thrift.definition.VertexQuery> queries) {
    this.queries = queries;
  }

  public void unsetQueries() {
    this.queries = null;
  }

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

  public void setQueriesIsSet(boolean value) {
    if (!value) {
      this.queries = null;
    }
  }

  public void setFieldValue(_Fields field, Object value) {
    switch (field) {
    case QUERIES:
      if (value == null) {
        unsetQueries();
      } else {
        setQueries((List<org.opentripplanner.api.thrift.definition.VertexQuery>)value);
      }
      break;

    }
  }

  public Object getFieldValue(_Fields field) {
    switch (field) {
    case QUERIES:
      return getQueries();

    }
    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 QUERIES:
      return isSetQueries();
    }
    throw new IllegalStateException();
  }

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

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

    boolean this_present_queries = true && this.isSetQueries();
    boolean that_present_queries = true && that.isSetQueries();
    if (this_present_queries || that_present_queries) {
      if (!(this_present_queries && that_present_queries))
        return false;
      if (!this.queries.equals(that.queries))
        return false;
    }

    return true;
  }

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

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

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

    lastComparison = Boolean.valueOf(isSetQueries()).compareTo(typedOther.isSetQueries());
    if (lastComparison != 0) {
      return lastComparison;
    }
    if (isSetQueries()) {
      lastComparison = org.apache.thrift.TBaseHelper.compareTo(this.queries, typedOther.queries);
      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("BulkFindNearestVertexRequest(");
    boolean first = true;

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

  public void validate() throws org.apache.thrift.TException {
    // check for required fields
    if (!isSetQueries()) {
      throw new org.apache.thrift.protocol.TProtocolException("Required field 'queries' is unset! Struct:" + toString());
    }

  }

  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 BulkFindNearestVertexRequestStandardSchemeFactory implements SchemeFactory {
    public BulkFindNearestVertexRequestStandardScheme getScheme() {
      return new BulkFindNearestVertexRequestStandardScheme();
    }
  }

  private static class BulkFindNearestVertexRequestStandardScheme extends StandardScheme<BulkFindNearestVertexRequest> {

    public void read(org.apache.thrift.protocol.TProtocol iprot, BulkFindNearestVertexRequest 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: // QUERIES
            if (schemeField.type == org.apache.thrift.protocol.TType.LIST) {
              {
                org.apache.thrift.protocol.TList _list16 = iprot.readListBegin();
                struct.queries = new ArrayList<org.opentripplanner.api.thrift.definition.VertexQuery>(_list16.size);
                for (int _i17 = 0; _i17 < _list16.size; ++_i17)
                {
                  org.opentripplanner.api.thrift.definition.VertexQuery _elem18; // required
                  _elem18 = new org.opentripplanner.api.thrift.definition.VertexQuery();
                  _elem18.read(iprot);
                  struct.queries.add(_elem18);
                }
                iprot.readListEnd();
              }
              struct.setQueriesIsSet(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, BulkFindNearestVertexRequest struct) throws org.apache.thrift.TException {
      struct.validate();

      oprot.writeStructBegin(STRUCT_DESC);
      if (struct.queries != null) {
        oprot.writeFieldBegin(QUERIES_FIELD_DESC);
        {
          oprot.writeListBegin(new org.apache.thrift.protocol.TList(org.apache.thrift.protocol.TType.STRUCT, struct.queries.size()));
          for (org.opentripplanner.api.thrift.definition.VertexQuery _iter19 : struct.queries)
          {
            _iter19.write(oprot);
          }
          oprot.writeListEnd();
        }
        oprot.writeFieldEnd();
      }
      oprot.writeFieldStop();
      oprot.writeStructEnd();
    }

  }

  private static class BulkFindNearestVertexRequestTupleSchemeFactory implements SchemeFactory {
    public BulkFindNearestVertexRequestTupleScheme getScheme() {
      return new BulkFindNearestVertexRequestTupleScheme();
    }
  }

  private static class BulkFindNearestVertexRequestTupleScheme extends TupleScheme<BulkFindNearestVertexRequest> {

    @Override
    public void write(org.apache.thrift.protocol.TProtocol prot, BulkFindNearestVertexRequest struct) throws org.apache.thrift.TException {
      TTupleProtocol oprot = (TTupleProtocol) prot;
      {
        oprot.writeI32(struct.queries.size());
        for (org.opentripplanner.api.thrift.definition.VertexQuery _iter20 : struct.queries)
        {
          _iter20.write(oprot);
        }
      }
    }

    @Override
    public void read(org.apache.thrift.protocol.TProtocol prot, BulkFindNearestVertexRequest struct) throws org.apache.thrift.TException {
      TTupleProtocol iprot = (TTupleProtocol) prot;
      {
        org.apache.thrift.protocol.TList _list21 = new org.apache.thrift.protocol.TList(org.apache.thrift.protocol.TType.STRUCT, iprot.readI32());
        struct.queries = new ArrayList<org.opentripplanner.api.thrift.definition.VertexQuery>(_list21.size);
        for (int _i22 = 0; _i22 < _list21.size; ++_i22)
        {
          org.opentripplanner.api.thrift.definition.VertexQuery _elem23; // required
          _elem23 = new org.opentripplanner.api.thrift.definition.VertexQuery();
          _elem23.read(iprot);
          struct.queries.add(_elem23);
        }
      }
      struct.setQueriesIsSet(true);
    }
  }

}