public void MergeFrom(QuadraticProgrammingProblem other) { if (other == null) { return; } if (other.ParamSize != 0) { ParamSize = other.ParamSize; } if (other.quadraticMatrix_ != null) { if (quadraticMatrix_ == null) { quadraticMatrix_ = new global::Apollo.Planning.QPMatrix(); } QuadraticMatrix.MergeFrom(other.QuadraticMatrix); } bias_.Add(other.bias_); if (other.equalityMatrix_ != null) { if (equalityMatrix_ == null) { equalityMatrix_ = new global::Apollo.Planning.QPMatrix(); } EqualityMatrix.MergeFrom(other.EqualityMatrix); } equalityValue_.Add(other.equalityValue_); if (other.inequalityMatrix_ != null) { if (inequalityMatrix_ == null) { inequalityMatrix_ = new global::Apollo.Planning.QPMatrix(); } InequalityMatrix.MergeFrom(other.InequalityMatrix); } inequalityValue_.Add(other.inequalityValue_); inputMarker_.Add(other.inputMarker_); optimalParam_.Add(other.optimalParam_); }
public void MergeFrom(pb::CodedInputStream input) { uint tag; while ((tag = input.ReadTag()) != 0) { switch (tag) { default: input.SkipLastField(); break; case 8: { ParamSize = input.ReadInt32(); break; } case 18: { if (quadraticMatrix_ == null) { quadraticMatrix_ = new global::Apollo.Planning.QPMatrix(); } input.ReadMessage(quadraticMatrix_); break; } case 26: case 25: { bias_.AddEntriesFrom(input, _repeated_bias_codec); break; } case 34: { if (equalityMatrix_ == null) { equalityMatrix_ = new global::Apollo.Planning.QPMatrix(); } input.ReadMessage(equalityMatrix_); break; } case 42: case 41: { equalityValue_.AddEntriesFrom(input, _repeated_equalityValue_codec); break; } case 50: { if (inequalityMatrix_ == null) { inequalityMatrix_ = new global::Apollo.Planning.QPMatrix(); } input.ReadMessage(inequalityMatrix_); break; } case 58: case 57: { inequalityValue_.AddEntriesFrom(input, _repeated_inequalityValue_codec); break; } case 66: case 65: { inputMarker_.AddEntriesFrom(input, _repeated_inputMarker_codec); break; } case 74: case 73: { optimalParam_.AddEntriesFrom(input, _repeated_optimalParam_codec); break; } } } }