Struct Relation

pub struct Relation {
    pub id: Id,
    pub tags: FnvHashMap<KString, KString>,
    pub info: Option<Info>,
    pub members: Vec<Member>,
}

Ordered list of Elements

This is a logical representation https://wiki.openstreetmap.org/wiki/Relation

Fields

id: Id

tags: FnvHashMap<KString, KString>

info: Option<Info>

members: Vec<Member>

There should be no more than 300 members per relation, with a hard limit of 32,000

https://wiki.openstreetmap.org/wiki/Relation#Size

Implementations

impl Relation

pub fn strip_info(&mut self)

Removes Info if present

Trait Implementations

impl Clone for Relation

fn clone(&self) -> Relation

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Relation

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

Formats the value using the given formatter.

impl PartialEq for Relation

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

Tests for self and other values to be equal, and is used by ==.

const fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Relation

impl StructuralPartialEq for Relation