ELF>`o@@&% AVAUATUSH`fnFdH%(HD$X1HHt$HD$HGfnȉD$(fbfD$ Hl$Lw(11HH|$04AHcLl$0EuoMD$$un|$ HH|$0E1HtHD$8H9tHD$XdH+%(H`L[]A\A]A^ÐIcI\fDHfDHH.H|$1E1H|$04HcH|$0IeLE1ZDLH9Ht$ H$EIUHH)HAD$D1HfDAoTHH9uDAt4AtH4HA9~ALLD9} ADDIT$ LL E~ int C++: static vtkTypeBool IsTypeOf(const char *type) Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h. V.SafeDownCast(vtkObjectBase) -> vtkHyperOctreeCursor C++: static vtkHyperOctreeCursor *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkHyperOctreeCursor C++: vtkHyperOctreeCursor *NewInstance() V.GetLeafId() -> int C++: virtual int GetLeafId() Return the index of the current leaf in the data arrays. \pre is_leaf: CurrentIsLeaf() V.CurrentIsLeaf() -> int C++: virtual int CurrentIsLeaf() Is the node pointed by the cursor a leaf? V.CurrentIsRoot() -> int C++: virtual int CurrentIsRoot() Is the node pointed by the cursor the root? V.GetCurrentLevel() -> int C++: virtual int GetCurrentLevel() Return the level of the node pointed by the cursor. \post positive_result: result>=0 V.GetChildIndex() -> int C++: virtual int GetChildIndex() Return the child number of the current node relative to its parent. \pre not_root: !CurrentIsRoot(). \post valid_range: result>=0 && result int C++: virtual int CurrentIsTerminalNode() V.ToRoot() C++: virtual void ToRoot() Move the cursor the root node. \pre can be root \post is_root: CurrentIsRoot() V.ToParent() C++: virtual void ToParent() Move the cursor to the parent of the current node. \pre not_root: !CurrentIsRoot() V.ToChild(int) C++: virtual void ToChild(int child) Move the cursor to child `child' of the current node. \pre not_leaf: !CurrentIsLeaf() \pre valid_child: child>=0 && childGetNumberOfChildren() V.ToSameNode(vtkHyperOctreeCursor) C++: virtual void ToSameNode(vtkHyperOctreeCursor *other) Move the cursor to the same node pointed by `other'. \pre other_exists: other!=0 \pre same_hyperoctree: this->SameTree(other); \post equal: this->IsEqual(other) V.IsEqual(vtkHyperOctreeCursor) -> int C++: virtual int IsEqual(vtkHyperOctreeCursor *other) Is `this' equal to `other'? \pre other_exists: other!=0 \pre same_hyperoctree: this->SameTree(other); V.Clone() -> vtkHyperOctreeCursor C++: virtual vtkHyperOctreeCursor *Clone() Create a copy of `this'. \post results_exists:result!=0 \post same_tree: result->SameTree(this) V.SameTree(vtkHyperOctreeCursor) -> int C++: virtual int SameTree(vtkHyperOctreeCursor *other) Are `this' and `other' pointing on the same hyperoctree? \pre other_exists: other!=0 V.GetIndex(int) -> int C++: virtual int GetIndex(int d) Return the index in dimension `d', as if the node was a cell of a uniform grid of 1<=0 && d=0 && result<(1< int C++: virtual int GetNumberOfChildren() Return the number of children for each node of the tree. \post positive_number: result>0 V.GetDimension() -> int C++: virtual int GetDimension() Return the dimension of the tree. \post positive_result: result>0 V.MoveToNode([int, ...], int) C++: virtual void MoveToNode(int *indices, int level) Move to the node described by its indices in each dimension and at a given level. If there is actually a node or a leaf at this location, Found() returns true. Otherwise, Found() returns false and the cursor moves to the closest parent of the query. It can be the root in the worst case. \pre indices_exists: indices!=0 \pre valid_size: sizeof(indices)==GetDimension() \pre valid_level: level>=0 V.Found() -> int C++: virtual int Found() Did the last call to MoveToNode succeed? HHHDGCC: (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0GNUzPLRx D$FBB A(A0D 0D(A BBBB l!zRx  EDPa AE @ T<EY B W(tEAD`j AAJ H@{ E H@{ E ED@{ AK ED@{ AK ED@{ AK DED@{ AK hED@{ AK ED@{ AK ED@{ AK ED@{ AK ED@{ AK ED@{ AK @ EDP AA dEDP AA EDP AA  EDP AE  EDP AE 0^FAA D`  AABH (gFD@ EE LHFA8hFBD A(D0 (A ABBF X  4 !l 2pp`P@ 0 < t   I y  0 >P^jg``Iw| &;DKTjtz  !&Gg.=_u " <P"<ry  H% 4 I V px         ! 6 I Y _ZL33PyvtkHyperOctreeCursor_MoveToNodeP7_objectS0__ZL33PyvtkHyperOctreeCursor_MoveToNodeP7_objectS0_.cold_ZL35PyvtkHyperOctreeCursor_SafeDownCastP7_objectS0__ZL31PyvtkHyperOctreeCursor_IsTypeOfP7_objectS0__ZL29PyvtkHyperOctreeCursor_ToRootP7_objectS0__ZL31PyvtkHyperOctreeCursor_ToParentP7_objectS0__ZL44PyvtkHyperOctreeCursor_CurrentIsTerminalNodeP7_objectS0__ZL32PyvtkHyperOctreeCursor_GetLeafIdP7_objectS0__ZL28PyvtkHyperOctreeCursor_FoundP7_objectS0__ZL36PyvtkHyperOctreeCursor_CurrentIsLeafP7_objectS0__ZL36PyvtkHyperOctreeCursor_CurrentIsRootP7_objectS0__ZL38PyvtkHyperOctreeCursor_GetCurrentLevelP7_objectS0__ZL36PyvtkHyperOctreeCursor_GetChildIndexP7_objectS0__ZL28PyvtkHyperOctreeCursor_CloneP7_objectS0__ZL42PyvtkHyperOctreeCursor_GetNumberOfChildrenP7_objectS0__ZL35PyvtkHyperOctreeCursor_GetDimensionP7_objectS0__ZL30PyvtkHyperOctreeCursor_ToChildP7_objectS0__ZL31PyvtkHyperOctreeCursor_GetIndexP7_objectS0__ZL33PyvtkHyperOctreeCursor_ToSameNodeP7_objectS0__ZL30PyvtkHyperOctreeCursor_IsEqualP7_objectS0__ZL31PyvtkHyperOctreeCursor_SameTreeP7_objectS0__ZL26PyvtkHyperOctreeCursor_IsAP7_objectS0__ZL34PyvtkHyperOctreeCursor_NewInstanceP7_objectS0__ZL27PyvtkHyperOctreeCursor_Type_ZL30PyvtkHyperOctreeCursor_Methods_ZZ33PyVTKAddFile_vtkHyperOctreeCursorE9constants_ZZ33PyVTKAddFile_vtkHyperOctreeCursorE9constants_0_GLOBAL__sub_I_vtkHyperOctreeCursorPython.cxx.LC0.LC2.LC3.LC4.LC6.LC5.LC7.LC8.LC9.LC10.LC11.LC12.LC13.LC14.LC15.LC16.LC17.LC18.LC19.LC20.LC21.LC22.LC23.LC24.LC25.LC26DW.ref.__gxx_personality_v0_ZN13vtkPythonArgs10GetArgSizeEi_ZN13vtkPythonArgs5ArrayIiEC1El_ZN13vtkPythonArgs13ArgCountErrorEii_ZdaPv_ZN13vtkPythonArgs16PureVirtualErrorEv_ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1__ZN13vtkPythonArgs8GetArrayEPii_ZN13vtkPythonArgs8GetValueERiPyErr_Occurred_ZN13vtkPythonArgs8SetArrayEiPKii_GLOBAL_OFFSET_TABLE__Py_NoneStruct__stack_chk_fail_Unwind_Resume_ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRb_ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase_ZNK20vtkHyperOctreeCursor19NewInstanceInternalEv_ZN9vtkObject3NewEv_ZN20vtkHyperOctreeCursor3IsAEPKcstrcmp_ZN13vtkObjectBase8IsTypeOfEPKc_ZN13vtkPythonArgs8GetValueERPcPyLong_FromLongPyVTKObject_CheckPyVTKObject_GetObjectPyVTKObject_SetFlagPyvtkHyperOctreeCursor_ClassNewPyVTKClass_AddPyvtkObject_ClassNewPyType_ReadyPyVTKAddFile_vtkHyperOctreeCursorPyDict_SetItemString_Py_DeallocPyType_TypePyVTKObject_DeletePyVTKObject_ReprPyVTKObject_StringPyObject_GenericGetAttrPyObject_GenericSetAttrPyVTKObject_AsBufferPyVTKObject_TraversePyVTKObject_GetSetPyVTKObject_NewPyObject_GC_Del()pDEFGH!I<DNEzJKdLyML*OP*0F]+bS{,LTLP-FMZ],eXs.xXL[YP/F9IWHjLv*OP0FI7HJLV*OaP1FIH<LI[PP2FIH,L9[@Po3FIH L) [0 P_ 4 F I H L [ PO 5 F I H L [ P? 6 F I H L [ P/ 7z F I H L [ P 8j F I H L T P9ZFIHL[P:JFqIHL[P;DFaIHKL*OP<TFqIHKL[P=dFIH,SL*OP/>FIH,SL[#PO?FIH, S(L9[CPt@FIZ>*WG,LXZ._XhLy[YPAFIIj*UuV,LT\]^LP)'2,9(A`G'OaY'^b_,d&\[de&[4dGeoeGRV,X&.+X8YB'$. D0Z@pP`#p#(#H#h####f#0gXhijklmn8o@p;#8 (P8#@@ HX#8` hx#j`#z@ #0 # #p # T(p8#@DHX#8`Khx##0 # #  # 0#x (8#0 @H X#X`hx##tP#hQC(1py  0Lhp`P@ 0  @ d  <`0P p4$.symtab.strtab.shstrtab.rela.text.data.bss.rodata.str1.1.rela.text.unlikely.gcc_except_table.rela.text._ZNK20vtkHyperOctreeCursor19NewInstanceInternalEv.rodata._ZN20vtkHyperOctreeCursor3IsAEPKc.str1.1.rela.text._ZN20vtkHyperOctreeCursor3IsAEPKc.rodata.str1.8.rela.text.startup.rela.init_array.rela.data.rel.ro.local.rela.data.rel.rela.data.rel.local.rela.data.rel.local.DW.ref.__gxx_personality_v0.comment.note.GNU-stack.note.gnu.property.rela.eh_frame.group@ #UL #WX #C px@ M#&,12E!@@`0# T"k f@a# 2 <@ax#2@.@a0#(.#@a#9 . 4@aP#Q/ L@(c #`0 [@Hd0#u3p@xj#03,33 3@@j#!8 $C Bi xm