forked from DLR-SC/tigl-website
-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathclasst8__scheme.html
3548 lines (3364 loc) · 195 KB
/
classt8__scheme.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>t8: t8_scheme Class Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">t8
 <span id="projectnumber">4.0.0-RC1.588-22cbd</span>
</div>
<div id="projectbrief">t8code is a C library to manage a forest of adaptive space-trees of general element classes in parallel.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
</div><!-- top -->
<div class="header">
<div class="summary">
<a href="#pub-types">Public Types</a> |
<a href="#pub-methods">Public Member Functions</a> |
<a href="#friends">Friends</a> </div>
<div class="headertitle">
<div class="title">t8_scheme Class Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>This class holds one or more element schemes.
<a href="classt8__scheme.html#details">More...</a></p>
<p><code>#include <<a class="el" href="t8__scheme_8hxx_source.html">t8_scheme.hxx</a>></code></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a>
Public Types</h2></td></tr>
<tr class="memitem:aed7b30dc711a18f17e455b073c384823"><td class="memItemLeft" align="right" valign="top"><a id="aed7b30dc711a18f17e455b073c384823"></a>
using </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#aed7b30dc711a18f17e455b073c384823">scheme_var</a> = std::variant< <a class="el" href="classt8__default__scheme__vertex.html">t8_default_scheme_vertex</a>, <a class="el" href="classt8__default__scheme__line.html">t8_default_scheme_line</a>, <a class="el" href="classt8__default__scheme__quad.html">t8_default_scheme_quad</a>, <a class="el" href="classt8__default__scheme__tri.html">t8_default_scheme_tri</a>, <a class="el" href="classt8__default__scheme__hex.html">t8_default_scheme_hex</a>, <a class="el" href="classt8__default__scheme__tet.html">t8_default_scheme_tet</a>, <a class="el" href="classt8__default__scheme__prism.html">t8_default_scheme_prism</a>, <a class="el" href="classt8__default__scheme__pyramid.html">t8_default_scheme_pyramid</a>, <a class="el" href="structt8__standalone__scheme.html">t8_standalone_scheme</a>< <a class="el" href="t8__eclass_8h.html#ab20dcd46b3a346d537c1fe8626d579f9ac4ce741ff4e19d3e94aa1eb0c0e7abbd">T8_ECLASS_VERTEX</a> >, <a class="el" href="structt8__standalone__scheme.html">t8_standalone_scheme</a>< <a class="el" href="t8__eclass_8h.html#ab20dcd46b3a346d537c1fe8626d579f9a9667a79817957d7f2446d73a9778b8b5">T8_ECLASS_LINE</a> >, <a class="el" href="structt8__standalone__scheme.html">t8_standalone_scheme</a>< <a class="el" href="t8__eclass_8h.html#ab20dcd46b3a346d537c1fe8626d579f9a81e3f71a30727a94fc1c80da130297a9">T8_ECLASS_QUAD</a> >, <a class="el" href="structt8__standalone__scheme.html">t8_standalone_scheme</a>< <a class="el" href="t8__eclass_8h.html#ab20dcd46b3a346d537c1fe8626d579f9a5780818d0b9120d3267db871196f866a">T8_ECLASS_HEX</a> > ></td></tr>
<tr class="memdesc:aed7b30dc711a18f17e455b073c384823"><td class="mdescLeft"> </td><td class="mdescRight">Variant to hold an eclass scheme. <br /></td></tr>
<tr class="separator:aed7b30dc711a18f17e455b073c384823"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a253d5c003fcee13597b774d3b02cbca3"><td class="memItemLeft" align="right" valign="top"><a id="a253d5c003fcee13597b774d3b02cbca3"></a>
using </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a253d5c003fcee13597b774d3b02cbca3">scheme_container</a> = std::vector< <a class="el" href="classt8__scheme.html#aed7b30dc711a18f17e455b073c384823">scheme_var</a> ></td></tr>
<tr class="memdesc:a253d5c003fcee13597b774d3b02cbca3"><td class="mdescLeft"> </td><td class="mdescRight">Container type for holding eclass schemes. <br /></td></tr>
<tr class="separator:a253d5c003fcee13597b774d3b02cbca3"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a70cd77d30b141078ac231d5c4a9515b9"><td class="memItemLeft" align="right" valign="top"><a id="a70cd77d30b141078ac231d5c4a9515b9"></a>
void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a70cd77d30b141078ac231d5c4a9515b9">ref</a> () const</td></tr>
<tr class="memdesc:a70cd77d30b141078ac231d5c4a9515b9"><td class="mdescLeft"> </td><td class="mdescRight">Increase the reference count of the scheme. <br /></td></tr>
<tr class="separator:a70cd77d30b141078ac231d5c4a9515b9"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4d3a78bc332b7868397b835c8317ac47"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a4d3a78bc332b7868397b835c8317ac47">unref</a> () const</td></tr>
<tr class="memdesc:a4d3a78bc332b7868397b835c8317ac47"><td class="mdescLeft"> </td><td class="mdescRight">Decrease the reference count of the scheme. <a href="classt8__scheme.html#a4d3a78bc332b7868397b835c8317ac47">More...</a><br /></td></tr>
<tr class="separator:a4d3a78bc332b7868397b835c8317ac47"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad1d98eada4c87673a7c189a5b2a1cb7e"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#ad1d98eada4c87673a7c189a5b2a1cb7e">get_num_eclass_schemes</a> () const</td></tr>
<tr class="memdesc:ad1d98eada4c87673a7c189a5b2a1cb7e"><td class="mdescLeft"> </td><td class="mdescRight">Get the number of eclass schemes inside the scheme. <a href="classt8__scheme.html#ad1d98eada4c87673a7c189a5b2a1cb7e">More...</a><br /></td></tr>
<tr class="separator:ad1d98eada4c87673a7c189a5b2a1cb7e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab26cfd761c91248b59ce42902addacdd"><td class="memTemplParams" colspan="2">template<class TEclassScheme > </td></tr>
<tr class="memitem:ab26cfd761c91248b59ce42902addacdd"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#ab26cfd761c91248b59ce42902addacdd">check_eclass_scheme_type</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class) const</td></tr>
<tr class="memdesc:ab26cfd761c91248b59ce42902addacdd"><td class="mdescLeft"> </td><td class="mdescRight">Check if the scheme is of a specific type. <a href="classt8__scheme.html#ab26cfd761c91248b59ce42902addacdd">More...</a><br /></td></tr>
<tr class="separator:ab26cfd761c91248b59ce42902addacdd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a41e212bb5f95d9e07e65b54c911d2c71"><td class="memItemLeft" align="right" valign="top"><a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a41e212bb5f95d9e07e65b54c911d2c71">get_eclass_scheme_eclass</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class) const</td></tr>
<tr class="memdesc:a41e212bb5f95d9e07e65b54c911d2c71"><td class="mdescLeft"> </td><td class="mdescRight">Get the eclass an eclass scheme is valid for. <a href="classt8__scheme.html#a41e212bb5f95d9e07e65b54c911d2c71">More...</a><br /></td></tr>
<tr class="separator:a41e212bb5f95d9e07e65b54c911d2c71"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2b6c4d7de5838d2a7bf7f99c29467533"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a2b6c4d7de5838d2a7bf7f99c29467533">get_element_size</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class) const</td></tr>
<tr class="memdesc:a2b6c4d7de5838d2a7bf7f99c29467533"><td class="mdescLeft"> </td><td class="mdescRight">Return the size of any element of a given class. <a href="classt8__scheme.html#a2b6c4d7de5838d2a7bf7f99c29467533">More...</a><br /></td></tr>
<tr class="separator:a2b6c4d7de5838d2a7bf7f99c29467533"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5585e34278986190d562fa76c47d6470"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a5585e34278986190d562fa76c47d6470">refines_irregular</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class) const</td></tr>
<tr class="memdesc:a5585e34278986190d562fa76c47d6470"><td class="mdescLeft"> </td><td class="mdescRight">Returns true, if there is one element in the tree, that does not refine into 2^dim children. <a href="classt8__scheme.html#a5585e34278986190d562fa76c47d6470">More...</a><br /></td></tr>
<tr class="separator:a5585e34278986190d562fa76c47d6470"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a42ad9586fb7839910813418b6e5b22a6"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a42ad9586fb7839910813418b6e5b22a6">get_maxlevel</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class) const</td></tr>
<tr class="memdesc:a42ad9586fb7839910813418b6e5b22a6"><td class="mdescLeft"> </td><td class="mdescRight">Return the maximum allowed level for any element of a given class. <a href="classt8__scheme.html#a42ad9586fb7839910813418b6e5b22a6">More...</a><br /></td></tr>
<tr class="separator:a42ad9586fb7839910813418b6e5b22a6"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad446bc14b0be601c4aa9c628db6c0e3a"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#ad446bc14b0be601c4aa9c628db6c0e3a">element_get_level</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem) const</td></tr>
<tr class="memdesc:ad446bc14b0be601c4aa9c628db6c0e3a"><td class="mdescLeft"> </td><td class="mdescRight">Return the level of a particular element. <a href="classt8__scheme.html#ad446bc14b0be601c4aa9c628db6c0e3a">More...</a><br /></td></tr>
<tr class="separator:ad446bc14b0be601c4aa9c628db6c0e3a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab976202bc88eceaf814568eb81dc5e7f"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#ab976202bc88eceaf814568eb81dc5e7f">element_copy</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *source, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *dest) const</td></tr>
<tr class="memdesc:ab976202bc88eceaf814568eb81dc5e7f"><td class="mdescLeft"> </td><td class="mdescRight">Copy all entries of <em>source</em> to <em>dest</em>. <a href="classt8__scheme.html#ab976202bc88eceaf814568eb81dc5e7f">More...</a><br /></td></tr>
<tr class="separator:ab976202bc88eceaf814568eb81dc5e7f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:acc6c2a91780403d2765bfc222098ba6c"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#acc6c2a91780403d2765bfc222098ba6c">element_compare</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem1, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem2) const</td></tr>
<tr class="memdesc:acc6c2a91780403d2765bfc222098ba6c"><td class="mdescLeft"> </td><td class="mdescRight">Compare two elements. <a href="classt8__scheme.html#acc6c2a91780403d2765bfc222098ba6c">More...</a><br /></td></tr>
<tr class="separator:acc6c2a91780403d2765bfc222098ba6c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7be24712101df44758b98fe8ae3eda27"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a7be24712101df44758b98fe8ae3eda27">element_is_equal</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem1, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem2) const</td></tr>
<tr class="memdesc:a7be24712101df44758b98fe8ae3eda27"><td class="mdescLeft"> </td><td class="mdescRight">Check if two elements are equal. <a href="classt8__scheme.html#a7be24712101df44758b98fe8ae3eda27">More...</a><br /></td></tr>
<tr class="separator:a7be24712101df44758b98fe8ae3eda27"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa9a7d1ed8da911d24f44663e089536d3"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#aa9a7d1ed8da911d24f44663e089536d3">element_get_parent</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *parent) const</td></tr>
<tr class="memdesc:aa9a7d1ed8da911d24f44663e089536d3"><td class="mdescLeft"> </td><td class="mdescRight">Compute the parent of a given element <em>elem</em> and store it in <em>parent</em>. <a href="classt8__scheme.html#aa9a7d1ed8da911d24f44663e089536d3">More...</a><br /></td></tr>
<tr class="separator:aa9a7d1ed8da911d24f44663e089536d3"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a05b2d451321e88c4fd9b112f60358b65"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a05b2d451321e88c4fd9b112f60358b65">element_get_num_siblings</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem) const</td></tr>
<tr class="memdesc:a05b2d451321e88c4fd9b112f60358b65"><td class="mdescLeft"> </td><td class="mdescRight">Compute the number of siblings of an element. <a href="classt8__scheme.html#a05b2d451321e88c4fd9b112f60358b65">More...</a><br /></td></tr>
<tr class="separator:a05b2d451321e88c4fd9b112f60358b65"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2c077dc91ca843128e893190cdfb138c"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a2c077dc91ca843128e893190cdfb138c">element_get_sibling</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int sibid, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *sibling) const</td></tr>
<tr class="memdesc:a2c077dc91ca843128e893190cdfb138c"><td class="mdescLeft"> </td><td class="mdescRight">Compute a specific sibling of a given element <em>elem</em> and store it in <em>sibling</em>. <a href="classt8__scheme.html#a2c077dc91ca843128e893190cdfb138c">More...</a><br /></td></tr>
<tr class="separator:a2c077dc91ca843128e893190cdfb138c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a100cf7a705b1ef6945bc64ce70b90d0d"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a100cf7a705b1ef6945bc64ce70b90d0d">element_get_num_corners</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem) const</td></tr>
<tr class="memdesc:a100cf7a705b1ef6945bc64ce70b90d0d"><td class="mdescLeft"> </td><td class="mdescRight">Compute the number of corners of a given element. <a href="classt8__scheme.html#a100cf7a705b1ef6945bc64ce70b90d0d">More...</a><br /></td></tr>
<tr class="separator:a100cf7a705b1ef6945bc64ce70b90d0d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ada02b05362d184368acebac229b06df7"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#ada02b05362d184368acebac229b06df7">element_get_num_faces</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem) const</td></tr>
<tr class="memdesc:ada02b05362d184368acebac229b06df7"><td class="mdescLeft"> </td><td class="mdescRight">Compute the number of faces of a given element. <a href="classt8__scheme.html#ada02b05362d184368acebac229b06df7">More...</a><br /></td></tr>
<tr class="separator:ada02b05362d184368acebac229b06df7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac18d46f1ed2db4ca608a98b0abf0218e"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#ac18d46f1ed2db4ca608a98b0abf0218e">element_get_max_num_faces</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem) const</td></tr>
<tr class="memdesc:ac18d46f1ed2db4ca608a98b0abf0218e"><td class="mdescLeft"> </td><td class="mdescRight">Compute the maximum number of faces of a given element and all of its descendants. <a href="classt8__scheme.html#ac18d46f1ed2db4ca608a98b0abf0218e">More...</a><br /></td></tr>
<tr class="separator:ac18d46f1ed2db4ca608a98b0abf0218e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7faaaa013c4c3152bbc0de5cde198fb9"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a7faaaa013c4c3152bbc0de5cde198fb9">element_get_num_children</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem) const</td></tr>
<tr class="memdesc:a7faaaa013c4c3152bbc0de5cde198fb9"><td class="mdescLeft"> </td><td class="mdescRight">Return the number of children of an element when it is refined. <a href="classt8__scheme.html#a7faaaa013c4c3152bbc0de5cde198fb9">More...</a><br /></td></tr>
<tr class="separator:a7faaaa013c4c3152bbc0de5cde198fb9"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7a4cceb847d8bad3d0885ac94871ecb6"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a7a4cceb847d8bad3d0885ac94871ecb6">element_get_num_face_children</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int face) const</td></tr>
<tr class="memdesc:a7a4cceb847d8bad3d0885ac94871ecb6"><td class="mdescLeft"> </td><td class="mdescRight">Return the number of children of an element's face when the element is refined. <a href="classt8__scheme.html#a7a4cceb847d8bad3d0885ac94871ecb6">More...</a><br /></td></tr>
<tr class="separator:a7a4cceb847d8bad3d0885ac94871ecb6"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a14d9253b553272dd2e966395eeb9f19f"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a14d9253b553272dd2e966395eeb9f19f">element_get_face_corner</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *element, const int face, const int corner) const</td></tr>
<tr class="memdesc:a14d9253b553272dd2e966395eeb9f19f"><td class="mdescLeft"> </td><td class="mdescRight">Return the corner number of an element's face corner. <a href="classt8__scheme.html#a14d9253b553272dd2e966395eeb9f19f">More...</a><br /></td></tr>
<tr class="separator:a14d9253b553272dd2e966395eeb9f19f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a68809126cb1bab4401d306663db4f8c8"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a68809126cb1bab4401d306663db4f8c8">element_get_corner_face</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *element, const int corner, const int face) const</td></tr>
<tr class="memdesc:a68809126cb1bab4401d306663db4f8c8"><td class="mdescLeft"> </td><td class="mdescRight">Return the face numbers of the faces sharing an element's corner. <a href="classt8__scheme.html#a68809126cb1bab4401d306663db4f8c8">More...</a><br /></td></tr>
<tr class="separator:a68809126cb1bab4401d306663db4f8c8"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0a56475d8e2539407c46860f9a555545"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a0a56475d8e2539407c46860f9a555545">element_get_child</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int childid, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *child) const</td></tr>
<tr class="memdesc:a0a56475d8e2539407c46860f9a555545"><td class="mdescLeft"> </td><td class="mdescRight">Construct the child element of a given number. <a href="classt8__scheme.html#a0a56475d8e2539407c46860f9a555545">More...</a><br /></td></tr>
<tr class="separator:a0a56475d8e2539407c46860f9a555545"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac904f5424e0c14015de5a02fe2c105f2"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#ac904f5424e0c14015de5a02fe2c105f2">element_get_children</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int length, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *c[]) const</td></tr>
<tr class="memdesc:ac904f5424e0c14015de5a02fe2c105f2"><td class="mdescLeft"> </td><td class="mdescRight">Construct all children of a given element. <a href="classt8__scheme.html#ac904f5424e0c14015de5a02fe2c105f2">More...</a><br /></td></tr>
<tr class="separator:ac904f5424e0c14015de5a02fe2c105f2"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6021440102c23fee1bcf74e0946579c0"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a6021440102c23fee1bcf74e0946579c0">element_get_child_id</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem) const</td></tr>
<tr class="memdesc:a6021440102c23fee1bcf74e0946579c0"><td class="mdescLeft"> </td><td class="mdescRight">Compute the child id of an element. <a href="classt8__scheme.html#a6021440102c23fee1bcf74e0946579c0">More...</a><br /></td></tr>
<tr class="separator:a6021440102c23fee1bcf74e0946579c0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a78a55c1a68f3fbbe23ea10664f36c9e0"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a78a55c1a68f3fbbe23ea10664f36c9e0">element_get_ancestor_id</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int level) const</td></tr>
<tr class="memdesc:a78a55c1a68f3fbbe23ea10664f36c9e0"><td class="mdescLeft"> </td><td class="mdescRight">Compute the ancestor id of an element, that is the child id at a given level. <a href="classt8__scheme.html#a78a55c1a68f3fbbe23ea10664f36c9e0">More...</a><br /></td></tr>
<tr class="separator:a78a55c1a68f3fbbe23ea10664f36c9e0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a79a0afde9fa6e9dda13e2bc33e403df2"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a79a0afde9fa6e9dda13e2bc33e403df2">elements_are_family</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *const *fam) const</td></tr>
<tr class="memdesc:a79a0afde9fa6e9dda13e2bc33e403df2"><td class="mdescLeft"> </td><td class="mdescRight">Query whether a given set of elements is a family or not. <a href="classt8__scheme.html#a79a0afde9fa6e9dda13e2bc33e403df2">More...</a><br /></td></tr>
<tr class="separator:a79a0afde9fa6e9dda13e2bc33e403df2"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5db4f6029b2cacb3b3fd2ad4d12a4b8b"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a5db4f6029b2cacb3b3fd2ad4d12a4b8b">element_get_nca</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem1, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem2, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *const nca) const</td></tr>
<tr class="memdesc:a5db4f6029b2cacb3b3fd2ad4d12a4b8b"><td class="mdescLeft"> </td><td class="mdescRight">Compute the nearest common ancestor of two elements. <a href="classt8__scheme.html#a5db4f6029b2cacb3b3fd2ad4d12a4b8b">More...</a><br /></td></tr>
<tr class="separator:a5db4f6029b2cacb3b3fd2ad4d12a4b8b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0d90099c58ea3128e262ad8279e9aa4a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="t8__element__shape_8h.html#aab8844a13783f0c1ab05e1d027fd545a">t8_element_shape_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a0d90099c58ea3128e262ad8279e9aa4a">element_get_face_shape</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int face) const</td></tr>
<tr class="memdesc:a0d90099c58ea3128e262ad8279e9aa4a"><td class="mdescLeft"> </td><td class="mdescRight">Compute the shape of the face of an element. <a href="classt8__scheme.html#a0d90099c58ea3128e262ad8279e9aa4a">More...</a><br /></td></tr>
<tr class="separator:a0d90099c58ea3128e262ad8279e9aa4a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0296f8812d7f241e16737261e44f7355"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a0296f8812d7f241e16737261e44f7355">element_get_children_at_face</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int face, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *children[], int num_children, int *child_indices) const</td></tr>
<tr class="memdesc:a0296f8812d7f241e16737261e44f7355"><td class="mdescLeft"> </td><td class="mdescRight">Given an element and a face of the element, compute all children of the element that touch the face. <a href="classt8__scheme.html#a0296f8812d7f241e16737261e44f7355">More...</a><br /></td></tr>
<tr class="separator:a0296f8812d7f241e16737261e44f7355"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a508efc7787bb9ffe830b2f1bef60eec3"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a508efc7787bb9ffe830b2f1bef60eec3">element_face_get_child_face</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int face, const int face_child) const</td></tr>
<tr class="memdesc:a508efc7787bb9ffe830b2f1bef60eec3"><td class="mdescLeft"> </td><td class="mdescRight">Given a face of an element and a child number of a child of that face, return the face number of the child of the element that matches the child face. <a href="classt8__scheme.html#a508efc7787bb9ffe830b2f1bef60eec3">More...</a><br /></td></tr>
<tr class="separator:a508efc7787bb9ffe830b2f1bef60eec3"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a37ff5bcf3a00aea8d313397183e0707a"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a37ff5bcf3a00aea8d313397183e0707a">element_face_get_parent_face</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int face) const</td></tr>
<tr class="memdesc:a37ff5bcf3a00aea8d313397183e0707a"><td class="mdescLeft"> </td><td class="mdescRight">Given a face of an element return the face number of the parent of the element that matches the element's face. <a href="classt8__scheme.html#a37ff5bcf3a00aea8d313397183e0707a">More...</a><br /></td></tr>
<tr class="separator:a37ff5bcf3a00aea8d313397183e0707a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a38e6088c02b873127925b4469c9b9660"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a38e6088c02b873127925b4469c9b9660">element_get_tree_face</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int face) const</td></tr>
<tr class="memdesc:a38e6088c02b873127925b4469c9b9660"><td class="mdescLeft"> </td><td class="mdescRight">Given an element and a face of this element. <a href="classt8__scheme.html#a38e6088c02b873127925b4469c9b9660">More...</a><br /></td></tr>
<tr class="separator:a38e6088c02b873127925b4469c9b9660"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa54cbd6c146c7b93ac4a8cf65efb7079"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#aa54cbd6c146c7b93ac4a8cf65efb7079">element_transform_face</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem1, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem2, const int orientation, const int sign, const int is_smaller_face) const</td></tr>
<tr class="memdesc:aa54cbd6c146c7b93ac4a8cf65efb7079"><td class="mdescLeft"> </td><td class="mdescRight">Suppose we have two trees that share a common face f. <a href="classt8__scheme.html#aa54cbd6c146c7b93ac4a8cf65efb7079">More...</a><br /></td></tr>
<tr class="separator:aa54cbd6c146c7b93ac4a8cf65efb7079"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a52773b471db244fade72eb7ef37cef56"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a52773b471db244fade72eb7ef37cef56">element_extrude_face</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *face, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int root_face) const</td></tr>
<tr class="memdesc:a52773b471db244fade72eb7ef37cef56"><td class="mdescLeft"> </td><td class="mdescRight">Given a boundary face inside a root tree's face construct the element inside the root tree that has the given face as a face. <a href="classt8__scheme.html#a52773b471db244fade72eb7ef37cef56">More...</a><br /></td></tr>
<tr class="separator:a52773b471db244fade72eb7ef37cef56"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aab86fe21e3053cdf57c86963c5ad6e33"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#aab86fe21e3053cdf57c86963c5ad6e33">element_get_boundary_face</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int face, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *boundary) const</td></tr>
<tr class="memdesc:aab86fe21e3053cdf57c86963c5ad6e33"><td class="mdescLeft"> </td><td class="mdescRight">Construct the boundary element at a specific face. <a href="classt8__scheme.html#aab86fe21e3053cdf57c86963c5ad6e33">More...</a><br /></td></tr>
<tr class="separator:aab86fe21e3053cdf57c86963c5ad6e33"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5f9d1aeca1a202af994659dd1cc300ad"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a5f9d1aeca1a202af994659dd1cc300ad">element_get_first_descendant_face</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int face, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *first_desc, const int level) const</td></tr>
<tr class="memdesc:a5f9d1aeca1a202af994659dd1cc300ad"><td class="mdescLeft"> </td><td class="mdescRight">Construct the first descendant of an element at a given level that touches a given face. <a href="classt8__scheme.html#a5f9d1aeca1a202af994659dd1cc300ad">More...</a><br /></td></tr>
<tr class="separator:a5f9d1aeca1a202af994659dd1cc300ad"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6112f73ed4285e9131ebeeed11a57780"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a6112f73ed4285e9131ebeeed11a57780">element_get_last_descendant_face</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int face, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *last_desc, const int level) const</td></tr>
<tr class="memdesc:a6112f73ed4285e9131ebeeed11a57780"><td class="mdescLeft"> </td><td class="mdescRight">Construct the last descendant of an element at a given level that touches a given face. <a href="classt8__scheme.html#a6112f73ed4285e9131ebeeed11a57780">More...</a><br /></td></tr>
<tr class="separator:a6112f73ed4285e9131ebeeed11a57780"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a69ca0ed62f4cda7ca215c7aa283d1d62"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a69ca0ed62f4cda7ca215c7aa283d1d62">element_is_root_boundary</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int face) const</td></tr>
<tr class="memdesc:a69ca0ed62f4cda7ca215c7aa283d1d62"><td class="mdescLeft"> </td><td class="mdescRight">Compute whether a given element shares a given face with its root tree. <a href="classt8__scheme.html#a69ca0ed62f4cda7ca215c7aa283d1d62">More...</a><br /></td></tr>
<tr class="separator:a69ca0ed62f4cda7ca215c7aa283d1d62"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6b6dc7523cace0b19ead78e63840afaf"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a6b6dc7523cace0b19ead78e63840afaf">element_get_face_neighbor_inside</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *neigh, const int face, int *neigh_face) const</td></tr>
<tr class="memdesc:a6b6dc7523cace0b19ead78e63840afaf"><td class="mdescLeft"> </td><td class="mdescRight">Construct the face neighbor of a given element if this face neighbor is inside the root tree. <a href="classt8__scheme.html#a6b6dc7523cace0b19ead78e63840afaf">More...</a><br /></td></tr>
<tr class="separator:a6b6dc7523cace0b19ead78e63840afaf"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ada42fcf420f367798f4ac1a0edc1e292"><td class="memItemLeft" align="right" valign="top"><a class="el" href="t8__element__shape_8h.html#aab8844a13783f0c1ab05e1d027fd545a">t8_element_shape_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#ada42fcf420f367798f4ac1a0edc1e292">element_get_shape</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem) const</td></tr>
<tr class="memdesc:ada42fcf420f367798f4ac1a0edc1e292"><td class="mdescLeft"> </td><td class="mdescRight">Return the shape of an allocated element according its type. <a href="classt8__scheme.html#ada42fcf420f367798f4ac1a0edc1e292">More...</a><br /></td></tr>
<tr class="separator:ada42fcf420f367798f4ac1a0edc1e292"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af061b230670a10f9e7f567e9349c4331"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#af061b230670a10f9e7f567e9349c4331">element_set_linear_id</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int level, const <a class="el" href="t8_8h.html#ae5c6845909c4725136233464e6db11bb">t8_linearidx_t</a> id) const</td></tr>
<tr class="memdesc:af061b230670a10f9e7f567e9349c4331"><td class="mdescLeft"> </td><td class="mdescRight">Initialize the entries of an allocated element according to a given linear id in a uniform refinement. <a href="classt8__scheme.html#af061b230670a10f9e7f567e9349c4331">More...</a><br /></td></tr>
<tr class="separator:af061b230670a10f9e7f567e9349c4331"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a19af30ae13cdadbd77f791d8531e5821"><td class="memItemLeft" align="right" valign="top"><a class="el" href="t8_8h.html#ae5c6845909c4725136233464e6db11bb">t8_linearidx_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a19af30ae13cdadbd77f791d8531e5821">element_get_linear_id</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const int level) const</td></tr>
<tr class="memdesc:a19af30ae13cdadbd77f791d8531e5821"><td class="mdescLeft"> </td><td class="mdescRight">Compute the linear id of a given element in a hypothetical uniform refinement of a given level. <a href="classt8__scheme.html#a19af30ae13cdadbd77f791d8531e5821">More...</a><br /></td></tr>
<tr class="separator:a19af30ae13cdadbd77f791d8531e5821"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:afdebfd511538f49a26c76e3cb5be52a9"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#afdebfd511538f49a26c76e3cb5be52a9">element_get_first_descendant</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *desc, const int level) const</td></tr>
<tr class="memdesc:afdebfd511538f49a26c76e3cb5be52a9"><td class="mdescLeft"> </td><td class="mdescRight">Compute the first descendant of a given element. <a href="classt8__scheme.html#afdebfd511538f49a26c76e3cb5be52a9">More...</a><br /></td></tr>
<tr class="separator:afdebfd511538f49a26c76e3cb5be52a9"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aca801518570b74db90c24759d7f96db3"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#aca801518570b74db90c24759d7f96db3">element_get_last_descendant</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *desc, const int level) const</td></tr>
<tr class="memdesc:aca801518570b74db90c24759d7f96db3"><td class="mdescLeft"> </td><td class="mdescRight">Compute the last descendant of a given element. <a href="classt8__scheme.html#aca801518570b74db90c24759d7f96db3">More...</a><br /></td></tr>
<tr class="separator:aca801518570b74db90c24759d7f96db3"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a98c9a4e136ad094f7eb6243cc62c13af"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a98c9a4e136ad094f7eb6243cc62c13af">element_construct_successor</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *t, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *s) const</td></tr>
<tr class="memdesc:a98c9a4e136ad094f7eb6243cc62c13af"><td class="mdescLeft"> </td><td class="mdescRight">Construct the successor in a uniform refinement of a given element. <a href="classt8__scheme.html#a98c9a4e136ad094f7eb6243cc62c13af">More...</a><br /></td></tr>
<tr class="separator:a98c9a4e136ad094f7eb6243cc62c13af"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1e049a4ab221565ed07f01ef57c8f6cd"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a1e049a4ab221565ed07f01ef57c8f6cd">element_get_vertex_reference_coords</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *t, const int vertex, double coords[]) const</td></tr>
<tr class="memdesc:a1e049a4ab221565ed07f01ef57c8f6cd"><td class="mdescLeft"> </td><td class="mdescRight">Compute the coordinates of a given element vertex inside a reference tree that is embedded into [0,1]^d (d = dimension). <a href="classt8__scheme.html#a1e049a4ab221565ed07f01ef57c8f6cd">More...</a><br /></td></tr>
<tr class="separator:a1e049a4ab221565ed07f01ef57c8f6cd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1f6bc45f3e1e5fad3423bc5eae278f94"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a1f6bc45f3e1e5fad3423bc5eae278f94">element_get_reference_coords</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, const double *ref_coords, const size_t num_coords, double *out_coords) const</td></tr>
<tr class="memdesc:a1f6bc45f3e1e5fad3423bc5eae278f94"><td class="mdescLeft"> </td><td class="mdescRight">Convert points in the reference space of an element to points in the reference space of the tree. <a href="classt8__scheme.html#a1f6bc45f3e1e5fad3423bc5eae278f94">More...</a><br /></td></tr>
<tr class="separator:a1f6bc45f3e1e5fad3423bc5eae278f94"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9be187f0be562e3e2d899f05c9709826"><td class="memItemLeft" align="right" valign="top"><a class="el" href="t8_8h.html#a03692467b9ffc84d4d0c37e042679225">t8_gloidx_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a9be187f0be562e3e2d899f05c9709826">element_count_leaves</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *t, const int level) const</td></tr>
<tr class="memdesc:a9be187f0be562e3e2d899f05c9709826"><td class="mdescLeft"> </td><td class="mdescRight">Count how many leaf descendants of a given uniform level an element would produce. <a href="classt8__scheme.html#a9be187f0be562e3e2d899f05c9709826">More...</a><br /></td></tr>
<tr class="separator:a9be187f0be562e3e2d899f05c9709826"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5db97e764b0195c22006227874d24afd"><td class="memItemLeft" align="right" valign="top"><a class="el" href="t8_8h.html#a03692467b9ffc84d4d0c37e042679225">t8_gloidx_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a5db97e764b0195c22006227874d24afd">count_leaves_from_root</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const int level) const</td></tr>
<tr class="memdesc:a5db97e764b0195c22006227874d24afd"><td class="mdescLeft"> </td><td class="mdescRight">Count how many leaf descendants of a given uniform level the root element will produce. <a href="classt8__scheme.html#a5db97e764b0195c22006227874d24afd">More...</a><br /></td></tr>
<tr class="separator:a5db97e764b0195c22006227874d24afd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac39d236fae4db6a2e6c1d234f17e1628"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#ac39d236fae4db6a2e6c1d234f17e1628">element_is_valid</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem) const</td></tr>
<tr class="memdesc:ac39d236fae4db6a2e6c1d234f17e1628"><td class="mdescLeft"> </td><td class="mdescRight">Query whether a given element can be considered as 'valid' and it is safe to perform any of the above algorithms on it. <a href="classt8__scheme.html#ac39d236fae4db6a2e6c1d234f17e1628">More...</a><br /></td></tr>
<tr class="separator:ac39d236fae4db6a2e6c1d234f17e1628"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5fd50d5ce709004a1760cd4a4aeb258f"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a5fd50d5ce709004a1760cd4a4aeb258f">element_debug_print</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem) const</td></tr>
<tr class="memdesc:a5fd50d5ce709004a1760cd4a4aeb258f"><td class="mdescLeft"> </td><td class="mdescRight">Print a given element. <a href="classt8__scheme.html#a5fd50d5ce709004a1760cd4a4aeb258f">More...</a><br /></td></tr>
<tr class="separator:a5fd50d5ce709004a1760cd4a4aeb258f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab4c6609d8b60530303d8a8c85b56fb27"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#ab4c6609d8b60530303d8a8c85b56fb27">element_to_string</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem, char *debug_string, const int string_size) const</td></tr>
<tr class="memdesc:ab4c6609d8b60530303d8a8c85b56fb27"><td class="mdescLeft"> </td><td class="mdescRight">Fill a string with readable information about the element. <a href="classt8__scheme.html#ab4c6609d8b60530303d8a8c85b56fb27">More...</a><br /></td></tr>
<tr class="separator:ab4c6609d8b60530303d8a8c85b56fb27"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac840fcf8915fffd21f2d75dca2382ae5"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#ac840fcf8915fffd21f2d75dca2382ae5">element_new</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const int length, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> **elem) const</td></tr>
<tr class="memdesc:ac840fcf8915fffd21f2d75dca2382ae5"><td class="mdescLeft"> </td><td class="mdescRight">Allocate memory for <em>length</em> many elements of a given class and initialize them, and put pointers to the elements in the provided array. <a href="classt8__scheme.html#ac840fcf8915fffd21f2d75dca2382ae5">More...</a><br /></td></tr>
<tr class="separator:ac840fcf8915fffd21f2d75dca2382ae5"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac2dee93ff3ee83bf71d73387c24a50d0"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#ac2dee93ff3ee83bf71d73387c24a50d0">element_init</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const int length, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem) const</td></tr>
<tr class="memdesc:ac2dee93ff3ee83bf71d73387c24a50d0"><td class="mdescLeft"> </td><td class="mdescRight">Initialize an array of allocated elements. <a href="classt8__scheme.html#ac2dee93ff3ee83bf71d73387c24a50d0">More...</a><br /></td></tr>
<tr class="separator:ac2dee93ff3ee83bf71d73387c24a50d0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad252dd70cdbe7454ab62b3fd79cdbbc7"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#ad252dd70cdbe7454ab62b3fd79cdbbc7">element_deinit</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const int length, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem) const</td></tr>
<tr class="memdesc:ad252dd70cdbe7454ab62b3fd79cdbbc7"><td class="mdescLeft"> </td><td class="mdescRight">Deinitialize an array of allocated elements. <a href="classt8__scheme.html#ad252dd70cdbe7454ab62b3fd79cdbbc7">More...</a><br /></td></tr>
<tr class="separator:ad252dd70cdbe7454ab62b3fd79cdbbc7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abbacc81b501a6b2f842d38f8fe767df0"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#abbacc81b501a6b2f842d38f8fe767df0">element_destroy</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const int length, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> **elem) const</td></tr>
<tr class="memdesc:abbacc81b501a6b2f842d38f8fe767df0"><td class="mdescLeft"> </td><td class="mdescRight">Deallocate an array of elements. <a href="classt8__scheme.html#abbacc81b501a6b2f842d38f8fe767df0">More...</a><br /></td></tr>
<tr class="separator:abbacc81b501a6b2f842d38f8fe767df0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a12778280e3593a3167627de90a5c71fa"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a12778280e3593a3167627de90a5c71fa">get_root</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> *elem) const</td></tr>
<tr class="memdesc:a12778280e3593a3167627de90a5c71fa"><td class="mdescLeft"> </td><td class="mdescRight">create the root element <a href="classt8__scheme.html#a12778280e3593a3167627de90a5c71fa">More...</a><br /></td></tr>
<tr class="separator:a12778280e3593a3167627de90a5c71fa"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a42e3c7a9f56253e11e36156e3cd52a8f"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a42e3c7a9f56253e11e36156e3cd52a8f">element_MPI_Pack</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> **const elements, const unsigned int count, void *send_buffer, int buffer_size, int *position, sc_MPI_Comm comm) const</td></tr>
<tr class="memdesc:a42e3c7a9f56253e11e36156e3cd52a8f"><td class="mdescLeft"> </td><td class="mdescRight">Pack multiple elements into contiguous memory, so they can be sent via MPI. <a href="classt8__scheme.html#a42e3c7a9f56253e11e36156e3cd52a8f">More...</a><br /></td></tr>
<tr class="separator:a42e3c7a9f56253e11e36156e3cd52a8f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa66cf5e55cb110aafd7249689850936e"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#aa66cf5e55cb110aafd7249689850936e">element_MPI_Pack_size</a> (const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, const unsigned int count, sc_MPI_Comm comm, int *pack_size) const</td></tr>
<tr class="memdesc:aa66cf5e55cb110aafd7249689850936e"><td class="mdescLeft"> </td><td class="mdescRight">Determine an upper bound for the size of the packed message of <em>count</em> elements. <a href="classt8__scheme.html#aa66cf5e55cb110aafd7249689850936e">More...</a><br /></td></tr>
<tr class="separator:aa66cf5e55cb110aafd7249689850936e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6038aefd4b83edc4325c590cc5ad3e74"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classt8__scheme.html#a6038aefd4b83edc4325c590cc5ad3e74">element_MPI_Unpack</a> (<a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> tree_class, void *recvbuf, const int buffer_size, int *position, <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> **elements, const unsigned int count, sc_MPI_Comm comm) const</td></tr>
<tr class="memdesc:a6038aefd4b83edc4325c590cc5ad3e74"><td class="mdescLeft"> </td><td class="mdescRight">Unpack multiple elements from contiguous memory that was received via MPI. <a href="classt8__scheme.html#a6038aefd4b83edc4325c590cc5ad3e74">More...</a><br /></td></tr>
<tr class="separator:a6038aefd4b83edc4325c590cc5ad3e74"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="friends"></a>
Friends</h2></td></tr>
<tr class="memitem:afea6512ca68ced2086be8bb24e948a97"><td class="memItemLeft" align="right" valign="top"><a id="afea6512ca68ced2086be8bb24e948a97"></a>
class </td><td class="memItemRight" valign="bottom"><b>t8_scheme_builder</b></td></tr>
<tr class="separator:afea6512ca68ced2086be8bb24e948a97"><td class="memSeparator" colspan="2"> </td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>This class holds one or more element schemes. </p>
<p>It also relays the function calls to the specific schemes. </p>
</div><h2 class="groupheader">Member Function Documentation</h2>
<a id="ab26cfd761c91248b59ce42902addacdd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab26cfd761c91248b59ce42902addacdd">◆ </a></span>check_eclass_scheme_type()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class TEclassScheme > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool t8_scheme::check_eclass_scheme_type </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> </td>
<td class="paramname"><em>tree_class</em></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Check if the scheme is of a specific type. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">TEclass_Scheme</td><td>The type of the scheme to check for. </td></tr>
</table>
</dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">tree_class</td><td>The eclass of the current tree. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>True if the scheme is of type <em>TEclassScheme</em>, false otherwise. </dd></dl>
</div>
</div>
<a id="a5db97e764b0195c22006227874d24afd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5db97e764b0195c22006227874d24afd">◆ </a></span>count_leaves_from_root()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="t8_8h.html#a03692467b9ffc84d4d0c37e042679225">t8_gloidx_t</a> t8_scheme::count_leaves_from_root </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> </td>
<td class="paramname"><em>tree_class</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int </td>
<td class="paramname"><em>level</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Count how many leaf descendants of a given uniform level the root element will produce. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">tree_class</td><td>The eclass of the current tree. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">level</td><td>A refinement level. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The value of <a class="el" href="t8__scheme_8h.html#a8e292133f473afd79d35e070bc258abd">t8_element_count_leaves</a> if the input element is the root (level 0) element.</dd></dl>
<p>This is a convenience function, and can be implemented via <a class="el" href="t8__scheme_8h.html#a8e292133f473afd79d35e070bc258abd">t8_element_count_leaves</a>. </p>
</div>
</div>
<a id="acc6c2a91780403d2765bfc222098ba6c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acc6c2a91780403d2765bfc222098ba6c">◆ </a></span>element_compare()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">int t8_scheme::element_compare </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> </td>
<td class="paramname"><em>tree_class</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> * </td>
<td class="paramname"><em>elem1</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> * </td>
<td class="paramname"><em>elem2</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Compare two elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">tree_class</td><td>The eclass of the current tree. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">elem1</td><td>The first element. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">elem2</td><td>The second element. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>negative if elem1 < elem2, zero if elem1 equals elem2 and positive if elem1 > elem2. If elem2 is a copy of elem1 then the elements are equal. </dd></dl>
</div>
</div>
<a id="a98c9a4e136ad094f7eb6243cc62c13af"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a98c9a4e136ad094f7eb6243cc62c13af">◆ </a></span>element_construct_successor()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void t8_scheme::element_construct_successor </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> </td>
<td class="paramname"><em>tree_class</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> * </td>
<td class="paramname"><em>t</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> * </td>
<td class="paramname"><em>s</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Construct the successor in a uniform refinement of a given element. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">tree_class</td><td>The eclass of the current tree. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">elem1</td><td>The element whose successor should be constructed. </td></tr>
<tr><td class="paramdir">[in,out]</td><td class="paramname">elem2</td><td>The element whose entries will be set. </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="ab976202bc88eceaf814568eb81dc5e7f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab976202bc88eceaf814568eb81dc5e7f">◆ </a></span>element_copy()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void t8_scheme::element_copy </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> </td>
<td class="paramname"><em>tree_class</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> * </td>
<td class="paramname"><em>source</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> * </td>
<td class="paramname"><em>dest</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Copy all entries of <em>source</em> to <em>dest</em>. </p>
<p><em>dest</em> must be an existing element. No memory is allocated by this function. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">tree_class</td><td>The eclass of the current tree. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">source</td><td>The element whose entries will be copied to <em>dest</em>. </td></tr>
<tr><td class="paramdir">[in,out]</td><td class="paramname">dest</td><td>This element's entries will be overwritten with the entries of <em>source</em>. </td></tr>
</table>
</dd>
</dl>
<dl class="section note"><dt>Note</dt><dd><em>source</em> and <em>dest</em> may point to the same element. </dd></dl>
</div>
</div>
<a id="a9be187f0be562e3e2d899f05c9709826"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9be187f0be562e3e2d899f05c9709826">◆ </a></span>element_count_leaves()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="t8_8h.html#a03692467b9ffc84d4d0c37e042679225">t8_gloidx_t</a> t8_scheme::element_count_leaves </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> </td>
<td class="paramname"><em>tree_class</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> * </td>
<td class="paramname"><em>t</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int </td>
<td class="paramname"><em>level</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Count how many leaf descendants of a given uniform level an element would produce. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">tree_class</td><td>The eclass of the current tree. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">t</td><td>The element to be checked. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">level</td><td>A refinement level. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Suppose <em>t</em> is uniformly refined up to level <em>level</em>. The return value is the resulting number of elements (of the given level). If <em>level</em> < element_get_level(t), the return value should be 0.</dd></dl>
<p>Example: If <em>t</em> is a line element that refines into 2 line elements on each level, then the return value is max(0, 2^{<em>level</em> - level(<em>t</em>)}). Thus, if <em>t's</em> level is 0, and <em>level</em> = 3, the return value is 2^3 = 8. </p>
</div>
</div>
<a id="a5fd50d5ce709004a1760cd4a4aeb258f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5fd50d5ce709004a1760cd4a4aeb258f">◆ </a></span>element_debug_print()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void t8_scheme::element_debug_print </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> </td>
<td class="paramname"><em>tree_class</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> * </td>
<td class="paramname"><em>elem</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Print a given element. </p>
<p>For a example for a triangle print the coordinates and the level of the triangle. This function is only available in the debugging configuration. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">tree_class</td><td>The eclass of the current tree. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">elem</td><td>The element to print </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="ad252dd70cdbe7454ab62b3fd79cdbbc7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad252dd70cdbe7454ab62b3fd79cdbbc7">◆ </a></span>element_deinit()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void t8_scheme::element_deinit </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> </td>
<td class="paramname"><em>tree_class</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int </td>
<td class="paramname"><em>length</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> * </td>
<td class="paramname"><em>elem</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Deinitialize an array of allocated elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">tree_class</td><td>The eclass of the current tree. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">length</td><td>The number of elements to be deinitialized. </td></tr>
<tr><td class="paramdir">[in,out]</td><td class="paramname">elems</td><td>On input an array of <em>length</em> many allocated and initialized elements, on output an array of <em>length</em> many allocated, but not initialized elements. </td></tr>
</table>
</dd>
</dl>
<dl class="section note"><dt>Note</dt><dd>Call this function if you called t8_element_init on the element pointers. </dd></dl>
<dl class="section see"><dt>See also</dt><dd>t8_element_init </dd></dl>
</div>
</div>
<a id="abbacc81b501a6b2f842d38f8fe767df0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abbacc81b501a6b2f842d38f8fe767df0">◆ </a></span>element_destroy()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void t8_scheme::element_destroy </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> </td>
<td class="paramname"><em>tree_class</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int </td>
<td class="paramname"><em>length</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> ** </td>
<td class="paramname"><em>elem</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Deallocate an array of elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">tree_class</td><td>The eclass of the current tree. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">length</td><td>The number of elements in the array. </td></tr>
<tr><td class="paramdir">[in,out]</td><td class="paramname">elem</td><td>On input an array of <em>length</em> many allocated element pointers. On output all these pointers will be freed. <em>elem</em> itself will not be freed by this function. </td></tr>
</table>
</dd>
</dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="t8__scheme_8h.html#aebd772f965b1fa5ff5ae10fe8c0950d9" title="Allocate memory for an array of elements of a given class and initialize them.">t8_element_new</a> </dd></dl>
</div>
</div>
<a id="a52773b471db244fade72eb7ef37cef56"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a52773b471db244fade72eb7ef37cef56">◆ </a></span>element_extrude_face()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">int t8_scheme::element_extrude_face </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> </td>
<td class="paramname"><em>tree_class</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> * </td>
<td class="paramname"><em>face</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> * </td>
<td class="paramname"><em>elem</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int </td>
<td class="paramname"><em>root_face</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Given a boundary face inside a root tree's face construct the element inside the root tree that has the given face as a face. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">tree_class</td><td>The eclass of the current tree. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">face</td><td>A face element. </td></tr>
<tr><td class="paramdir">[in,out]</td><td class="paramname">elem</td><td>An allocated element. The entries will be filled with the data of the element that has <em>face</em> as a face and lies within the root tree. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">root_face</td><td>The index of the face of the root tree in which <em>face</em> lies. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The face number of the face of <em>elem</em> that coincides with <em>face</em>. </dd></dl>
</div>
</div>
<a id="a508efc7787bb9ffe830b2f1bef60eec3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a508efc7787bb9ffe830b2f1bef60eec3">◆ </a></span>element_face_get_child_face()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">int t8_scheme::element_face_get_child_face </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> </td>
<td class="paramname"><em>tree_class</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> * </td>
<td class="paramname"><em>elem</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int </td>
<td class="paramname"><em>face</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int </td>
<td class="paramname"><em>face_child</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Given a face of an element and a child number of a child of that face, return the face number of the child of the element that matches the child face. </p>
<pre class="fragment"> x ---- x x x x ---- x
| | | | | | | <-- f
| | | x | x--x
| | | | |
x ---- x x x ---- x
elem face face_child Returns the face number f
</pre><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">tree_class</td><td>The eclass of the current tree. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">elem</td><td>The element. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">face</td><td>Then number of the face. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">face_child</td><td>A number 0 <= <em>face_child</em> < num_face_children, specifying a child of <em>elem</em> that shares a face with <em>face</em>. These children are counted in linear order. This coincides with the order of children from a call to t8_element_children_at_face. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The face number of the face of a child of <em>elem</em> that coincides with <em>face_child</em>. </dd></dl>
</div>
</div>
<a id="a37ff5bcf3a00aea8d313397183e0707a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a37ff5bcf3a00aea8d313397183e0707a">◆ </a></span>element_face_get_parent_face()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">int t8_scheme::element_face_get_parent_face </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> </td>
<td class="paramname"><em>tree_class</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> * </td>
<td class="paramname"><em>elem</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int </td>
<td class="paramname"><em>face</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Given a face of an element return the face number of the parent of the element that matches the element's face. </p>
<p>Or return -1 if no face of the parent matches the face. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">tree_class</td><td>The eclass of the current tree. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">elem</td><td>The element. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">face</td><td>Then number of the face. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>If <em>face</em> of <em>elem</em> is also a face of <em>elem's</em> parent, the face number of this face. Otherwise -1. </dd></dl>
<dl class="section note"><dt>Note</dt><dd>For the root element this function always returns <em>face</em>. </dd></dl>
</div>
</div>
<a id="a78a55c1a68f3fbbe23ea10664f36c9e0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a78a55c1a68f3fbbe23ea10664f36c9e0">◆ </a></span>element_get_ancestor_id()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">int t8_scheme::element_get_ancestor_id </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> </td>
<td class="paramname"><em>tree_class</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="t8__element_8h.html#ac4c605cddc1aad4d36398a773768f738">t8_element_t</a> * </td>
<td class="paramname"><em>elem</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int </td>
<td class="paramname"><em>level</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Compute the ancestor id of an element, that is the child id at a given level. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">tree_class</td><td>The eclass of the current tree. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">elem</td><td>This must be a valid element. </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">level</td><td>A refinement level. Must satisfy <em>level</em> <= elem.level </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The child_id of <em>elem</em> in regard to its <em>level</em> ancestor. </dd></dl>
<dl class="section note"><dt>Note</dt><dd>The ancestor id at elem.level is the same as the child id. </dd></dl>
</div>
</div>
<a id="aab86fe21e3053cdf57c86963c5ad6e33"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aab86fe21e3053cdf57c86963c5ad6e33">◆ </a></span>element_get_boundary_face()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void t8_scheme::element_get_boundary_face </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="t8__eclass_8h.html#a343c2af26e5b41822905b164cab176ec">t8_eclass_t</a> </td>
<td class="paramname"><em>tree_class</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>