1 // Copyright (c) 2017-2026, Lawrence Livermore National Security, LLC and other CEED contributors.
2 // All Rights Reserved. See the top-level LICENSE and NOTICE files for details.
4 // SPDX-License-Identifier: BSD-2-Clause
13 // -----------------------------------------------------------------------------
15 // -----------------------------------------------------------------------------
23     fn from(rstr: &'a ElemRestriction) -> Self {  in from()
31     pub(crate) fn to_raw(&self) -> bind_ceed::CeedElemRestriction {  in to_raw()
42     /// # fn main() -> libceed::Result<()> {
50     /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?;
51     /// let r_opt = ElemRestrictionOpt::from(&r);
59     pub fn is_some(&self) -> bool {  in is_some()
70     /// # fn main() -> libceed::Result<()> {
78     /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?;
79     /// let r_opt = ElemRestrictionOpt::from(&r);
87     pub fn is_none(&self) -> bool {  in is_none()
95 // -----------------------------------------------------------------------------
97 // -----------------------------------------------------------------------------
104 // -----------------------------------------------------------------------------
106 // -----------------------------------------------------------------------------
117 // -----------------------------------------------------------------------------
119 // -----------------------------------------------------------------------------
125     /// # fn main() -> libceed::Result<()> {
133     /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?;
134     /// println!("{}", r);
138     fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {  in fmt()
151 // -----------------------------------------------------------------------------
153 // -----------------------------------------------------------------------------
166     ) -> crate::Result<Self> {  in create()
196     pub(crate) unsafe fn from_raw(ptr: bind_ceed::CeedElemRestriction) -> crate::Result<Self> {  in from_raw()
214     ) -> crate::Result<Self> {  in create_oriented()
256     ) -> crate::Result<Self> {  in create_curl_oriented()
294     ) -> crate::Result<Self> {
321     fn ceed(&self) -> bind_ceed::Ceed {  in ceed()
327     fn check_error(&self, ierr: i32) -> crate::Result<i32> {  in check_error()
335     /// # fn main() -> libceed::Result<()> {
343     /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?;
345     /// let lvector = r.create_lvector()?;
351     pub fn create_lvector<'b>(&self) -> crate::Result<Vector<'b>> {  in create_lvector()
364     /// # fn main() -> libceed::Result<()> {
372     /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?;
374     /// let evector = r.create_evector()?;
380     pub fn create_evector<'b>(&self) -> crate::Result<Vector<'b>> {  in create_evector()
393     /// # fn main() -> libceed::Result<()> {
401     /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?;
403     /// let (lvector, evector) = r.create_vectors()?;
410     pub fn create_vectors<'b, 'c>(&self) -> crate::Result<(Vector<'b>, Vector<'c>)> {  in create_vectors()
425     /// * `tmode` - Apply restriction or transpose
426     /// * `u`     - Input vector (of size `lsize` when `TransposeMode::NoTranspose`)
427     /// * `ru`    - Output vector (of shape `[nelem * elemsize]` when
433     /// # fn main() -> libceed::Result<()> {
441     /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?;
447     /// r.apply(TransposeMode::NoTranspose, &x, &mut y)?;
459     pub fn apply(&self, tmode: TransposeMode, u: &Vector, ru: &mut Vector) -> crate::Result<i32> {  in apply()
476     /// # fn main() -> libceed::Result<()> {
485     /// let r = ceed.elem_restriction(nelem, 2, 1, compstride, nelem + 1, MemType::Host, &ind)?;
487     /// let c = r.comp_stride();
492     pub fn comp_stride(&self) -> usize {  in comp_stride()
502     /// # fn main() -> libceed::Result<()> {
510     /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?;
512     /// let n = r.num_elements();
517     pub fn num_elements(&self) -> usize {  in num_elements()
527     /// # fn main() -> libceed::Result<()> {
536     /// let r = ceed.elem_restriction(nelem, elem_size, 1, 1, nelem + 1, MemType::Host, &ind)?;
538     /// let e = r.elem_size();
543     pub fn elem_size(&self) -> usize {  in elem_size()
553     /// # fn main() -> libceed::Result<()> {
561     /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?;
563     /// let lsize = r.lvector_size();
568     pub fn lvector_size(&self) -> usize {  in lvector_size()
578     /// # fn main() -> libceed::Result<()> {
587     /// let r = ceed.elem_restriction(nelem, 2, 42, 1, ncomp * (nelem + 1), MemType::Host, &ind)?;
589     /// let n = r.num_components();
594     pub fn num_components(&self) -> usize {  in num_components()
604     /// # fn main() -> libceed::Result<()> {
612     /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?;
617     /// r.multiplicity(&mut mult)?;
629     pub fn multiplicity(&self, mult: &mut Vector) -> crate::Result<i32> {  in multiplicity()
636 // -----------------------------------------------------------------------------