pub struct FiberTable {
pub section_offsets: Vec<u32>,
pub y: Vec<f64>,
pub z: Vec<f64>,
pub area: Vec<f64>,
pub material: Vec<u32>,
}Expand description
Fibers for every DispBeamColumn/ForceBeamColumn section, flattened
and offset-indexed: section k occupies
section_offsets[k]..section_offsets[k + 1] in y/z/area/material.
section_offsets therefore has num_sections + 1 entries. z is empty in
a 2D model and parallel to y in a 3D model (biaxial bending) — torsion is
deliberately excluded from the fiber loop in core (FiberSection3’s doc
comment) and supplied instead as each owning table’s own g/j fields.
Fields§
§section_offsets: Vec<u32>§y: Vec<f64>§z: Vec<f64>§area: Vec<f64>§material: Vec<u32>Index into the material arena, parallel to y/area.
Implementations§
Source§impl FiberTable
impl FiberTable
pub fn section_count(&self) -> usize
Trait Implementations§
Source§impl Clone for FiberTable
impl Clone for FiberTable
Source§fn clone(&self) -> FiberTable
fn clone(&self) -> FiberTable
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for FiberTable
impl Debug for FiberTable
Source§impl Default for FiberTable
impl Default for FiberTable
Source§fn default() -> FiberTable
fn default() -> FiberTable
Returns the “default value” for a type. Read more
Source§impl<'de> Deserialize<'de> for FiberTable
impl<'de> Deserialize<'de> for FiberTable
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 Serialize for FiberTable
impl Serialize for FiberTable
Source§impl Tsify for FiberTable
impl Tsify for FiberTable
const DECL: &'static str = "/**\n * Fibers for every `DispBeamColumn`/`ForceBeamColumn` section, flattened\n * and offset-indexed: section `k` occupies\n * `section_offsets[k]..section_offsets[k + 1]` in `y`/`z`/`area`/`material`.\n * `section_offsets` therefore has `num_sections + 1` entries. `z` is empty in\n * a 2D model and parallel to `y` in a 3D model (biaxial bending) \u{2014} torsion is\n * deliberately excluded from the fiber loop in `core` (`FiberSection3`\'s doc\n * comment) and supplied instead as each owning table\'s own `g`/`j` fields.\n */\nexport interface FiberTable {\n sectionOffsets: number[];\n y: number[];\n z?: number[];\n area: number[];\n /**\n * Index into the material arena, parallel to `y`/`area`.\n */\n material: number[];\n}"
const SERIALIZATION_CONFIG: SerializationConfig
Source§type JsType = JsType
type JsType = JsType
Must be a type imported through
#[wasm_bindgen] extern "C" { .. }.
[Ts<T>] is #[repr(transparent)] over this and passes it across the
ABI as a plain JS handle, which any other representation would break.fn into_js(&self) -> Result<Self::JsType, Error>where
Self: Serialize,
fn from_js<T>(js: T) -> Result<Self, Error>
Auto Trait Implementations§
impl Freeze for FiberTable
impl RefUnwindSafe for FiberTable
impl Send for FiberTable
impl Sync for FiberTable
impl Unpin for FiberTable
impl UnsafeUnpin for FiberTable
impl UnwindSafe for FiberTable
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<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
impl<T, U> Imply<T> for U
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.