ELF>h@@0/UH@dH%(HD$81HHt$HD$HFHD$$D$ t0H|$1HT$8dH+%(uhH@]@HT$H|$H5|$HtHt+HH5HPtHuH1Huff.fUSHHdH%(HD$81HHt$HD$HFHD$$D$ HD$t6H|$1HT$8dH+%(HH[]DHt$H|$tHl$H=HtHH=uHuHc@HH=tH@ATH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$uDH(HtD$9D$tIH11E1HD$(dH+%(H0LA\@HHufHHRxH;IMtoI$H5LPtZHuLIHoHbL1HHP@L8fE1H"DIjfSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uZH0[fDHHuӐtHuHcHH H;tЉff.fSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uZH0[fDHHuӐtHuHcHHH;tЉff.fSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uZH0[fDHHuӐtHuHcHH(H;tЉff.fSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uZH0[fDHHuӐtHuHcHHH;tЉff.fSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uUH0[fDHHuӐt_XHuHcDHHH;tЉfSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uUH0[fDHHuӐt_PHuHcDHH0H;tЉfSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uUH0[fDHHuӐt_THuHcDHHH;tЉfUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(H@]fDHHuϐHt$ H|$tD$$t$ tA9L9uXtHEuXHHuHHxHEHH;u$9L9uXtuXHHff.UH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(H@]fDHHuϐHt$ H|$tD$$t$ tAN9uPtHEuPHHuHHxHEHH;u$N9uPtuPHHff.ATUSH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uYHD$Ho(Ht!\$ +\$$tJH|$1HT$8dH+%(H@[]A\HHuːHt$H|$tD$$Ld$uXHELH@H;ulH=tLH=u)HeHcZfDLLH=tL븐HЉfATL%H HH5LuLHLA\ATIUHHt HH5LHtHmtH]A\HH]A\AUATUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uPHo(Ht!D$ +D$$tRH|$1HT$8dH+%(H@]A\A]fDHHufLd$HLtLl$LLtD$$H4$uLHEHLHHt?HcHtDHH5HDHLHHT$L@HH UH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uNH0]fDHHuӐu$HHHuH@HfUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(urH@]f.HHuϐHt$H|$tD$$D$u'HEHHuHHHfH8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(uLH8HHuҐu$HHuHH@ff.H8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(uLH8HHuҐu$HHuHH@9L9wXt HwXGXGTN9wPt HwPGPSafeDownCastvtkObjectBasevtkSimpleScalarTreeIsTypeOfNewInstanceGetMaxLevelMinValueGetBranchingFactorMinValueGetMaxLevelMaxValueGetBranchingFactorMaxValueGetBranchingFactorGetMaxLevelGetLevelSetBranchingFactorSetMaxLevelIsAGetCellBatchp_voidGetNumberOfCellBatchesInitTraversalInitializeBuildTreevtkScalarTreevtkObjectUH=Hu]ÐHH=tHH=tH]vtkSimpleScalarTree - organize data according to scalar values (used to accelerate contouring operations) Superclass: vtkScalarTree vtkSimpleScalarTree creates a pointerless binary tree that helps search for cells that lie within a particular scalar range. This object is used to accelerate some contouring (and other scalar-based techniques). The tree consists of an array of (min,max) scalar range pairs per node in the tree. The (min,max) range is determined from looking at the range of the children of the tree node. If the node is a leaf, then the range is determined by scanning the range of scalar data in n cells in the dataset. The n cells are determined by arbitrary selecting cell ids from id(i) to id(i+n), and where n is specified using the BranchingFactor ivar. Note that leaf node i=0 contains the scalar range computed from cell ids (0,n-1); leaf node i=1 contains the range from cell ids (n,2n-1); and so on. The implication is that there are no direct lists of cell ids per leaf node, instead the cell ids are implicitly known. Despite the arbitrary grouping of cells, in practice this scalar tree actually performs quite well due to spatial/data coherence. This class has an API that supports both serial and parallel operation. The parallel API enables the using class to grab arrays (or batches) of cells that potentially intersect the isocontour. These batches can then be processed in separate threads. @sa vtkSpanSpace vtkCommonExecutionModelPython.vtkSimpleScalarTreeV.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Standard type related macros and PrintSelf() method. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard type related macros and PrintSelf() method. V.SafeDownCast(vtkObjectBase) -> vtkSimpleScalarTree C++: static vtkSimpleScalarTree *SafeDownCast(vtkObjectBase *o) Standard type related macros and PrintSelf() method. V.NewInstance() -> vtkSimpleScalarTree C++: vtkSimpleScalarTree *NewInstance() Standard type related macros and PrintSelf() method. V.SetBranchingFactor(int) C++: virtual void SetBranchingFactor(int _arg) Set the branching factor for the tree. This is the number of children per tree node. Smaller values (minimum is 2) mean deeper trees and more memory overhead. Larger values mean shallower trees, less memory usage, but worse performance. V.GetBranchingFactorMinValue() -> int C++: virtual int GetBranchingFactorMinValue() Set the branching factor for the tree. This is the number of children per tree node. Smaller values (minimum is 2) mean deeper trees and more memory overhead. Larger values mean shallower trees, less memory usage, but worse performance. V.GetBranchingFactorMaxValue() -> int C++: virtual int GetBranchingFactorMaxValue() Set the branching factor for the tree. This is the number of children per tree node. Smaller values (minimum is 2) mean deeper trees and more memory overhead. Larger values mean shallower trees, less memory usage, but worse performance. V.GetBranchingFactor() -> int C++: virtual int GetBranchingFactor() Set the branching factor for the tree. This is the number of children per tree node. Smaller values (minimum is 2) mean deeper trees and more memory overhead. Larger values mean shallower trees, less memory usage, but worse performance. V.GetLevel() -> int C++: virtual int GetLevel() Get the level of the scalar tree. This value may change each time the scalar tree is built and the branching factor changes. V.SetMaxLevel(int) C++: virtual void SetMaxLevel(int _arg) Set the maximum allowable level for the tree. V.GetMaxLevelMinValue() -> int C++: virtual int GetMaxLevelMinValue() Set the maximum allowable level for the tree. V.GetMaxLevelMaxValue() -> int C++: virtual int GetMaxLevelMaxValue() Set the maximum allowable level for the tree. V.GetMaxLevel() -> int C++: virtual int GetMaxLevel() Set the maximum allowable level for the tree. V.BuildTree() C++: void BuildTree() override; Construct the scalar tree from the dataset provided. Checks build times and modified time from input and reconstructs the tree if necessary. V.Initialize() C++: void Initialize() override; Initialize locator. Frees memory and resets object as appropriate. V.InitTraversal(float) C++: void InitTraversal(double scalarValue) override; Begin to traverse the cells based on a scalar value. Returned cells will likely have scalar values that span the scalar value specified. V.GetNumberOfCellBatches() -> int C++: vtkIdType GetNumberOfCellBatches() override; Get the number of cell batches available for processing. Note that this methods should be called after InitTraversal(). This is because the number of batches available is typically a function of the isocontour value. Note that the cells found in [0...(NumberOfCellBatches-1)] will contain all the cells potentially containing the isocontour. V.GetCellBatch(int, int) -> (int, ...) C++: const vtkIdType *GetCellBatch(vtkIdType batchNum, vtkIdType &numCells) override; Return the array of cell ids in the specified batch. The method also returns the number of cell ids in the array. Make sure to call InitTraversal() beforehand. HHHDGCC: (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0GNUzRx !0 D Xl!    EDPa AE OEY B j(<EAD`n AAF hgFD@ EE ED@ AG ED@ AG ED@ AG ED@ AG ED@ AG @ED@ AG dED@ AG TEDP AG TEDP AG 0nFAA D`  AABH MFF0 OFDD n ABA DDBT0h}FBA D`  ABBG ED@ AG EDP AK H@ I H@ I ?  ' [  g ` P; @v 0  % U T T n$ &` 0 ] }   6 $&gl qv/{8DXs&1"!" S" """!" 5" e"" .=w"O5K]s M  @O* ? K j      = \        - E Z o   _ZL31PyvtkSimpleScalarTree_StaticNewv_ZL34PyvtkSimpleScalarTree_SafeDownCastP7_objectS0__ZL30PyvtkSimpleScalarTree_IsTypeOfP7_objectS0__ZL33PyvtkSimpleScalarTree_NewInstanceP7_objectS0__ZL41PyvtkSimpleScalarTree_GetMaxLevelMinValueP7_objectS0__ZL48PyvtkSimpleScalarTree_GetBranchingFactorMinValueP7_objectS0__ZL41PyvtkSimpleScalarTree_GetMaxLevelMaxValueP7_objectS0__ZL48PyvtkSimpleScalarTree_GetBranchingFactorMaxValueP7_objectS0__ZL40PyvtkSimpleScalarTree_GetBranchingFactorP7_objectS0__ZL33PyvtkSimpleScalarTree_GetMaxLevelP7_objectS0__ZL30PyvtkSimpleScalarTree_GetLevelP7_objectS0__ZL40PyvtkSimpleScalarTree_SetBranchingFactorP7_objectS0__ZL33PyvtkSimpleScalarTree_SetMaxLevelP7_objectS0__ZL25PyvtkSimpleScalarTree_IsAP7_objectS0__ZL26PyvtkSimpleScalarTree_Type_ZL29PyvtkSimpleScalarTree_Methods_GLOBAL__sub_I_vtkSimpleScalarTreePython.cxx_ZL34PyvtkSimpleScalarTree_GetCellBatchP7_objectS0__ZL44PyvtkSimpleScalarTree_GetNumberOfCellBatchesP7_objectS0__ZL35PyvtkSimpleScalarTree_InitTraversalP7_objectS0__ZL32PyvtkSimpleScalarTree_InitializeP7_objectS0__ZL31PyvtkSimpleScalarTree_BuildTreeP7_objectS0_.LC0.LC1.LC2.LC5.LC3.LC4.LC6.LC7.LC8.LC9.LC10.LC11.LC12.LC13.LC14.LC15.LC16.LC18.LC19.LC20.LC21.LC22.LC23.LC17_ZN19vtkSimpleScalarTree18SetBranchingFactorEi_ZN19vtkSimpleScalarTree26GetBranchingFactorMinValueEv_ZN19vtkSimpleScalarTree26GetBranchingFactorMaxValueEv_ZN19vtkSimpleScalarTree18GetBranchingFactorEv_ZN19vtkSimpleScalarTree8GetLevelEv_ZN19vtkSimpleScalarTree11SetMaxLevelEi_ZN19vtkSimpleScalarTree19GetMaxLevelMinValueEv_ZN19vtkSimpleScalarTree19GetMaxLevelMaxValueEv_ZN19vtkSimpleScalarTree11GetMaxLevelEv_ZN19vtkSimpleScalarTree3NewEv_ZNK19vtkSimpleScalarTree19NewInstanceInternalEv_ZN13vtkPythonArgs13ArgCountErrorEii_ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRbPyErr_Occurred_ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__stack_chk_fail_ZN19vtkSimpleScalarTree3IsAEPKcstrcmp_ZN13vtkObjectBase8IsTypeOfEPKc_ZN13vtkPythonArgs8GetValueERPcPyLong_FromLong_ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1__GLOBAL_OFFSET_TABLE_PyVTKObject_CheckPyVTKObject_GetObjectPyVTKObject_SetFlag_ZN13vtkPythonArgs8GetValueERi_Py_NoneStructPyvtkSimpleScalarTree_ClassNewPyVTKClass_AddPyvtkScalarTree_ClassNewPyType_ReadyPyVTKAddFile_vtkSimpleScalarTreePyDict_SetItemString_Py_Dealloc_ZN13vtkPythonArgs8GetValueERx_ZN13vtkPythonUtil13ManglePointerEPKvPKcPyUnicode_FromString_ZN19vtkSimpleScalarTree12GetCellBatchExRx_ZN13vtkPythonArgs11SetArgValueEixPyLong_FromLongLong_ZN19vtkSimpleScalarTree22GetNumberOfCellBatchesEv_ZN13vtkPythonArgs8GetValueERd_ZN19vtkSimpleScalarTree13InitTraversalEd_ZN19vtkSimpleScalarTree10InitializeEv_ZN19vtkSimpleScalarTree9BuildTreeEvPyType_TypePyVTKObject_DeletePyVTKObject_ReprPyVTKObject_StringPyObject_GenericGetAttrPyObject_GenericSetAttrPyVTKObject_AsBufferPyVTKObject_TraversePyVTKObject_GetSetPyVTKObject_NewPyObject_GC_Del,)`L*M+NONP ,JL}T+R-RNU.RSP/_LV*KJ+NOXY%Z4NSP0LV NU2*G?Pq1LVNU"*B/Pa2LVNU*HPQ3LVNU*CPA4LVNU*DP!5nLVNU*IP 6N Lq V N U *E P 7: La V{ [ N *\ *A PA 8 L V [ N *\> *Fp P 9 L1 VK Tn *Qw +| R - R N U . R S P '+(^'$_.'3`O]^+ib:L9V\dpdNN;efgh*\ P1<~LVNijP=jLVkN*\lP >mLVN*\mP?MLqVN*\nPJcJ+R&-+R9.>RKS@' o0pXqrstuvw8x@y/ ( 8p@HX`8hx (XP` 0   ( ( 8 @DH`XH`sh@x81&` (8` 4H\p     @l`P@0  Dh    $@X l.symtab.strtab.shstrtab.rela.text.data.bss.text._ZN19vtkSimpleScalarTree18SetBranchingFactorEi.text._ZN19vtkSimpleScalarTree26GetBranchingFactorMinValueEv.text._ZN19vtkSimpleScalarTree26GetBranchingFactorMaxValueEv.text._ZN19vtkSimpleScalarTree18GetBranchingFactorEv.text._ZN19vtkSimpleScalarTree8GetLevelEv.text._ZN19vtkSimpleScalarTree11SetMaxLevelEi.text._ZN19vtkSimpleScalarTree19GetMaxLevelMinValueEv.text._ZN19vtkSimpleScalarTree19GetMaxLevelMaxValueEv.text._ZN19vtkSimpleScalarTree11GetMaxLevelEv.rela.text._ZNK19vtkSimpleScalarTree19NewInstanceInternalEv.rodata.str1.1.rodata._ZN19vtkSimpleScalarTree3IsAEPKc.str1.1.rela.text._ZN19vtkSimpleScalarTree3IsAEPKc.rodata.str1.8.rela.text.startup.rela.init_array.rela.data.rel.rela.data.rel.local.comment.note.GNU-stack.note.gnu.property.rela.eh_frame.group@@-A@H-B@P-C@X-D@`-E@h-F@p-G@x-H@-I@ -K@ -Q @ K- &T,T1`!f  ?!m    0 @([-C29;R2tO@@[-2p+@[0- +@\-"+ @0\ -$@-` @P]-&0/,// 6/1@`b-+4p .A x? xeG