@Override public int hashCode() { List<Object> list = new ArrayList<Object>(); boolean present_node = true && (isSetNode()); list.add(present_node); if (present_node) list.add(node); boolean present_children = true && (isSetChildren()); list.add(present_children); if (present_children) list.add(children); boolean present_adjacencyType = true && (isSetAdjacencyType()); list.add(present_adjacencyType); if (present_adjacencyType) list.add(adjacencyType.getValue()); return list.hashCode(); }
/** 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 NODE: return isSetNode(); case CHILDREN: return isSetChildren(); case ADJACENCY_TYPE: return isSetAdjacencyType(); } throw new IllegalStateException(); }
/** * Performs a deep copy on <i>other</i>. */ public Adjacency(Adjacency other) { if (other.isSetNode()) { this.node = other.node; } if (other.isSetChildren()) { List<String> __this__children = new ArrayList<String>(other.children); this.children = __this__children; } if (other.isSetAdjacencyType()) { this.adjacencyType = other.adjacencyType; } }
@Override public int hashCode() { List<Object> list = new ArrayList<Object>(); boolean present_node = true && (isSetNode()); list.add(present_node); if (present_node) list.add(node); boolean present_children = true && (isSetChildren()); list.add(present_children); if (present_children) list.add(children); boolean present_adjacencyType = true && (isSetAdjacencyType()); list.add(present_adjacencyType); if (present_adjacencyType) list.add(adjacencyType.getValue()); return list.hashCode(); }
/** 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 NODE: return isSetNode(); case CHILDREN: return isSetChildren(); case ADJACENCY_TYPE: return isSetAdjacencyType(); } throw new IllegalStateException(); }
/** * Performs a deep copy on <i>other</i>. */ public Adjacency(Adjacency other) { if (other.isSetNode()) { this.node = other.node; } if (other.isSetChildren()) { List<String> __this__children = new ArrayList<String>(other.children); this.children = __this__children; } if (other.isSetAdjacencyType()) { this.adjacencyType = other.adjacencyType; } }
lastComparison = Boolean.valueOf(isSetAdjacencyType()).compareTo(other.isSetAdjacencyType()); if (lastComparison != 0) { return lastComparison; if (isSetAdjacencyType()) { lastComparison = org.apache.thrift.TBaseHelper.compareTo(this.adjacencyType, other.adjacencyType); if (lastComparison != 0) {
lastComparison = Boolean.valueOf(isSetAdjacencyType()).compareTo(other.isSetAdjacencyType()); if (lastComparison != 0) { return lastComparison; if (isSetAdjacencyType()) { lastComparison = org.apache.thrift.TBaseHelper.compareTo(this.adjacencyType, other.adjacencyType); if (lastComparison != 0) {
public boolean equals(Adjacency that) { if (that == null) return false; boolean this_present_node = true && this.isSetNode(); boolean that_present_node = true && that.isSetNode(); if (this_present_node || that_present_node) { if (!(this_present_node && that_present_node)) return false; if (!this.node.equals(that.node)) return false; } boolean this_present_children = true && this.isSetChildren(); boolean that_present_children = true && that.isSetChildren(); if (this_present_children || that_present_children) { if (!(this_present_children && that_present_children)) return false; if (!this.children.equals(that.children)) return false; } boolean this_present_adjacencyType = true && this.isSetAdjacencyType(); boolean that_present_adjacencyType = true && that.isSetAdjacencyType(); if (this_present_adjacencyType || that_present_adjacencyType) { if (!(this_present_adjacencyType && that_present_adjacencyType)) return false; if (!this.adjacencyType.equals(that.adjacencyType)) return false; } return true; }
public boolean equals(Adjacency that) { if (that == null) return false; boolean this_present_node = true && this.isSetNode(); boolean that_present_node = true && that.isSetNode(); if (this_present_node || that_present_node) { if (!(this_present_node && that_present_node)) return false; if (!this.node.equals(that.node)) return false; } boolean this_present_children = true && this.isSetChildren(); boolean that_present_children = true && that.isSetChildren(); if (this_present_children || that_present_children) { if (!(this_present_children && that_present_children)) return false; if (!this.children.equals(that.children)) return false; } boolean this_present_adjacencyType = true && this.isSetAdjacencyType(); boolean that_present_adjacencyType = true && that.isSetAdjacencyType(); if (this_present_adjacencyType || that_present_adjacencyType) { if (!(this_present_adjacencyType && that_present_adjacencyType)) return false; if (!this.adjacencyType.equals(that.adjacencyType)) return false; } return true; }
@Override public void write(org.apache.thrift.protocol.TProtocol prot, Adjacency struct) throws org.apache.thrift.TException { TTupleProtocol oprot = (TTupleProtocol) prot; BitSet optionals = new BitSet(); if (struct.isSetNode()) { optionals.set(0); } if (struct.isSetChildren()) { optionals.set(1); } if (struct.isSetAdjacencyType()) { optionals.set(2); } oprot.writeBitSet(optionals, 3); if (struct.isSetNode()) { oprot.writeString(struct.node); } if (struct.isSetChildren()) { { oprot.writeI32(struct.children.size()); for (String _iter4 : struct.children) { oprot.writeString(_iter4); } } } if (struct.isSetAdjacencyType()) { oprot.writeI32(struct.adjacencyType.getValue()); } }
@Override public void write(org.apache.thrift.protocol.TProtocol prot, Adjacency struct) throws org.apache.thrift.TException { TTupleProtocol oprot = (TTupleProtocol) prot; BitSet optionals = new BitSet(); if (struct.isSetNode()) { optionals.set(0); } if (struct.isSetChildren()) { optionals.set(1); } if (struct.isSetAdjacencyType()) { optionals.set(2); } oprot.writeBitSet(optionals, 3); if (struct.isSetNode()) { oprot.writeString(struct.node); } if (struct.isSetChildren()) { { oprot.writeI32(struct.children.size()); for (String _iter4 : struct.children) { oprot.writeString(_iter4); } } } if (struct.isSetAdjacencyType()) { oprot.writeI32(struct.adjacencyType.getValue()); } }
/** 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 NODE: return isSetNode(); case CHILDREN: return isSetChildren(); case ADJACENCY_TYPE: return isSetAdjacencyType(); } throw new IllegalStateException(); }
/** Returns true if field corresponding to fieldID is set (has been asigned a value) and false otherwise */ public boolean isSet(_Fields field) { if (field == null) { throw new IllegalArgumentException(); } switch (field) { case NODE: return isSetNode(); case CHILDREN: return isSetChildren(); case ADJACENCY_TYPE: return isSetAdjacencyType(); } throw new IllegalStateException(); }
/** * Performs a deep copy on <i>other</i>. */ public Adjacency(Adjacency other) { if (other.isSetNode()) { this.node = other.node; } if (other.isSetChildren()) { List<String> __this__children = new ArrayList<String>(); for (String other_element : other.children) { __this__children.add(other_element); } this.children = __this__children; } if (other.isSetAdjacencyType()) { this.adjacencyType = other.adjacencyType; } }
/** * Performs a deep copy on <i>other</i>. */ public Adjacency(Adjacency other) { if (other.isSetNode()) { this.node = other.node; } if (other.isSetChildren()) { List<String> __this__children = new ArrayList<String>(); for (String other_element : other.children) { __this__children.add(other_element); } this.children = __this__children; } if (other.isSetAdjacencyType()) { this.adjacencyType = other.adjacencyType; } }
public boolean equals(Adjacency that) { if (that == null) return false; boolean this_present_node = true && this.isSetNode(); boolean that_present_node = true && that.isSetNode(); if (this_present_node || that_present_node) { if (!(this_present_node && that_present_node)) return false; if (!this.node.equals(that.node)) return false; } boolean this_present_children = true && this.isSetChildren(); boolean that_present_children = true && that.isSetChildren(); if (this_present_children || that_present_children) { if (!(this_present_children && that_present_children)) return false; if (!this.children.equals(that.children)) return false; } boolean this_present_adjacencyType = true && this.isSetAdjacencyType(); boolean that_present_adjacencyType = true && that.isSetAdjacencyType(); if (this_present_adjacencyType || that_present_adjacencyType) { if (!(this_present_adjacencyType && that_present_adjacencyType)) return false; if (!this.adjacencyType.equals(that.adjacencyType)) return false; } return true; }
public boolean equals(Adjacency that) { if (that == null) return false; boolean this_present_node = true && this.isSetNode(); boolean that_present_node = true && that.isSetNode(); if (this_present_node || that_present_node) { if (!(this_present_node && that_present_node)) return false; if (!this.node.equals(that.node)) return false; } boolean this_present_children = true && this.isSetChildren(); boolean that_present_children = true && that.isSetChildren(); if (this_present_children || that_present_children) { if (!(this_present_children && that_present_children)) return false; if (!this.children.equals(that.children)) return false; } boolean this_present_adjacencyType = true && this.isSetAdjacencyType(); boolean that_present_adjacencyType = true && that.isSetAdjacencyType(); if (this_present_adjacencyType || that_present_adjacencyType) { if (!(this_present_adjacencyType && that_present_adjacencyType)) return false; if (!this.adjacencyType.equals(that.adjacencyType)) return false; } return true; }
@Override public void write(org.apache.thrift.protocol.TProtocol prot, Adjacency struct) throws org.apache.thrift.TException { TTupleProtocol oprot = (TTupleProtocol) prot; BitSet optionals = new BitSet(); if (struct.isSetNode()) { optionals.set(0); } if (struct.isSetChildren()) { optionals.set(1); } if (struct.isSetAdjacencyType()) { optionals.set(2); } oprot.writeBitSet(optionals, 3); if (struct.isSetNode()) { oprot.writeString(struct.node); } if (struct.isSetChildren()) { { oprot.writeI32(struct.children.size()); for (String _iter4 : struct.children) { oprot.writeString(_iter4); } } } if (struct.isSetAdjacencyType()) { oprot.writeI32(struct.adjacencyType.getValue()); } }
@Override public int hashCode() { HashCodeBuilder builder = new HashCodeBuilder(); boolean present_node = true && (isSetNode()); builder.append(present_node); if (present_node) builder.append(node); boolean present_children = true && (isSetChildren()); builder.append(present_children); if (present_children) builder.append(children); boolean present_adjacencyType = true && (isSetAdjacencyType()); builder.append(present_adjacencyType); if (present_adjacencyType) builder.append(adjacencyType.getValue()); return builder.toHashCode(); }