mapFolding 0.17.1__tar.gz → 0.18.0__tar.gz

{mapfolding-0.17.1/mapFolding.egg-info → mapfolding-0.18.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: mapFolding
-Version: 0.17.1
+Version: 0.18.0
 Summary: Map folding, meanders, stamp folding, semi-meanders. Experiment with algorithm transformations, and analyze computational states.
 Author-email: Hunter Hogan <HunterHogan@pm.me>
 License: CC-BY-NC-4.0
@@ -8,14 +8,13 @@ Project-URL: Donate, https://www.patreon.com/integrated
 Project-URL: Homepage, https://github.com/hunterhogan/mapFolding
 Project-URL: Issues, https://github.com/hunterhogan/mapFolding/issues
 Project-URL: Repository, https://github.com/hunterhogan/mapFolding.git
-Keywords: A000136,A000560,A000682,A001010,A001011,A001415,A001416,A001417,A001418,A005315,A005316,A007822,A178961,A195646,A223094,A259702,A301620,AST manipulation,JIT compilation,Numba optimization,OEIS,Python optimization,abstract syntax tree,algorithmic combinatorics,algorithmic optimization,arch configurations,automated code generation,bit-packed arrays,bitwise state machines,cache-efficient algorithms,closed meandric numbers,code generation,code optimization,code synthesis,code transformation,codon optimization,combinatorial computing,combinatorial enumeration,combinatorial geometry,combinatorial mathematics,combinatorial problem solver,combinatorics,computational combinatorics,computational geometry,crossing patterns,curve crossings,dataclass transformation,discrete mathematics,dynamic compilation,enumerative combinatorics,folding pattern enumeration,folding problems,high-performance computing,integer sequences,just-in-time compilation,kernel optimization,labeled stamp folding,low-level computation,map folding,mapFolding,mathematical algorithms,mathematical modeling,mathematical optimization,mathematical patterns,mathematical software,mathematical tool,mathematical visualization,meander enumeration,meanders,meandric systems,memory-efficient enumeration,metaprogramming,numerical algorithms,numerical computation,open meandric systems,paper folding mathematics,parallel computing,pattern recognition,performance optimization,permutation patterns,permutations,post-setup optimization,pyproject,scientific computing,semi-meanders,sequence analysis,sequence calculator,sequence enumeration,sequence explorer,sequence generation,source code analysis,stamp folding,symbolic computation,symmetric foldings,topological combinatorics,topological patterns,typed Python
+Keywords: A001415,A001417,Abstract Syntax Tree,AST,combinatorial geometry,combinatorics,computational combinatorics,computational geometry,map folding,meanders,OEIS,stamp folding
 Classifier: Development Status :: 4 - Beta
 Classifier: Environment :: Console
 Classifier: Intended Audience :: Developers
 Classifier: Intended Audience :: Education
 Classifier: Intended Audience :: Science/Research
 Classifier: Natural Language :: English
-Classifier: Operating System :: MacOS
 Classifier: Operating System :: OS Independent
 Classifier: Operating System :: POSIX :: Linux
 Classifier: Programming Language :: Python
@@ -23,6 +22,7 @@ Classifier: Programming Language :: Python :: 3
 Classifier: Programming Language :: Python :: 3 :: Only
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Python :: 3.14
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Topic :: Scientific/Engineering :: Information Analysis
 Classifier: Topic :: Scientific/Engineering :: Mathematics
@@ -31,17 +31,19 @@ Classifier: Topic :: Software Development :: Compilers
 Classifier: Topic :: Software Development :: Libraries :: Python Modules
 Classifier: Topic :: Software Development :: Pre-processors
 Classifier: Typing :: Typed
-Requires-Python: <3.14,>=3.12
+Requires-Python: >=3.12
 Description-Content-Type: text/markdown
 License-File: LICENSE
 Requires-Dist: astToolkit>=0.9.0
 Requires-Dist: cytoolz
 Requires-Dist: gmpy2
-Requires-Dist: hunterMakesPy>=0.3.0
+Requires-Dist: hunterMakesPy>=0.3.2
 Requires-Dist: more_itertools
 Requires-Dist: numpy
 Requires-Dist: platformdirs
+Requires-Dist: tqdm
 Provides-Extra: development
+Requires-Dist: gmpy2-stubs; extra == "development"
 Requires-Dist: ipykernel; extra == "development"
 Requires-Dist: ipywidgets; extra == "development"
 Requires-Dist: memray; sys_platform == "linux" and extra == "development"
@@ -51,8 +53,9 @@ Requires-Dist: setuptools-scm; extra == "development"
 Provides-Extra: numba
 Requires-Dist: numba; extra == "numba"
 Requires-Dist: numba_progress; extra == "numba"
+Provides-Extra: ortools
+Requires-Dist: ortools; extra == "ortools"
 Provides-Extra: pandas
-Requires-Dist: ortools; extra == "pandas"
 Requires-Dist: pandas; extra == "pandas"
 Requires-Dist: pyarrow; extra == "pandas"
 Provides-Extra: sympy
@@ -91,7 +94,7 @@ There are cool and powerful tools in here, but as of 2025 September 17, I am dis
 3. The directory "mapFolding/syntheticModules" has code that is generated by the transformation tools.
 4. Transformation functions are in "mapFolding/someAssemblyRequired."
 5. The directory "mapFolding/reference" has "reference" materials.
-6. "mapFolding/tests" has the tests, and I have tried to make it easy for you to add _your_ versions of the algorithms to the tests. Is it actually easy? I'll say it this way: if you were to create your own subclass of `ast.AST` it would be impossible for you to add your subclass to all of the `ast` module tests with just a few lines of code. In contrast, it is possible to fully test your algorithm with in my tests by adding between three and 25 lines of code. So, yeah, it's easy.
+6. "mapFolding/tests" has the tests, and I have tried to make it easy for you to add _your_ versions of the algorithms to the tests. Is it actually easy? I'll say it this way: if you were to create your own subclass of `ast.AST` it would be impossible for you to add your subclass to all of the `ast` module tests with just a few lines of code. In contrast, it is possible to fully test your algorithm with my tests by adding between 3 and 25 lines of code. So, yeah, it's easy.
 
 ## Math and programming
 
@@ -102,4 +105,4 @@ I'm not a mathematician. I don't have training in or professional experience as
 [![Static Badge](https://img.shields.io/badge/2011_August-Homeless_since-blue?style=flat)](https://HunterThinks.com/support)
 [![YouTube Channel Subscribers](https://img.shields.io/youtube/channel/subscribers/UC3Gx7kz61009NbhpRtPP7tw)](https://www.youtube.com/@HunterHogan)
 
-[![CC-BY-NC-4.0](https://raw.githubusercontent.com/hunterhogan/mapFolding/refs/heads/main/CC-BY-NC-4.0.png)](https://creativecommons.org/licenses/by-nc/4.0/)
+[![CC-BY-NC-4.0](https://raw.githubusercontent.com/hunterhogan/mapFolding/refs/heads/main/.github/CC-BY-NC-4.0.png)](https://creativecommons.org/licenses/by-nc/4.0/)

{mapfolding-0.17.1 → mapfolding-0.18.0}/README.md

@@ -20,7 +20,7 @@ There are cool and powerful tools in here, but as of 2025 September 17, I am dis
 3. The directory "mapFolding/syntheticModules" has code that is generated by the transformation tools.
 4. Transformation functions are in "mapFolding/someAssemblyRequired."
 5. The directory "mapFolding/reference" has "reference" materials.
-6. "mapFolding/tests" has the tests, and I have tried to make it easy for you to add _your_ versions of the algorithms to the tests. Is it actually easy? I'll say it this way: if you were to create your own subclass of `ast.AST` it would be impossible for you to add your subclass to all of the `ast` module tests with just a few lines of code. In contrast, it is possible to fully test your algorithm with in my tests by adding between three and 25 lines of code. So, yeah, it's easy.
+6. "mapFolding/tests" has the tests, and I have tried to make it easy for you to add _your_ versions of the algorithms to the tests. Is it actually easy? I'll say it this way: if you were to create your own subclass of `ast.AST` it would be impossible for you to add your subclass to all of the `ast` module tests with just a few lines of code. In contrast, it is possible to fully test your algorithm with my tests by adding between 3 and 25 lines of code. So, yeah, it's easy.
 
 ## Math and programming
 
@@ -31,4 +31,4 @@ I'm not a mathematician. I don't have training in or professional experience as
 [![Static Badge](https://img.shields.io/badge/2011_August-Homeless_since-blue?style=flat)](https://HunterThinks.com/support)
 [![YouTube Channel Subscribers](https://img.shields.io/youtube/channel/subscribers/UC3Gx7kz61009NbhpRtPP7tw)](https://www.youtube.com/@HunterHogan)
 
-[![CC-BY-NC-4.0](https://raw.githubusercontent.com/hunterhogan/mapFolding/refs/heads/main/CC-BY-NC-4.0.png)](https://creativecommons.org/licenses/by-nc/4.0/)
+[![CC-BY-NC-4.0](https://raw.githubusercontent.com/hunterhogan/mapFolding/refs/heads/main/.github/CC-BY-NC-4.0.png)](https://creativecommons.org/licenses/by-nc/4.0/)

{mapfolding-0.17.1 → mapfolding-0.18.0}/easyRun/NOTcountingFolds.py

@@ -1,6 +1,6 @@
 # ruff: noqa
 from collections import ChainMap
-from mapFolding import dictionaryOEIS, dictionaryOEISMapFolding
+from mapFolding import ansiColorReset, ansiColors, dictionaryOEIS, dictionaryOEISMapFolding
 from mapFolding.basecamp import NOTcountingFolds
 import sys
 import time
@@ -11,11 +11,11 @@ if __name__ == '__main__':
 	def _write() -> None:
 		sys.stdout.write(
 			f"{(match:=countTotal == dictionaryONE[oeisID]['valuesKnown'][n])}\t"
-			f"\033[{(not match)*91}m"
+			f"{(ansiColors.YellowOnRed, ansiColors.GreenOnBlack)[match]}"
 			f"{n}\t"
 			f"{countTotal}\t"
 			f"{time.perf_counter() - timeStart:.2f}\t"
-			"\033[0m\n"
+			f"{ansiColorReset}\n"
 		)
 
 	CPUlimit: bool | float | int | None = -2
@@ -26,14 +26,10 @@ if __name__ == '__main__':
 
 	flow = 'algorithm'
 	flow = 'theorem2'
-	flow = 'eliminationParallel'
-	flow = 'elimination_combi'
-	flow = 'constraintPropagation'
-	flow = 'elimination'
 
-	sys.stdout.write(f"\033[{30+int(oeisID,11)%8};{40+int(oeisID,12)%8}m{oeisID} ")
-	sys.stdout.write(f"\033[{31+int(flow,35)%7};{41+int(flow,36)%7}m{flow}")
-	sys.stdout.write("\033[0m\n")
+	sys.stdout.write(f"{ansiColors[int(oeisID,36)%len(ansiColors)]}{oeisID} ")
+	sys.stdout.write(f"{ansiColors[int(flow,36)%len(ansiColors)]}{flow}")
+	sys.stdout.write(ansiColorReset + '\n')
 
 	nList: list[int] = []
 	nList.extend(range(7, 11))
@@ -49,6 +45,6 @@ if __name__ == '__main__':
 		_write()
 
 r"""
-deactivate && C:\apps\mapFolding\.vtail\Scripts\activate.bat && title good && cls
+
 title running && start "working" /B /HIGH /wait py -X faulthandler=0 -X tracemalloc=0 -X frozen_modules=on easyRun\NOTcountingFolds.py & title I'm done
 """

{mapfolding-0.17.1 → mapfolding-0.18.0}/easyRun/countFolds.py

@@ -1,7 +1,8 @@
 # ruff: noqa
 # pyright: basic
 from collections.abc import Sequence
-from mapFolding import countFolds, dictionaryOEISMapFolding
+from mapFolding import ansiColorReset, ansiColors, dictionaryOEISMapFolding
+from mapFolding.basecamp import countFolds
 from os import PathLike
 from pathlib import PurePath
 import sys
@@ -11,12 +12,12 @@ if __name__ == '__main__':
 	def _write() -> None:
 		sys.stdout.write(
 			f"{(match:=foldsTotal == dictionaryOEISMapFolding[oeisID]['valuesKnown'][n])}\t"
-			f"\033[{(not match)*91}m"
+			f"{(ansiColors.YellowOnRed, ansiColors.GreenOnBlack)[match]}"
 			f"{n}\t"
 			f"{foldsTotal}\t"
 			f"{dictionaryOEISMapFolding[oeisID]['valuesKnown'][n]}\t"
 			f"{time.perf_counter() - timeStart:.2f}\t"
-			"\033[0m\n"
+			f"{ansiColorReset}\n"
 		)
 
 	listDimensions: Sequence[int] | None = None
@@ -24,23 +25,23 @@ if __name__ == '__main__':
 	computationDivisions: int | str | None = None
 	CPUlimit: bool | float | int | None = None
 	# mapShape: tuple[int, ...] | None = None
-	flow = 'daoOfMapFolding'
 	flow = 'numba'
 	flow = 'theorem2'
 	flow = 'theorem2Numba'
+	flow = 'daoOfMapFolding'
 
 	oeisID: str = 'A195646'
+	oeisID: str = 'A001416'
 	oeisID: str = 'A001418'
+	oeisID: str = 'A001417'
 	oeisID: str = 'A000136'
-	oeisID: str = 'A001416'
 	oeisID: str = 'A001415'
-	oeisID: str = 'A001417'
 
-	sys.stdout.write(f"\033[{30+int(oeisID,11)%8};{40+int(oeisID,12)%8}m{oeisID} ")
-	sys.stdout.write(f"\033[{31+int(flow,35)%7};{41+int(flow,36)%7}m{flow}")
-	sys.stdout.write("\033[0m\n")
+	sys.stdout.write(f"{ansiColors[int(oeisID,36)%len(ansiColors)]}{oeisID} ")
+	sys.stdout.write(f"{ansiColors[int(flow,36)%len(ansiColors)]}{flow}")
+	sys.stdout.write(ansiColorReset + '\n')
 
-	for n in range(6,7):
+	for n in range(2):
 
 		mapShape: tuple[int, ...] = dictionaryOEISMapFolding[oeisID]['getMapShape'](n)
 

{mapfolding-0.17.1 → mapfolding-0.18.0}/easyRun/meanders.py

@@ -1,26 +1,24 @@
 # ruff: noqa
 # pyright: basic
-from mapFolding import dictionaryOEIS
+from mapFolding import ansiColorReset, ansiColors, dictionaryOEIS
 from mapFolding.basecamp import NOTcountingFolds
 import gc
-import multiprocessing
 import sys
 import time
 import warnings
 
 def write() -> None:
 	sys.stdout.write(
-		f"{(booleanColor:=(countTotal == dictionaryOEIS[oeisID]['valuesKnown'][n]))}\t"
-		f"\033[{(not booleanColor)*91}m"
+		f"{(match:=(countTotal == dictionaryOEIS[oeisID]['valuesKnown'][n]))}\t"
+		f"{(ansiColors.YellowOnRed, ansiColors.GreenOnBlack)[match]}"
 		f"{n}\t"
 		# f"{countTotal}\t"
 		# f"{dictionaryOEISMeanders[oeisID]['valuesKnown'][n]}\t"
 		f"{time.perf_counter() - timeStart:.2f}\t"
-		"\033[0m\n"
+		f"{ansiColorReset}\n"
 	)
 
 if __name__ == '__main__':
-	multiprocessing.set_start_method('spawn')
 	if sys.version_info >= (3, 14):
 		warnings.filterwarnings("ignore", category=FutureWarning)
 
@@ -34,7 +32,7 @@ if __name__ == '__main__':
 				]:
 		sys.stdout.write(f"\n{oeisID}\n")
 
-		"""TODO Identifiers. improve
+		"""# TODO Identifiers. improve
 		"generate up to four targets."
 		1. Adding a new loop.
 		2. Dragging up a loop end.
@@ -63,7 +61,7 @@ if __name__ == '__main__':
 				sys.stdout.write(f"{n} {countTotal} {time.perf_counter() - timeStart:.2f}\n")
 
 r"""
-deactivate && C:\apps\mapFolding\.vtail\Scripts\activate.bat && title good && cls
+
 title running && start "meanders" /B /HIGH /wait py -X faulthandler=0 -X tracemalloc=0 -X frozen_modules=on easyRun\meanders.py && title I'm done || title Error
 
 """

mapfolding-0.18.0/mapFolding/__init__.py

@@ -0,0 +1,38 @@
+"""Map folding, meanders, stamp folding, semi-meanders. Experiment with algorithm transformations, and analyze computational states."""
+
+# isort: split
+from mapFolding._semiotics import (
+	ansiColorReset as ansiColorReset, ansiColors as ansiColors, decreasing as decreasing, inclusive as inclusive,
+	zeroIndexed as zeroIndexed)
+
+# isort: split
+from mapFolding._theTypes import (
+	Array1DElephino as Array1DElephino, Array1DFoldsTotal as Array1DFoldsTotal, Array1DLeavesTotal as Array1DLeavesTotal,
+	Array2DLeavesTotal as Array2DLeavesTotal, Array3DLeavesTotal as Array3DLeavesTotal, axisOfLength as axisOfLength,
+	DatatypeElephino as DatatypeElephino, DatatypeFoldsTotal as DatatypeFoldsTotal,
+	DatatypeLeavesTotal as DatatypeLeavesTotal, MetadataOEISid as MetadataOEISid,
+	MetadataOEISidManuallySet as MetadataOEISidManuallySet, MetadataOEISidMapFolding as MetadataOEISidMapFolding,
+	MetadataOEISidMapFoldingManuallySet as MetadataOEISidMapFoldingManuallySet, NumPyElephino as NumPyElephino,
+	NumPyFoldsTotal as NumPyFoldsTotal, NumPyIntegerType as NumPyIntegerType, NumPyLeavesTotal as NumPyLeavesTotal,
+	ShapeArray as ShapeArray, ShapeSlicer as ShapeSlicer)
+
+# isort: split
+from mapFolding._theSSOT import packageSettings as packageSettings
+
+# isort: split
+from mapFolding.beDRY import (
+	defineProcessorLimit as defineProcessorLimit, getConnectionGraph as getConnectionGraph,
+	getLeavesTotal as getLeavesTotal, getTaskDivisions as getTaskDivisions, makeDataContainer as makeDataContainer,
+	validateListDimensions as validateListDimensions)
+
+# isort: split
+from mapFolding.filesystemToolkit import (
+	getFilenameFoldsTotal as getFilenameFoldsTotal, getPathFilenameFoldsTotal as getPathFilenameFoldsTotal,
+	getPathRootJobDEFAULT as getPathRootJobDEFAULT, saveFoldsTotal as saveFoldsTotal,
+	saveFoldsTotalFAILearly as saveFoldsTotalFAILearly)
+
+# isort: split
+from mapFolding.oeis import (
+	dictionaryOEIS as dictionaryOEIS, dictionaryOEISMapFolding as dictionaryOEISMapFolding,
+	getFoldsTotalKnown as getFoldsTotalKnown, getOEISids as getOEISids, OEIS_for_n as OEIS_for_n,
+	oeisIDfor_n as oeisIDfor_n)

mapfolding-0.18.0/mapFolding/_e/Z0Z_analysisPython/SORTZ0Z_hypothesis.py

@@ -0,0 +1,189 @@
+# ruff: noqa
+from cytoolz.dicttoolz import valfilter
+from functools import cache
+from gmpy2 import bit_flip, bit_mask, bit_test, is_even
+from hunterMakesPy import raiseIfNone
+from mapFolding import decreasing
+from mapFolding._e import dimensionNearestTail, dimensionNearest首, howManyDimensionsHaveOddParity, leafOrigin, 零
+from mapFolding._e.algorithms.iff import getCreasePost, ImaOddLeaf
+from mapFolding._e.dataBaskets import EliminationState
+from math import log2, prod
+from pprint import pprint
+
+def getDictionaryAddends4Next(state: EliminationState) -> dict[int, list[int]]:
+	@cache
+	def workhorse(mapShape: tuple[int, ...], dimensionsTotal: int, leavesTotal: int) -> dict[int, list[int]]:
+		dictionaryAddends: dict[int, list[int]] = {leafOrigin: [1]}
+
+		productsOfDimensions: list[int] = [prod(mapShape[0:dimension], start=1) for dimension in range(dimensionsTotal)]
+
+		for leaf in range(零, leavesTotal):
+			products下_leaf: list[int] = productsOfDimensions.copy()
+
+			theMaskOfDirectionality = bit_mask(leavesTotal - 零) & leaf
+			for index in range(dimensionsTotal):
+				if bit_test(theMaskOfDirectionality, index):
+					products下_leaf[index] *= -1
+
+			slicingIndexStart: int = howManyDimensionsHaveOddParity(leaf) & 1 ^ 1
+			slicingIndexEnd = dimensionNearest首(leaf) * (slicingIndexStart ^ 1) or None
+
+			if (slicingIndexStart == 1) and is_even(leaf):
+				slicingIndexStart += dimensionNearestTail(leaf)
+
+			products下_leaf = products下_leaf[slicingIndexStart:None]
+			products下_leaf = products下_leaf[0:slicingIndexEnd]
+			dictionaryAddends[leaf] = products下_leaf
+
+		return dictionaryAddends
+	return workhorse(state.mapShape, state.dimensionsTotal, state.leavesTotal)
+
+def getDictionaryAddends4Prior(state: EliminationState) -> dict[int, list[int]]:
+	@cache
+	def workhorse(mapShape: tuple[int, ...], dimensionsTotal: int, leavesTotal: int) -> dict[int, list[int]]:
+		dictionaryAddends: dict[int, list[int]] = {leafOrigin: [], 零: [-1]}
+
+		productsOfDimensions: list[int] = [prod(mapShape[0:dimension], start=1) for dimension in range(dimensionsTotal)]
+
+		for leaf in range(leavesTotal + decreasing, 1, decreasing):
+			products下_leaf: list[int] = productsOfDimensions.copy()
+
+			theMaskOfDirectionality = bit_mask(leavesTotal - 零) & leaf
+			for index in range(dimensionsTotal):
+				if bit_test(theMaskOfDirectionality, index):
+					products下_leaf[index] *= -1
+
+			slicingIndexStart: int = howManyDimensionsHaveOddParity(leaf) & 1
+			slicingIndexEnd = dimensionNearest首(leaf) * (slicingIndexStart ^ 1) or None
+
+			if (slicingIndexStart == 1) and is_even(leaf):
+				slicingIndexStart += dimensionNearestTail(leaf)
+
+			products下_leaf = products下_leaf[slicingIndexStart:None]
+			products下_leaf = products下_leaf[0:slicingIndexEnd]
+			dictionaryAddends[leaf] = products下_leaf
+
+		return dictionaryAddends
+	return workhorse(state.mapShape, state.dimensionsTotal, state.leavesTotal)
+
+if __name__ == '__main__':
+	state = EliminationState((2,) * 5)
+
+	dictionaryAddends4Next: dict[int, list[int]] = getDictionaryAddends4Next(state)
+	dictionaryAddends4Prior: dict[int, list[int]] = getDictionaryAddends4Prior(state)
+
+	printThis = False
+
+	for leaf in range(state.leavesTotal):
+		dictionaryNextCreaseLeafV0: dict[int, int | None] = {dimension: getCreasePost(state.mapShape, leaf, dimension) for dimension in range(state.dimensionsTotal)}
+		listAddendLeaves = sorted([leaf + addend for addend in dictionaryAddends4Next[leaf]])
+		if printThis:
+			print(leaf, end='\t')
+			print(leaf)
+		for indexAddend, leafW in enumerate(listAddendLeaves):
+			if leafW > leaf:
+				# NOTE parity of leaf is ALWAYS even on this branch
+				# continue
+				dimension = next(dim for dim, creaseLeaf in dictionaryNextCreaseLeafV0.items() if creaseLeaf == leafW)
+				if printThis:
+					print(ImaOddLeaf(state.mapShape, leaf, dimension), end='\t')
+					print(leafW in dictionaryNextCreaseLeafV0.values(), end='\t')
+					print('\t', indexAddend, leafW, dictionaryNextCreaseLeafV0, len(listAddendLeaves), listAddendLeaves, leafW==dictionaryNextCreaseLeafV0[indexAddend+1 + (state.dimensionsTotal - 1 - len(listAddendLeaves))])
+			else:
+				# NOTE parity of leaf is ALWAYS odd on this branch
+				# holy fuck, I've had all of this data for weeks but didn't realize it was huge.
+				# continue
+				dictionaryNextCreaseLeafW: dict[int, int | None] = {dimension: getCreasePost(state.mapShape, leafW, dimension) for dimension in range(state.dimensionsTotal)}
+				dimension = next(dim for dim, creaseLeaf in dictionaryNextCreaseLeafW.items() if creaseLeaf == leaf)
+				if printThis:
+					print(ImaOddLeaf(state.mapShape, leaf, dimension), end='\t')
+					print(leaf in dictionaryNextCreaseLeafW.values(), end='\t')
+
+		if printThis:
+			print()
+
+	printThis = False
+
+	dictionaryListNextCreaseLeaf: dict[int, list[int | None]] = {leaf: [] for leaf in range(state.leavesTotal)}
+	dictionaryNextCreaseLeaf: dict[int, dict[int, int | None]] = {leaf: {} for leaf in range(state.leavesTotal)}
+	for leaf in range(state.leavesTotal):
+		dictionaryListNextCreaseLeaf[leaf] = list(dictionaryNextCreaseLeaf[leaf].values())
+		dictionaryNextCreaseLeaf[leaf] = {dimension: getCreasePost(state.mapShape, leaf, dimension) for dimension in range(state.dimensionsTotal)}
+		dictionaryNextCreaseLeaf[leaf] = valfilter(bool, dictionaryNextCreaseLeaf[leaf])
+		listLeavesNextAndPriorInSequence = valfilter(lambda flipped: flipped > leaf, {dimension: bit_flip(leaf, dimension) for dimension in range(state.dimensionsTotal)})
+		if printThis:
+			print(leaf, len(dictionaryNextCreaseLeaf[leaf]), dictionaryNextCreaseLeaf[leaf], dictionaryNextCreaseLeaf[leaf] == listLeavesNextAndPriorInSequence, sep='\t')
+
+	printThis = False
+
+	for leaf in range(state.leavesTotal):
+		listAddendLeaves = [leaf + addend for addend in dictionaryAddends4Next[leaf]]
+		listAddendPriorLeaves = [leaf + addend for addend in dictionaryAddends4Prior[leaf]]
+		list1 = list(dict.fromkeys([*listAddendLeaves, *listAddendPriorLeaves]))
+		if len(list1) < state.dimensionsTotal and 0 < leaf:
+			index = int(log2(leaf))
+			list1.insert(index, 0)
+
+		listLeavesNextAndPriorInSequence = [int(bit_flip(leaf, dimension)) for dimension in range(state.dimensionsTotal)]
+
+		if leaf == leafOrigin:
+			listLeavesNext = [1]
+			listLeavesPrior = []
+		else:
+			slicingIndexStart: int = howManyDimensionsHaveOddParity(leaf) & 1 ^ 1
+			slicingIndexEnd = dimensionNearest首(leaf) * (slicingIndexStart ^ 1) or None
+
+			if (slicingIndexStart == 1) and is_even(leaf):
+				slicingIndexStart += dimensionNearestTail(leaf)
+			listLeavesNext = listLeavesNextAndPriorInSequence[slicingIndexStart: slicingIndexEnd]
+
+			slicingIndexStart = howManyDimensionsHaveOddParity(leaf) & 1
+			slicingIndexEnd = dimensionNearest首(leaf) * (slicingIndexStart ^ 1) or None
+
+			if (slicingIndexStart == 1) and is_even(leaf):
+				slicingIndexStart += dimensionNearestTail(leaf)
+			listLeavesPrior = listLeavesNextAndPriorInSequence[slicingIndexStart: slicingIndexEnd]
+
+			if leaf == 1:
+				listLeavesPrior = [0]
+
+		if printThis:
+				print(leaf, listAddendLeaves==listLeavesNext, listAddendPriorLeaves==listLeavesPrior, listLeavesNextAndPriorInSequence, sep='\t', end='\n')
+		else:
+			if printThis:
+				print(leaf, leaf.bit_count() - 1 & 1, dimensionNearestTail(leaf), sep='\t', end='\n')
+				print(leaf, listAddendLeaves, listAddendPriorLeaves, listLeavesNextAndPriorInSequence, sep='\n', end='\n\n')
+				print(leaf, listLeavesNextAndPriorInSequence, sorted(list1) == sorted(listLeavesNextAndPriorInSequence), sep='\t', end='\n')
+				print(leaf, list1, listLeavesNextAndPriorInSequence, sorted(list1), sorted(listLeavesNextAndPriorInSequence), sep='\n', end='\n\n')
+
+	printThis = False
+
+	creasesByDimension: dict[int, list[tuple[int, int]]] = {dimension: [] for dimension in range(state.dimensionsTotal)}
+	for dimension in range(state.dimensionsTotal):
+		for leaf in range(state.leavesTotal):
+			leafW = dictionaryNextCreaseLeaf[leaf].get(dimension)
+			if leafW is not None:
+				creasesByDimension[dimension].append((leaf, leafW))
+	if printThis:
+		pprint(creasesByDimension, width=140, compact=True)
+
+	printThis = False
+
+	for qq, ww in dictionaryListNextCreaseLeaf.items():
+		if printThis:
+			print(qq, *ww, sep='\t')
+
+	printThis = True
+
+	for leaf, dd in dictionaryNextCreaseLeaf.items():
+		tt = True
+		if printThis:
+			print(leaf, len(dd), sep='\t', end='\t')
+		for nn in dd.values():
+			qq = dictionaryNextCreaseLeaf[raiseIfNone(nn)]
+			tt &= len(dd) == 1+ len(qq)
+			if printThis:
+				print(len(qq), end='\t')
+		if printThis:
+			print(bool(tt))
+

mapfolding-0.18.0/mapFolding/_e/Z0Z_analysisPython/SORTZ0Z_p2d6.py

@@ -0,0 +1,143 @@
+# pyright: basic
+# ruff: noqa
+from functools import partial
+from itertools import pairwise, permutations, product as CartesianProduct
+from pathlib import Path
+from pprint import pprint
+from toolz import compose
+import numpy
+import pickle
+
+fileStem = "p2d4"
+pathFilename: Path = Path(f"/apps/mapFolding/Z0Z_notes/{fileStem}.csv")
+
+headerLength = 182
+headerLength = 86
+headerLength = 38
+data2Dn: str = pathFilename.read_text(encoding="utf-8")[headerLength:None]
+
+def parseLineToIntegers(textLine: str) -> list[int]:
+	return [int(numberText) for numberText in textLine.strip().split(",")]
+
+listFoldings2Dn: list[list[int]] = []
+
+for textLine in data2Dn.splitlines():
+	sequenceIntegers = parseLineToIntegers(textLine)
+	listFoldings2Dn.append(sequenceIntegers)
+
+arrayFoldings2Dn = numpy.array(listFoldings2Dn, dtype=numpy.uint8)
+
+pathFilename.with_name(f'listFoldings{fileStem}.pkl').write_bytes(pickle.dumps(listFoldings2Dn))
+pathFilename.with_name(f'arrayFoldings{fileStem}.pkl').write_bytes(pickle.dumps(arrayFoldings2Dn))
+
+dictionaryDifferencesReverse: dict[int, list[int]] = {}
+
+for rowIndex in range(arrayFoldings2Dn.shape[0]):
+	for columnIndex in range(1, arrayFoldings2Dn.shape[1]):
+		valueOriginal = int(arrayFoldings2Dn[rowIndex, columnIndex])
+		valueLeft = int(arrayFoldings2Dn[rowIndex, columnIndex - 1])
+		differenceToLeft = valueLeft - valueOriginal
+
+		if valueOriginal not in dictionaryDifferencesReverse:
+			dictionaryDifferencesReverse[valueOriginal] = []
+
+		if differenceToLeft not in dictionaryDifferencesReverse[valueOriginal]:
+			dictionaryDifferencesReverse[valueOriginal].append(differenceToLeft)
+
+for valueOriginal in dictionaryDifferencesReverse:
+	dictionaryDifferencesReverse[valueOriginal].sort(key=abs)
+
+
+pprint(dictionaryDifferencesReverse)
+
+l5 = listLeft = [8] + [8, 16] + [2]
+r4 = listRight = [8] + [8, 16]
+
+l6 = listLeft = [8] + [8, 16]	# 2,6 is on the list of 3,2.
+# However, to concatenate leafLeft,3,2,6 with 2,6,7,leafRight, leafLeft+4 == leafRight ,1,3,2,6,7,5, ,11,3,2,6,7,15, ,19,3,2,6,7,23, ,35,3,2,6,7,39,
+r7 = listRight = [8] + [8, 16] + [-2]
+#  7: [-2, -4, 8, 16, 32],
+l=6; r=7
+
+l8 = listLeft = [1] + [1, 2]
+r40 = listRight = [1] + [1, 2] + [16]
+
+l16 = listLeft = [1] + [1, 2, 4]
+r48 = listRight = [1] + [1, 2, 4] + [-16] # 48 > 16
+
+l56 = listLeft = [1] + [1, 2] + [-16]
+r24 = listRight = [1] + [1, 2]	#24,16 is on the list of 8,40.
+
+l9 = listLeft = [16] + [16] + [2]
+r8 = listRight = [16] + [16]
+l=9; r=8
+
+l52 = listLeft = [1] + [1] + [-16]
+r20 = listRight = [1] + [1]
+# NOTE appends, below.
+l=52; r=20
+# 16, 21, 22, 28
+# 36, 53, 54, 60
+
+l4 = listLeft = [1] + [1]
+r36 = listRight = [1] + [1] + [16]
+l=4; r=36
+# 37, 38, 32, 44, 52
+# +1, +2, -4, +8, +16
+
+l10 = listLeft = [16] + [16]
+r11 = listRight = [16] + [16] + [-2]
+# NOTE appends, below.
+l=10; r=11
+# 9,  15,  3,  27,  43
+# -2, +4, -8, +16, +32
+
+l3 = listLeft = [4] + [4, 8, 16] + [-2] # 3 > 2
+r2 = listRight = [4] + [4, 8, 16]
+l=3; r=2
+
+ll = []
+for index in range(1, len(listLeft)):
+	ll.append(l + sum(listLeft[0:index]))
+rr = []
+for index in range(1, len(listRight)):
+	rr.append(r + sum(listRight[0:index]))
+
+if l > r:
+	ll.append(l + listLeft[-1])
+	rr.append(r + sum(listRight[0:None]))
+else:
+	ll.append(l + sum(listLeft[0:None]))
+	rr.append(r + listRight[-1])
+
+if (l == 4) and (r == 36):	# NOTE idk.
+	rr.append(44)
+
+if (l == 6) and (r == 7):	# 2,6 is on the list of 3,2.
+	ll.append(2)
+
+if (l == 9) and (r == 8):	# NOTE I can't explain 13. 9+4=13.
+	ll.append(13)
+
+if (l == 10) and (r == 11):	# NOTE similar to 9,8.
+	rr.append(15)			# An additional, stand-alone +4. 11+4=15.
+	ll.append(14)			# An additional, stand-alone +4. 10+4=14.
+	ll.append(2)			# 2,10 is on the list of 3,2.
+
+if (l == 52) and (r == 20):	# 20,16 is on the list of 16,48.
+	rr.append(16)
+	rr.append(28)
+	ll.append(60)
+
+if (l == 56) and (r == 24):	# 24,16 is on the list of 16,48.
+	rr.append(16)
+
+# infix: str = f",{l},{r}"
+# total = 0
+# for left, right in CartesianProduct(ll, rr):
+# 	this: str = f",{left}{infix},{right},"
+# 	count = data2Dn.count(this)
+# 	total += count
+# 	print(f"{count}\t{this}")
+
+# print(total)

mapfolding-0.18.0/mapFolding/_e/Z0Z_analysisPython/__init__.py

@@ -0,0 +1,4 @@
+"""Analysis tools written in Python to help develop the "elimination" algorithms.
+
+These are not intended for long-term use. If a function evolves into something I want to keep, I should find a better home for it.
+"""