mapFolding 0.2.7__tar.gz → 0.3.0__tar.gz
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- {mapfolding-0.2.7 → mapfolding-0.3.0}/PKG-INFO +3 -1
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/mapFolding.egg-info/PKG-INFO +3 -1
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/mapFolding.egg-info/SOURCES.txt +5 -4
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/mapFolding.egg-info/requires.txt +2 -0
- mapfolding-0.3.0/mapFolding/someAssemblyRequired/__init__.py +3 -0
- mapfolding-0.3.0/mapFolding/someAssemblyRequired/countInitialize.py +45 -0
- mapfolding-0.3.0/mapFolding/someAssemblyRequired/countParallel.py +52 -0
- mapfolding-0.3.0/mapFolding/someAssemblyRequired/countSequential.py +59 -0
- mapfolding-0.2.7/mapFolding/someAssemblyRequired/inlineAfunction.py → mapfolding-0.3.0/mapFolding/someAssemblyRequired/synthesizeModules.py +75 -40
- {mapfolding-0.2.7 → mapfolding-0.3.0}/pyproject.toml +5 -2
- mapfolding-0.2.7/mapFolding/someAssemblyRequired/jobsAndTasks.py +0 -46
- mapfolding-0.2.7/mapFolding/someAssemblyRequired/makeNuitkaSource.py +0 -99
- mapfolding-0.2.7/mapFolding/someAssemblyRequired/makeNumbaJob.py +0 -147
- {mapfolding-0.2.7 → mapfolding-0.3.0}/README.md +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/benchmarks/benchmarking.py +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/mapFolding.egg-info/dependency_links.txt +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/mapFolding.egg-info/entry_points.txt +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/mapFolding.egg-info/top_level.txt +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/reference/flattened.py +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/reference/hunterNumba.py +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/reference/irvineJavaPort.py +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/reference/jax.py +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/reference/lunnan.py +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/reference/lunnanNumpy.py +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/reference/lunnanWhile.py +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/reference/rotatedEntryPoint.py +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/mapFolding/reference/total_countPlus1vsPlusN.py +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/setup.cfg +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/tests/test_oeis.py +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/tests/test_other.py +0 -0
- {mapfolding-0.2.7 → mapfolding-0.3.0}/tests/test_tasks.py +0 -0
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
Metadata-Version: 2.2
|
|
2
2
|
Name: mapFolding
|
|
3
|
-
Version: 0.
|
|
3
|
+
Version: 0.3.0
|
|
4
4
|
Summary: Count distinct ways to fold a map (or a strip of stamps)
|
|
5
5
|
Author-email: Hunter Hogan <HunterHogan@pm.me>
|
|
6
6
|
License: CC-BY-NC-4.0
|
|
@@ -29,10 +29,12 @@ Requires-Dist: jupyter; extra == "benchmark"
|
|
|
29
29
|
Requires-Dist: pandas; extra == "benchmark"
|
|
30
30
|
Requires-Dist: tqdm; extra == "benchmark"
|
|
31
31
|
Provides-Extra: testing
|
|
32
|
+
Requires-Dist: more_itertools; extra == "testing"
|
|
32
33
|
Requires-Dist: pytest; extra == "testing"
|
|
33
34
|
Requires-Dist: pytest-cov; extra == "testing"
|
|
34
35
|
Requires-Dist: pytest-env; extra == "testing"
|
|
35
36
|
Requires-Dist: pytest-xdist; extra == "testing"
|
|
37
|
+
Requires-Dist: python_minifier; extra == "testing"
|
|
36
38
|
|
|
37
39
|
# Algorithm(s) for counting distinct ways to fold a map (or a strip of stamps)
|
|
38
40
|
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
Metadata-Version: 2.2
|
|
2
2
|
Name: mapFolding
|
|
3
|
-
Version: 0.
|
|
3
|
+
Version: 0.3.0
|
|
4
4
|
Summary: Count distinct ways to fold a map (or a strip of stamps)
|
|
5
5
|
Author-email: Hunter Hogan <HunterHogan@pm.me>
|
|
6
6
|
License: CC-BY-NC-4.0
|
|
@@ -29,10 +29,12 @@ Requires-Dist: jupyter; extra == "benchmark"
|
|
|
29
29
|
Requires-Dist: pandas; extra == "benchmark"
|
|
30
30
|
Requires-Dist: tqdm; extra == "benchmark"
|
|
31
31
|
Provides-Extra: testing
|
|
32
|
+
Requires-Dist: more_itertools; extra == "testing"
|
|
32
33
|
Requires-Dist: pytest; extra == "testing"
|
|
33
34
|
Requires-Dist: pytest-cov; extra == "testing"
|
|
34
35
|
Requires-Dist: pytest-env; extra == "testing"
|
|
35
36
|
Requires-Dist: pytest-xdist; extra == "testing"
|
|
37
|
+
Requires-Dist: python_minifier; extra == "testing"
|
|
36
38
|
|
|
37
39
|
# Algorithm(s) for counting distinct ways to fold a map (or a strip of stamps)
|
|
38
40
|
|
|
@@ -16,10 +16,11 @@ mapFolding/reference/lunnanNumpy.py
|
|
|
16
16
|
mapFolding/reference/lunnanWhile.py
|
|
17
17
|
mapFolding/reference/rotatedEntryPoint.py
|
|
18
18
|
mapFolding/reference/total_countPlus1vsPlusN.py
|
|
19
|
-
mapFolding/someAssemblyRequired/
|
|
20
|
-
mapFolding/someAssemblyRequired/
|
|
21
|
-
mapFolding/someAssemblyRequired/
|
|
22
|
-
mapFolding/someAssemblyRequired/
|
|
19
|
+
mapFolding/someAssemblyRequired/__init__.py
|
|
20
|
+
mapFolding/someAssemblyRequired/countInitialize.py
|
|
21
|
+
mapFolding/someAssemblyRequired/countParallel.py
|
|
22
|
+
mapFolding/someAssemblyRequired/countSequential.py
|
|
23
|
+
mapFolding/someAssemblyRequired/synthesizeModules.py
|
|
23
24
|
tests/test_oeis.py
|
|
24
25
|
tests/test_other.py
|
|
25
26
|
tests/test_tasks.py
|
|
@@ -0,0 +1,45 @@
|
|
|
1
|
+
from mapFolding import indexMy, indexTrack
|
|
2
|
+
import numba
|
|
3
|
+
|
|
4
|
+
@numba.jit((numba.uint8[:,:,::1], numba.uint8[::1], numba.uint8[::1], numba.uint8[:,::1]), parallel=False, boundscheck=False, cache=True, error_model="numpy", fastmath=True, looplift=False, nogil=True, nopython=True)
|
|
5
|
+
def countInitialize(connectionGraph, gapsWhere, my, track):
|
|
6
|
+
while my[7] > 0:
|
|
7
|
+
if my[7] <= 1 or track[1, 0] == 1:
|
|
8
|
+
my[1] = my[0]
|
|
9
|
+
my[3] = track[3, my[7] - 1]
|
|
10
|
+
my[4] = 0
|
|
11
|
+
while my[4] < my[0]:
|
|
12
|
+
if connectionGraph[my[4], my[7], my[7]] == my[7]:
|
|
13
|
+
my[1] -= 1
|
|
14
|
+
else:
|
|
15
|
+
my[8] = connectionGraph[my[4], my[7], my[7]]
|
|
16
|
+
while my[8] != my[7]:
|
|
17
|
+
gapsWhere[my[3]] = my[8]
|
|
18
|
+
if track[2, my[8]] == 0:
|
|
19
|
+
my[3] += 1
|
|
20
|
+
track[2, my[8]] += 1
|
|
21
|
+
my[8] = connectionGraph[my[4], my[7], track[1, my[8]]]
|
|
22
|
+
my[4] += 1
|
|
23
|
+
if not my[1]:
|
|
24
|
+
my[5] = 0
|
|
25
|
+
while my[5] < my[7]:
|
|
26
|
+
gapsWhere[my[3]] = my[5]
|
|
27
|
+
my[3] += 1
|
|
28
|
+
my[5] += 1
|
|
29
|
+
my[6] = my[2]
|
|
30
|
+
while my[6] < my[3]:
|
|
31
|
+
gapsWhere[my[2]] = gapsWhere[my[6]]
|
|
32
|
+
if track[2, gapsWhere[my[6]]] == my[1]:
|
|
33
|
+
my[2] += 1
|
|
34
|
+
track[2, gapsWhere[my[6]]] = 0
|
|
35
|
+
my[6] += 1
|
|
36
|
+
if my[7] > 0:
|
|
37
|
+
my[2] -= 1
|
|
38
|
+
track[0, my[7]] = gapsWhere[my[2]]
|
|
39
|
+
track[1, my[7]] = track[1, track[0, my[7]]]
|
|
40
|
+
track[1, track[0, my[7]]] = my[7]
|
|
41
|
+
track[0, track[1, my[7]]] = my[7]
|
|
42
|
+
track[3, my[7]] = my[2]
|
|
43
|
+
my[7] += 1
|
|
44
|
+
if my[2] > 0:
|
|
45
|
+
return
|
|
@@ -0,0 +1,52 @@
|
|
|
1
|
+
from mapFolding import indexMy, indexTrack
|
|
2
|
+
import numba
|
|
3
|
+
|
|
4
|
+
@numba.jit((numba.uint8[:,:,::1], numba.int64[::1], numba.uint8[::1], numba.uint8[::1], numba.uint8[:,::1]), parallel=True, boundscheck=False, cache=True, error_model="numpy", fastmath=True, looplift=False, nogil=True, nopython=True)
|
|
5
|
+
def countParallel(connectionGraph, foldGroups, gapsWherePARALLEL, myPARALLEL, trackPARALLEL):
|
|
6
|
+
for indexSherpa in numba.prange(myPARALLEL[9]):
|
|
7
|
+
gapsWhere = gapsWherePARALLEL.copy()
|
|
8
|
+
my = myPARALLEL.copy()
|
|
9
|
+
my[10] = indexSherpa
|
|
10
|
+
track = trackPARALLEL.copy()
|
|
11
|
+
groupsOfFolds: int = 0
|
|
12
|
+
while my[7] > 0:
|
|
13
|
+
if my[7] <= 1 or track[1, 0] == 1:
|
|
14
|
+
if my[7] > foldGroups[-1]:
|
|
15
|
+
groupsOfFolds = groupsOfFolds + 1
|
|
16
|
+
else:
|
|
17
|
+
my[1] = my[0]
|
|
18
|
+
my[3] = track[3, my[7] - 1]
|
|
19
|
+
my[4] = 0
|
|
20
|
+
while my[4] < my[0]:
|
|
21
|
+
if connectionGraph[my[4], my[7], my[7]] == my[7]:
|
|
22
|
+
my[1] -= 1
|
|
23
|
+
else:
|
|
24
|
+
my[8] = connectionGraph[my[4], my[7], my[7]]
|
|
25
|
+
while my[8] != my[7]:
|
|
26
|
+
if my[7] != my[9] or my[8] % my[9] == my[10]:
|
|
27
|
+
gapsWhere[my[3]] = my[8]
|
|
28
|
+
if track[2, my[8]] == 0:
|
|
29
|
+
my[3] += 1
|
|
30
|
+
track[2, my[8]] += 1
|
|
31
|
+
my[8] = connectionGraph[my[4], my[7], track[1, my[8]]]
|
|
32
|
+
my[4] += 1
|
|
33
|
+
my[6] = my[2]
|
|
34
|
+
while my[6] < my[3]:
|
|
35
|
+
gapsWhere[my[2]] = gapsWhere[my[6]]
|
|
36
|
+
if track[2, gapsWhere[my[6]]] == my[1]:
|
|
37
|
+
my[2] += 1
|
|
38
|
+
track[2, gapsWhere[my[6]]] = 0
|
|
39
|
+
my[6] += 1
|
|
40
|
+
while my[7] > 0 and my[2] == track[3, my[7] - 1]:
|
|
41
|
+
my[7] -= 1
|
|
42
|
+
track[1, track[0, my[7]]] = track[1, my[7]]
|
|
43
|
+
track[0, track[1, my[7]]] = track[0, my[7]]
|
|
44
|
+
if my[7] > 0:
|
|
45
|
+
my[2] -= 1
|
|
46
|
+
track[0, my[7]] = gapsWhere[my[2]]
|
|
47
|
+
track[1, my[7]] = track[1, track[0, my[7]]]
|
|
48
|
+
track[1, track[0, my[7]]] = my[7]
|
|
49
|
+
track[0, track[1, my[7]]] = my[7]
|
|
50
|
+
track[3, my[7]] = my[2]
|
|
51
|
+
my[7] += 1
|
|
52
|
+
foldGroups[my[10]] = groupsOfFolds
|
|
@@ -0,0 +1,59 @@
|
|
|
1
|
+
from mapFolding import indexMy, indexTrack
|
|
2
|
+
import numba
|
|
3
|
+
|
|
4
|
+
@numba.jit((numba.uint8[:,:,::1], numba.int64[::1], numba.uint8[::1], numba.uint8[::1], numba.uint8[:,::1]), parallel=False, boundscheck=False, cache=True, error_model="numpy", fastmath=True, looplift=False, nogil=True, nopython=True)
|
|
5
|
+
def countSequential(connectionGraph, foldGroups, gapsWhere, my, track):
|
|
6
|
+
doFindGaps = True
|
|
7
|
+
dimensionsTotal = my[indexMy.dimensionsTotal.value]
|
|
8
|
+
dimensionsUnconstrained = my[indexMy.dimensionsUnconstrained.value]
|
|
9
|
+
gap1ndex = my[indexMy.gap1ndex.value]
|
|
10
|
+
gap1ndexCeiling = my[indexMy.gap1ndexCeiling.value]
|
|
11
|
+
indexDimension = my[indexMy.indexDimension.value]
|
|
12
|
+
indexMiniGap = my[indexMy.indexMiniGap.value]
|
|
13
|
+
leaf1ndex = my[indexMy.leaf1ndex.value]
|
|
14
|
+
leafConnectee = my[indexMy.leafConnectee.value]
|
|
15
|
+
taskIndex = my[indexMy.taskIndex.value]
|
|
16
|
+
leafAbove = track[indexTrack.leafAbove.value]
|
|
17
|
+
leafBelow = track[indexTrack.leafBelow.value]
|
|
18
|
+
countDimensionsGapped = track[indexTrack.countDimensionsGapped.value]
|
|
19
|
+
gapRangeStart = track[indexTrack.gapRangeStart.value]
|
|
20
|
+
groupsOfFolds: int = 0
|
|
21
|
+
while leaf1ndex > 0:
|
|
22
|
+
if (doFindGaps := (leaf1ndex <= 1 or leafBelow[0] == 1)) and leaf1ndex > foldGroups[-1]:
|
|
23
|
+
groupsOfFolds = groupsOfFolds + 1
|
|
24
|
+
elif doFindGaps:
|
|
25
|
+
dimensionsUnconstrained = dimensionsTotal
|
|
26
|
+
gap1ndexCeiling = gapRangeStart[leaf1ndex - 1]
|
|
27
|
+
indexDimension = 0
|
|
28
|
+
while indexDimension < dimensionsTotal:
|
|
29
|
+
if connectionGraph[indexDimension, leaf1ndex, leaf1ndex] == leaf1ndex:
|
|
30
|
+
dimensionsUnconstrained -= 1
|
|
31
|
+
else:
|
|
32
|
+
leafConnectee = connectionGraph[indexDimension, leaf1ndex, leaf1ndex]
|
|
33
|
+
while leafConnectee != leaf1ndex:
|
|
34
|
+
gapsWhere[gap1ndexCeiling] = leafConnectee
|
|
35
|
+
if countDimensionsGapped[leafConnectee] == 0:
|
|
36
|
+
gap1ndexCeiling += 1
|
|
37
|
+
countDimensionsGapped[leafConnectee] += 1
|
|
38
|
+
leafConnectee = connectionGraph[indexDimension, leaf1ndex, leafBelow[leafConnectee]]
|
|
39
|
+
indexDimension += 1
|
|
40
|
+
indexMiniGap = gap1ndex
|
|
41
|
+
while indexMiniGap < gap1ndexCeiling:
|
|
42
|
+
gapsWhere[gap1ndex] = gapsWhere[indexMiniGap]
|
|
43
|
+
if countDimensionsGapped[gapsWhere[indexMiniGap]] == dimensionsUnconstrained:
|
|
44
|
+
gap1ndex += 1
|
|
45
|
+
countDimensionsGapped[gapsWhere[indexMiniGap]] = 0
|
|
46
|
+
indexMiniGap += 1
|
|
47
|
+
while leaf1ndex > 0 and gap1ndex == gapRangeStart[leaf1ndex - 1]:
|
|
48
|
+
leaf1ndex -= 1
|
|
49
|
+
leafBelow[leafAbove[leaf1ndex]] = leafBelow[leaf1ndex]
|
|
50
|
+
leafAbove[leafBelow[leaf1ndex]] = leafAbove[leaf1ndex]
|
|
51
|
+
if leaf1ndex > 0:
|
|
52
|
+
gap1ndex -= 1
|
|
53
|
+
leafAbove[leaf1ndex] = gapsWhere[gap1ndex]
|
|
54
|
+
leafBelow[leaf1ndex] = leafBelow[leafAbove[leaf1ndex]]
|
|
55
|
+
leafBelow[leafAbove[leaf1ndex]] = leaf1ndex
|
|
56
|
+
leafAbove[leafBelow[leaf1ndex]] = leaf1ndex
|
|
57
|
+
gapRangeStart[leaf1ndex] = gap1ndex
|
|
58
|
+
leaf1ndex += 1
|
|
59
|
+
foldGroups[taskIndex] = groupsOfFolds
|
|
@@ -1,7 +1,18 @@
|
|
|
1
|
-
from mapFolding import indexMy, indexTrack
|
|
1
|
+
from mapFolding import indexMy, indexTrack, theDao, datatypeDefault, datatypeLarge, datatypeSmall
|
|
2
2
|
import ast
|
|
3
|
-
import copy
|
|
4
3
|
import pathlib
|
|
4
|
+
import inspect
|
|
5
|
+
|
|
6
|
+
algorithmSource = theDao
|
|
7
|
+
|
|
8
|
+
dictionaryDecorators={
|
|
9
|
+
'countInitialize':
|
|
10
|
+
f'@numba.jit((numba.{datatypeSmall}[:,:,::1], numba.{datatypeDefault}[::1], numba.{datatypeSmall}[::1], numba.{datatypeDefault}[:,::1]), parallel=False, boundscheck=False, cache=True, error_model="numpy", fastmath=True, looplift=False, nogil=True, nopython=True)\n',
|
|
11
|
+
'countParallel':
|
|
12
|
+
f'@numba.jit((numba.{datatypeSmall}[:,:,::1], numba.{datatypeLarge}[::1], numba.{datatypeDefault}[::1], numba.{datatypeSmall}[::1], numba.{datatypeDefault}[:,::1]), parallel=True, boundscheck=False, cache=True, error_model="numpy", fastmath=True, looplift=False, nogil=True, nopython=True)\n',
|
|
13
|
+
'countSequential':
|
|
14
|
+
f'@numba.jit((numba.{datatypeSmall}[:,:,::1], numba.{datatypeLarge}[::1], numba.{datatypeDefault}[::1], numba.{datatypeSmall}[::1], numba.{datatypeDefault}[:,::1]), parallel=False, boundscheck=False, cache=True, error_model="numpy", fastmath=True, looplift=False, nogil=True, nopython=True)\n',
|
|
15
|
+
}
|
|
5
16
|
|
|
6
17
|
def getDictionaryEnumValues():
|
|
7
18
|
dictionaryEnumValues = {}
|
|
@@ -11,10 +22,13 @@ def getDictionaryEnumValues():
|
|
|
11
22
|
return dictionaryEnumValues
|
|
12
23
|
|
|
13
24
|
class RecursiveInlinerWithEnum(ast.NodeTransformer):
|
|
25
|
+
"""Process AST nodes to inline functions and substitute enum values.
|
|
26
|
+
Also handles function decorators during inlining."""
|
|
27
|
+
|
|
14
28
|
def __init__(self, dictionaryFunctions, dictionaryEnumValues):
|
|
15
29
|
self.dictionaryFunctions = dictionaryFunctions
|
|
16
30
|
self.dictionaryEnumValues = dictionaryEnumValues
|
|
17
|
-
self.processed = set()
|
|
31
|
+
self.processed = set()
|
|
18
32
|
|
|
19
33
|
def inlineFunctionBody(self, functionName):
|
|
20
34
|
if functionName in self.processed:
|
|
@@ -39,7 +53,7 @@ class RecursiveInlinerWithEnum(ast.NodeTransformer):
|
|
|
39
53
|
callNode = self.generic_visit(node)
|
|
40
54
|
if isinstance(callNode, ast.Call) and isinstance(callNode.func, ast.Name) and callNode.func.id in self.dictionaryFunctions:
|
|
41
55
|
inlineDefinition = self.inlineFunctionBody(callNode.func.id)
|
|
42
|
-
if inlineDefinition and inlineDefinition.body:
|
|
56
|
+
if (inlineDefinition and inlineDefinition.body):
|
|
43
57
|
lastStmt = inlineDefinition.body[-1]
|
|
44
58
|
if isinstance(lastStmt, ast.Return) and lastStmt.value is not None:
|
|
45
59
|
return self.visit(lastStmt.value)
|
|
@@ -78,20 +92,21 @@ def findRequiredImports(node):
|
|
|
78
92
|
|
|
79
93
|
def generateImports(requiredImports):
|
|
80
94
|
"""Generate import statements based on required modules."""
|
|
81
|
-
importStatements =
|
|
95
|
+
importStatements = {'import numba', 'from mapFolding import indexMy, indexTrack'}
|
|
82
96
|
|
|
83
|
-
# Map of module names to their import statements
|
|
84
97
|
importMapping = {
|
|
85
98
|
'numba': 'import numba',
|
|
86
99
|
}
|
|
87
100
|
|
|
88
101
|
for moduleName in sorted(requiredImports):
|
|
89
102
|
if moduleName in importMapping:
|
|
90
|
-
importStatements.
|
|
103
|
+
importStatements.add(importMapping[moduleName])
|
|
91
104
|
|
|
92
105
|
return '\n'.join(importStatements)
|
|
93
106
|
|
|
94
|
-
def inlineFunctions(sourceCode, targetFunctionName, dictionaryEnumValues):
|
|
107
|
+
def inlineFunctions(sourceCode, targetFunctionName, dictionaryEnumValues, skipEnum=False):
|
|
108
|
+
if skipEnum:
|
|
109
|
+
dictionaryEnumValues = {}
|
|
95
110
|
dictionaryParsed = ast.parse(sourceCode)
|
|
96
111
|
dictionaryFunctions = {
|
|
97
112
|
element.name: element
|
|
@@ -103,50 +118,70 @@ def inlineFunctions(sourceCode, targetFunctionName, dictionaryEnumValues):
|
|
|
103
118
|
nodeInlined = nodeInliner.visit(nodeTarget)
|
|
104
119
|
ast.fix_missing_locations(nodeInlined)
|
|
105
120
|
|
|
106
|
-
# Generate imports
|
|
107
121
|
requiredImports = findRequiredImports(nodeInlined)
|
|
108
122
|
importStatements = generateImports(requiredImports)
|
|
109
123
|
|
|
110
|
-
|
|
111
|
-
inlinedCode = importStatements + '\n\n' + ast.unparse(ast.Module(body=[nodeInlined], type_ignores=[]))
|
|
124
|
+
lineNumbaDecorator = dictionaryDecorators[targetFunctionName]
|
|
125
|
+
inlinedCode = importStatements + '\n\n' + lineNumbaDecorator + ast.unparse(ast.Module(body=[nodeInlined], type_ignores=[]))
|
|
112
126
|
return inlinedCode
|
|
113
127
|
|
|
128
|
+
def unpackArrays(codeInlined: str, callableTarget: str) -> str:
|
|
129
|
+
dictionaryReplaceScalars = {
|
|
130
|
+
'my[indexMy.dimensionsTotal.value]': 'dimensionsTotal',
|
|
131
|
+
'my[indexMy.dimensionsUnconstrained.value]': 'dimensionsUnconstrained',
|
|
132
|
+
'my[indexMy.gap1ndex.value]': 'gap1ndex',
|
|
133
|
+
'my[indexMy.gap1ndexCeiling.value]': 'gap1ndexCeiling',
|
|
134
|
+
'my[indexMy.indexDimension.value]': 'indexDimension',
|
|
135
|
+
# 'my[indexMy.indexLeaf.value]': 'indexLeaf',
|
|
136
|
+
'my[indexMy.indexMiniGap.value]': 'indexMiniGap',
|
|
137
|
+
'my[indexMy.leaf1ndex.value]': 'leaf1ndex',
|
|
138
|
+
'my[indexMy.leafConnectee.value]': 'leafConnectee',
|
|
139
|
+
# 'my[indexMy.taskDivisions.value]': 'taskDivisions',
|
|
140
|
+
'my[indexMy.taskIndex.value]': 'taskIndex',
|
|
141
|
+
# 'foldGroups[-1]': 'leavesTotal',
|
|
142
|
+
}
|
|
143
|
+
|
|
144
|
+
dictionaryReplaceArrays = {
|
|
145
|
+
"track[indexTrack.leafAbove.value, ": 'leafAbove[',
|
|
146
|
+
"track[indexTrack.leafBelow.value, ": 'leafBelow[',
|
|
147
|
+
'track[indexTrack.countDimensionsGapped.value, ': 'countDimensionsGapped[',
|
|
148
|
+
'track[indexTrack.gapRangeStart.value, ': 'gapRangeStart[',
|
|
149
|
+
}
|
|
150
|
+
|
|
151
|
+
ImaIndent = " "
|
|
152
|
+
linesInitialize = """"""
|
|
153
|
+
|
|
154
|
+
for find, replace in dictionaryReplaceScalars.items():
|
|
155
|
+
linesInitialize += f"{ImaIndent}{replace} = {find}\n"
|
|
156
|
+
codeInlined = codeInlined.replace(find, replace)
|
|
157
|
+
|
|
158
|
+
for find, replace in dictionaryReplaceArrays.items():
|
|
159
|
+
linesInitialize += f"{ImaIndent}{replace[0:-1]} = {find[0:-2]}]\n"
|
|
160
|
+
codeInlined = codeInlined.replace(find, replace)
|
|
161
|
+
|
|
162
|
+
ourGuyOnTheInside = " doFindGaps = True\n"
|
|
163
|
+
linesInitialize = ourGuyOnTheInside + linesInitialize
|
|
164
|
+
|
|
165
|
+
codeInlined = codeInlined.replace(ourGuyOnTheInside, linesInitialize)
|
|
166
|
+
|
|
167
|
+
return codeInlined
|
|
168
|
+
|
|
114
169
|
def Z0Z_inlineMapFolding():
|
|
115
170
|
dictionaryEnumValues = getDictionaryEnumValues()
|
|
171
|
+
codeSource = inspect.getsource(algorithmSource)
|
|
172
|
+
pathFilenameAlgorithm = pathlib.Path(inspect.getfile(algorithmSource))
|
|
116
173
|
|
|
117
|
-
|
|
118
|
-
codeSource = pathFilenameSource.read_text()
|
|
119
|
-
|
|
120
|
-
listCallables = [
|
|
121
|
-
'countInitialize',
|
|
122
|
-
'countParallel',
|
|
123
|
-
'countSequential',
|
|
124
|
-
]
|
|
174
|
+
listCallables = [ 'countInitialize', 'countParallel', 'countSequential', ]
|
|
125
175
|
|
|
126
176
|
listPathFilenamesDestination: list[pathlib.Path] = []
|
|
127
177
|
for callableTarget in listCallables:
|
|
128
|
-
|
|
129
|
-
|
|
130
|
-
pathFilenameDestination.
|
|
178
|
+
skipEnum = (callableTarget == 'countInitialize')
|
|
179
|
+
skipEnum = (callableTarget == 'countSequential')
|
|
180
|
+
pathFilenameDestination = pathFilenameAlgorithm.parent / "someAssemblyRequired" / pathFilenameAlgorithm.with_stem(callableTarget).name
|
|
181
|
+
codeInlined = inlineFunctions(codeSource, callableTarget, dictionaryEnumValues, skipEnum)
|
|
182
|
+
codeUnpacked = unpackArrays(codeInlined, callableTarget)
|
|
183
|
+
pathFilenameDestination.write_text(codeUnpacked)
|
|
131
184
|
listPathFilenamesDestination.append(pathFilenameDestination)
|
|
132
185
|
|
|
133
|
-
listNoNumba = [
|
|
134
|
-
'countInitialize',
|
|
135
|
-
'countSequential',
|
|
136
|
-
]
|
|
137
|
-
|
|
138
|
-
listPathFilenamesNoNumba = []
|
|
139
|
-
for pathFilename in listPathFilenamesDestination:
|
|
140
|
-
if pathFilename.stem in listNoNumba:
|
|
141
|
-
pathFilenameNoNumba = pathFilename.with_name(pathFilename.stem + 'NoNumba' + pathFilename.suffix)
|
|
142
|
-
else:
|
|
143
|
-
continue
|
|
144
|
-
codeNoNumba = pathFilename.read_text()
|
|
145
|
-
for codeLine in copy.copy(codeNoNumba.splitlines()):
|
|
146
|
-
if 'numba' in codeLine:
|
|
147
|
-
codeNoNumba = codeNoNumba.replace(codeLine, '')
|
|
148
|
-
pathFilenameNoNumba.write_text(codeNoNumba)
|
|
149
|
-
listPathFilenamesNoNumba.append(pathFilenameNoNumba)
|
|
150
|
-
|
|
151
186
|
if __name__ == '__main__':
|
|
152
187
|
Z0Z_inlineMapFolding()
|
|
@@ -38,16 +38,18 @@ optional-dependencies = { benchmark = [
|
|
|
38
38
|
"pandas",
|
|
39
39
|
"tqdm",
|
|
40
40
|
], testing = [
|
|
41
|
+
"more_itertools",
|
|
41
42
|
"pytest",
|
|
42
43
|
"pytest-cov",
|
|
43
44
|
"pytest-env",
|
|
44
45
|
"pytest-xdist",
|
|
46
|
+
"python_minifier",
|
|
45
47
|
] }
|
|
46
48
|
readme = { file = "README.md", content-type = "text/markdown" }
|
|
47
49
|
requires-python = ">=3.10,<3.14"
|
|
48
50
|
scripts = { getOEISids = "mapFolding.oeis:getOEISids", clearOEIScache = "mapFolding.oeis:clearOEIScache", OEIS_for_n = "mapFolding.oeis:OEIS_for_n" }
|
|
49
51
|
urls = { Homepage = "https://github.com/hunterhogan/mapFolding", Donate = "https://www.patreon.com/integrated" }
|
|
50
|
-
version = "0.
|
|
52
|
+
version = "0.3.0"
|
|
51
53
|
|
|
52
54
|
[tool.coverage]
|
|
53
55
|
report = { exclude_lines = [
|
|
@@ -68,7 +70,8 @@ xml = { output = "tests/coverage/coverage.xml" }
|
|
|
68
70
|
|
|
69
71
|
[tool.pytest.ini_options]
|
|
70
72
|
addopts = ["--color=yes", "-n 4"]
|
|
71
|
-
env = ["NUMBA_JIT_COVERAGE=1"]
|
|
73
|
+
# env = ["NUMBA_JIT_COVERAGE=1"]
|
|
74
|
+
env = ["NUMBA_DISABLE_JIT=1"]
|
|
72
75
|
testpaths = ["tests"]
|
|
73
76
|
|
|
74
77
|
[tool.setuptools.packages.find]
|
|
@@ -1,46 +0,0 @@
|
|
|
1
|
-
from typing import Any, Optional, Sequence, Type
|
|
2
|
-
|
|
3
|
-
def Z0Z_makeJob(listDimensions: Sequence[int], **keywordArguments: Optional[Type[Any]]):
|
|
4
|
-
from mapFolding import outfitCountFolds
|
|
5
|
-
stateUniversal = outfitCountFolds(listDimensions, computationDivisions=None, CPUlimit=None, **keywordArguments)
|
|
6
|
-
from mapFolding.someAssemblyRequired.countInitializeNoNumba import countInitialize
|
|
7
|
-
countInitialize(stateUniversal['connectionGraph'], stateUniversal['gapsWhere'], stateUniversal['my'], stateUniversal['track'])
|
|
8
|
-
from mapFolding import getPathFilenameFoldsTotal
|
|
9
|
-
pathFilenameChopChop = getPathFilenameFoldsTotal(stateUniversal['mapShape'])
|
|
10
|
-
import pathlib
|
|
11
|
-
suffix = pathFilenameChopChop.suffix
|
|
12
|
-
pathJob = pathlib.Path(str(pathFilenameChopChop)[0:-len(suffix)])
|
|
13
|
-
pathJob.mkdir(parents=True, exist_ok=True)
|
|
14
|
-
pathFilenameJob = pathJob / 'stateJob.pkl'
|
|
15
|
-
|
|
16
|
-
pathFilenameFoldsTotal = getPathFilenameFoldsTotal(stateUniversal['mapShape'], pathFilenameJob.parent)
|
|
17
|
-
stateJob = {**stateUniversal, 'pathFilenameFoldsTotal': pathFilenameFoldsTotal}
|
|
18
|
-
|
|
19
|
-
del stateJob['mapShape']
|
|
20
|
-
|
|
21
|
-
import pickle
|
|
22
|
-
pathFilenameJob.write_bytes(pickle.dumps(stateJob))
|
|
23
|
-
return pathFilenameJob
|
|
24
|
-
|
|
25
|
-
def runJob(pathFilename):
|
|
26
|
-
from typing import Final
|
|
27
|
-
import numpy
|
|
28
|
-
from pathlib import Path
|
|
29
|
-
pathFilenameJob = Path(pathFilename)
|
|
30
|
-
from pickle import loads
|
|
31
|
-
stateJob = loads(pathFilenameJob.read_bytes())
|
|
32
|
-
|
|
33
|
-
connectionGraph: numpy.ndarray = stateJob['connectionGraph']
|
|
34
|
-
foldsSubTotals: numpy.ndarray = stateJob['foldsSubTotals']
|
|
35
|
-
gapsWhere: numpy.ndarray = stateJob['gapsWhere']
|
|
36
|
-
my: numpy.ndarray = stateJob['my']
|
|
37
|
-
pathFilenameFoldsTotal: Final[Path] = stateJob['pathFilenameFoldsTotal']
|
|
38
|
-
track: numpy.ndarray = stateJob['track']
|
|
39
|
-
|
|
40
|
-
from mapFolding.someAssemblyRequired.countSequentialNoNumba import countSequential
|
|
41
|
-
countSequential(connectionGraph, foldsSubTotals, gapsWhere, my, track)
|
|
42
|
-
|
|
43
|
-
print(foldsSubTotals.sum().item())
|
|
44
|
-
Path(pathFilenameFoldsTotal).parent.mkdir(parents=True, exist_ok=True)
|
|
45
|
-
Path(pathFilenameFoldsTotal).write_text(str(foldsSubTotals.sum().item()))
|
|
46
|
-
print(pathFilenameFoldsTotal)
|
|
@@ -1,99 +0,0 @@
|
|
|
1
|
-
"""NOTE make a special venv for nuitka, then run nuitka from that venv"""
|
|
2
|
-
from pathlib import Path
|
|
3
|
-
from pickle import loads
|
|
4
|
-
from typing import Final
|
|
5
|
-
import numpy
|
|
6
|
-
from mapFolding.someAssemblyRequired.jobsAndTasks import Z0Z_makeJob
|
|
7
|
-
|
|
8
|
-
"""
|
|
9
|
-
Section: configure every time"""
|
|
10
|
-
|
|
11
|
-
# TODO configure this
|
|
12
|
-
mapShape = [3]*3
|
|
13
|
-
# NOTE ^^^^^^ pay attention
|
|
14
|
-
|
|
15
|
-
"""
|
|
16
|
-
Section: settings"""
|
|
17
|
-
|
|
18
|
-
pathFilenameData = Z0Z_makeJob(mapShape)
|
|
19
|
-
|
|
20
|
-
pathJob = pathFilenameData.parent
|
|
21
|
-
|
|
22
|
-
pathFilenameAlgorithm = Path('/apps/mapFolding/mapFolding/countSequentialNoNumba.py')
|
|
23
|
-
pathFilenameDestination = Path(f"/apps/mapFolding/nn/{pathJob.name}.py")
|
|
24
|
-
|
|
25
|
-
"""
|
|
26
|
-
Section: did you handle and include this stuff?"""
|
|
27
|
-
|
|
28
|
-
lineImportNumPy = "import numpy"
|
|
29
|
-
linePrintFoldsTotal = "print(foldsSubTotals.sum().item())"
|
|
30
|
-
linesAlgorithm = """"""
|
|
31
|
-
linesData = """"""
|
|
32
|
-
settingsNuitkaProject=f"""
|
|
33
|
-
# nuitka-project: --mode=onefile
|
|
34
|
-
# nuitka-project: --onefile-no-compression
|
|
35
|
-
# nuitka-project: --lto=yes
|
|
36
|
-
# nuitka-project: --clang
|
|
37
|
-
# nuitka-project: --output-dir={pathJob}
|
|
38
|
-
# nuitka-project: --output-filename={pathJob.name}.exe
|
|
39
|
-
"""
|
|
40
|
-
# nuitka-project:
|
|
41
|
-
"""
|
|
42
|
-
Section: do the work"""
|
|
43
|
-
|
|
44
|
-
WTFamIdoing = pathFilenameAlgorithm.read_text()
|
|
45
|
-
for lineSource in WTFamIdoing.splitlines():
|
|
46
|
-
ImaIndent = ' '
|
|
47
|
-
if lineSource.startswith(ImaIndent):
|
|
48
|
-
lineSource = lineSource[len(ImaIndent):None]
|
|
49
|
-
elif lineSource.startswith('#'):
|
|
50
|
-
continue
|
|
51
|
-
elif not lineSource:
|
|
52
|
-
continue
|
|
53
|
-
elif lineSource.startswith('def '):
|
|
54
|
-
continue
|
|
55
|
-
else:
|
|
56
|
-
raise NotImplementedError("You didn't anticipate this.")
|
|
57
|
-
linesAlgorithm = "\n".join([linesAlgorithm
|
|
58
|
-
, lineSource
|
|
59
|
-
])
|
|
60
|
-
|
|
61
|
-
stateJob = loads(pathFilenameData.read_bytes())
|
|
62
|
-
connectionGraph: Final[numpy.ndarray] = stateJob['connectionGraph']
|
|
63
|
-
foldsSubTotals: numpy.ndarray = stateJob['foldsSubTotals']
|
|
64
|
-
gapsWhere: numpy.ndarray = stateJob['gapsWhere']
|
|
65
|
-
my: numpy.ndarray = stateJob['my']
|
|
66
|
-
the: numpy.ndarray = stateJob['the']
|
|
67
|
-
track: numpy.ndarray = stateJob['track']
|
|
68
|
-
|
|
69
|
-
pathFilenameFoldsTotal = stateJob['pathFilenameFoldsTotal']
|
|
70
|
-
lineDataPathFilenameFoldsTotal = "pathFilenameFoldsTotal = r'" + str(pathFilenameFoldsTotal) + "'\n"
|
|
71
|
-
|
|
72
|
-
def archivistFormatsArrayToCode(arrayTarget: numpy.ndarray, identifierName: str) -> str:
|
|
73
|
-
"""Format numpy array into a code string that recreates the array."""
|
|
74
|
-
arrayAsTypeStr = numpy.array2string(
|
|
75
|
-
arrayTarget,
|
|
76
|
-
threshold=10000,
|
|
77
|
-
max_line_width=100,
|
|
78
|
-
separator=','
|
|
79
|
-
)
|
|
80
|
-
return f"{identifierName} = numpy.array({arrayAsTypeStr}, dtype=numpy.{arrayTarget.dtype})\n"
|
|
81
|
-
|
|
82
|
-
linesData = "\n".join([linesData
|
|
83
|
-
, lineDataPathFilenameFoldsTotal
|
|
84
|
-
, archivistFormatsArrayToCode(the, 'the')
|
|
85
|
-
, archivistFormatsArrayToCode(my, 'my')
|
|
86
|
-
, archivistFormatsArrayToCode(foldsSubTotals, 'foldsSubTotals')
|
|
87
|
-
, archivistFormatsArrayToCode(gapsWhere, 'gapsWhere')
|
|
88
|
-
, archivistFormatsArrayToCode(connectionGraph, 'connectionGraph')
|
|
89
|
-
, archivistFormatsArrayToCode(track, 'track')
|
|
90
|
-
])
|
|
91
|
-
|
|
92
|
-
linesAll = "\n".join([settingsNuitkaProject
|
|
93
|
-
, lineImportNumPy
|
|
94
|
-
, linesData
|
|
95
|
-
, linesAlgorithm
|
|
96
|
-
, linePrintFoldsTotal
|
|
97
|
-
])
|
|
98
|
-
|
|
99
|
-
pathFilenameDestination.write_text(linesAll)
|
|
@@ -1,147 +0,0 @@
|
|
|
1
|
-
"""Create a python module hardcoded to compute a map's foldsTotal.
|
|
2
|
-
- NumPy ndarray.
|
|
3
|
-
- Numba optimized.
|
|
4
|
-
- Absolutely no other imports.
|
|
5
|
-
|
|
6
|
-
Can create LLVM IR from the module: of unknown utility.
|
|
7
|
-
"""
|
|
8
|
-
# from mapFolding import dtypeDefault, dtypeSmall
|
|
9
|
-
from mapFolding import make_dtype, datatypeLarge, dtypeLarge
|
|
10
|
-
from mapFolding.someAssemblyRequired.inlineAfunction import Z0Z_inlineMapFolding
|
|
11
|
-
from mapFolding.someAssemblyRequired.jobsAndTasks import Z0Z_makeJob
|
|
12
|
-
import importlib
|
|
13
|
-
import llvmlite.binding
|
|
14
|
-
import numpy
|
|
15
|
-
import pathlib
|
|
16
|
-
import pickle
|
|
17
|
-
import python_minifier
|
|
18
|
-
|
|
19
|
-
listDimensions = [5,5]
|
|
20
|
-
|
|
21
|
-
# NOTE this overwrites files
|
|
22
|
-
Z0Z_inlineMapFolding()
|
|
23
|
-
|
|
24
|
-
identifierCallableLaunch = "goGoGadgetAbsurdity"
|
|
25
|
-
|
|
26
|
-
def convertNDArrayToStr(arrayTarget: numpy.ndarray, identifierName: str) -> str:
|
|
27
|
-
arrayAsTypeStr = numpy.array2string(arrayTarget, threshold=100000, max_line_width=200, separator=',')
|
|
28
|
-
stringMinimized = python_minifier.minify(arrayAsTypeStr)
|
|
29
|
-
commaZeroMaximum = arrayTarget.shape[-1] - 1
|
|
30
|
-
stringMinimized = stringMinimized.replace('[0' + ',0'*commaZeroMaximum + ']', '[0]*'+str(commaZeroMaximum+1))
|
|
31
|
-
for countZeros in range(commaZeroMaximum, 2, -1):
|
|
32
|
-
stringMinimized = stringMinimized.replace(',0'*countZeros + ']', ']+[0]*'+str(countZeros))
|
|
33
|
-
return f"{identifierName} = numpy.array({stringMinimized}, dtype=numpy.{arrayTarget.dtype})"
|
|
34
|
-
|
|
35
|
-
def writeModuleWithNumba(listDimensions):
|
|
36
|
-
numpy_dtypeLarge = dtypeLarge
|
|
37
|
-
# numpy_dtypeDefault = dtypeDefault
|
|
38
|
-
datatypeDefault = 'uint8'
|
|
39
|
-
numpy_dtypeDefault = make_dtype(datatypeDefault)
|
|
40
|
-
numpy_dtypeSmall = numpy_dtypeDefault
|
|
41
|
-
# forceinline=True might actually be useful
|
|
42
|
-
parametersNumba = f"numba.types.{datatypeLarge}(), \
|
|
43
|
-
cache=True, \
|
|
44
|
-
nopython=True, \
|
|
45
|
-
fastmath=True, \
|
|
46
|
-
forceinline=True, \
|
|
47
|
-
inline='always', \
|
|
48
|
-
looplift=False, \
|
|
49
|
-
_nrt=True, \
|
|
50
|
-
error_model='numpy', \
|
|
51
|
-
parallel=False, \
|
|
52
|
-
boundscheck=False, \
|
|
53
|
-
no_cfunc_wrapper=False, \
|
|
54
|
-
no_cpython_wrapper=False, \
|
|
55
|
-
"
|
|
56
|
-
# no_cfunc_wrapper=True, \
|
|
57
|
-
# no_cpython_wrapper=True, \
|
|
58
|
-
|
|
59
|
-
pathFilenameData = Z0Z_makeJob(listDimensions, datatypeDefault=numpy_dtypeDefault, datatypeLarge=numpy_dtypeLarge, datatypeSmall=numpy_dtypeSmall)
|
|
60
|
-
|
|
61
|
-
pathFilenameAlgorithm = pathlib.Path('/apps/mapFolding/mapFolding/someAssemblyRequired/countSequentialNoNumba.py')
|
|
62
|
-
pathFilenameDestination = pathFilenameData.with_stem(pathFilenameData.parent.name).with_suffix(".py")
|
|
63
|
-
|
|
64
|
-
lineNumba = f"@numba.jit({parametersNumba})"
|
|
65
|
-
|
|
66
|
-
linesImport = "\n".join([
|
|
67
|
-
"import numpy"
|
|
68
|
-
, "import numba"
|
|
69
|
-
])
|
|
70
|
-
|
|
71
|
-
stateJob = pickle.loads(pathFilenameData.read_bytes())
|
|
72
|
-
|
|
73
|
-
ImaIndent = ' '
|
|
74
|
-
linesDataDynamic = """"""
|
|
75
|
-
linesDataDynamic = "\n".join([linesDataDynamic
|
|
76
|
-
, ImaIndent + f"foldsTotal = numba.types.{datatypeLarge}(0)"
|
|
77
|
-
, ImaIndent + convertNDArrayToStr(stateJob['my'], 'my')
|
|
78
|
-
, ImaIndent + convertNDArrayToStr(stateJob['foldGroups'], 'foldGroups')
|
|
79
|
-
, ImaIndent + convertNDArrayToStr(stateJob['gapsWhere'], 'gapsWhere')
|
|
80
|
-
, ImaIndent + convertNDArrayToStr(stateJob['track'], 'track')
|
|
81
|
-
])
|
|
82
|
-
|
|
83
|
-
linesDataStatic = """"""
|
|
84
|
-
linesDataStatic = "\n".join([linesDataStatic
|
|
85
|
-
, ImaIndent + convertNDArrayToStr(stateJob['connectionGraph'], 'connectionGraph')
|
|
86
|
-
])
|
|
87
|
-
|
|
88
|
-
pathFilenameFoldsTotal: pathlib.Path = stateJob['pathFilenameFoldsTotal']
|
|
89
|
-
|
|
90
|
-
linesAlgorithm = """"""
|
|
91
|
-
for lineSource in pathFilenameAlgorithm.read_text().splitlines():
|
|
92
|
-
if lineSource.startswith('#'):
|
|
93
|
-
continue
|
|
94
|
-
elif not lineSource:
|
|
95
|
-
continue
|
|
96
|
-
elif lineSource.startswith('def '):
|
|
97
|
-
lineSource = "\n".join([lineNumba
|
|
98
|
-
, f"def {identifierCallableLaunch}():"
|
|
99
|
-
, linesDataDynamic
|
|
100
|
-
, linesDataStatic
|
|
101
|
-
])
|
|
102
|
-
linesAlgorithm = "\n".join([linesAlgorithm
|
|
103
|
-
, lineSource
|
|
104
|
-
])
|
|
105
|
-
|
|
106
|
-
linesLaunch = """"""
|
|
107
|
-
linesLaunch = linesLaunch + f"""
|
|
108
|
-
if __name__ == '__main__':
|
|
109
|
-
import time
|
|
110
|
-
timeStart = time.perf_counter()
|
|
111
|
-
{identifierCallableLaunch}()
|
|
112
|
-
print(time.perf_counter() - timeStart)"""
|
|
113
|
-
|
|
114
|
-
linesWriteFoldsTotal = """"""
|
|
115
|
-
linesWriteFoldsTotal = "\n".join([linesWriteFoldsTotal
|
|
116
|
-
, " foldsTotal = foldGroups[0:-1].sum() * foldGroups[-1]"
|
|
117
|
-
, " print(foldsTotal)"
|
|
118
|
-
, " with numba.objmode():"
|
|
119
|
-
, f" open('{pathFilenameFoldsTotal.as_posix()}', 'w').write(str(foldsTotal))"
|
|
120
|
-
, " return foldsTotal"
|
|
121
|
-
])
|
|
122
|
-
|
|
123
|
-
linesAll = "\n".join([
|
|
124
|
-
linesImport
|
|
125
|
-
, linesAlgorithm
|
|
126
|
-
, linesWriteFoldsTotal
|
|
127
|
-
, linesLaunch
|
|
128
|
-
])
|
|
129
|
-
|
|
130
|
-
pathFilenameDestination.write_text(linesAll)
|
|
131
|
-
|
|
132
|
-
return pathFilenameDestination
|
|
133
|
-
|
|
134
|
-
def writeModuleLLVM(pathFilenamePythonFile: pathlib.Path) -> pathlib.Path:
|
|
135
|
-
pathRootPackage = pathlib.Path('c:/apps/mapFolding')
|
|
136
|
-
relativePathModule = pathFilenamePythonFile.relative_to(pathRootPackage)
|
|
137
|
-
moduleTarget = '.'.join(relativePathModule.parts)[0:-len(relativePathModule.suffix)]
|
|
138
|
-
moduleTargetImported = importlib.import_module(moduleTarget)
|
|
139
|
-
linesLLVM = moduleTargetImported.__dict__[identifierCallableLaunch].inspect_llvm()[()]
|
|
140
|
-
moduleLLVM = llvmlite.binding.module.parse_assembly(linesLLVM)
|
|
141
|
-
pathFilenameLLVM = pathFilenamePythonFile.with_suffix(".ll")
|
|
142
|
-
pathFilenameLLVM.write_text(str(moduleLLVM))
|
|
143
|
-
return pathFilenameLLVM
|
|
144
|
-
|
|
145
|
-
if __name__ == '__main__':
|
|
146
|
-
pathFilenamePythonFile = writeModuleWithNumba(listDimensions)
|
|
147
|
-
pathFilenameLLVM = writeModuleLLVM(pathFilenamePythonFile)
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|