Struct df_st_legends_plus::River

pub struct River {
    pub id: Option<i32>,
    pub name: Option<String>,
    pub path: Option<Vec<Path>>,
    pub end_pos: Option<Coordinate>,
    pub unknown: HashMap<String, Value>,
}

Fields

id: Option<i32>

name: Option<String>

path: Option<Vec<Path>>

end_pos: Option<Coordinate>

unknown: HashMap<String, Value>

Trait Implementations

impl Clone for River

fn clone(&self) -> River

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for River

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for River

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl Filler<River, River> for River

fn add_missing_data(&mut self, source: &River)

Add data to self that is set as None or appends list items. Use source object to get values from.

fn add_missing_data_indexed(&mut self, source: &River, index: u64)

Add data to self from source. Same ways as add_missing_data. This function is used when adding data when looping over lists. This allows the index to be used. For example as an incremental ID. This function can be overwritten if this ID is wanted.

fn never_replace_data(&mut self, source: &S) where
    Self: Debug, 

Add data to self that is set as None or appends list items. If a value is Some it will leave the value as is.

fn replace_data(&mut self, source: &S) where
    Self: Debug, 

Add data to self. If already some value present, replace it. Appends list items. This is used when there is data that is richer then previous data. It does not trow the not_same_data warning. add_missing_data should be used in most cases instead.

fn check_mergeable(&self, source: &S) -> bool where
    S: PartialEq<Self> + Debug,
    Self: Debug + Default + PartialEq<Self>, 

impl HasUnknown for River

fn print_unknown(&self, prefix: &str, unknown_map: &mut HashMap<String, u32>)

fn combine_unknown(
    &self,
    prefix: &str,
    unknown_combiner: &mut HashMap<String, Vec<(String, Value)>>
)

fn update_unknown_prefix(&self, prefix: &str, struct_name: &str) -> String

fn print_unknown_list(
    &self,
    list: &HashMap<String, Value, RandomState>,
    prefix: &str,
    unknown_map: &mut HashMap<String, u32, RandomState>
)

fn combine_unknown_list(
    &self,
    list: &HashMap<String, Value, RandomState>,
    prefix: &str,
    unknown_combiner: &mut HashMap<String, Vec<(String, Value)>, RandomState>
)

impl Hash for River

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

Feeds this value into the given [Hasher].

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

Feeds a slice of this type into the given [Hasher].

impl PartialEq<River> for River

fn eq(&self, other: &River) -> bool

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

#[must_use]fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl Serialize for River

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.