#region Copyright notice and license | |
// Protocol Buffers - Google's data interchange format | |
// Copyright 2008 Google Inc. All rights reserved. | |
// https://developers.google.com/protocol-buffers/ | |
// | |
// Redistribution and use in source and binary forms, with or without | |
// modification, are permitted provided that the following conditions are | |
// met: | |
// | |
// * Redistributions of source code must retain the above copyright | |
// notice, this list of conditions and the following disclaimer. | |
// * Redistributions in binary form must reproduce the above | |
// copyright notice, this list of conditions and the following disclaimer | |
// in the documentation and/or other materials provided with the | |
// distribution. | |
// * Neither the name of Google Inc. nor the names of its | |
// contributors may be used to endorse or promote products derived from | |
// this software without specific prior written permission. | |
// | |
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
#endregion | |
namespace Google.Protobuf.FieldAccess | |
{ | |
/// <summary> | |
/// Allows fields to be reflectively accessed in a smart manner. | |
/// The property descriptors for each field are created once and then cached. | |
/// In addition, this interface holds knowledge of repeated fields, builders etc. | |
/// </summary> | |
internal interface IFieldAccessor<T> where T : IMessage<T> | |
{ | |
/// <summary> | |
/// Indicates whether the specified message contains the field. For primitive fields | |
/// declared in proto3-syntax messages, this simply checks whether the value is the default one. | |
/// </summary> | |
/// <exception cref="InvalidOperationException">The field is a repeated field, or a single primitive field.</exception> | |
bool HasValue(T message); | |
/// <summary> | |
/// Clears the field in the specified message. (For repeated fields, | |
/// this clears the list.) | |
/// </summary> | |
void Clear(T message); | |
/// <summary> | |
/// Fetches the field value. For repeated values, this will be an | |
/// <see cref="IList"/> implementation. | |
/// </summary> | |
object GetValue(T message); | |
/// <summary> | |
/// Mutator for single fields only. (Repeated fields must be mutated | |
/// by fetching the list, then mutating that.) | |
/// </summary> | |
/// <exception cref="InvalidOperationException">The field is a repeated field.</exception> | |
void SetValue(T message, object value); | |
} | |
} |