pub struct TabDef {
pub id: u32,
pub auto_tab_left: bool,
pub auto_tab_right: bool,
}Expand description
A single tab property definition.
Maps to HWPX <hh:tabPr>.
Fields§
§id: u32Tab property ID (0-based).
auto_tab_left: boolAuto-insert tab at left margin.
auto_tab_right: boolAuto-insert tab at right margin.
Implementations§
Trait Implementations§
Source§impl<'de> Deserialize<'de> for TabDef
impl<'de> Deserialize<'de> for TabDef
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl JsonSchema for TabDef
impl JsonSchema for TabDef
Source§fn schema_id() -> Cow<'static, str>
fn schema_id() -> Cow<'static, str>
Returns a string that uniquely identifies the schema produced by this type. Read more
Source§fn json_schema(generator: &mut SchemaGenerator) -> Schema
fn json_schema(generator: &mut SchemaGenerator) -> Schema
Generates a JSON Schema for this type. Read more
Source§fn inline_schema() -> bool
fn inline_schema() -> bool
Whether JSON Schemas generated for this type should be included directly in parent schemas,
rather than being re-used where possible using the
$ref keyword. Read moreimpl Eq for TabDef
impl StructuralPartialEq for TabDef
Auto Trait Implementations§
impl Freeze for TabDef
impl RefUnwindSafe for TabDef
impl Send for TabDef
impl Sync for TabDef
impl Unpin for TabDef
impl UnwindSafe for TabDef
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.