pub struct NodeTable {
pub coords: Vec<f64>,
pub fixed: Vec<u8>,
pub mass_node_index: Vec<u32>,
pub mass: Vec<f64>,
}Expand description
Node table: coords stride ndm (x, y[, z]); fixed one bitmask byte per
node (bit k = DOF k: ux, uy, rz in 2D; ux, uy, uz, rx, ry, rz in 3D);
mass is sparse, addressed via a parallel node-index array since most nodes
carry none.
Fields§
§coords: Vec<f64>§fixed: Vec<u8>§mass_node_index: Vec<u32>§mass: Vec<f64>Stride ndf (3 in 2D, 6 in 3D), parallel to mass_node_index.
Implementations§
Trait Implementations§
Source§impl<'de> Deserialize<'de> for NodeTable
impl<'de> Deserialize<'de> for NodeTable
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 Tsify for NodeTable
impl Tsify for NodeTable
const DECL: &'static str = "/**\n * Node table: `coords` stride `ndm` (x, y[, z]); `fixed` one bitmask byte per\n * node (bit `k` = DOF `k`: ux, uy, rz in 2D; ux, uy, uz, rx, ry, rz in 3D);\n * mass is sparse, addressed via a parallel node-index array since most nodes\n * carry none.\n */\nexport interface NodeTable {\n coords: number[];\n fixed: number[];\n massNodeIndex: number[];\n /**\n * Stride `ndf` (3 in 2D, 6 in 3D), parallel to `mass_node_index`.\n */\n mass: 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 NodeTable
impl RefUnwindSafe for NodeTable
impl Send for NodeTable
impl Sync for NodeTable
impl Unpin for NodeTable
impl UnsafeUnpin for NodeTable
impl UnwindSafe for NodeTable
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.