com.google.ortools.sat.CircuitCoveringConstraintProto Maven / Gradle / Ivy
The newest version!
// Generated by the protocol buffer compiler. DO NOT EDIT!
// source: ortools/sat/cp_model.proto
package com.google.ortools.sat;
/**
*
* Another routing constraint. This one forces the nexts variables to form a
* permutation, and cycles of this permutation of length more than 1 (nonloops)
* to contain exactly one of the distinguished nodes.
*
*
* Protobuf type {@code operations_research.sat.CircuitCoveringConstraintProto}
*/
public final class CircuitCoveringConstraintProto extends
com.google.protobuf.GeneratedMessageV3 implements
// @@protoc_insertion_point(message_implements:operations_research.sat.CircuitCoveringConstraintProto)
CircuitCoveringConstraintProtoOrBuilder {
private static final long serialVersionUID = 0L;
// Use CircuitCoveringConstraintProto.newBuilder() to construct.
private CircuitCoveringConstraintProto(com.google.protobuf.GeneratedMessageV3.Builder builder) {
super(builder);
}
private CircuitCoveringConstraintProto() {
nexts_ = emptyIntList();
distinguishedNodes_ = emptyLongList();
}
@java.lang.Override
@SuppressWarnings({"unused"})
protected java.lang.Object newInstance(
UnusedPrivateParameter unused) {
return new CircuitCoveringConstraintProto();
}
@java.lang.Override
public final com.google.protobuf.UnknownFieldSet
getUnknownFields() {
return this.unknownFields;
}
private CircuitCoveringConstraintProto(
com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
this();
if (extensionRegistry == null) {
throw new java.lang.NullPointerException();
}
int mutable_bitField0_ = 0;
com.google.protobuf.UnknownFieldSet.Builder unknownFields =
com.google.protobuf.UnknownFieldSet.newBuilder();
try {
boolean done = false;
while (!done) {
int tag = input.readTag();
switch (tag) {
case 0:
done = true;
break;
case 8: {
if (!((mutable_bitField0_ & 0x00000001) != 0)) {
nexts_ = newIntList();
mutable_bitField0_ |= 0x00000001;
}
nexts_.addInt(input.readInt32());
break;
}
case 10: {
int length = input.readRawVarint32();
int limit = input.pushLimit(length);
if (!((mutable_bitField0_ & 0x00000001) != 0) && input.getBytesUntilLimit() > 0) {
nexts_ = newIntList();
mutable_bitField0_ |= 0x00000001;
}
while (input.getBytesUntilLimit() > 0) {
nexts_.addInt(input.readInt32());
}
input.popLimit(limit);
break;
}
case 16: {
if (!((mutable_bitField0_ & 0x00000002) != 0)) {
distinguishedNodes_ = newLongList();
mutable_bitField0_ |= 0x00000002;
}
distinguishedNodes_.addLong(input.readInt64());
break;
}
case 18: {
int length = input.readRawVarint32();
int limit = input.pushLimit(length);
if (!((mutable_bitField0_ & 0x00000002) != 0) && input.getBytesUntilLimit() > 0) {
distinguishedNodes_ = newLongList();
mutable_bitField0_ |= 0x00000002;
}
while (input.getBytesUntilLimit() > 0) {
distinguishedNodes_.addLong(input.readInt64());
}
input.popLimit(limit);
break;
}
default: {
if (!parseUnknownField(
input, unknownFields, extensionRegistry, tag)) {
done = true;
}
break;
}
}
}
} catch (com.google.protobuf.InvalidProtocolBufferException e) {
throw e.setUnfinishedMessage(this);
} catch (java.io.IOException e) {
throw new com.google.protobuf.InvalidProtocolBufferException(
e).setUnfinishedMessage(this);
} finally {
if (((mutable_bitField0_ & 0x00000001) != 0)) {
nexts_.makeImmutable(); // C
}
if (((mutable_bitField0_ & 0x00000002) != 0)) {
distinguishedNodes_.makeImmutable(); // C
}
this.unknownFields = unknownFields.build();
makeExtensionsImmutable();
}
}
public static final com.google.protobuf.Descriptors.Descriptor
getDescriptor() {
return com.google.ortools.sat.CpModelProtobuf.internal_static_operations_research_sat_CircuitCoveringConstraintProto_descriptor;
}
@java.lang.Override
protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
internalGetFieldAccessorTable() {
return com.google.ortools.sat.CpModelProtobuf.internal_static_operations_research_sat_CircuitCoveringConstraintProto_fieldAccessorTable
.ensureFieldAccessorsInitialized(
com.google.ortools.sat.CircuitCoveringConstraintProto.class, com.google.ortools.sat.CircuitCoveringConstraintProto.Builder.class);
}
public static final int NEXTS_FIELD_NUMBER = 1;
private com.google.protobuf.Internal.IntList nexts_;
/**
* repeated int32 nexts = 1;
* @return A list containing the nexts.
*/
@java.lang.Override
public java.util.List
getNextsList() {
return nexts_;
}
/**
* repeated int32 nexts = 1;
* @return The count of nexts.
*/
public int getNextsCount() {
return nexts_.size();
}
/**
* repeated int32 nexts = 1;
* @param index The index of the element to return.
* @return The nexts at the given index.
*/
public int getNexts(int index) {
return nexts_.getInt(index);
}
private int nextsMemoizedSerializedSize = -1;
public static final int DISTINGUISHED_NODES_FIELD_NUMBER = 2;
private com.google.protobuf.Internal.LongList distinguishedNodes_;
/**
* repeated int64 distinguished_nodes = 2;
* @return A list containing the distinguishedNodes.
*/
@java.lang.Override
public java.util.List
getDistinguishedNodesList() {
return distinguishedNodes_;
}
/**
* repeated int64 distinguished_nodes = 2;
* @return The count of distinguishedNodes.
*/
public int getDistinguishedNodesCount() {
return distinguishedNodes_.size();
}
/**
* repeated int64 distinguished_nodes = 2;
* @param index The index of the element to return.
* @return The distinguishedNodes at the given index.
*/
public long getDistinguishedNodes(int index) {
return distinguishedNodes_.getLong(index);
}
private int distinguishedNodesMemoizedSerializedSize = -1;
private byte memoizedIsInitialized = -1;
@java.lang.Override
public final boolean isInitialized() {
byte isInitialized = memoizedIsInitialized;
if (isInitialized == 1) return true;
if (isInitialized == 0) return false;
memoizedIsInitialized = 1;
return true;
}
@java.lang.Override
public void writeTo(com.google.protobuf.CodedOutputStream output)
throws java.io.IOException {
getSerializedSize();
if (getNextsList().size() > 0) {
output.writeUInt32NoTag(10);
output.writeUInt32NoTag(nextsMemoizedSerializedSize);
}
for (int i = 0; i < nexts_.size(); i++) {
output.writeInt32NoTag(nexts_.getInt(i));
}
if (getDistinguishedNodesList().size() > 0) {
output.writeUInt32NoTag(18);
output.writeUInt32NoTag(distinguishedNodesMemoizedSerializedSize);
}
for (int i = 0; i < distinguishedNodes_.size(); i++) {
output.writeInt64NoTag(distinguishedNodes_.getLong(i));
}
unknownFields.writeTo(output);
}
@java.lang.Override
public int getSerializedSize() {
int size = memoizedSize;
if (size != -1) return size;
size = 0;
{
int dataSize = 0;
for (int i = 0; i < nexts_.size(); i++) {
dataSize += com.google.protobuf.CodedOutputStream
.computeInt32SizeNoTag(nexts_.getInt(i));
}
size += dataSize;
if (!getNextsList().isEmpty()) {
size += 1;
size += com.google.protobuf.CodedOutputStream
.computeInt32SizeNoTag(dataSize);
}
nextsMemoizedSerializedSize = dataSize;
}
{
int dataSize = 0;
for (int i = 0; i < distinguishedNodes_.size(); i++) {
dataSize += com.google.protobuf.CodedOutputStream
.computeInt64SizeNoTag(distinguishedNodes_.getLong(i));
}
size += dataSize;
if (!getDistinguishedNodesList().isEmpty()) {
size += 1;
size += com.google.protobuf.CodedOutputStream
.computeInt32SizeNoTag(dataSize);
}
distinguishedNodesMemoizedSerializedSize = dataSize;
}
size += unknownFields.getSerializedSize();
memoizedSize = size;
return size;
}
@java.lang.Override
public boolean equals(final java.lang.Object obj) {
if (obj == this) {
return true;
}
if (!(obj instanceof com.google.ortools.sat.CircuitCoveringConstraintProto)) {
return super.equals(obj);
}
com.google.ortools.sat.CircuitCoveringConstraintProto other = (com.google.ortools.sat.CircuitCoveringConstraintProto) obj;
if (!getNextsList()
.equals(other.getNextsList())) return false;
if (!getDistinguishedNodesList()
.equals(other.getDistinguishedNodesList())) return false;
if (!unknownFields.equals(other.unknownFields)) return false;
return true;
}
@java.lang.Override
public int hashCode() {
if (memoizedHashCode != 0) {
return memoizedHashCode;
}
int hash = 41;
hash = (19 * hash) + getDescriptor().hashCode();
if (getNextsCount() > 0) {
hash = (37 * hash) + NEXTS_FIELD_NUMBER;
hash = (53 * hash) + getNextsList().hashCode();
}
if (getDistinguishedNodesCount() > 0) {
hash = (37 * hash) + DISTINGUISHED_NODES_FIELD_NUMBER;
hash = (53 * hash) + getDistinguishedNodesList().hashCode();
}
hash = (29 * hash) + unknownFields.hashCode();
memoizedHashCode = hash;
return hash;
}
public static com.google.ortools.sat.CircuitCoveringConstraintProto parseFrom(
java.nio.ByteBuffer data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.google.ortools.sat.CircuitCoveringConstraintProto parseFrom(
java.nio.ByteBuffer data,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static com.google.ortools.sat.CircuitCoveringConstraintProto parseFrom(
com.google.protobuf.ByteString data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.google.ortools.sat.CircuitCoveringConstraintProto parseFrom(
com.google.protobuf.ByteString data,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static com.google.ortools.sat.CircuitCoveringConstraintProto parseFrom(byte[] data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.google.ortools.sat.CircuitCoveringConstraintProto parseFrom(
byte[] data,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static com.google.ortools.sat.CircuitCoveringConstraintProto parseFrom(java.io.InputStream input)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseWithIOException(PARSER, input);
}
public static com.google.ortools.sat.CircuitCoveringConstraintProto parseFrom(
java.io.InputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseWithIOException(PARSER, input, extensionRegistry);
}
public static com.google.ortools.sat.CircuitCoveringConstraintProto parseDelimitedFrom(java.io.InputStream input)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseDelimitedWithIOException(PARSER, input);
}
public static com.google.ortools.sat.CircuitCoveringConstraintProto parseDelimitedFrom(
java.io.InputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseDelimitedWithIOException(PARSER, input, extensionRegistry);
}
public static com.google.ortools.sat.CircuitCoveringConstraintProto parseFrom(
com.google.protobuf.CodedInputStream input)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseWithIOException(PARSER, input);
}
public static com.google.ortools.sat.CircuitCoveringConstraintProto parseFrom(
com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseWithIOException(PARSER, input, extensionRegistry);
}
@java.lang.Override
public Builder newBuilderForType() { return newBuilder(); }
public static Builder newBuilder() {
return DEFAULT_INSTANCE.toBuilder();
}
public static Builder newBuilder(com.google.ortools.sat.CircuitCoveringConstraintProto prototype) {
return DEFAULT_INSTANCE.toBuilder().mergeFrom(prototype);
}
@java.lang.Override
public Builder toBuilder() {
return this == DEFAULT_INSTANCE
? new Builder() : new Builder().mergeFrom(this);
}
@java.lang.Override
protected Builder newBuilderForType(
com.google.protobuf.GeneratedMessageV3.BuilderParent parent) {
Builder builder = new Builder(parent);
return builder;
}
/**
*
* Another routing constraint. This one forces the nexts variables to form a
* permutation, and cycles of this permutation of length more than 1 (nonloops)
* to contain exactly one of the distinguished nodes.
*
*
* Protobuf type {@code operations_research.sat.CircuitCoveringConstraintProto}
*/
public static final class Builder extends
com.google.protobuf.GeneratedMessageV3.Builder implements
// @@protoc_insertion_point(builder_implements:operations_research.sat.CircuitCoveringConstraintProto)
com.google.ortools.sat.CircuitCoveringConstraintProtoOrBuilder {
public static final com.google.protobuf.Descriptors.Descriptor
getDescriptor() {
return com.google.ortools.sat.CpModelProtobuf.internal_static_operations_research_sat_CircuitCoveringConstraintProto_descriptor;
}
@java.lang.Override
protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
internalGetFieldAccessorTable() {
return com.google.ortools.sat.CpModelProtobuf.internal_static_operations_research_sat_CircuitCoveringConstraintProto_fieldAccessorTable
.ensureFieldAccessorsInitialized(
com.google.ortools.sat.CircuitCoveringConstraintProto.class, com.google.ortools.sat.CircuitCoveringConstraintProto.Builder.class);
}
// Construct using com.google.ortools.sat.CircuitCoveringConstraintProto.newBuilder()
private Builder() {
maybeForceBuilderInitialization();
}
private Builder(
com.google.protobuf.GeneratedMessageV3.BuilderParent parent) {
super(parent);
maybeForceBuilderInitialization();
}
private void maybeForceBuilderInitialization() {
if (com.google.protobuf.GeneratedMessageV3
.alwaysUseFieldBuilders) {
}
}
@java.lang.Override
public Builder clear() {
super.clear();
nexts_ = emptyIntList();
bitField0_ = (bitField0_ & ~0x00000001);
distinguishedNodes_ = emptyLongList();
bitField0_ = (bitField0_ & ~0x00000002);
return this;
}
@java.lang.Override
public com.google.protobuf.Descriptors.Descriptor
getDescriptorForType() {
return com.google.ortools.sat.CpModelProtobuf.internal_static_operations_research_sat_CircuitCoveringConstraintProto_descriptor;
}
@java.lang.Override
public com.google.ortools.sat.CircuitCoveringConstraintProto getDefaultInstanceForType() {
return com.google.ortools.sat.CircuitCoveringConstraintProto.getDefaultInstance();
}
@java.lang.Override
public com.google.ortools.sat.CircuitCoveringConstraintProto build() {
com.google.ortools.sat.CircuitCoveringConstraintProto result = buildPartial();
if (!result.isInitialized()) {
throw newUninitializedMessageException(result);
}
return result;
}
@java.lang.Override
public com.google.ortools.sat.CircuitCoveringConstraintProto buildPartial() {
com.google.ortools.sat.CircuitCoveringConstraintProto result = new com.google.ortools.sat.CircuitCoveringConstraintProto(this);
int from_bitField0_ = bitField0_;
if (((bitField0_ & 0x00000001) != 0)) {
nexts_.makeImmutable();
bitField0_ = (bitField0_ & ~0x00000001);
}
result.nexts_ = nexts_;
if (((bitField0_ & 0x00000002) != 0)) {
distinguishedNodes_.makeImmutable();
bitField0_ = (bitField0_ & ~0x00000002);
}
result.distinguishedNodes_ = distinguishedNodes_;
onBuilt();
return result;
}
@java.lang.Override
public Builder clone() {
return super.clone();
}
@java.lang.Override
public Builder setField(
com.google.protobuf.Descriptors.FieldDescriptor field,
java.lang.Object value) {
return super.setField(field, value);
}
@java.lang.Override
public Builder clearField(
com.google.protobuf.Descriptors.FieldDescriptor field) {
return super.clearField(field);
}
@java.lang.Override
public Builder clearOneof(
com.google.protobuf.Descriptors.OneofDescriptor oneof) {
return super.clearOneof(oneof);
}
@java.lang.Override
public Builder setRepeatedField(
com.google.protobuf.Descriptors.FieldDescriptor field,
int index, java.lang.Object value) {
return super.setRepeatedField(field, index, value);
}
@java.lang.Override
public Builder addRepeatedField(
com.google.protobuf.Descriptors.FieldDescriptor field,
java.lang.Object value) {
return super.addRepeatedField(field, value);
}
@java.lang.Override
public Builder mergeFrom(com.google.protobuf.Message other) {
if (other instanceof com.google.ortools.sat.CircuitCoveringConstraintProto) {
return mergeFrom((com.google.ortools.sat.CircuitCoveringConstraintProto)other);
} else {
super.mergeFrom(other);
return this;
}
}
public Builder mergeFrom(com.google.ortools.sat.CircuitCoveringConstraintProto other) {
if (other == com.google.ortools.sat.CircuitCoveringConstraintProto.getDefaultInstance()) return this;
if (!other.nexts_.isEmpty()) {
if (nexts_.isEmpty()) {
nexts_ = other.nexts_;
bitField0_ = (bitField0_ & ~0x00000001);
} else {
ensureNextsIsMutable();
nexts_.addAll(other.nexts_);
}
onChanged();
}
if (!other.distinguishedNodes_.isEmpty()) {
if (distinguishedNodes_.isEmpty()) {
distinguishedNodes_ = other.distinguishedNodes_;
bitField0_ = (bitField0_ & ~0x00000002);
} else {
ensureDistinguishedNodesIsMutable();
distinguishedNodes_.addAll(other.distinguishedNodes_);
}
onChanged();
}
this.mergeUnknownFields(other.unknownFields);
onChanged();
return this;
}
@java.lang.Override
public final boolean isInitialized() {
return true;
}
@java.lang.Override
public Builder mergeFrom(
com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws java.io.IOException {
com.google.ortools.sat.CircuitCoveringConstraintProto parsedMessage = null;
try {
parsedMessage = PARSER.parsePartialFrom(input, extensionRegistry);
} catch (com.google.protobuf.InvalidProtocolBufferException e) {
parsedMessage = (com.google.ortools.sat.CircuitCoveringConstraintProto) e.getUnfinishedMessage();
throw e.unwrapIOException();
} finally {
if (parsedMessage != null) {
mergeFrom(parsedMessage);
}
}
return this;
}
private int bitField0_;
private com.google.protobuf.Internal.IntList nexts_ = emptyIntList();
private void ensureNextsIsMutable() {
if (!((bitField0_ & 0x00000001) != 0)) {
nexts_ = mutableCopy(nexts_);
bitField0_ |= 0x00000001;
}
}
/**
* repeated int32 nexts = 1;
* @return A list containing the nexts.
*/
public java.util.List
getNextsList() {
return ((bitField0_ & 0x00000001) != 0) ?
java.util.Collections.unmodifiableList(nexts_) : nexts_;
}
/**
* repeated int32 nexts = 1;
* @return The count of nexts.
*/
public int getNextsCount() {
return nexts_.size();
}
/**
* repeated int32 nexts = 1;
* @param index The index of the element to return.
* @return The nexts at the given index.
*/
public int getNexts(int index) {
return nexts_.getInt(index);
}
/**
* repeated int32 nexts = 1;
* @param index The index to set the value at.
* @param value The nexts to set.
* @return This builder for chaining.
*/
public Builder setNexts(
int index, int value) {
ensureNextsIsMutable();
nexts_.setInt(index, value);
onChanged();
return this;
}
/**
* repeated int32 nexts = 1;
* @param value The nexts to add.
* @return This builder for chaining.
*/
public Builder addNexts(int value) {
ensureNextsIsMutable();
nexts_.addInt(value);
onChanged();
return this;
}
/**
* repeated int32 nexts = 1;
* @param values The nexts to add.
* @return This builder for chaining.
*/
public Builder addAllNexts(
java.lang.Iterable values) {
ensureNextsIsMutable();
com.google.protobuf.AbstractMessageLite.Builder.addAll(
values, nexts_);
onChanged();
return this;
}
/**
* repeated int32 nexts = 1;
* @return This builder for chaining.
*/
public Builder clearNexts() {
nexts_ = emptyIntList();
bitField0_ = (bitField0_ & ~0x00000001);
onChanged();
return this;
}
private com.google.protobuf.Internal.LongList distinguishedNodes_ = emptyLongList();
private void ensureDistinguishedNodesIsMutable() {
if (!((bitField0_ & 0x00000002) != 0)) {
distinguishedNodes_ = mutableCopy(distinguishedNodes_);
bitField0_ |= 0x00000002;
}
}
/**
* repeated int64 distinguished_nodes = 2;
* @return A list containing the distinguishedNodes.
*/
public java.util.List
getDistinguishedNodesList() {
return ((bitField0_ & 0x00000002) != 0) ?
java.util.Collections.unmodifiableList(distinguishedNodes_) : distinguishedNodes_;
}
/**
* repeated int64 distinguished_nodes = 2;
* @return The count of distinguishedNodes.
*/
public int getDistinguishedNodesCount() {
return distinguishedNodes_.size();
}
/**
* repeated int64 distinguished_nodes = 2;
* @param index The index of the element to return.
* @return The distinguishedNodes at the given index.
*/
public long getDistinguishedNodes(int index) {
return distinguishedNodes_.getLong(index);
}
/**
* repeated int64 distinguished_nodes = 2;
* @param index The index to set the value at.
* @param value The distinguishedNodes to set.
* @return This builder for chaining.
*/
public Builder setDistinguishedNodes(
int index, long value) {
ensureDistinguishedNodesIsMutable();
distinguishedNodes_.setLong(index, value);
onChanged();
return this;
}
/**
* repeated int64 distinguished_nodes = 2;
* @param value The distinguishedNodes to add.
* @return This builder for chaining.
*/
public Builder addDistinguishedNodes(long value) {
ensureDistinguishedNodesIsMutable();
distinguishedNodes_.addLong(value);
onChanged();
return this;
}
/**
* repeated int64 distinguished_nodes = 2;
* @param values The distinguishedNodes to add.
* @return This builder for chaining.
*/
public Builder addAllDistinguishedNodes(
java.lang.Iterable values) {
ensureDistinguishedNodesIsMutable();
com.google.protobuf.AbstractMessageLite.Builder.addAll(
values, distinguishedNodes_);
onChanged();
return this;
}
/**
* repeated int64 distinguished_nodes = 2;
* @return This builder for chaining.
*/
public Builder clearDistinguishedNodes() {
distinguishedNodes_ = emptyLongList();
bitField0_ = (bitField0_ & ~0x00000002);
onChanged();
return this;
}
@java.lang.Override
public final Builder setUnknownFields(
final com.google.protobuf.UnknownFieldSet unknownFields) {
return super.setUnknownFields(unknownFields);
}
@java.lang.Override
public final Builder mergeUnknownFields(
final com.google.protobuf.UnknownFieldSet unknownFields) {
return super.mergeUnknownFields(unknownFields);
}
// @@protoc_insertion_point(builder_scope:operations_research.sat.CircuitCoveringConstraintProto)
}
// @@protoc_insertion_point(class_scope:operations_research.sat.CircuitCoveringConstraintProto)
private static final com.google.ortools.sat.CircuitCoveringConstraintProto DEFAULT_INSTANCE;
static {
DEFAULT_INSTANCE = new com.google.ortools.sat.CircuitCoveringConstraintProto();
}
public static com.google.ortools.sat.CircuitCoveringConstraintProto getDefaultInstance() {
return DEFAULT_INSTANCE;
}
private static final com.google.protobuf.Parser
PARSER = new com.google.protobuf.AbstractParser() {
@java.lang.Override
public CircuitCoveringConstraintProto parsePartialFrom(
com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return new CircuitCoveringConstraintProto(input, extensionRegistry);
}
};
public static com.google.protobuf.Parser parser() {
return PARSER;
}
@java.lang.Override
public com.google.protobuf.Parser getParserForType() {
return PARSER;
}
@java.lang.Override
public com.google.ortools.sat.CircuitCoveringConstraintProto getDefaultInstanceForType() {
return DEFAULT_INSTANCE;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy