regina 7.4.1__cp314-cp314-macosx_10_13_x86_64.whl

regina/sageRegina/testsuite/comparison.test

@@ -0,0 +1,47 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2015-2025, Ben Burton
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Tests that the comparison operators behave as expected for Regina's
+# python bindings.
+#
+# This file is a single component of Regina's python test suite.  To run
+# the python test suite, move to the main python directory in the source
+# tree and run "make check".
+#
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+#
+# As an exception, when this program is distributed through (i) the
+# App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or
+# (iii) Google Play by Google Inc., then that store may impose any
+# digital rights management, device limits and/or redistribution
+# restrictions that are required by its terms of service.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+r = [ Rational(0,0), Rational(1,3), Rational(1,2), Rational(1,0) ]
+
+for a in r:
+	for b in r:
+		print(a < b, a <= b, a == b, a != b, a > b, a >= b)
+
+# Note: Currently regina sorts invariant factors using the _reverse_ sequences.
+# The five groups below are presented in the order that regina should sort them.
+
+g = [ AbelianGroup(), AbelianGroup(2), AbelianGroup(2, [3]), AbelianGroup(2, [6]), AbelianGroup(2, [3, 6]) ]
+
+for a in g:
+	for b in g:
+		print(a < b, a <= b, a == b, a != b, a > b, a >= b)
+

regina/sageRegina/testsuite/construction.out

@@ -0,0 +1,120 @@
+----------
+Empty link
+
+Link link = Link::fromData({ });
+
+link = Link.fromData([ ], [ ])
+
+Empty link
+----------
+0-crossing knot: ( )
+
+Link link = Link::fromData({ }, { 0 });
+
+link = Link.fromData([ ], [[ ]])
+
+0-crossing knot: ( )
+----------
+0-crossing, 2-component link: ( ) ( )
+
+Link link = Link::fromData({ }, { 0 }, { 0 });
+
+link = Link.fromData([ ], [[ ], [ ]])
+
+0-crossing, 2-component link: ( ) ( )
+----------
+3-crossing knot: +++ ( ^0 _1 ^2 _0 ^1 _2 )
+
+Link link = Link::fromData({ +1, +1, +1 }, { 1, -2, 3, -1, 2, -3 });
+
+link = Link.fromData([ +1, +1, +1 ], [ 1, -2, 3, -1, 2, -3 ])
+
+3-crossing knot: +++ ( ^0 _1 ^2 _0 ^1 _2 )
+----------
+2-crossing, 2-component link: ++ ( ^0 _1 ) ( _0 ^1 )
+
+Link link = Link::fromData({ +1, +1 }, { 1, -2 }, { -1, 2 });
+
+link = Link.fromData([ +1, +1 ], [[ 1, -2 ], [ -1, 2 ]])
+
+2-crossing, 2-component link: ++ ( ^0 _1 ) ( _0 ^1 )
+----------
+Empty 3-D triangulation
+
+Triangulation<3> tri = Triangulation<3>::fromGluings(0, {
+});
+
+tri = Triangulation3.fromGluings(0, [
+])
+
+Empty 3-D triangulation
+----------
+Bounded orientable 2-D triangulation, f = ( 2 4 2 )
+
+Triangulation<2> tri = Triangulation<2>::fromGluings(2, {
+    { 0, 0, 1, {2,0,1} }, { 0, 2, 1, {1,2,0} }});
+
+tri = Triangulation2.fromGluings(2, [
+    [ 0, 0, 1, Perm3(2,0,1) ], [ 0, 2, 1, Perm3(1,2,0) ]])
+
+Bounded orientable 2-D triangulation, f = ( 2 4 2 )
+----------
+Bounded orientable 3-D triangulation, f = ( 4 6 4 1 )
+
+Triangulation<3> tri = Triangulation<3>::fromGluings(1, {
+});
+
+tri = Triangulation3.fromGluings(1, [
+])
+
+Bounded orientable 3-D triangulation, f = ( 4 6 4 1 )
+----------
+Closed orientable 3-D triangulation, f = ( 1 6 10 5 )
+
+Triangulation<3> tri = Triangulation<3>::fromGluings(5, {
+    { 0, 0, 1, {0,3,2,1} }, { 0, 1, 2, {3,0,1,2} },
+    { 0, 2, 3, {3,2,0,1} }, { 0, 3, 4, {3,1,2,0} },
+    { 1, 1, 2, {2,1,0,3} }, { 1, 2, 4, {2,3,1,0} },
+    { 1, 3, 3, {2,0,3,1} }, { 2, 2, 3, {1,2,3,0} },
+    { 2, 3, 4, {3,0,1,2} }, { 3, 2, 4, {1,2,3,0} }});
+
+tri = Triangulation3.fromGluings(5, [
+    [ 0, 0, 1, Perm4(0,3,2,1) ], [ 0, 1, 2, Perm4(3,0,1,2) ],
+    [ 0, 2, 3, Perm4(3,2,0,1) ], [ 0, 3, 4, Perm4(3,1,2,0) ],
+    [ 1, 1, 2, Perm4(2,1,0,3) ], [ 1, 2, 4, Perm4(2,3,1,0) ],
+    [ 1, 3, 3, Perm4(2,0,3,1) ], [ 2, 2, 3, Perm4(1,2,3,0) ],
+    [ 2, 3, 4, Perm4(3,0,1,2) ], [ 3, 2, 4, Perm4(1,2,3,0) ]])
+
+Closed orientable 3-D triangulation, f = ( 1 6 10 5 )
+----------
+Ideal orientable 4-D triangulation, f = ( 1 1 4 5 2 )
+
+Triangulation<4> tri = Triangulation<4>::fromGluings(2, {
+    { 0, 0, 0, {3,0,1,2,4} }, { 0, 1, 1, {0,4,1,2,3} },
+    { 0, 2, 1, {1,2,0,4,3} }, { 0, 4, 1, {0,1,4,3,2} },
+    { 1, 1, 1, {0,3,1,4,2} }});
+
+tri = Triangulation4.fromGluings(2, [
+    [ 0, 0, 0, Perm5(3,0,1,2,4) ], [ 0, 1, 1, Perm5(0,4,1,2,3) ],
+    [ 0, 2, 1, Perm5(1,2,0,4,3) ], [ 0, 4, 1, Perm5(0,1,4,3,2) ],
+    [ 1, 1, 1, Perm5(0,3,1,4,2) ]])
+
+Ideal orientable 4-D triangulation, f = ( 1 1 4 5 2 )
+----------
+Possibly closed orientable 8-D triangulation, f = ( 9 36 84 126 126 84 36 9 2 )
+
+Triangulation<8> tri = Triangulation<8>::fromGluings(2, {
+    { 0, 0, 1, {0,1,2,3,4,5,6,7,8} }, { 0, 1, 1, {0,1,2,3,4,5,6,7,8} },
+    { 0, 2, 1, {0,1,2,3,4,5,6,7,8} }, { 0, 3, 1, {0,1,2,3,4,5,6,7,8} },
+    { 0, 4, 1, {0,1,2,3,4,5,6,7,8} }, { 0, 5, 1, {0,1,2,3,4,5,6,7,8} },
+    { 0, 6, 1, {0,1,2,3,4,5,6,7,8} }, { 0, 7, 1, {0,1,2,3,4,5,6,7,8} },
+    { 0, 8, 1, {0,1,2,3,4,5,6,7,8} }});
+
+tri = Triangulation8.fromGluings(2, [
+    [ 0, 0, 1, Perm9([0,1,2,3,4,5,6,7,8]) ], [ 0, 1, 1, Perm9([0,1,2,3,4,5,6,7,8]) ],
+    [ 0, 2, 1, Perm9([0,1,2,3,4,5,6,7,8]) ], [ 0, 3, 1, Perm9([0,1,2,3,4,5,6,7,8]) ],
+    [ 0, 4, 1, Perm9([0,1,2,3,4,5,6,7,8]) ], [ 0, 5, 1, Perm9([0,1,2,3,4,5,6,7,8]) ],
+    [ 0, 6, 1, Perm9([0,1,2,3,4,5,6,7,8]) ], [ 0, 7, 1, Perm9([0,1,2,3,4,5,6,7,8]) ],
+    [ 0, 8, 1, Perm9([0,1,2,3,4,5,6,7,8]) ]])
+
+Possibly closed orientable 8-D triangulation, f = ( 9 36 84 126 126 84 36 9 2 )

regina/sageRegina/testsuite/construction.test

@@ -0,0 +1,63 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2015-2025, Ben Burton
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Tests the behaviour of the various dumpConstruction() functions.
+#
+# This file is a single component of Regina's python test suite.  To run
+# the python test suite, move to the main python directory in the source
+# tree and run "make check".
+#
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+#
+# As an exception, when this program is distributed through (i) the
+# App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or
+# (iii) Google Play by Google Inc., then that store may impose any
+# digital rights management, device limits and/or redistribution
+# restrictions that are required by its terms of service.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+def testDump(obj):
+	print('----------')
+	print(obj)
+	print()
+	
+	# For C++, just print the construction.
+	print(obj.source(Language.Cxx))
+	
+	# For Python, print it _and_ test that it works.
+	code = obj.source()
+	print(code)
+	# As of Python 3.13 we need to set up our own locals dictionary (a result
+	# of PEP 667).  See also: https://github.com/python/cpython/issues/118888
+	loc = {}
+	exec(code, globals(), loc)
+	if obj.__class__ == regina.Link:
+		print(loc['link'])
+	else:
+		print(loc['tri'])
+
+testDump(Link())
+testDump(Link(1))
+testDump(Link(2))
+testDump(ExampleLink.trefoil())
+testDump(ExampleLink.hopf())
+
+testDump(Triangulation3())
+testDump(Example2.annulus())
+testDump(Example3.ball())
+testDump(Example3.poincare())
+testDump(Example4.cappellShaneson())
+testDump(Example8.sphere())

regina/sageRegina/testsuite/constructors.out

@@ -0,0 +1,14 @@
+0 a
+2 cPcbbbiht
+2 cPcbbbiht
+4 eLPkbdcddhgggb
+4 eLPkbdcddhgggb
+2 cPcbbbiht
+2 cPcbbbiht
+2 cPcbbbiht
+Could not construct
+2 cPcbbbiht
+Invalid constructor arguments
+Invalid constructor arguments
+Could not construct
+Invalid constructor arguments

regina/sageRegina/testsuite/constructors.test

@@ -0,0 +1,95 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2015-2025, Ben Burton
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Tests bindings for the different Triangulation3 constructors.
+#
+# This file is a single component of Regina's python test suite.  To run
+# the python test suite, move to the main python directory in the source
+# tree and run "make check".
+#
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+#
+# As an exception, when this program is distributed through (i) the
+# App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or
+# (iii) Google Play by Google Inc., then that store may impose any
+# digital rights management, device limits and/or redistribution
+# restrictions that are required by its terms of service.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+def tri3From(*args):
+	try:
+		t = Triangulation3(*args)
+		print(t.size(), t.isoSig())
+	except InvalidArgument:
+		print('Could not construct')
+	except TypeError:
+		print('Invalid constructor arguments')
+	except Exception as e:
+		print('ERROR: Unexpected exception:', type(e))
+
+# Empty
+tri3From()
+
+# Another triangulation
+tri3From(Example3.figureEight())
+
+# Another triangulation, without cloning properties
+tri3From(Example3.figureEight(), False)
+
+# Regina's SnapPeaTriangulation class
+tri3From(ExampleSnapPea.whiteheadLink())
+
+# Regina's SnapPeaTriangulation class, without cloning properties
+tri3From(ExampleSnapPea.whiteheadLink(), False)
+
+# Iso sig
+tri3From('cPcbbbiht')
+
+# Dehydration string
+tri3From('cabbbbaei')
+
+# SnapPea data file contents
+tri3From(Example3.figureEight().snapPea())
+
+# Junk (constructor should throw an exception)
+tri3From('banana')
+
+# Simulate what happens if we try to pass a SnapPy manifold or triangulation:
+class SnapPyObject:
+	def _to_string(self):
+		return Example3.figureEight().snapPea()
+
+class NotSnapPyObject:
+	def _other_string(self):
+		return Example3.figureEight().snapPea()
+
+class JunkSnapPyObject:
+	def _other_string(self):
+		return 'banana'
+
+class MisbehavedSnapPyObject:
+	def _to_string(self):
+		return 42
+
+class UncallableSnapPyObject:
+	_to_string = 'cPcbbbiht'
+
+tri3From(SnapPyObject())
+tri3From(NotSnapPyObject())
+tri3From(JunkSnapPyObject())
+tri3From(MisbehavedSnapPyObject())
+tri3From(UncallableSnapPyObject())
+

regina/sageRegina/testsuite/cube.orb

@@ -0,0 +1,87 @@
+% orb
+cube
+SolutionType geometric_solution
+vertices_known
+
+  1  4 0.000  1  4  2vu  1uv
+  2  1 0.000  1  2  2xv  1vw
+  3 10 0.000  8  4  8wv  7vx
+  4  0 1.000  5  2  6xv  5vw  1wx  2wx 10xv  9vw
+  5  9 0.000  5  1  2xu  1uw
+  6  0 1.000  5  4  8vu  7uv 10vu  2uw  1xu  5uv
+  7  0 1.000  4  2  5xv  3ux  4wu 10vw  2vw  1xv
+  8 12 0.000  2  6  6wv  9vx
+  9  0 1.000  2  7  6xw  5xw  3wx  4wx 10xw  9xw
+ 10  2 0.000  2  3  4xu  3uw
+ 11  3 0.000  3  4  4vu  3uv
+ 12 11 0.000  3  7  4xv  3vw
+ 13  0 1.000  4  7  8wu  7ux 10wu  4vw  3xv  5ux
+ 14  8 0.000  5  8  8xv  7vw
+ 15  5 0.000  5  6  6vu  9uv
+ 16  0 1.000  7  5  8xu  7uw 10xu  9uw  6xu  5uw
+ 17  6 0.000  6  7  6wu  9ux
+ 18  7 0.000  8  7  8xw  7xw
+
+  1   -0.4349533391534604    0.5731099791419046    0.3301014013470916    0.0000000000000000    0.0000000000000000
+  2   -0.4349533391534603    0.5731099791419046    0.3301014013470914    0.0000000000000000    0.0000000000000000
+  3   -0.4349533391534603    0.5731099791419045    0.3301014013470916    0.0000000000000000    0.0000000000000000
+  4   -0.9903042040412748    0.3301014013470915    0.3301014013470914    1.1071487177940906    0.9272952180016123    1.1071487177940909    1.1071487177940909    0.9272952180016124    1.1071487177940906
+  5   -0.4349533391534603    0.3301014013470915    0.5731099791419046    0.0000000000000000    0.0000000000000000
+  6   -0.9903042040412748    0.3301014013470915    0.3301014013470916    1.1071487177940904    1.1071487177940904    0.9272952180016123    1.1071487177940904    1.1071487177940906    0.9272952180016123
+  7   -0.9903042040412748    0.3301014013470916    0.3301014013470914    0.9272952180016123    1.1071487177940906    1.1071487177940906    0.9272952180016123    1.1071487177940906    1.1071487177940906
+  8   -0.4349533391534603    0.3301014013470914    0.5731099791419046    0.0000000000000000    0.0000000000000000
+  9   -0.9903042040412747    0.3301014013470914    0.3301014013470915    1.1071487177940904    0.9272952180016121    1.1071487177940906    1.1071487177940904    0.9272952180016123    1.1071487177940904
+ 10   -0.4349533391534603    0.3301014013470914    0.5731099791419045    0.0000000000000000    0.0000000000000000
+ 11   -0.4349533391534603    0.5731099791419045    0.3301014013470916    0.0000000000000000    0.0000000000000000
+ 12   -0.4349533391534603    0.5731099791419045    0.3301014013470915    0.0000000000000000    0.0000000000000000
+ 13   -0.9903042040412748    0.3301014013470916    0.3301014013470915    1.1071487177940904    1.1071487177940904    0.9272952180016123    1.1071487177940906    1.1071487177940906    0.9272952180016123
+ 14   -0.4349533391534603    0.3301014013470915    0.5731099791419045    0.0000000000000000    0.0000000000000000
+ 15   -0.4349533391534603    0.3301014013470915    0.5731099791419046    0.0000000000000000    0.0000000000000000
+ 16   -0.9903042040412747    0.3301014013470915    0.3301014013470915    1.1071487177940906    1.1071487177940906    0.9272952180016123    1.1071487177940904    1.1071487177940904    0.9272952180016121
+ 17   -0.4349533391534603    0.5731099791419046    0.3301014013470915    0.0000000000000000    0.0000000000000000
+ 18   -0.4349533391534603    0.5731099791419045    0.3301014013470915    0.0000000000000000    0.0000000000000000
+
+  1    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+  2    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+  3    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+  4    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+  5    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+  6    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+  7    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+  8    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+  9    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+ 10    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+ 11    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+ 12    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+ 13    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+ 14    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+ 15    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+ 16    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+ 17    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+ 18    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+
+8
+0	54	35
+1	39	136
+2	180	165
+3	202	46
+4	89	61
+5	84	110
+6	155	124
+7	162	81
+
+12
+0	0	1	0
+1	1	2	0
+2	2	3	0
+3	3	0	0
+4	4	5	0
+5	5	6	0
+6	6	7	0
+7	7	4	0
+8	4	0	0
+9	7	3	0
+10	6	2	0
+11	5	1	0
+
+0

regina/sageRegina/testsuite/discs.out

@@ -0,0 +1,3 @@
+0:4 #0
+1:0 #0
+3:1 #0

regina/sageRegina/testsuite/discs.test

@@ -0,0 +1,38 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2015-2025, Ben Burton
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Tests for issues relating to disc set iteration.
+#
+# This file is a single component of Regina's python test suite.  To run
+# the python test suite, move to the main python directory in the source
+# tree and run "make check".
+#
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+#
+# As an exception, when this program is distributed through (i) the
+# App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or
+# (iii) Google Play by Google Inc., then that store may impose any
+# digital rights management, device limits and/or redistribution
+# restrictions that are required by its terms of service.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+t = Example3.rp3rp3()
+s = t.nonTrivialSphereOrDisc()
+d = DiscSetSurface(s)
+
+for spec in d:
+	print(spec)
+

regina/sageRegina/testsuite/docstrings.filter

@@ -0,0 +1,22 @@
+#!/bin/sh
+set -e
+
+# This filter adjusts the names of pybind11 local modules so that
+# they are independent of the C++ compiler that was used.
+#
+# It also makes tweaks to account for differences in help() output between
+# Python 3.6 vs 3.8 and above (I'm not sure which way Python 3.7 goes),
+# to account for the different ways that trailing whitespace is handled in
+# Python <= 3.11 vs >= 3.12, to account for the differerent ways that the
+# pybind11_object constructor is handled in Python <= 3.11 vs >= 3.12, and
+# to account for the different ways that class methods are introduced in
+# Python <= 3.13 vs >= 3.14.
+#
+# Note that BSD sed does not support \+, which is why we use \{1,\} instead.
+# BSD sed also seems to have issues with \s and \S, so we avoid them too.
+
+sed -e 's#\( \)__pybind11_module_local_\([a-zA-Z0-9_-]\{1,\}\) = .*\.\.\.#\1__pybind11_module_local__ = ...#' \
+    -e 's#\( \)Methods\( inherited from pybind11_builtins\.pybind11_object:\)$#\1Static methods\2#' \
+    -e 's#\(Help on \)method descriptor [a-zA-Z0-9_]\{1,\}\( in module\)#\1instancemethod\2#' \
+    -e 's# \{1,\}$##' \
+    -e 's# class method of pybind11_builtins\.pybind11_object# from pybind11_builtins\.pybind11_type#'