public boolean equals(Graph that) { if (that == null) return false; boolean this_present_nodeType = true && this.isSetNodeType(); boolean that_present_nodeType = true && that.isSetNodeType(); if (this_present_nodeType || that_present_nodeType) { if (!(this_present_nodeType && that_present_nodeType)) return false; if (!this.nodeType.equals(that.nodeType)) return false; } boolean this_present_roots = true && this.isSetRoots(); boolean that_present_roots = true && that.isSetRoots(); if (this_present_roots || that_present_roots) { if (!(this_present_roots && that_present_roots)) return false; if (!this.roots.equals(that.roots)) return false; } boolean this_present_adjacencyList = true && this.isSetAdjacencyList(); boolean that_present_adjacencyList = true && that.isSetAdjacencyList(); if (this_present_adjacencyList || that_present_adjacencyList) { if (!(this_present_adjacencyList && that_present_adjacencyList)) return false; if (!this.adjacencyList.equals(that.adjacencyList)) return false; } return true; }
case 1: // NODE_TYPE if (schemeField.type == org.apache.thrift.protocol.TType.I32) { struct.nodeType = org.apache.hadoop.hive.ql.plan.api.NodeType.findByValue(iprot.readI32()); struct.setNodeTypeIsSet(true); } else {
@Override public int hashCode() { List<Object> list = new ArrayList<Object>(); boolean present_nodeType = true && (isSetNodeType()); list.add(present_nodeType); if (present_nodeType) list.add(nodeType.getValue()); boolean present_roots = true && (isSetRoots()); list.add(present_roots); if (present_roots) list.add(roots); boolean present_adjacencyList = true && (isSetAdjacencyList()); list.add(present_adjacencyList); if (present_adjacencyList) list.add(adjacencyList); return list.hashCode(); }
@Override public int hashCode() { List<Object> list = new ArrayList<Object>(); boolean present_nodeType = true && (isSetNodeType()); list.add(present_nodeType); if (present_nodeType) list.add(nodeType.getValue()); boolean present_roots = true && (isSetRoots()); list.add(present_roots); if (present_roots) list.add(roots); boolean present_adjacencyList = true && (isSetAdjacencyList()); list.add(present_adjacencyList); if (present_adjacencyList) list.add(adjacencyList); return list.hashCode(); }
case 1: // NODE_TYPE if (schemeField.type == org.apache.thrift.protocol.TType.I32) { struct.nodeType = org.apache.hadoop.hive.ql.plan.api.NodeType.findByValue(iprot.readI32()); struct.setNodeTypeIsSet(true); } else {
public boolean equals(Graph that) { if (that == null) return false; boolean this_present_nodeType = true && this.isSetNodeType(); boolean that_present_nodeType = true && that.isSetNodeType(); if (this_present_nodeType || that_present_nodeType) { if (!(this_present_nodeType && that_present_nodeType)) return false; if (!this.nodeType.equals(that.nodeType)) return false; } boolean this_present_roots = true && this.isSetRoots(); boolean that_present_roots = true && that.isSetRoots(); if (this_present_roots || that_present_roots) { if (!(this_present_roots && that_present_roots)) return false; if (!this.roots.equals(that.roots)) return false; } boolean this_present_adjacencyList = true && this.isSetAdjacencyList(); boolean that_present_adjacencyList = true && that.isSetAdjacencyList(); if (this_present_adjacencyList || that_present_adjacencyList) { if (!(this_present_adjacencyList && that_present_adjacencyList)) return false; if (!this.adjacencyList.equals(that.adjacencyList)) return false; } return true; }
if (struct.nodeType != null) { oprot.writeFieldBegin(NODE_TYPE_FIELD_DESC); oprot.writeI32(struct.nodeType.getValue()); oprot.writeFieldEnd();
BitSet incoming = iprot.readBitSet(3); if (incoming.get(0)) { struct.nodeType = org.apache.hadoop.hive.ql.plan.api.NodeType.findByValue(iprot.readI32()); struct.setNodeTypeIsSet(true);
public boolean equals(Graph that) { if (that == null) return false; boolean this_present_nodeType = true && this.isSetNodeType(); boolean that_present_nodeType = true && that.isSetNodeType(); if (this_present_nodeType || that_present_nodeType) { if (!(this_present_nodeType && that_present_nodeType)) return false; if (!this.nodeType.equals(that.nodeType)) return false; } boolean this_present_roots = true && this.isSetRoots(); boolean that_present_roots = true && that.isSetRoots(); if (this_present_roots || that_present_roots) { if (!(this_present_roots && that_present_roots)) return false; if (!this.roots.equals(that.roots)) return false; } boolean this_present_adjacencyList = true && this.isSetAdjacencyList(); boolean that_present_adjacencyList = true && that.isSetAdjacencyList(); if (this_present_adjacencyList || that_present_adjacencyList) { if (!(this_present_adjacencyList && that_present_adjacencyList)) return false; if (!this.adjacencyList.equals(that.adjacencyList)) return false; } return true; }
if (struct.nodeType != null) { oprot.writeFieldBegin(NODE_TYPE_FIELD_DESC); oprot.writeI32(struct.nodeType.getValue()); oprot.writeFieldEnd();
BitSet incoming = iprot.readBitSet(3); if (incoming.get(0)) { struct.nodeType = org.apache.hadoop.hive.ql.plan.api.NodeType.findByValue(iprot.readI32()); struct.setNodeTypeIsSet(true);
public boolean equals(Graph that) { if (that == null) return false; boolean this_present_nodeType = true && this.isSetNodeType(); boolean that_present_nodeType = true && that.isSetNodeType(); if (this_present_nodeType || that_present_nodeType) { if (!(this_present_nodeType && that_present_nodeType)) return false; if (!this.nodeType.equals(that.nodeType)) return false; } boolean this_present_roots = true && this.isSetRoots(); boolean that_present_roots = true && that.isSetRoots(); if (this_present_roots || that_present_roots) { if (!(this_present_roots && that_present_roots)) return false; if (!this.roots.equals(that.roots)) return false; } boolean this_present_adjacencyList = true && this.isSetAdjacencyList(); boolean that_present_adjacencyList = true && that.isSetAdjacencyList(); if (this_present_adjacencyList || that_present_adjacencyList) { if (!(this_present_adjacencyList && that_present_adjacencyList)) return false; if (!this.adjacencyList.equals(that.adjacencyList)) return false; } return true; }
oprot.writeI32(struct.nodeType.getValue());
case 1: // NODE_TYPE if (field.type == TType.I32) { this.nodeType = NodeType.findByValue(iprot.readI32()); } else { TProtocolUtil.skip(iprot, field.type);
oprot.writeI32(struct.nodeType.getValue());
case 1: // NODE_TYPE if (schemeField.type == org.apache.thrift.protocol.TType.I32) { struct.nodeType = NodeType.findByValue(iprot.readI32()); struct.setNodeTypeIsSet(true); } else {
if (struct.nodeType != null) { oprot.writeFieldBegin(NODE_TYPE_FIELD_DESC); oprot.writeI32(struct.nodeType.getValue()); oprot.writeFieldEnd();
BitSet incoming = iprot.readBitSet(3); if (incoming.get(0)) { struct.nodeType = NodeType.findByValue(iprot.readI32()); struct.setNodeTypeIsSet(true);
if (this.nodeType != null) { oprot.writeFieldBegin(NODE_TYPE_FIELD_DESC); oprot.writeI32(this.nodeType.getValue()); oprot.writeFieldEnd();
oprot.writeI32(struct.nodeType.getValue());