pub struct LinearConstraintTable {
pub slave_node: Vec<u32>,
pub slave_dof: Vec<u8>,
pub term_offsets: Vec<u32>,
pub term_node: Vec<u32>,
pub term_dof: Vec<u8>,
pub term_coeff: Vec<f64>,
}Expand description
General linear multi-point constraints (core::Domain::add_constraint):
row i defines u[slaveNode[i], slaveDof[i]] = sum coeff * u[node, dof]
over the terms termOffsets[i]..termOffsets[i + 1] of the flattened sparse
termNode/termDof/termCoeff arrays. termOffsets has rows + 1
entries (or none at all for an empty table).
Fields§
§slave_node: Vec<u32>§slave_dof: Vec<u8>§term_offsets: Vec<u32>§term_node: Vec<u32>§term_dof: Vec<u8>§term_coeff: Vec<f64>Trait Implementations§
Source§impl Clone for LinearConstraintTable
impl Clone for LinearConstraintTable
Source§fn clone(&self) -> LinearConstraintTable
fn clone(&self) -> LinearConstraintTable
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 LinearConstraintTable
impl Debug for LinearConstraintTable
Source§impl Default for LinearConstraintTable
impl Default for LinearConstraintTable
Source§fn default() -> LinearConstraintTable
fn default() -> LinearConstraintTable
Returns the “default value” for a type. Read more
Source§impl<'de> Deserialize<'de> for LinearConstraintTable
impl<'de> Deserialize<'de> for LinearConstraintTable
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 LinearConstraintTable
impl Serialize for LinearConstraintTable
Source§impl Tsify for LinearConstraintTable
impl Tsify for LinearConstraintTable
const DECL: &'static str = "/**\n * General linear multi-point constraints (`core::Domain::add_constraint`):\n * row `i` defines `u[slaveNode[i], slaveDof[i]] = sum coeff * u[node, dof]`\n * over the terms `termOffsets[i]..termOffsets[i + 1]` of the flattened sparse\n * `termNode`/`termDof`/`termCoeff` arrays. `termOffsets` has `rows + 1`\n * entries (or none at all for an empty table).\n */\nexport interface LinearConstraintTable {\n slaveNode: number[];\n slaveDof: number[];\n termOffsets: number[];\n termNode: number[];\n termDof: number[];\n termCoeff: 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 LinearConstraintTable
impl RefUnwindSafe for LinearConstraintTable
impl Send for LinearConstraintTable
impl Sync for LinearConstraintTable
impl Unpin for LinearConstraintTable
impl UnsafeUnpin for LinearConstraintTable
impl UnwindSafe for LinearConstraintTable
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.