Struct protobuf::UnknownFields

[+] Show declaration

pub struct UnknownFields {
    pub fields: Option<Box<HashMap<u32, UnknownValues>>>,
}

[−] Expand description

Hold “unknown” fields in parsed message.

Field may be unknown if it they are added in newer version of .proto. Unknown fields are stored in UnknownFields structure, so protobuf message could process messages without losing data.

For example, in this operation: load from DB, modify, store to DB, even when working with older .proto file, new fields won’t be lost.

Fields

fields: Option<Box<HashMap<u32, UnknownValues>>>

[−] Expand description

The map.

Implementations

impl UnknownFields[−]

pub fn new() -> UnknownFields[−]

Empty unknown fields

pub fn add_fixed32(&mut self, number: u32, fixed32: u32)[−]

Add unknown fixed 32-bit

pub fn add_fixed64(&mut self, number: u32, fixed64: u64)[−]

Add unknown fixed 64-bit

pub fn add_varint(&mut self, number: u32, varint: u64)[−]

Add unknown varint

pub fn add_length_delimited(&mut self, number: u32, length_delimited: Vec<u8>)[−]

Add unknown length delimited

pub fn add_value(&mut self, number: u32, value: UnknownValue)[−]

Add unknown value

pub fn iter<'s>(&'s self) -> UnknownFieldsIter<'s>[−]

Iterate over all unknowns

pub fn get(&self, field_number: u32) -> Option<&UnknownValues>[−]

Find unknown field by number

Trait Implementations

impl Clear for UnknownFields[+]

[+] Show hidden undocumented items

fn clear(&mut self)[−]

Clear this make, make it equivalent to newly created object.

impl Clone for UnknownFields[+]

[+] Show hidden undocumented items

fn clone(&self) -> UnknownFields[−]

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)[−]

Performs copy-assignment from source.

impl Debug for UnknownFields[+]

[+] Show hidden undocumented items

fn fmt(&self, f: &mut Formatter<'_>) -> Result[−]

Formats the value using the given formatter.

impl Default for UnknownFields[+]

[+] Show hidden undocumented items

fn default() -> UnknownFields[−]

Returns the “default value” for a type.

impl Eq for UnknownFields

impl Hash for UnknownFields[+]

Very simple hash implementation of Hash for UnknownFields. Since map is unordered, we cannot put entry hashes into hasher, instead we summing hashes of entries.

[+] Show hidden undocumented items

fn hash<H: Hasher>(&self, state: &mut H)[−]

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, [−]

Feeds a slice of this type into the given Hasher.

impl<'a> IntoIterator for &'a UnknownFields[+]

[+] Show hidden undocumented items

type Item = (u32, &'a UnknownValues)

The type of the elements being iterated over.

type IntoIter = UnknownFieldsIter<'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> UnknownFieldsIter<'a>[−]

Creates an iterator from a value.

impl PartialEq<UnknownFields> for UnknownFields[+]

[+] Show hidden undocumented items

fn eq(&self, other: &UnknownFields) -> bool[−]

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &UnknownFields) -> bool[−]

This method tests for !=.

impl StructuralEq for UnknownFields

impl StructuralPartialEq for UnknownFields