1 // Copyright (c) 2017-2024, Lawrence Livermore National Security, LLC and other CEED contributors. 2 // All Rights Reserved. See the top-level LICENSE and NOTICE files for details. 3 // 4 // SPDX-License-Identifier: BSD-2-Clause 5 // 6 // This file is part of CEED: http://github.com/ceed 7 8 //! A Ceed ElemRestriction decomposes elements and groups the degrees of freedom 9 //! (dofs) according to the different elements they belong to. 10 11 use crate::prelude::*; 12 13 // ----------------------------------------------------------------------------- 14 // ElemRestriction option 15 // ----------------------------------------------------------------------------- 16 #[derive(Debug)] 17 pub enum ElemRestrictionOpt<'a> { 18 Some(&'a ElemRestriction<'a>), 19 None, 20 } 21 /// Construct a ElemRestrictionOpt reference from a ElemRestriction reference 22 impl<'a> From<&'a ElemRestriction<'_>> for ElemRestrictionOpt<'a> { 23 fn from(rstr: &'a ElemRestriction) -> Self { 24 debug_assert!(rstr.ptr != unsafe { bind_ceed::CEED_ELEMRESTRICTION_NONE }); 25 Self::Some(rstr) 26 } 27 } 28 impl<'a> ElemRestrictionOpt<'a> { 29 /// Transform a Rust libCEED ElemRestrictionOpt into C libCEED 30 /// CeedElemRestriction 31 pub(crate) fn to_raw(self) -> bind_ceed::CeedElemRestriction { 32 match self { 33 Self::Some(rstr) => rstr.ptr, 34 Self::None => unsafe { bind_ceed::CEED_ELEMRESTRICTION_NONE }, 35 } 36 } 37 38 /// Check if an ElemRestrictionOpt is Some 39 /// 40 /// ``` 41 /// # use libceed::prelude::*; 42 /// # fn main() -> libceed::Result<()> { 43 /// # let ceed = libceed::Ceed::default_init(); 44 /// let nelem = 3; 45 /// let mut ind: Vec<i32> = vec![0; 2 * nelem]; 46 /// for i in 0..nelem { 47 /// ind[2 * i + 0] = i as i32; 48 /// ind[2 * i + 1] = (i + 1) as i32; 49 /// } 50 /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?; 51 /// let r_opt = ElemRestrictionOpt::from(&r); 52 /// assert!(r_opt.is_some(), "Incorrect ElemRestrictionOpt"); 53 /// 54 /// let r_opt = ElemRestrictionOpt::None; 55 /// assert!(!r_opt.is_some(), "Incorrect ElemRestrictionOpt"); 56 /// # Ok(()) 57 /// # } 58 /// ``` 59 pub fn is_some(&self) -> bool { 60 match self { 61 Self::Some(_) => true, 62 Self::None => false, 63 } 64 } 65 66 /// Check if an ElemRestrictionOpt is None 67 /// 68 /// ``` 69 /// # use libceed::prelude::*; 70 /// # fn main() -> libceed::Result<()> { 71 /// # let ceed = libceed::Ceed::default_init(); 72 /// let nelem = 3; 73 /// let mut ind: Vec<i32> = vec![0; 2 * nelem]; 74 /// for i in 0..nelem { 75 /// ind[2 * i + 0] = i as i32; 76 /// ind[2 * i + 1] = (i + 1) as i32; 77 /// } 78 /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?; 79 /// let r_opt = ElemRestrictionOpt::from(&r); 80 /// assert!(!r_opt.is_none(), "Incorrect ElemRestrictionOpt"); 81 /// 82 /// let r_opt = ElemRestrictionOpt::None; 83 /// assert!(r_opt.is_none(), "Incorrect ElemRestrictionOpt"); 84 /// # Ok(()) 85 /// # } 86 /// ``` 87 pub fn is_none(&self) -> bool { 88 match self { 89 Self::Some(_) => false, 90 Self::None => true, 91 } 92 } 93 } 94 95 // ----------------------------------------------------------------------------- 96 // ElemRestriction context wrapper 97 // ----------------------------------------------------------------------------- 98 #[derive(Debug)] 99 pub struct ElemRestriction<'a> { 100 pub(crate) ptr: bind_ceed::CeedElemRestriction, 101 _lifeline: PhantomData<&'a ()>, 102 } 103 104 // ----------------------------------------------------------------------------- 105 // Destructor 106 // ----------------------------------------------------------------------------- 107 impl<'a> Drop for ElemRestriction<'a> { 108 fn drop(&mut self) { 109 unsafe { 110 if self.ptr != bind_ceed::CEED_ELEMRESTRICTION_NONE { 111 bind_ceed::CeedElemRestrictionDestroy(&mut self.ptr); 112 } 113 } 114 } 115 } 116 117 // ----------------------------------------------------------------------------- 118 // Display 119 // ----------------------------------------------------------------------------- 120 impl<'a> fmt::Display for ElemRestriction<'a> { 121 /// View an ElemRestriction 122 /// 123 /// ``` 124 /// # use libceed::prelude::*; 125 /// # fn main() -> libceed::Result<()> { 126 /// # let ceed = libceed::Ceed::default_init(); 127 /// let nelem = 3; 128 /// let mut ind: Vec<i32> = vec![0; 2 * nelem]; 129 /// for i in 0..nelem { 130 /// ind[2 * i + 0] = i as i32; 131 /// ind[2 * i + 1] = (i + 1) as i32; 132 /// } 133 /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?; 134 /// println!("{}", r); 135 /// # Ok(()) 136 /// # } 137 /// ``` 138 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result { 139 let mut ptr = std::ptr::null_mut(); 140 let mut sizeloc = crate::MAX_BUFFER_LENGTH; 141 let cstring = unsafe { 142 let file = bind_ceed::open_memstream(&mut ptr, &mut sizeloc); 143 bind_ceed::CeedElemRestrictionView(self.ptr, file); 144 bind_ceed::fclose(file); 145 CString::from_raw(ptr) 146 }; 147 cstring.to_string_lossy().fmt(f) 148 } 149 } 150 151 // ----------------------------------------------------------------------------- 152 // Implementations 153 // ----------------------------------------------------------------------------- 154 impl<'a> ElemRestriction<'a> { 155 // Constructors 156 pub fn create( 157 ceed: &crate::Ceed, 158 nelem: usize, 159 elemsize: usize, 160 ncomp: usize, 161 compstride: usize, 162 lsize: usize, 163 mtype: crate::MemType, 164 offsets: &[i32], 165 ) -> crate::Result<Self> { 166 let mut ptr = std::ptr::null_mut(); 167 let (nelem, elemsize, ncomp, compstride, lsize, mtype) = ( 168 i32::try_from(nelem).unwrap(), 169 i32::try_from(elemsize).unwrap(), 170 i32::try_from(ncomp).unwrap(), 171 i32::try_from(compstride).unwrap(), 172 isize::try_from(lsize).unwrap(), 173 mtype as bind_ceed::CeedMemType, 174 ); 175 let ierr = unsafe { 176 bind_ceed::CeedElemRestrictionCreate( 177 ceed.ptr, 178 nelem, 179 elemsize, 180 ncomp, 181 compstride, 182 lsize, 183 mtype, 184 crate::CopyMode::CopyValues as bind_ceed::CeedCopyMode, 185 offsets.as_ptr(), 186 &mut ptr, 187 ) 188 }; 189 ceed.check_error(ierr)?; 190 Ok(Self { 191 ptr, 192 _lifeline: PhantomData, 193 }) 194 } 195 196 pub(crate) fn from_raw(ptr: bind_ceed::CeedElemRestriction) -> crate::Result<Self> { 197 Ok(Self { 198 ptr, 199 _lifeline: PhantomData, 200 }) 201 } 202 203 pub fn create_oriented( 204 ceed: &crate::Ceed, 205 nelem: usize, 206 elemsize: usize, 207 ncomp: usize, 208 compstride: usize, 209 lsize: usize, 210 mtype: crate::MemType, 211 offsets: &[i32], 212 orients: &[bool], 213 ) -> crate::Result<Self> { 214 let mut ptr = std::ptr::null_mut(); 215 let (nelem, elemsize, ncomp, compstride, lsize, mtype) = ( 216 i32::try_from(nelem).unwrap(), 217 i32::try_from(elemsize).unwrap(), 218 i32::try_from(ncomp).unwrap(), 219 i32::try_from(compstride).unwrap(), 220 isize::try_from(lsize).unwrap(), 221 mtype as bind_ceed::CeedMemType, 222 ); 223 let ierr = unsafe { 224 bind_ceed::CeedElemRestrictionCreateOriented( 225 ceed.ptr, 226 nelem, 227 elemsize, 228 ncomp, 229 compstride, 230 lsize, 231 mtype, 232 crate::CopyMode::CopyValues as bind_ceed::CeedCopyMode, 233 offsets.as_ptr(), 234 orients.as_ptr(), 235 &mut ptr, 236 ) 237 }; 238 ceed.check_error(ierr)?; 239 Ok(Self { 240 ptr, 241 _lifeline: PhantomData, 242 }) 243 } 244 245 pub fn create_curl_oriented( 246 ceed: &crate::Ceed, 247 nelem: usize, 248 elemsize: usize, 249 ncomp: usize, 250 compstride: usize, 251 lsize: usize, 252 mtype: crate::MemType, 253 offsets: &[i32], 254 curlorients: &[i8], 255 ) -> crate::Result<Self> { 256 let mut ptr = std::ptr::null_mut(); 257 let (nelem, elemsize, ncomp, compstride, lsize, mtype) = ( 258 i32::try_from(nelem).unwrap(), 259 i32::try_from(elemsize).unwrap(), 260 i32::try_from(ncomp).unwrap(), 261 i32::try_from(compstride).unwrap(), 262 isize::try_from(lsize).unwrap(), 263 mtype as bind_ceed::CeedMemType, 264 ); 265 let ierr = unsafe { 266 bind_ceed::CeedElemRestrictionCreateCurlOriented( 267 ceed.ptr, 268 nelem, 269 elemsize, 270 ncomp, 271 compstride, 272 lsize, 273 mtype, 274 crate::CopyMode::CopyValues as bind_ceed::CeedCopyMode, 275 offsets.as_ptr(), 276 curlorients.as_ptr(), 277 &mut ptr, 278 ) 279 }; 280 ceed.check_error(ierr)?; 281 Ok(Self { 282 ptr, 283 _lifeline: PhantomData, 284 }) 285 } 286 287 pub fn create_strided( 288 ceed: &crate::Ceed, 289 nelem: usize, 290 elemsize: usize, 291 ncomp: usize, 292 lsize: usize, 293 strides: [i32; 3], 294 ) -> crate::Result<Self> { 295 let mut ptr = std::ptr::null_mut(); 296 let (nelem, elemsize, ncomp, lsize) = ( 297 i32::try_from(nelem).unwrap(), 298 i32::try_from(elemsize).unwrap(), 299 i32::try_from(ncomp).unwrap(), 300 isize::try_from(lsize).unwrap(), 301 ); 302 let ierr = unsafe { 303 bind_ceed::CeedElemRestrictionCreateStrided( 304 ceed.ptr, 305 nelem, 306 elemsize, 307 ncomp, 308 lsize, 309 strides.as_ptr(), 310 &mut ptr, 311 ) 312 }; 313 ceed.check_error(ierr)?; 314 Ok(Self { 315 ptr, 316 _lifeline: PhantomData, 317 }) 318 } 319 320 // Error handling 321 #[doc(hidden)] 322 fn check_error(&self, ierr: i32) -> crate::Result<i32> { 323 unsafe { crate::check_error(bind_ceed::CeedElemRestrictionReturnCeed(self.ptr), ierr) } 324 } 325 326 /// Create an Lvector for an ElemRestriction 327 /// 328 /// ``` 329 /// # use libceed::prelude::*; 330 /// # fn main() -> libceed::Result<()> { 331 /// # let ceed = libceed::Ceed::default_init(); 332 /// let nelem = 3; 333 /// let mut ind: Vec<i32> = vec![0; 2 * nelem]; 334 /// for i in 0..nelem { 335 /// ind[2 * i + 0] = i as i32; 336 /// ind[2 * i + 1] = (i + 1) as i32; 337 /// } 338 /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?; 339 /// 340 /// let lvector = r.create_lvector()?; 341 /// 342 /// assert_eq!(lvector.length(), nelem + 1, "Incorrect Lvector size"); 343 /// # Ok(()) 344 /// # } 345 /// ``` 346 pub fn create_lvector<'b>(&self) -> crate::Result<Vector<'b>> { 347 let mut ptr_lvector = std::ptr::null_mut(); 348 let null = std::ptr::null_mut() as *mut _; 349 let ierr = 350 unsafe { bind_ceed::CeedElemRestrictionCreateVector(self.ptr, &mut ptr_lvector, null) }; 351 self.check_error(ierr)?; 352 Vector::from_raw(ptr_lvector) 353 } 354 355 /// Create an Evector for an ElemRestriction 356 /// 357 /// ``` 358 /// # use libceed::prelude::*; 359 /// # fn main() -> libceed::Result<()> { 360 /// # let ceed = libceed::Ceed::default_init(); 361 /// let nelem = 3; 362 /// let mut ind: Vec<i32> = vec![0; 2 * nelem]; 363 /// for i in 0..nelem { 364 /// ind[2 * i + 0] = i as i32; 365 /// ind[2 * i + 1] = (i + 1) as i32; 366 /// } 367 /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?; 368 /// 369 /// let evector = r.create_evector()?; 370 /// 371 /// assert_eq!(evector.length(), nelem * 2, "Incorrect Evector size"); 372 /// # Ok(()) 373 /// # } 374 /// ``` 375 pub fn create_evector<'b>(&self) -> crate::Result<Vector<'b>> { 376 let mut ptr_evector = std::ptr::null_mut(); 377 let null = std::ptr::null_mut() as *mut _; 378 let ierr = 379 unsafe { bind_ceed::CeedElemRestrictionCreateVector(self.ptr, null, &mut ptr_evector) }; 380 self.check_error(ierr)?; 381 Vector::from_raw(ptr_evector) 382 } 383 384 /// Create Vectors for an ElemRestriction 385 /// 386 /// ``` 387 /// # use libceed::prelude::*; 388 /// # fn main() -> libceed::Result<()> { 389 /// # let ceed = libceed::Ceed::default_init(); 390 /// let nelem = 3; 391 /// let mut ind: Vec<i32> = vec![0; 2 * nelem]; 392 /// for i in 0..nelem { 393 /// ind[2 * i + 0] = i as i32; 394 /// ind[2 * i + 1] = (i + 1) as i32; 395 /// } 396 /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?; 397 /// 398 /// let (lvector, evector) = r.create_vectors()?; 399 /// 400 /// assert_eq!(lvector.length(), nelem + 1, "Incorrect Lvector size"); 401 /// assert_eq!(evector.length(), nelem * 2, "Incorrect Evector size"); 402 /// # Ok(()) 403 /// # } 404 /// ``` 405 pub fn create_vectors<'b, 'c>(&self) -> crate::Result<(Vector<'b>, Vector<'c>)> { 406 let mut ptr_lvector = std::ptr::null_mut(); 407 let mut ptr_evector = std::ptr::null_mut(); 408 let ierr = unsafe { 409 bind_ceed::CeedElemRestrictionCreateVector(self.ptr, &mut ptr_lvector, &mut ptr_evector) 410 }; 411 self.check_error(ierr)?; 412 let lvector = Vector::from_raw(ptr_lvector)?; 413 let evector = Vector::from_raw(ptr_evector)?; 414 Ok((lvector, evector)) 415 } 416 417 /// Restrict an Lvector to an Evector or apply its transpose 418 /// 419 /// # arguments 420 /// 421 /// * `tmode` - Apply restriction or transpose 422 /// * `u` - Input vector (of size `lsize` when `TransposeMode::NoTranspose`) 423 /// * `ru` - Output vector (of shape `[nelem * elemsize]` when 424 /// `TransposeMode::NoTranspose`). Ordering of the Evector is 425 /// decided by the backend. 426 /// 427 /// ``` 428 /// # use libceed::prelude::*; 429 /// # fn main() -> libceed::Result<()> { 430 /// # let ceed = libceed::Ceed::default_init(); 431 /// let nelem = 3; 432 /// let mut ind: Vec<i32> = vec![0; 2 * nelem]; 433 /// for i in 0..nelem { 434 /// ind[2 * i + 0] = i as i32; 435 /// ind[2 * i + 1] = (i + 1) as i32; 436 /// } 437 /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?; 438 /// 439 /// let x = ceed.vector_from_slice(&[0., 1., 2., 3.])?; 440 /// let mut y = ceed.vector(nelem * 2)?; 441 /// y.set_value(0.0); 442 /// 443 /// r.apply(TransposeMode::NoTranspose, &x, &mut y)?; 444 /// 445 /// for (i, y) in y.view()?.iter().enumerate() { 446 /// assert_eq!( 447 /// *y, 448 /// ((i + 1) / 2) as Scalar, 449 /// "Incorrect value in restricted vector" 450 /// ); 451 /// } 452 /// # Ok(()) 453 /// # } 454 /// ``` 455 pub fn apply(&self, tmode: TransposeMode, u: &Vector, ru: &mut Vector) -> crate::Result<i32> { 456 let tmode = tmode as bind_ceed::CeedTransposeMode; 457 let ierr = unsafe { 458 bind_ceed::CeedElemRestrictionApply( 459 self.ptr, 460 tmode, 461 u.ptr, 462 ru.ptr, 463 bind_ceed::CEED_REQUEST_IMMEDIATE, 464 ) 465 }; 466 self.check_error(ierr) 467 } 468 469 /// Returns the Lvector component stride 470 /// 471 /// ``` 472 /// # use libceed::prelude::*; 473 /// # fn main() -> libceed::Result<()> { 474 /// # let ceed = libceed::Ceed::default_init(); 475 /// let nelem = 3; 476 /// let compstride = 1; 477 /// let mut ind: Vec<i32> = vec![0; 2 * nelem]; 478 /// for i in 0..nelem { 479 /// ind[2 * i + 0] = i as i32; 480 /// ind[2 * i + 1] = (i + 1) as i32; 481 /// } 482 /// let r = ceed.elem_restriction(nelem, 2, 1, compstride, nelem + 1, MemType::Host, &ind)?; 483 /// 484 /// let c = r.comp_stride(); 485 /// assert_eq!(c, compstride, "Incorrect component stride"); 486 /// # Ok(()) 487 /// # } 488 /// ``` 489 pub fn comp_stride(&self) -> usize { 490 let mut compstride = 0; 491 unsafe { bind_ceed::CeedElemRestrictionGetCompStride(self.ptr, &mut compstride) }; 492 usize::try_from(compstride).unwrap() 493 } 494 495 /// Returns the total number of elements in the range of a ElemRestriction 496 /// 497 /// ``` 498 /// # use libceed::prelude::*; 499 /// # fn main() -> libceed::Result<()> { 500 /// # let ceed = libceed::Ceed::default_init(); 501 /// let nelem = 3; 502 /// let mut ind: Vec<i32> = vec![0; 2 * nelem]; 503 /// for i in 0..nelem { 504 /// ind[2 * i + 0] = i as i32; 505 /// ind[2 * i + 1] = (i + 1) as i32; 506 /// } 507 /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?; 508 /// 509 /// let n = r.num_elements(); 510 /// assert_eq!(n, nelem, "Incorrect number of elements"); 511 /// # Ok(()) 512 /// # } 513 /// ``` 514 pub fn num_elements(&self) -> usize { 515 let mut numelem = 0; 516 unsafe { bind_ceed::CeedElemRestrictionGetNumElements(self.ptr, &mut numelem) }; 517 usize::try_from(numelem).unwrap() 518 } 519 520 /// Returns the size of elements in the ElemRestriction 521 /// 522 /// ``` 523 /// # use libceed::prelude::*; 524 /// # fn main() -> libceed::Result<()> { 525 /// # let ceed = libceed::Ceed::default_init(); 526 /// let nelem = 3; 527 /// let elem_size = 2; 528 /// let mut ind: Vec<i32> = vec![0; 2 * nelem]; 529 /// for i in 0..nelem { 530 /// ind[2 * i + 0] = i as i32; 531 /// ind[2 * i + 1] = (i + 1) as i32; 532 /// } 533 /// let r = ceed.elem_restriction(nelem, elem_size, 1, 1, nelem + 1, MemType::Host, &ind)?; 534 /// 535 /// let e = r.elem_size(); 536 /// assert_eq!(e, elem_size, "Incorrect element size"); 537 /// # Ok(()) 538 /// # } 539 /// ``` 540 pub fn elem_size(&self) -> usize { 541 let mut elemsize = 0; 542 unsafe { bind_ceed::CeedElemRestrictionGetElementSize(self.ptr, &mut elemsize) }; 543 usize::try_from(elemsize).unwrap() 544 } 545 546 /// Returns the size of the Lvector for an ElemRestriction 547 /// 548 /// ``` 549 /// # use libceed::prelude::*; 550 /// # fn main() -> libceed::Result<()> { 551 /// # let ceed = libceed::Ceed::default_init(); 552 /// let nelem = 3; 553 /// let mut ind: Vec<i32> = vec![0; 2 * nelem]; 554 /// for i in 0..nelem { 555 /// ind[2 * i + 0] = i as i32; 556 /// ind[2 * i + 1] = (i + 1) as i32; 557 /// } 558 /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?; 559 /// 560 /// let lsize = r.lvector_size(); 561 /// assert_eq!(lsize, nelem + 1); 562 /// # Ok(()) 563 /// # } 564 /// ``` 565 pub fn lvector_size(&self) -> usize { 566 let mut lsize = 0; 567 unsafe { bind_ceed::CeedElemRestrictionGetLVectorSize(self.ptr, &mut lsize) }; 568 usize::try_from(lsize).unwrap() 569 } 570 571 /// Returns the number of components in the elements of an ElemRestriction 572 /// 573 /// ``` 574 /// # use libceed::prelude::*; 575 /// # fn main() -> libceed::Result<()> { 576 /// # let ceed = libceed::Ceed::default_init(); 577 /// let nelem = 3; 578 /// let ncomp = 42; 579 /// let mut ind: Vec<i32> = vec![0; 2 * nelem]; 580 /// for i in 0..nelem { 581 /// ind[2 * i + 0] = i as i32; 582 /// ind[2 * i + 1] = (i + 1) as i32; 583 /// } 584 /// let r = ceed.elem_restriction(nelem, 2, 42, 1, ncomp * (nelem + 1), MemType::Host, &ind)?; 585 /// 586 /// let n = r.num_components(); 587 /// assert_eq!(n, ncomp, "Incorrect number of components"); 588 /// # Ok(()) 589 /// # } 590 /// ``` 591 pub fn num_components(&self) -> usize { 592 let mut ncomp = 0; 593 unsafe { bind_ceed::CeedElemRestrictionGetNumComponents(self.ptr, &mut ncomp) }; 594 usize::try_from(ncomp).unwrap() 595 } 596 597 /// Returns the multiplicity of nodes in an ElemRestriction 598 /// 599 /// ``` 600 /// # use libceed::prelude::*; 601 /// # fn main() -> libceed::Result<()> { 602 /// # let ceed = libceed::Ceed::default_init(); 603 /// let nelem = 3; 604 /// let mut ind: Vec<i32> = vec![0; 2 * nelem]; 605 /// for i in 0..nelem { 606 /// ind[2 * i + 0] = i as i32; 607 /// ind[2 * i + 1] = (i + 1) as i32; 608 /// } 609 /// let r = ceed.elem_restriction(nelem, 2, 1, 1, nelem + 1, MemType::Host, &ind)?; 610 /// 611 /// let mut mult = ceed.vector(nelem + 1)?; 612 /// mult.set_value(0.0); 613 /// 614 /// r.multiplicity(&mut mult)?; 615 /// 616 /// for (i, m) in mult.view()?.iter().enumerate() { 617 /// assert_eq!( 618 /// *m, 619 /// if (i == 0 || i == nelem) { 1. } else { 2. }, 620 /// "Incorrect multiplicity value" 621 /// ); 622 /// } 623 /// # Ok(()) 624 /// # } 625 /// ``` 626 pub fn multiplicity(&self, mult: &mut Vector) -> crate::Result<i32> { 627 let ierr = unsafe { bind_ceed::CeedElemRestrictionGetMultiplicity(self.ptr, mult.ptr) }; 628 self.check_error(ierr) 629 } 630 } 631 632 // ----------------------------------------------------------------------------- 633