( y y__text__TEXT7{__gcc_except_tab__TEXT7:__data__DATA8`;__cstring__TEXT@@*C__compact_unwind__LDjm B__eh_frame__TEXTp(s0 h2  8x P99;IUHH=H5H'@H uHH=H]ÐUH]fDUHSPHH=H5H?H uHH=H5?HHt H tH[]H=H[]fUHAVSH0HuH@HEЋFEHEHEH}ȃu\Hut^H]H=>HAtH=hiHt HLcHuL1H0[A^]ÐUHAWAVSH(HuH@HED~D}HG]ԉ]؅yHHLw(HEMA)AuQHuH}t|}L}tYH=>LAtOH={hLtHE]UUy HHtiH_(Ht`HuH}tJEMU]emHHuHHH5=1H H H;MuHĈ[]1HUHAWAVAUATSHXHuH>HEFEHGM̉MЅyHHYL(H}E11AC6HcH}LmEIcI\IDMQE+ẼH}LDEEArKDH9JI91D)HHLHtfDItH4HHuHnDILH ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9u H}E1H}HEH9KPE1DHpHHH‰уH s1oHH)1@ADALLAD AL0D L0AD@ALPD@LPfAD`ALpfD`LpHHuHt8HHf.fADALfD H HuL9]LLE~<1DADf.u z HI9uHuH}1LDHt,E1H}HEH9t HtLHX[A\A]A^A_]L%I$H}HEH9uHH}HEH9t HtH UHAWAVAUATSHh^HG)Ѓ\HuH*<HE]ȉỦUЅyHH]H_(H0H}HuH}HpH}HxH}HuH}HuH}HuEpx]emHHrL%I$HuH";HE]ȉỦUЅyHHbL(H}E11AC6HcH}LmEIcI\IDMBE+ẼH}LDEEArKDH9JI91HHLLHtf.At4HHuHafDAL ALLALLAL L ALLALLALLALLHI9uH59E1]H}+1HE1DHpHHH‰уHs1iHH)1ADALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpH HuHt)HHADALD H HuL9iLLE~91AD.u z HI9uHuH}1LDHt,E1H}HEH9t HtLHh[A\A]A^A_]L%I$H}HEH9uHH}HEH9t HtH UHAWAVAUATSHXHuH9HEFEHGM̉MЅyHHYL(H}E11AC6HcH}LmEIcI\IDMQE+ẼH}LDEEArKDH9JI91D)HHLHtfDItH4HHuHnDILH ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9u H}E1H}HEH9KPE1DHpHHH‰уH s1oHH)1@ADALLAD AL0D L0AD@ALPD@LPfAD`ALpfD`LpHHuHt8HHf.fADALfD H HuL9]LLE~<1DADf.u z HI9uHuH}1LDHt,E1H}HEH9t HtLHX[A\A]A^A_]L%I$H}HEH9uHH}HEH9t HtH UHAWAVSH(HuHI7HEDvDuHG]܉]y HHtL(MtD9uHt1%H}111I0LHHH([A^A_]UHAWAVSH(HuH|7HEDvDuHG]܉]y HHtL(MtD9uHt1%H}111IHLHHH([A^A_]UHAWAVSHXHuH17HEЋFEHGM܉MyHHLw(H}E11HcH}MtwE+E܃uDL}H}LtSLLHu,L=IH}HEH9u7?H}ȾE1H}HEH9uE1H}HEH9t HtLHX[A^A_]E1;HH}HEH9t HtH UHAWAVSHXHuH6HEЋFEHGM܉MyHHLw(H}E11HcH}MtwE+E܃uDL}H}LtSLLHu,L=IH}HEH9u7?H}ȾE1H}HEH9uE1H}HEH9t HtLHX[A^A_]E1;HH}HEH9t HtH UHAWAVSH(HuH5HEDvDuHG]܉]y HHtL(MtD9uHt1%H}111I`LHHH([A^A_]UHAWAVSH(HuH"6HEDvDuHG]܉]y HHtL(MtD9uHt1%H}111IxLHHH([A^A_]UHAWAVSHXHuH5HEЋFEHGM܉MyHHLw(H}E11HcH}MtwE+E܃uDL}H}LtSLLHu,L=IH}HEH9u7?H}ȾE1H}HEH9uE1H}HEH9t HtLHX[A^A_]E1;HH}HEH9t HtH UHAWAVSHXHuHT5HEЋFEHGM܉MyHHLw(H}E11HcH}MtwE+E܃uDL}H}LtSLLHu,L=IH}HEH9u7?H}ȾE1H}HEH9uE1H}HEH9t HtLHX[A^A_]E1;HH}HEH9t HtH UHAWAVSH(HuH4HED~D}HG]ԉ]؅y HHtgLw(Mt^A)AuBHuH}tD}utHA9tAILHu6H}1H([A^A_]ILHuHHUHAVSH HuH4HEDvDuHG]]y HHt#H(HtD9uEt%Ht*11H}111 HHuHcHHH [A^]@UHAVSH HuH4HEDvDuHG]]y HHt#H(HtD9uEt%Ht*11H}111 HHuHcHHH [A^]@UHAVSH HuHQ5HEDvDuHG]]y HHt#H(HtD9uEt%Ht*11H}111 HHuHcHHH [A^]@UHAWAVSH(HuH6HED~D}HG]ԉ]؅y HHtgLw(Mt^A)AuBHuH}tD}utHA9tAILHu6H}1H([A^A_]ILHuHHUHAWAVSH(HuH6HED~D}HG]ԉ]؅y HHtgLw(Mt^A)AuBHuH}tD}utHA9tAILHu6H}1H([A^A_]ILHuHHUHAWAVSH(HuH<7HEDvDuHG]ԉ]؅yHHL(MtwA)Au[H5H}HU}tTIH5lH}HU}t7LLHHuHHH}1H([A^A_]DUHAVSH HuH6HEDvDuHG]]y HHtH(HtD9uHt1H}111 HHHH [A^]UHAVSH HuH6HEDvDuHG]]y HHt$H(HtD9uEt&HHt+12H}111!HHHuHHHH [A^]fUHAWAVSH(HuH6HED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5mH}HU}t4LHHuHHH}1H([A^A_]fUHAVSH HuHD6HEDvDuHG]]y HHt$H(HtD9uEt&HHt+12H}111!HHHuHHHH [A^]fUHAWAVSH(HuH 6HED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5H}HU}t4LHHuHHH}1H([A^A_]fUHAVSH HuH5HEDvDuHG]]y HHt$H(HtD9uEt&HHt+12H}111!HHHuHHHH [A^]fUHAWAVSH(HuH5HED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5H}HU}t4LHHuHHH}1H([A^A_]fUHAWAVSHXHuH+5HED~D}HG]ԉ]؅yHHLw(MA)H}AHuH}HuH}HuH}HuH}HutpH}Hut_H}HutNEMU]emuLHuHc1HX[A^A_]E1MUHAWAVSHHHuHT5HED~D}HG]ԉ]؅yHHLw(MA)H}AHuH}HutwH}HutfH}HutUH}HutDEMU]uLHuHc1HH[A^A_]E1M=UHAWAVSH(HuH5HEDvDuHG]ԉ]؅y HHtwL(MtnA)AuRH5@H}HU}tKIHuH}t7ULLHuHcH}1H([A^A_]fUHAWAVAUATSHhHuH6HEFEHGMĉMȅyHHL(EH}AC6HcHpLp1EIcMdLDME+EărH}H5?H}HU}HH}HugEM9}H}HuHEM9}H}LD'HDEArIDI9II91)HHHHt f.DI|IHXHu&HXHuHXHuEMUuHEHEHHuH_4HE]UĉUȅyHHL(H}AC$HcHXLX1EIcM,LDM[E+Eă7H}Hu5H}Hu H}Hu H}LDH}HuDEArII9 IDI91)HHHHtI4ItHHuHI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u:H5212H}1HXH`H9t HtHHĈ[A\A]A^A_]1HTE1؃HpHHH‰уH s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt+HHADA ADALH HuH9;}EMUUtLLELLEE~;1AfA.Du z HH9uHuH}LDHcEHHXH`H9TYHHXH`H9t HtH f.fUHAWAVSHHHuH2HED~D}HG]܉]yHHLw(Mt}A)H}AuaHutcH}HutRH}HutAEMULEHuE1HH[A^A_]E1MjUHAWAVSH(HuH33HED~D}HG]ԉ]؅y HHtWLw(MtNA)Au2HuH}t4uLHuHHH}1H([A^A_]fUHAWAVSH(HuH2HED~D}HG]ԉ]؅y HHtWLw(MtNA)Au2HuH}t4uLHuHHH}1H([A^A_]oooSfSfSfSfD"c  z KJ@HDm@AABBCCCDDDKDDDEEFF#G5GGG"I,III{KKLLTMaMMM=NJNNNOOP,PPP}QQ,R2RRRGTPTUU.W7WXX6YGYYYZZZZ[[~[[[[S\a\]]W_h_KaZaccee>fUfCh_hiiDjUjvtkKdNodevtkCommonDataModelPython.vtkKdNodevtkKdNode - This class represents a single spatial region in an 3D axis aligned binary spatial partitioning. Superclass: vtkObject It is assumed the region bounds some set of points. Regions are represented as nodes in a binary tree. @sa vtkKdTree vtkOBSPCuts IsTypeOfV.IsTypeOf(string) -> 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. IsAV.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. SafeDownCastV.SafeDownCast(vtkObjectBase) -> vtkKdNode C++: static vtkKdNode *SafeDownCast(vtkObjectBase *o) NewInstanceV.NewInstance() -> vtkKdNode C++: vtkKdNode *NewInstance() SetDimV.SetDim(int) C++: virtual void SetDim(int _arg) Set/Get the dimension along which this region is divided. (0 - x, 1 - y, 2 - z, 3 - leaf node (default)). GetDimV.GetDim() -> int C++: virtual int GetDim() Set/Get the dimension along which this region is divided. (0 - x, 1 - y, 2 - z, 3 - leaf node (default)). GetDivisionPositionV.GetDivisionPosition() -> float C++: virtual double GetDivisionPosition() Get the location of the division plane along the axis the region is divided. See also GetDim(). The result is undertermined if this node is not divided (a leaf node). SetNumberOfPointsV.SetNumberOfPoints(int) C++: virtual void SetNumberOfPoints(int _arg) Set/Get the number of points contained in this region. GetNumberOfPointsV.GetNumberOfPoints() -> int C++: virtual int GetNumberOfPoints() Set/Get the number of points contained in this region. SetBoundsV.SetBounds(float, float, float, float, float, float) C++: void SetBounds(double x1, double x2, double y1, double y2, double z1, double z2) V.SetBounds((float, float, float, float, float, float)) C++: void SetBounds(const double b[6]) Set/Get the bounds of the spatial region represented by this node. Caller allocates storage for 6-vector in GetBounds. GetBoundsV.GetBounds([float, ...]) C++: void GetBounds(double *b) Set/Get the bounds of the spatial region represented by this node. Caller allocates storage for 6-vector in GetBounds. SetDataBoundsV.SetDataBounds(float, float, float, float, float, float) C++: void SetDataBounds(double x1, double x2, double y1, double y2, double z1, double z2) V.SetDataBounds([float, ...]) C++: void SetDataBounds(float *v) Set/Get the bounds of the points contained in this spatial region. This may be smaller than the bounds of the region itself. Caller allocates storage for 6-vector in GetDataBounds. GetDataBoundsV.GetDataBounds([float, ...]) C++: void GetDataBounds(double *b) Set/Get the bounds of the points contained in this spatial region. This may be smaller than the bounds of the region itself. Caller allocates storage for 6-vector in GetDataBounds. GetMinBoundsV.GetMinBounds() -> (float, float, float) C++: double *GetMinBounds() Get a pointer to the 3 bound minima (xmin, ymin and zmin) or the 3 bound maxima (xmax, ymax, zmax). Don't free this pointer. GetMaxBoundsV.GetMaxBounds() -> (float, float, float) C++: double *GetMaxBounds() SetMinBoundsV.SetMinBounds((float, ...)) C++: void SetMinBounds(const double *mb) Set the xmin, ymin and zmin value of the bounds of this region SetMaxBoundsV.SetMaxBounds((float, ...)) C++: void SetMaxBounds(const double *mb) Set the xmax, ymax and zmax value of the bounds of this region GetMinDataBoundsV.GetMinDataBounds() -> (float, float, float) C++: double *GetMinDataBounds() Get a pointer to the 3 data bound minima (xmin, ymin and zmin) or the 3 data bound maxima (xmax, ymax, zmax). Don't free this pointer. GetMaxDataBoundsV.GetMaxDataBounds() -> (float, float, float) C++: double *GetMaxDataBounds() SetMinDataBoundsV.SetMinDataBounds((float, ...)) C++: void SetMinDataBounds(const double *mb) Set the xmin, ymin and zmin value of the bounds of this data within this region SetMaxDataBoundsV.SetMaxDataBounds((float, ...)) C++: void SetMaxDataBounds(const double *mb) Set the xmax, ymax and zmax value of the bounds of this data within this region SetIDV.SetID(int) C++: virtual void SetID(int _arg) Set/Get the ID associated with the region described by this node. If this is not a leaf node, this value should be -1. GetIDV.GetID() -> int C++: virtual int GetID() Set/Get the ID associated with the region described by this node. If this is not a leaf node, this value should be -1. GetMinIDV.GetMinID() -> int C++: virtual int GetMinID() If this node is not a leaf node, there are leaf nodes below it whose regions represent a partitioning of this region. The IDs of these leaf nodes form a contigous set. Set/Get the range of the IDs of the leaf nodes below this node. If this is already a leaf node, these values should be the same as the ID. GetMaxIDV.GetMaxID() -> int C++: virtual int GetMaxID() If this node is not a leaf node, there are leaf nodes below it whose regions represent a partitioning of this region. The IDs of these leaf nodes form a contigous set. Set/Get the range of the IDs of the leaf nodes below this node. If this is already a leaf node, these values should be the same as the ID. SetMinIDV.SetMinID(int) C++: virtual void SetMinID(int _arg) If this node is not a leaf node, there are leaf nodes below it whose regions represent a partitioning of this region. The IDs of these leaf nodes form a contigous set. Set/Get the range of the IDs of the leaf nodes below this node. If this is already a leaf node, these values should be the same as the ID. SetMaxIDV.SetMaxID(int) C++: virtual void SetMaxID(int _arg) If this node is not a leaf node, there are leaf nodes below it whose regions represent a partitioning of this region. The IDs of these leaf nodes form a contigous set. Set/Get the range of the IDs of the leaf nodes below this node. If this is already a leaf node, these values should be the same as the ID. AddChildNodesV.AddChildNodes(vtkKdNode, vtkKdNode) C++: void AddChildNodes(vtkKdNode *left, vtkKdNode *right) Add the left and right children. DeleteChildNodesV.DeleteChildNodes() C++: void DeleteChildNodes() Delete the left and right children. GetLeftV.GetLeft() -> vtkKdNode C++: virtual vtkKdNode *GetLeft() Set/Get a pointer to the left child of this node. SetLeftV.SetLeft(vtkKdNode) C++: void SetLeft(vtkKdNode *left) Set/Get a pointer to the left child of this node. GetRightV.GetRight() -> vtkKdNode C++: virtual vtkKdNode *GetRight() Set/Get a pointer to the right child of this node. SetRightV.SetRight(vtkKdNode) C++: void SetRight(vtkKdNode *right) Set/Get a pointer to the right child of this node. GetUpV.GetUp() -> vtkKdNode C++: virtual vtkKdNode *GetUp() Set/Get a pointer to the parent of this node. SetUpV.SetUp(vtkKdNode) C++: void SetUp(vtkKdNode *up) Set/Get a pointer to the parent of this node. IntersectsBoxV.IntersectsBox(float, float, float, float, float, float, int) -> int C++: int IntersectsBox(double x1, double x2, double y1, double y2, double z1, double z2, int useDataBounds) Return 1 if this spatial region intersects the axis-aligned box given by the bounds passed in. Use the possibly smaller bounds of the points within the region if useDataBounds is non-zero. IntersectsSphere2V.IntersectsSphere2(float, float, float, float, int) -> int C++: int IntersectsSphere2(double x, double y, double z, double rSquared, int useDataBounds) Return 1 if this spatial region intersects a sphere described by it's center and the square of it's radius. Use the possibly smaller bounds of the points within the region if useDataBounds is non-zero. IntersectsRegionV.IntersectsRegion(vtkPlanesIntersection, int) -> int C++: int IntersectsRegion(vtkPlanesIntersection *pi, int useDataBounds) A vtkPlanesIntersection object represents a convex 3D region bounded by planes, and it is capable of computing intersections of boxes with itself. Return 1 if this spatial region intersects the spatial region described by the vtkPlanesIntersection object. Use the possibly smaller bounds of the points within the region if useDataBounds is non-zero. IntersectsCellV.IntersectsCell(vtkCell, int, int, [float, ...]) -> int C++: int IntersectsCell(vtkCell *cell, int useDataBounds, int cellRegion=-1, double *cellBounds=nullptr) Return 1 if the cell specified intersects this region. If you already know the ID of the region containing the cell's centroid, provide that as an argument. If you already know the bounds of the cell, provide that as well, in the form of xmin,xmax,ymin,ymax,zmin, zmax. Either of these may speed the calculation. Use the possibly smaller bounds of the points within the region if useDataBounds is non-zero. ContainsBoxV.ContainsBox(float, float, float, float, float, float, int) -> int C++: int ContainsBox(double x1, double x2, double y1, double y2, double z1, double z2, int useDataBounds) Return 1 if this spatial region entirely contains a box specified by it's bounds. Use the possibly smaller bounds of the points within the region if useDataBounds is non-zero. ContainsPointV.ContainsPoint(float, float, float, int) -> int C++: int ContainsPoint(double x, double y, double z, int useDataBounds) Return 1 if this spatial region entirely contains the given point. Use the possibly smaller bounds of the points within the region if useDataBounds is non-zero. GetDistance2ToBoundaryV.GetDistance2ToBoundary(float, float, float, int) -> float C++: double GetDistance2ToBoundary(double x, double y, double z, int useDataBounds) V.GetDistance2ToBoundary(float, float, float, [float, ...], int) -> float C++: double GetDistance2ToBoundary(double x, double y, double z, double *boundaryPt, int useDataBounds) Calculate the distance squared from any point to the boundary of this region. Use the boundary of the points within the region if useDataBounds is non-zero. GetDistance2ToInnerBoundaryV.GetDistance2ToInnerBoundary(float, float, float) -> float C++: double GetDistance2ToInnerBoundary(double x, double y, double z) Calculate the distance from the specified point (which is required to be inside this spatial region) to an interior boundary. An interior boundary is one that is not also an boundary of the entire space partitioned by the tree of vtkKdNode's. PrintNodeV.PrintNode(int) C++: void PrintNode(int depth) For debugging purposes, print out this node. PrintVerboseNodeV.PrintVerboseNode(int) C++: void PrintVerboseNode(int depth) For debugging purposes, print out this node. vtkObjectvtkObjectBasevtkPlanesIntersectionvtkCellOP `!a!`!`a@!!a!@ IXA7p XXA8IXA,8 aa`9aAD89aAX8aa 9aAl8`9aA8a!0!!ap aP!a0"!"!p#a0$!$a%!P&a'Xap( a)a`*XA8@.Xa/a0XA85a6a@7azRx $OAC $D AC $lAC B$`AC G$AC I$АAC G$ XAC G$40AC I$\AC G$pAC G$AC I$AC G$HAC H$$AC I$LxAC I$tpAC I$AC I$AC I$AC G$ AC G$<AC G$d0AC I$AC I$AC I$XAC G$AC G$,HAC I$TAC G$|hAC I$AC G$AC I$ XAC I$X AC I$DPAC I$lطXAC I$AC I$AC I$AC I$ 8AC IzPLRx 4$ВIAC M4\XoAC M4I[AC M,h9;AC I,x9AC I,,ȡ9AC I,\آ9AC I4˿AC M4AC P7W-7Q=7<-7o-7`-~7Y-T7-7W-7Q= 7<-7{-6`-6Y-6p6W-_6=-P6<-F6v-+6_-6_- 6_-5Y-55R-5-E5=-25<--5a-5<-4t-4t-3-3W-3V-32`-2\-2_-v2_-a2_-%2Z-2U-1Y-11=-1<-1u-1`-q1_-Y1_-A1_-1Y-00W-r0>-e0<-^0h-@0`-/0_-0_- 0_-/Y-/y/W-h/>-[/<-T/d-'/`-/_-/_-._-._-._-._-~.Y-T.:.R-2.-->----<--a--<-e-l-X-l-+\-o+`-P+`-6+X-)++W-*Z-*U-*Y-x*M*W-8*>-+*<-$*n-*`-)X-))Y-)q)W-`)>-S)<-L)r-))`-)_-)_-(_-(_-(Y-(I(W-8(>-+(<-$(i-'`-'_-'_-'_-'_-'_-'_-N'Y-$'&W-&Q=&<-&x-&X-&&Y-d&;&c-.&<-&W-&<-%Y-%%W-n%Q=b%<-]%z-L%X-?%%Y-$$c-$<-$W-$<-l$Y-B$$W-#Q=#<-#y-#X-##Y-#[#c-N#<-;#W-##<-"Y-""Q="W-"<-"m-l"Y-B""W-"Q=!<-!g-!X-!!X-!!Y-d!G!Q=;!<-!W-!<- `- Y- g Q=[ <-= W-# <-`-Y-y>-l<-ZW-B<-Y->-<-W-<-lY-B>- <-W-<-Y-wQ=k<-MW-3<-`-Y-R--[-/W- Q=<-p-\-Z-U-Y-tSR-K--W-Q=<-q-\-Z-zU-\Y-4T-W-<-Y-dT-QW-9<-Y-R---oW-JQ=><-9e-*\-Z-U-Y-R--[-/W- Q=<-f-\-Z-U-Y-tDT-1W-<-Y-T-W-y<-^Y-4R- -Q=-<-a-<-`}-\W-{\-AZ-.U-Y-R--Q=t-U<-Pb-:<-j-*W-V-9]-[-U-Y-Q=<-k-[_-F_-1_-_-_- _- Y- c R-[ -. Q= - <- a- <- ~- W- \- Z-~ U-` Y-8  - = V-  Q= <- |- \-} Y-g 1 _- _- _-_-_-_-Y-O=)>-<- W-<-Y-Q={<-]W-C<-`-Y-=-<-nW-V<-Ls-,Y->-<-W-<-|Y-R7Q=+<- W-<-`-Y-tLL-/H-#F-c-<-W-<-Y-rSc-F<-3W-<-X->-<-lW-WS-K-C2-*^-Y-W->-r<-jS-^-VE-=.^-P-;-B-O-D-zslVw-IBB-=6/O-'!D-8(8 76432xh0`XH/@8(. -,+*)xh(`XH'@8(& %$#"!xh `XH@8( xh`XH@8(     xh `XH@8( @?8JINEA@MXK0GC`@80 `@ `@ xp`XP@ `@ `@ CM^8 :LP<` ` ` @d Q  b @  7f p 8 e,8  7  `RD8 ?X8 7   l8 `82V0 zp P! 0"+ " p# 0$ $@ % P& 'p( )`*86 @. /0x85c6@7`%{=$QIh;Vqu9e_~YAyX'LdqL1=i~_PyType_Ready_PyvtkObject_ClassNew_PyvtkKdNode_ClassNew_PyVTKObject_New__ZL21PyvtkKdNode_StaticNewv__ZdaPv__ZN9vtkKdNode3NewEv__ZN9vtkKdNode16DeleteChildNodesEv__ZN9vtkKdNode19GetDivisionPositionEv_PyVTKObject_GetSet__Py_NoneStruct_PyVTKObject_GetObject__ZL19PyvtkKdNode_Methods_PyObject_GenericSetAttr_PyObject_GenericGetAttr_PyVTKObject_Repr_PyVTKObject_AsBuffer_strcmp___stack_chk_fail_PyObject_GC_Del__ZN13vtkPythonArgs5ArrayIfEC1El__ZN13vtkPythonArgs5ArrayIdEC1El_PyVTKObject_Check__ZN9vtkKdNode16IntersectsRegionEP21vtkPlanesIntersectioni__ZN13vtkPythonArgs13ArgCountErrorEii__ZN13vtkPythonArgs8GetArrayEPfi__ZN13vtkPythonArgs8SetArrayEiPKfi__ZN9vtkKdNode13IntersectsBoxEddddddi__ZN9vtkKdNode11ContainsBoxEddddddi__ZN9vtkKdNode17IntersectsSphere2Eddddi__ZN9vtkKdNode22GetDistance2ToBoundaryEdddi__ZN9vtkKdNode13ContainsPointEdddi__ZN9vtkKdNode22GetDistance2ToBoundaryEdddPdi__ZN13vtkPythonArgs8GetArrayEPdi__ZN13vtkPythonArgs8SetArrayEiPKdi__ZN13vtkPythonArgs10BuildTupleEPKdi__ZN13vtkPythonArgs8GetValueERi__ZN13vtkPythonArgs10GetArgSizeEi__ZN9vtkKdNode9PrintNodeEi__ZN9vtkKdNode16PrintVerboseNodeEi_PyLong_FromLong_PyDict_SetItemString_PyVTKObject_String_PyVTKObject_SetFlag__ZN9vtkKdNode13SetDataBoundsEPf_PyVTKObject_Delete_PyVTKObject_Traverse__ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase_PyType_Type__ZL16PyvtkKdNode_Type__Unwind_Resume_PyFloat_FromDouble_PyVTKAddFile_vtkKdNode___stack_chk_guard_PyErr_Occurred__ZN9vtkKdNode9SetBoundsEdddddd__ZN9vtkKdNode13SetDataBoundsEdddddd__ZN9vtkKdNode27GetDistance2ToInnerBoundaryEddd_PyVTKClass_Add__ZN13vtkPythonArgs8GetValueERd__ZN9vtkKdNode14IntersectsCellEP7vtkCelliiPd__ZNK9vtkKdNode9GetBoundsEPd__ZNK9vtkKdNode13GetDataBoundsEPd__ZN9vtkKdNode12SetMaxBoundsEPKd__ZN9vtkKdNode12SetMinBoundsEPKd__ZN9vtkKdNode16SetMaxDataBoundsEPKd__ZN9vtkKdNode16SetMinDataBoundsEPKd__Py_Dealloc__ZN13vtkPythonArgs8GetValueERPc__ZN13vtkPythonArgs13ArgCountErrorEiPKc__ZN13vtkObjectBase8IsTypeOfEPKc__ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRb__ZN9vtkKdNode8SetRightEPS___ZN9vtkKdNode7SetLeftEPS___ZN9vtkKdNode5SetUpEPS___ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1___ZL39PyvtkKdNode_GetDistance2ToInnerBoundaryP7_objectS0___ZL34PyvtkKdNode_GetDistance2ToBoundaryP7_objectS0___ZL25PyvtkKdNode_IntersectsBoxP7_objectS0___ZL23PyvtkKdNode_ContainsBoxP7_objectS0___ZL24PyvtkKdNode_SafeDownCastP7_objectS0___ZL25PyvtkKdNode_ContainsPointP7_objectS0___ZL20PyvtkKdNode_SetRightP7_objectS0___ZL20PyvtkKdNode_GetRightP7_objectS0___ZL19PyvtkKdNode_SetLeftP7_objectS0___ZL19PyvtkKdNode_GetLeftP7_objectS0___ZL29PyvtkKdNode_SetNumberOfPointsP7_objectS0___ZL29PyvtkKdNode_GetNumberOfPointsP7_objectS0___ZL28PyvtkKdNode_DeleteChildNodesP7_objectS0___ZL25PyvtkKdNode_AddChildNodesP7_objectS0___ZL24PyvtkKdNode_SetMaxBoundsP7_objectS0___ZL24PyvtkKdNode_GetMaxBoundsP7_objectS0___ZL21PyvtkKdNode_SetBoundsP7_objectS0___ZL21PyvtkKdNode_GetBoundsP7_objectS0___ZL24PyvtkKdNode_SetMinBoundsP7_objectS0___ZL24PyvtkKdNode_GetMinBoundsP7_objectS0___ZL28PyvtkKdNode_SetMaxDataBoundsP7_objectS0___ZL28PyvtkKdNode_GetMaxDataBoundsP7_objectS0___ZL25PyvtkKdNode_SetDataBoundsP7_objectS0___ZL25PyvtkKdNode_GetDataBoundsP7_objectS0___ZL28PyvtkKdNode_SetMinDataBoundsP7_objectS0___ZL28PyvtkKdNode_GetMinDataBoundsP7_objectS0___ZL17PyvtkKdNode_SetUpP7_objectS0___ZL17PyvtkKdNode_GetUpP7_objectS0___ZL31PyvtkKdNode_GetDivisionPositionP7_objectS0___ZL28PyvtkKdNode_IntersectsRegionP7_objectS0___ZL18PyvtkKdNode_SetDimP7_objectS0___ZL18PyvtkKdNode_GetDimP7_objectS0___ZL26PyvtkKdNode_IntersectsCellP7_objectS0___ZL20PyvtkKdNode_IsTypeOfP7_objectS0___ZL21PyvtkKdNode_PrintNodeP7_objectS0___ZL28PyvtkKdNode_PrintVerboseNodeP7_objectS0___ZL23PyvtkKdNode_NewInstanceP7_objectS0___ZL20PyvtkKdNode_SetMaxIDP7_objectS0___ZL20PyvtkKdNode_GetMaxIDP7_objectS0___ZL17PyvtkKdNode_SetIDP7_objectS0___ZL17PyvtkKdNode_GetIDP7_objectS0___ZL20PyvtkKdNode_SetMinIDP7_objectS0___ZL20PyvtkKdNode_GetMinIDP7_objectS0___ZL15PyvtkKdNode_IsAP7_objectS0___ZL29PyvtkKdNode_IntersectsSphere2P7_objectS0___ZN9vtkKdNode13AddChildNodesEPS_S0_GCC_except_table19GCC_except_table18GCC_except_table15GCC_except_table44GCC_except_table14GCC_except_table23GCC_except_table13GCC_except_table22GCC_except_table41___gxx_personality_v0