ELF>R@@&%   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@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ЉfUH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(u[H0]fDHHuӐtHuHHHH;tHff.UH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(u[H0]fDHHuӐtHuHHHH;tHff.UH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uVH0]fDHHuӐtHoPHuH@HHH;tHATH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$uDH(HtD$9D$tIH11E1HD$(dH+%(H0LA\@HHufHHRxH;IMtoI$H5LPtZHuLIHoHbL1HHP@L8fE1H"DIjfUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(H@]fDHHuϐHt$H|$tD$$Ht$tPH9HOHHNH9uPtHEHuPHHqHHcHEHH;u4H9HOHHNH9uPtHuPHHff.ATL%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@H9HOHHNH9wPtHHwPHGPSafeDownCastvtkObjectBasevtkSpanSpaceIsTypeOfIsAGetResolutionMaxValueGetResolutionMinValueGetResolutionNewInstanceSetResolutionGetCellBatchp_voidGetNumberOfCellBatchesInitTraversalBuildTreeInitializevtkScalarTreevtkObjectUH=Hu]ÐHH=tHH=tH]vtkSpanSpace - organize data according to scalar span space Superclass: vtkScalarTree This is a helper class used to accelerate contouring operations. Given an dataset, it organizes the dataset cells into a 2D binned space, with axes (scalar_min,scalar_max). This so-called span space can then be traversed quickly to find the cells that intersect a particular contour value. 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 lie along a particular row in the span space. These arrays can then be processed separately in parallel. Learn more about span space in these two publications: 1) "A Near Optimal Isosorface Extraction Algorithm Using the Spsn Space." Yarden Livnat et al. and 2) Isosurfacing in SPan Space with Utmost Efficiency." Han-Wei Shen et al. @sa vtkSimpleScalarTree vtkCommonExecutionModelPython.vtkSpanSpaceV.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) -> vtkSpanSpace C++: static vtkSpanSpace *SafeDownCast(vtkObjectBase *o) Standard type related macros and PrintSelf() method. V.NewInstance() -> vtkSpanSpace C++: vtkSpanSpace *NewInstance() Standard type related macros and PrintSelf() method. V.SetResolution(int) C++: virtual void SetResolution(vtkIdType _arg) Set/Get the resolution N of the span space. The span space can be envisioned as a rectangular lattice of NXN buckets (i.e., N rows and N columns), where each bucket stores a list of cell ids. The i-j coordinate of each cell (hence its location in the lattice) is determined from the cell's 2-tuple (smin,smax) scalar range. By default Resolution = 100. V.GetResolutionMinValue() -> int C++: virtual vtkIdType GetResolutionMinValue() Set/Get the resolution N of the span space. The span space can be envisioned as a rectangular lattice of NXN buckets (i.e., N rows and N columns), where each bucket stores a list of cell ids. The i-j coordinate of each cell (hence its location in the lattice) is determined from the cell's 2-tuple (smin,smax) scalar range. By default Resolution = 100. V.GetResolutionMaxValue() -> int C++: virtual vtkIdType GetResolutionMaxValue() Set/Get the resolution N of the span space. The span space can be envisioned as a rectangular lattice of NXN buckets (i.e., N rows and N columns), where each bucket stores a list of cell ids. The i-j coordinate of each cell (hence its location in the lattice) is determined from the cell's 2-tuple (smin,smax) scalar range. By default Resolution = 100. V.GetResolution() -> int C++: virtual vtkIdType GetResolution() Set/Get the resolution N of the span space. The span space can be envisioned as a rectangular lattice of NXN buckets (i.e., N rows and N columns), where each bucket stores a list of cell ids. The i-j coordinate of each cell (hence its location in the lattice) is determined from the cell's 2-tuple (smin,smax) scalar range. By default Resolution = 100. V.Initialize() C++: void Initialize() override; Initialize locator. Frees memory and resets object as appropriate. 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.InitTraversal(float) C++: void InitTraversal(double scalarValue) override; Begin to traverse the cells based on a scalar value. Returned cells will have scalar values that span the scalar value specified. Note this method must be called prior to parallel or serial traversal since it specifies the scalar value to be extracted. 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 10 D X l  EDPa AE OEY B j(EAD`n AAF 0nFAA D`  AABH 8ED@ AG \ED@ AG ED@ AG gFD@ EE tEDP AG MFF0OFDD n ABA DDB<0P}FBA D`  ABBG ED@ AG EDP AK H@ I H@ I      Mvn`P@4 g`t }0 M {  (15Kao{ &,28" 1[" " " " ;gv"O"2g} M";H` Obw4Sv'<Qdt_ZL24PyvtkSpanSpace_StaticNewv_ZL27PyvtkSpanSpace_SafeDownCastP7_objectS0__ZL23PyvtkSpanSpace_IsTypeOfP7_objectS0__ZL18PyvtkSpanSpace_IsAP7_objectS0__ZL36PyvtkSpanSpace_GetResolutionMaxValueP7_objectS0__ZL36PyvtkSpanSpace_GetResolutionMinValueP7_objectS0__ZL28PyvtkSpanSpace_GetResolutionP7_objectS0__ZL26PyvtkSpanSpace_NewInstanceP7_objectS0__ZL28PyvtkSpanSpace_SetResolutionP7_objectS0__ZL19PyvtkSpanSpace_Type_ZL22PyvtkSpanSpace_Methods_GLOBAL__sub_I_vtkSpanSpacePython.cxx_ZL27PyvtkSpanSpace_GetCellBatchP7_objectS0__ZL37PyvtkSpanSpace_GetNumberOfCellBatchesP7_objectS0__ZL28PyvtkSpanSpace_InitTraversalP7_objectS0__ZL24PyvtkSpanSpace_BuildTreeP7_objectS0__ZL25PyvtkSpanSpace_InitializeP7_objectS0_.LC0.LC1.LC2.LC5.LC3.LC4.LC6.LC7.LC8.LC9.LC10.LC11.LC13.LC14.LC15.LC16.LC17.LC18.LC12_ZN12vtkSpanSpace13SetResolutionEx_ZN12vtkSpanSpace21GetResolutionMinValueEv_ZN12vtkSpanSpace21GetResolutionMaxValueEv_ZN12vtkSpanSpace13GetResolutionEv_ZN12vtkSpanSpace3NewEv_ZNK12vtkSpanSpace19NewInstanceInternalEv_ZN13vtkPythonArgs13ArgCountErrorEii_ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRbPyErr_Occurred_ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__stack_chk_fail_ZN12vtkSpanSpace3IsAEPKcstrcmp_ZN13vtkObjectBase8IsTypeOfEPKc_ZN13vtkPythonArgs8GetValueERPcPyLong_FromLong_ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1__GLOBAL_OFFSET_TABLE_PyLong_FromLongLongPyVTKObject_CheckPyVTKObject_GetObjectPyVTKObject_SetFlag_ZN13vtkPythonArgs8GetValueERx_Py_NoneStructPyvtkSpanSpace_ClassNewPyVTKClass_AddPyvtkScalarTree_ClassNewPyType_ReadyPyVTKAddFile_vtkSpanSpacePyDict_SetItemString_Py_Dealloc_ZN13vtkPythonUtil13ManglePointerEPKvPKcPyUnicode_FromString_ZN12vtkSpanSpace12GetCellBatchExRx_ZN13vtkPythonArgs11SetArgValueEix_ZN12vtkSpanSpace22GetNumberOfCellBatchesEv_ZN13vtkPythonArgs8GetValueERd_ZN12vtkSpanSpace13InitTraversalEd_ZN12vtkSpanSpace9BuildTreeEv_ZN12vtkSpanSpace10InitializeEvPyType_TypePyVTKObject_DeletePyVTKObject_ReprPyVTKObject_StringPyObject_GenericGetAttrPyObject_GenericSetAttrPyVTKObject_AsBufferPyVTKObject_TraversePyVTKObject_GetSetPyVTKObject_NewPyObject_GC_Del,`8 9!:;:< "J8}@!>#>:A$>?<%v8B@*=!>#>:A6$;>G?Z<&8B :D2*4@<q'8B:D"*30<a(8B:D *5<B)8B*76!:;(E8FUGd:<* 81BKH:*I*2 < ' !. 6 K< D LN S Mo J~ ! O +. 8Y B| H H : : , Q R S T *I) <Q - 8 B : D U <1 . 8 B V : *I W <@ / 8 B : *I X < 0m8B:*IY<6 P6!>&#+>9$>>K?1Z0[X\]^_`ab8c@d (  1(8@@ HX` oh x` { KP 5`8  a@    ( 8 @ H X ` h0 x    4H\p <``P@  ` @T 0   .symtab.strtab.shstrtab.rela.text.data.bss.text._ZN12vtkSpanSpace13SetResolutionEx.text._ZN12vtkSpanSpace21GetResolutionMinValueEv.text._ZN12vtkSpanSpace21GetResolutionMaxValueEv.text._ZN12vtkSpanSpace13GetResolutionEv.rela.text._ZNK12vtkSpanSpace19NewInstanceInternalEv.rodata.str1.1.rodata._ZN12vtkSpanSpace3IsAEPKc.str1.1.rela.text._ZN12vtkSpanSpace3IsAEPKc.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 @#2 H#3 P#4 X#5 ` #7 l #= @; #&T,T1`1Z    @H#2)2WOR@H#w2  #@XI0#8#@I#@# @I #$ @J#0&,&& &@hN(#!)x $2 h3P