mapFolding 0.15.4__py3-none-any.whl → 0.16.0__py3-none-any.whl

mapFolding/syntheticModules/A007822/asynchronousTheorem2.py

@@ -0,0 +1,53 @@
+from mapFolding.dataBaskets import MapFoldingState
+from mapFolding.syntheticModules.A007822.asynchronousAnnex import filterAsymmetricFolds, getAsymmetricFoldsTotal
+
+def count(state: MapFoldingState) -> MapFoldingState:
+    while state.leaf1ndex > 4:
+        if state.leafBelow[0] == 1:
+            if state.leaf1ndex > state.leavesTotal:
+                filterAsymmetricFolds(state.leafBelow)
+            else:
+                state.dimensionsUnconstrained = state.dimensionsTotal
+                state.gap1ndexCeiling = state.gapRangeStart[state.leaf1ndex - 1]
+                state.indexDimension = 0
+                while state.indexDimension < state.dimensionsTotal:
+                    state.leafConnectee = state.connectionGraph[state.indexDimension, state.leaf1ndex, state.leaf1ndex]
+                    if state.leafConnectee == state.leaf1ndex:
+                        state.dimensionsUnconstrained -= 1
+                    else:
+                        while state.leafConnectee != state.leaf1ndex:
+                            state.gapsWhere[state.gap1ndexCeiling] = state.leafConnectee
+                            if state.countDimensionsGapped[state.leafConnectee] == 0:
+                                state.gap1ndexCeiling += 1
+                            state.countDimensionsGapped[state.leafConnectee] += 1
+                            state.leafConnectee = state.connectionGraph[state.indexDimension, state.leaf1ndex, state.leafBelow[state.leafConnectee]]
+                    state.indexDimension += 1
+                if not state.dimensionsUnconstrained:
+                    state.indexLeaf = 0
+                    while state.indexLeaf < state.leaf1ndex:
+                        state.gapsWhere[state.gap1ndexCeiling] = state.indexLeaf
+                        state.gap1ndexCeiling += 1
+                        state.indexLeaf += 1
+                state.indexMiniGap = state.gap1ndex
+                while state.indexMiniGap < state.gap1ndexCeiling:
+                    state.gapsWhere[state.gap1ndex] = state.gapsWhere[state.indexMiniGap]
+                    if state.countDimensionsGapped[state.gapsWhere[state.indexMiniGap]] == state.dimensionsUnconstrained:
+                        state.gap1ndex += 1
+                    state.countDimensionsGapped[state.gapsWhere[state.indexMiniGap]] = 0
+                    state.indexMiniGap += 1
+        while state.gap1ndex == state.gapRangeStart[state.leaf1ndex - 1]:
+            state.leaf1ndex -= 1
+            state.leafBelow[state.leafAbove[state.leaf1ndex]] = state.leafBelow[state.leaf1ndex]
+            state.leafAbove[state.leafBelow[state.leaf1ndex]] = state.leafAbove[state.leaf1ndex]
+        state.gap1ndex -= 1
+        state.leafAbove[state.leaf1ndex] = state.gapsWhere[state.gap1ndex]
+        state.leafBelow[state.leaf1ndex] = state.leafBelow[state.leafAbove[state.leaf1ndex]]
+        state.leafBelow[state.leafAbove[state.leaf1ndex]] = state.leaf1ndex
+        state.leafAbove[state.leafBelow[state.leaf1ndex]] = state.leaf1ndex
+        state.gapRangeStart[state.leaf1ndex] = state.gap1ndex
+        state.leaf1ndex += 1
+    else:
+        state.groupsOfFolds = getAsymmetricFoldsTotal()
+        state.groupsOfFolds *= 2
+    state.groupsOfFolds = (state.groupsOfFolds + 1) // 2
+    return state

mapFolding/syntheticModules/A007822/asynchronousTrimmed.py

@@ -0,0 +1,47 @@
+from mapFolding.dataBaskets import MapFoldingState
+from mapFolding.syntheticModules.A007822.asynchronousAnnex import filterAsymmetricFolds, getAsymmetricFoldsTotal
+
+def count(state: MapFoldingState) -> MapFoldingState:
+    while state.leaf1ndex > 4:
+        if state.leafBelow[0] == 1:
+            if state.leaf1ndex > state.leavesTotal:
+                filterAsymmetricFolds(state.leafBelow)
+            else:
+                state.dimensionsUnconstrained = state.dimensionsTotal
+                state.gap1ndexCeiling = state.gapRangeStart[state.leaf1ndex - 1]
+                state.indexDimension = 0
+                while state.indexDimension < state.dimensionsTotal:
+                    state.leafConnectee = state.connectionGraph[state.indexDimension, state.leaf1ndex, state.leaf1ndex]
+                    if state.leafConnectee == state.leaf1ndex:
+                        state.dimensionsUnconstrained -= 1
+                    else:
+                        while state.leafConnectee != state.leaf1ndex:
+                            state.gapsWhere[state.gap1ndexCeiling] = state.leafConnectee
+                            if state.countDimensionsGapped[state.leafConnectee] == 0:
+                                state.gap1ndexCeiling += 1
+                            state.countDimensionsGapped[state.leafConnectee] += 1
+                            state.leafConnectee = state.connectionGraph[state.indexDimension, state.leaf1ndex, state.leafBelow[state.leafConnectee]]
+                    state.indexDimension += 1
+                state.indexMiniGap = state.gap1ndex
+                while state.indexMiniGap < state.gap1ndexCeiling:
+                    state.gapsWhere[state.gap1ndex] = state.gapsWhere[state.indexMiniGap]
+                    if state.countDimensionsGapped[state.gapsWhere[state.indexMiniGap]] == state.dimensionsUnconstrained:
+                        state.gap1ndex += 1
+                    state.countDimensionsGapped[state.gapsWhere[state.indexMiniGap]] = 0
+                    state.indexMiniGap += 1
+        while state.gap1ndex == state.gapRangeStart[state.leaf1ndex - 1]:
+            state.leaf1ndex -= 1
+            state.leafBelow[state.leafAbove[state.leaf1ndex]] = state.leafBelow[state.leaf1ndex]
+            state.leafAbove[state.leafBelow[state.leaf1ndex]] = state.leafAbove[state.leaf1ndex]
+        state.gap1ndex -= 1
+        state.leafAbove[state.leaf1ndex] = state.gapsWhere[state.gap1ndex]
+        state.leafBelow[state.leaf1ndex] = state.leafBelow[state.leafAbove[state.leaf1ndex]]
+        state.leafBelow[state.leafAbove[state.leaf1ndex]] = state.leaf1ndex
+        state.leafAbove[state.leafBelow[state.leaf1ndex]] = state.leaf1ndex
+        state.gapRangeStart[state.leaf1ndex] = state.gap1ndex
+        state.leaf1ndex += 1
+    else:
+        state.groupsOfFolds = getAsymmetricFoldsTotal()
+        state.groupsOfFolds *= 2
+    state.groupsOfFolds = (state.groupsOfFolds + 1) // 2
+    return state

mapFolding/syntheticModules/dataPackingA007822.py

@@ -1,5 +1,5 @@
 from mapFolding.dataBaskets import Array1DElephino, Array1DLeavesTotal, Array3DLeavesTotal, DatatypeElephino, DatatypeFoldsTotal, DatatypeLeavesTotal, MapFoldingState
-from mapFolding.syntheticModules.theorem2A007822Numba import count
+from mapFolding.syntheticModules.A007822.theorem2Numba import count
 
 def sequential(state: MapFoldingState) -> MapFoldingState:
     mapShape: tuple[DatatypeLeavesTotal, ...] = state.mapShape

mapFolding/tests/test_computations.py

@@ -28,12 +28,12 @@ which is useful if you're working with the code synthesis features of the packag
 from mapFolding import countFolds, dictionaryOEISMapFolding, dictionaryOEISMeanders, getFoldsTotalKnown, oeisIDfor_n
 from mapFolding.algorithms import oeisIDbyFormula
 from mapFolding.dataBaskets import MapFoldingState
-from mapFolding.someAssemblyRequired.makeAllModules import parametersNumbaLight
 from mapFolding.someAssemblyRequired.RecipeJob import RecipeJobTheorem2
+from mapFolding.someAssemblyRequired.toolkitNumba import parametersNumbaLight
 from mapFolding.syntheticModules.initializeState import transitionOnGroupsOfFolds
 from mapFolding.tests.conftest import registrarRecordsTemporaryFilesystemObject, standardizedEqualToCallableReturn
 from pathlib import Path, PurePosixPath
-from typing import Literal, TYPE_CHECKING
+from typing import TYPE_CHECKING
 import importlib.util
 import multiprocessing
 import pytest

mapFolding/trim_memory.py

@@ -0,0 +1,62 @@
+"""Memory management utilities.
+
+https://github.com/pandas-dev/pandas/issues/2659#issuecomment-2452943964
+"""
+import ctypes
+import ctypes.wintypes
+import gc
+import logging
+import platform
+
+logger = logging.getLogger(__name__)
+
+def trim_windows_process_memory(pid: int | None = None) -> bool:
+    """Cause effects similar to malloc_trim on -nix."""
+    # Define SIZE_T based on the platform (32-bit or 64-bit)
+    if ctypes.sizeof(ctypes.c_void_p) == 4:
+        SIZE_T = ctypes.c_uint32
+    else:
+        SIZE_T = ctypes.c_uint64
+
+    # Get a handle to the current process
+    if not pid:
+        pid = ctypes.windll.kernel32.GetCurrentProcess()
+
+    # Define argument and return types for SetProcessWorkingSetSizeEx
+    ctypes.windll.kernel32.SetProcessWorkingSetSizeEx.argtypes = [
+        ctypes.wintypes.HANDLE,  # Process handle
+        SIZE_T,  # Minimum working set size
+        SIZE_T,  # Maximum working set size
+        ctypes.wintypes.DWORD,  # Flags
+    ]
+    ctypes.windll.kernel32.SetProcessWorkingSetSizeEx.restype = ctypes.wintypes.BOOL
+
+    # Define constants for SetProcessWorkingSetSizeEx
+    QUOTA_LIMITS_HARDWS_MIN_DISABLE = 0x00000002
+
+    # Attempt to set the working set size
+    result = ctypes.windll.kernel32.SetProcessWorkingSetSizeEx(pid, SIZE_T(-1), SIZE_T(-1), QUOTA_LIMITS_HARDWS_MIN_DISABLE)
+
+    if result == 0:
+        # Retrieve the error code
+        error_code = ctypes.windll.kernel32.GetLastError()
+        message = f"SetProcessWorkingSetSizeEx failed with error code: {error_code}"
+        logger.error(message)
+        return False
+    else:
+        return True
+
+
+def trim_ram() -> None:
+    """Force python garbage collection.
+
+    Most importantly, calls malloc_trim/SetProcessWorkingSetSizeEx, which fixes pandas/libc (?) memory leak.
+    """
+    gc.collect()
+    if platform.system() == "Windows":
+        trim_windows_process_memory()
+    else:
+        try:
+            ctypes.CDLL("libc.so.6").malloc_trim(0)
+        except Exception:
+            logger.exception("malloc_trim attempt failed")

mapFolding/zCuzDocStoopid/__init__.py

@@ -0,0 +1 @@
+"""I mean, you must write docstrings after you write the code because you don't know what the code will do until after you write it."""

mapFolding/zCuzDocStoopid/makeDocstrings.py

@@ -0,0 +1,63 @@
+"""Make docstrings."""
+from astToolkit import Grab, IfThis, Make, NodeChanger, parsePathFilename2astModule, Then
+from astToolkit.transformationTools import makeDictionaryFunctionDef
+from hunterMakesPy import raiseIfNone, writeStringToHere
+from mapFolding import dictionaryOEISMapFolding, dictionaryOEISMeanders, packageSettings
+from pathlib import Path
+import ast
+
+sourcePrefix: str = 'zCuzDocStoopid'
+
+pathRoot: Path = packageSettings.pathPackage / "algorithms"
+
+pathFilenameSource: Path = next(iter(pathRoot.glob(f"{sourcePrefix}*.py"))).absolute()
+pathFilenameWrite: Path = pathFilenameSource.with_stem(pathFilenameSource.stem.removeprefix(sourcePrefix))
+
+astModule: ast.Module = parsePathFilename2astModule(pathFilenameSource)
+dictionaryFunctionDef: dict[str, ast.FunctionDef] = makeDictionaryFunctionDef(astModule)
+
+moduleWarning = """
+NOTE: This is a generated file; edit the source file.
+"""
+
+oeisID = 'Error during transformation' # `ast.FunctionDef.name` of function in `pathFilenameSource`.
+functionOf: str = 'Error during transformation' # The value of `functionOf` is in the docstring of function `oeisID` in `pathFilenameSource`.
+
+for oeisID, FunctionDef in dictionaryFunctionDef.items():
+    dictionaryOEIS = dictionaryOEISMapFolding if oeisID in dictionaryOEISMapFolding else dictionaryOEISMeanders
+    functionOf = raiseIfNone(ast.get_docstring(FunctionDef))
+
+    ImaDocstring= 	f"""
+    Compute {oeisID}(n) as a function of {functionOf}.
+
+    *The On-Line Encyclopedia of Integer Sequences* (OEIS) description of {oeisID} is: "{dictionaryOEIS[oeisID]['description']}"
+
+    The domain of {oeisID} starts at {dictionaryOEIS[oeisID]['offset']}, therefore for values of `n` < {dictionaryOEIS[oeisID]['offset']}, a(n) is undefined. The smallest value of n for which a(n)
+    has not yet been computed is {dictionaryOEIS[oeisID]['valueUnknown']}.
+
+    Parameters
+    ----------
+    n : int
+        Index (n-dex) for a(n) in the sequence of values. "n" (lower case) and "a(n)" are conventions in mathematics.
+
+    Returns
+    -------
+    a(n) : int
+        {dictionaryOEIS[oeisID]['description']}
+
+    Would You Like to Know More?
+    ----------------------------
+    OEIS : webpage
+        https://oeis.org/{oeisID}
+    """
+
+    astExprDocstring = Make.Expr(Make.Constant(ImaDocstring))
+
+    NodeChanger(
+        findThis = IfThis.isFunctionDefIdentifier(oeisID)
+        , doThat = Grab.bodyAttribute(Grab.index(0, Then.replaceWith(astExprDocstring)))
+    ).visit(astModule)
+
+ast.fix_missing_locations(astModule)
+
+writeStringToHere((ast.unparse(astModule)+"\n"), pathFilenameWrite)

{mapfolding-0.15.4.dist-info → mapfolding-0.16.0.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: mapFolding
-Version: 0.15.4
+Version: 0.16.0
 Summary: Map folding, meanders, stamp folding, semi-meanders. Experiment with algorithm transformations and code optimization.
 Author-email: Hunter Hogan <HunterHogan@pm.me>
 License: CC-BY-NC-4.0
@@ -8,7 +8,7 @@ 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,A195646,A223094,A259702,A301620,AST manipulation,GPU acceleration,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: A000136,A000560,A000682,A001010,A001011,A001415,A001416,A001417,A001418,A005315,A005316,A007822,A178961,A195646,A223094,A259702,A301620,AST manipulation,GPU acceleration,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
 Classifier: Development Status :: 4 - Beta
 Classifier: Environment :: Console
 Classifier: Intended Audience :: Developers
@@ -35,6 +35,7 @@ Requires-Python: >=3.12
 Description-Content-Type: text/markdown
 License-File: LICENSE
 Requires-Dist: astToolkit
+Requires-Dist: autoflake
 Requires-Dist: hunterMakesPy
 Requires-Dist: numpy
 Requires-Dist: platformdirs
@@ -47,8 +48,14 @@ Requires-Dist: setuptools-scm; extra == "development"
 Provides-Extra: numba
 Requires-Dist: numba; extra == "numba"
 Requires-Dist: numba_progress; extra == "numba"
+Provides-Extra: pandas
+Requires-Dist: pandas; extra == "pandas"
+Requires-Dist: pyarrow; extra == "pandas"
+Requires-Dist: pyarrow-stubs; extra == "pandas"
 Provides-Extra: testing
 Requires-Dist: numba; extra == "testing"
+Requires-Dist: pandas; extra == "testing"
+Requires-Dist: pyarrow; extra == "testing"
 Requires-Dist: pytest-cov; extra == "testing"
 Requires-Dist: pytest-env; extra == "testing"
 Requires-Dist: pytest-xdist; extra == "testing"

mapfolding-0.16.0.dist-info/RECORD

@@ -0,0 +1,100 @@
+mapFolding/__init__.py,sha256=TDo9hax941LW-ea0hyAZsq0NEdhizAXXlNrWj8qX6dE,4012
+mapFolding/_theSSOT.py,sha256=aZsdI_PPWB8S0wrLDs7HqVvL88OIPOti0STrYG776gg,5279
+mapFolding/_theTypes.py,sha256=F2pCHexrlbHTgMpQn58jDhkwAMFUSBp28gQp21n86o0,6559
+mapFolding/basecamp.py,sha256=x13ZipCO0G-6rZSWEqgInWlMDKC5TtH-n_V-wB7lfac,18795
+mapFolding/beDRY.py,sha256=iYATcrYrAWkKaAecjA_awELBtZP5Q3snU4053dIsEwU,13941
+mapFolding/dataBaskets.py,sha256=myijFYlgJuRXYPGpMSQN7Kg7mzLp7LuRgZZqDfQJku8,18088
+mapFolding/filesystemToolkit.py,sha256=Ex5tyugRQurXIgUNVtkQYfWMq8fM4e-izX01MBXU5_8,11006
+mapFolding/oeis.py,sha256=wtvCGXNkSduvf9RGUCJv8qOQoyNH1P8EYHxD_tf6ANU,18652
+mapFolding/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+mapFolding/trim_memory.py,sha256=Do5oPwkMvqbrJ6oS7-7aegB9hVD03S1uLPlWXFrCF2c,2042
+mapFolding/algorithms/__init__.py,sha256=gARPqfySaeSWMfApQ5wSxzy7ZdgLdKYsLqsRSEYWwWI,28
+mapFolding/algorithms/daoOfMapFolding.py,sha256=ncTIiBfTsM8SNVx9qefZ0bBcBtviWLSk4iPv3Z9nGiE,5442
+mapFolding/algorithms/getBucketsTotal.py,sha256=5JCgOb_bC4E5ol45TSs1dQtBWWX04aN3DIkonNU9Nh4,5966
+mapFolding/algorithms/matrixMeanders.py,sha256=DLrzdJzkUiylaIX5yG-xZ7Jq75-St6aFIj_3acs8kQc,21750
+mapFolding/algorithms/oeisIDbyFormula.py,sha256=ia79A1GlNS_7cUFs50B_zBB-F35Kf1Ljviy31XWpqnM,11372
+mapFolding/algorithms/zCuzDocStoopidoeisIDbyFormula.py,sha256=zShTDbRgqBXpMrrdNdQ9ZO9rTV4Fq6X8zSO3YPPiIA4,2068
+mapFolding/reference/A000682facts.py,sha256=AAIdA-YttdbOw6msEH3bgFxPcvKZn075ONOtPIQGjxU,14873
+mapFolding/reference/A005316facts.py,sha256=Bavx1EIZ-uKc5xcp0XNC6lzMheXkapIGE5y-gugwryw,1281
+mapFolding/reference/__init__.py,sha256=GKcSgYE49NcTISx-JZbELXyq-eRkMeTL5g4DXInWFw0,2206
+mapFolding/reference/flattened.py,sha256=0eHgLFIeIeVUsI5zF5oSy5iWYrjOMzxr7KjDxiTe01k,16078
+mapFolding/reference/hunterNumba.py,sha256=iLfyqwGdAh6c5GbapnKsWhAsNsR3O-fyGGHAdohluLw,7258
+mapFolding/reference/irvineJavaPort.py,sha256=XnsL4g33LRrYwAhcrAVt-ujsP6QD6fbyCsGYzcm9g_k,3724
+mapFolding/reference/jaxCount.py,sha256=t8ons45zyWNJQ-nmn1qbhNsTkTnRzf7ATauaYvIlkRI,14853
+mapFolding/reference/lunnonNumpy.py,sha256=mMgrgbrBpe4nmo72ThEI-MGH0OwEHmfMPczSXHp2qKo,4357
+mapFolding/reference/lunnonWhile.py,sha256=ZL8GAQtPs5nJZSgoDl5USrLSS_zs03y98y1Z9E4jOmQ,3799
+mapFolding/reference/rotatedEntryPoint.py,sha256=3IJU7Hc2PDSE71wmSkDs4Z3t0Px9NBSzmCsVrgQuQyU,10274
+mapFolding/reference/total_countPlus1vsPlusN.py,sha256=yJZAVLVdoXqHag2_N6_6CT-Q6HXBgRro-eny93-Rlpw,9307
+mapFolding/reference/jobsCompleted/__init__.py,sha256=TU93ZGUW1xEkT6d9mQFn_rp5DvRy0ZslEB2Q6MF5ZDc,2596
+mapFolding/reference/jobsCompleted/[2x19]/p2x19.py,sha256=_tvYtfzMWVo2VtUbIAieoscb4N8FFflgTdW4-ljBUuA,19626
+mapFolding/reference/jobsCompleted/p2x19/p2x19.py,sha256=eZEw4Me4ocTt6VXoK2-Sbd5SowZtxRIbN9dZmc7OCVg,6395
+mapFolding/reference/matrixMeandersAnalysis/__init__.py,sha256=FQbR63_z3_zd3HMrpUxx3_YIcn9znzA0RIggcMntSC8,35
+mapFolding/reference/matrixMeandersAnalysis/evenEven.py,sha256=KfP9G9AG9Qd0kOG67JyLnauHxGmBqMvGVADxqSAHwTk,5009
+mapFolding/reference/matrixMeandersAnalysis/oddEven.py,sha256=igZLaavoFtQCWAtIepPHohD1dVrLyfg-3rY0m4NFpGc,1759
+mapFolding/reference/meandersDumpingGround/A005316JavaPort.py,sha256=6qqTzbD3PTwYGtqaywEURGXtNFx1lp8ofEwpQeEvAHc,4899
+mapFolding/reference/meandersDumpingGround/A005316imperative.py,sha256=hhjUxELOktNBmHrwIoxVA-mcFsOWgg01p780OBeqL04,3816
+mapFolding/reference/meandersDumpingGround/A005316intOptimized.py,sha256=oO9ktdYeFwtosVp5KliwH8JmCSxfjapjBM1iMECuDAc,4121
+mapFolding/reference/meandersDumpingGround/A005316optimized128bit.py,sha256=6JxmVBIQnN0rH0MQIZtu_wgY1Wbms8hZCWarMe5NLLU,3416
+mapFolding/reference/meandersDumpingGround/A005316primitiveOptimized.py,sha256=iFig6Edv1E774xrlVUFLyscC40DqDhV-oh4hOnG2DLI,4116
+mapFolding/reference/meandersDumpingGround/A005316redis.py,sha256=MPeiobrs3VsNZOOKYBg52oVp0OjVDzLEdsRKfrZ9LrU,4328
+mapFolding/reference/meandersDumpingGround/A005316write2disk.py,sha256=NMVrdhe5KhnXQfaQ5Xr7Pwl5oXYEOM1DrMISDDOCVVw,5633
+mapFolding/reference/meandersDumpingGround/matrixMeanders64retired.py,sha256=oRVgf6zkWRjk7dWR-Px41M_5spdvKy_Pich0qd7oxVA,9270
+mapFolding/reference/meandersDumpingGround/matrixMeandersBaseline.py,sha256=8Z98MMfhTCdoa75HWZz4DO166EiHZCu5eHeFzhgK42s,3003
+mapFolding/reference/meandersDumpingGround/matrixMeandersBaselineAnnex.py,sha256=d2Oh4JZxz53ox_ArhIxpMTOuA7rtE9wnEPojpFcnlfc,5817
+mapFolding/reference/meandersDumpingGround/matrixMeandersBaselineV2.py,sha256=VpRiIGhnk-DbxwsHwCeCwXqcKLSNyHl-iRGLDH9ZGMY,7674
+mapFolding/reference/meandersDumpingGround/matrixMeandersSimpleQueue.py,sha256=pOfaS315OKIBG9GSqSJwUDcEhfnV2XduM9IPqHrBvJg,4083
+mapFolding/reference/meandersDumpingGround/matrixMeandersSlicePop.py,sha256=XyiesSQAH1dRplYx_CdR1FzcXvgmmxzj27V4aIqPp7o,5353
+mapFolding/someAssemblyRequired/RecipeJob.py,sha256=3lMDeb5sU1hkJYwaEMBFtl79xu8WCXca4sjndcQD9Ho,9866
+mapFolding/someAssemblyRequired/__init__.py,sha256=3IF8HFIgFisJBQ1i4sx7Nz2iOqVoAG78jwjNJ9q531U,6272
+mapFolding/someAssemblyRequired/_toolIfThis.py,sha256=QC2cmCea18BZ_WpoWoErYCWhROvmd40_i_nBO7YFRaE,6378
+mapFolding/someAssemblyRequired/_toolkitContainers.py,sha256=RJThCzIBWSk-dUO75QhRJgaJk6xz5Pf4-LBN1wv7hxo,13545
+mapFolding/someAssemblyRequired/getLLVMforNoReason.py,sha256=tY0-2K0BFkwLAAjSrFJLPoG8CevDHOFc3OH3TxXANzg,2806
+mapFolding/someAssemblyRequired/infoBooth.py,sha256=ZWFH37S2jMGRbNlmjhNvoaezIk8abS3DvHhy7qVOaQM,2139
+mapFolding/someAssemblyRequired/makeJobTheorem2Numba.py,sha256=MMB3is5IrKwZbx83OSndvCqtxJgTV1YGLjYpv25K_0g,17197
+mapFolding/someAssemblyRequired/makeJobTheorem2codon.py,sha256=_V5Y5X_Wpwx0XEKdr4FWDsOu8SosH2uMCdaqL9OX4u0,11747
+mapFolding/someAssemblyRequired/makingModules_count.py,sha256=ykTyroYhk2_M20FgDskuX4xEos-ecbZtQ7EytxGA0B0,14489
+mapFolding/someAssemblyRequired/makingModules_doTheNeedful.py,sha256=T5i75G2ZnybITeKLLnyEOJVekNlcM_zFHFdhdjAOO-s,6356
+mapFolding/someAssemblyRequired/toolkitMakeModules.py,sha256=ZzoDENTHbOoSSMq7fbF7jYPlbsgtPcNekSHoTIAB6os,7638
+mapFolding/someAssemblyRequired/toolkitNumba.py,sha256=3ujtBaA27CX8yVApnfNRzFpZd3GvsHv1H1vyTiiJIZk,14905
+mapFolding/someAssemblyRequired/transformationTools.py,sha256=LmyUPy-xADrQVjvWx_ufX_nclVOyJdhpF-htR9-nk7M,11513
+mapFolding/someAssemblyRequired/A007822/A007822rawMaterials.py,sha256=FtDnxoMwbNP9C-fnKYHH6q_2qwhjdPHaVlja3d3pk6c,2955
+mapFolding/someAssemblyRequired/A007822/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+mapFolding/someAssemblyRequired/A007822/makeA007822AsynchronousModules.py,sha256=MZD_SgFdIrnG_-mHYYsgsQuhqbbiPkam7iT5XmTcbM0,8389
+mapFolding/someAssemblyRequired/A007822/makeA007822Modules.py,sha256=wIy2qSTp4HDBOLuEQ-81aAuo5LsiWriYNg96BWybqEA,4032
+mapFolding/someAssemblyRequired/mapFolding/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+mapFolding/someAssemblyRequired/mapFolding/makeMapFoldingModules.py,sha256=SNU7Dpqu1agOmSX9DG3Kv8357mirzZiSvvKxn8XjtnM,16716
+mapFolding/syntheticModules/__init__.py,sha256=evVFqhCGa-WZKDiLcnQWjs-Bj34eRnfSLqz_d7dFYZY,83
+mapFolding/syntheticModules/countParallelNumba.py,sha256=6sHWzGc6ch3HjKVB8krvaBec_KoHv3gpfN_F5Vl1SP8,7870
+mapFolding/syntheticModules/daoOfMapFoldingNumba.py,sha256=5oMb8pttNKslN6wss9JIQXSnmjgE2q_2-3fIrh1pEW0,6033
+mapFolding/syntheticModules/dataPacking.py,sha256=SzRmDNr2OZP6Xk4krLqxTuWAUtUJxBDXmHEqlBHzNPI,2407
+mapFolding/syntheticModules/dataPackingA007822.py,sha256=VA9rDEQfaSVNpgbMAXUvckSmU-5PBY6jPmEETnqH-vc,2469
+mapFolding/syntheticModules/initializeState.py,sha256=OTiVi1Ywnlwk8tbwSIFjPJa_yBCINoapaCzGXDAJq_k,3121
+mapFolding/syntheticModules/theorem2.py,sha256=QeXkBScihDatBk4iEMOMSntvhyJISb0G8zwZMQe7JFc,3031
+mapFolding/syntheticModules/theorem2Numba.py,sha256=AFe-KI97ilPgPFA22ASAhfUetaTA249K7By_vqu1Crs,3416
+mapFolding/syntheticModules/theorem2Trimmed.py,sha256=geKX3So1SqhENlKeEO2dV6S3rGsxBp-AItB4hRbwbBI,2699
+mapFolding/syntheticModules/A007822/__init__.py,sha256=evVFqhCGa-WZKDiLcnQWjs-Bj34eRnfSLqz_d7dFYZY,83
+mapFolding/syntheticModules/A007822/algorithm.py,sha256=rJHwImwcFGAysYoNME79qmNhoa3ebRgXb7ktKZLtSZ8,7074
+mapFolding/syntheticModules/A007822/algorithmNumba.py,sha256=k7w-TicOkjV05bYPNK5s0kzWrBzS3EfVfQafZxBBa1Q,7222
+mapFolding/syntheticModules/A007822/asynchronous.py,sha256=1L-5aa7Ivs-QM8DDI3I9Ulfi8AkJ3fd2KdNS6g7YBLE,6270
+mapFolding/syntheticModules/A007822/asynchronousAnnex.py,sha256=m4k0Z_tlmWWgdalaW2SldLprqioVJtKf4oXAGSZf_6M,2644
+mapFolding/syntheticModules/A007822/asynchronousTheorem2.py,sha256=wp6igfkIs54zqPudRMjYiue0UZE4QAu4QlHGbTLnj5U,3271
+mapFolding/syntheticModules/A007822/asynchronousTrimmed.py,sha256=2m86hM0qlbyAjEks20e_KzxfVyjjQIB0iQkLPaFqo8M,2939
+mapFolding/syntheticModules/A007822/initializeState.py,sha256=qizwxyNqKSgnF4MyBWU8Nca9IRbTnp-rrUAirF-ZL-E,4344
+mapFolding/syntheticModules/A007822/theorem2.py,sha256=HflJuuOj6b_cF6zEKmLy74Nzv_7jFrqLmjsN05XM4KQ,4254
+mapFolding/syntheticModules/A007822/theorem2Numba.py,sha256=GppP_WntOrcFSIpIk6jP7PlAb4PlskzEBqfKOJaisSA,4637
+mapFolding/syntheticModules/A007822/theorem2Trimmed.py,sha256=ekbKQ_FIZgaQ9m7NrxDimx5dM2PBDIReGBtpv23jpNc,3922
+mapFolding/tests/__init__.py,sha256=QVCHSMFVvTxV3mAyYOLkMFAFyBJ514zdoVnDmpBJnTo,1336
+mapFolding/tests/conftest.py,sha256=fLBZFStVJEIfbt6PQNVyAEdMVyck_lwhEB0eZYgQSwU,15255
+mapFolding/tests/test_computations.py,sha256=m0JJq71oSQ0ol-rE99SDLwN9LWXp7yamfkFA3-fY0x0,8286
+mapFolding/tests/test_filesystem.py,sha256=0rYQ62f4e3HOoymXrxDWbqNEBJQ7DGN8RUOMI84tE2Q,3892
+mapFolding/tests/test_oeis.py,sha256=qwi9z_BnpeGO4QwTHj_WOiP21gf2rUgDdxhc90zWsl8,4754
+mapFolding/tests/test_other.py,sha256=ScBiJ78LnyAaW-RhxcouX6Xw10wgpSdqfvT4LO3WjnQ,4766
+mapFolding/tests/test_tasks.py,sha256=_pr9JRWjjNKA7sww70XvkJJdGPruBVzubM63RmD_Du0,4013
+mapFolding/zCuzDocStoopid/__init__.py,sha256=kgbAVyTTSsRBvIOOpO6TMSnrJ06JP4-aLA5AlhUwxEI,136
+mapFolding/zCuzDocStoopid/makeDocstrings.py,sha256=Bq9QLptQ8vxdivTemKNU90ZINTKixFL5EBHijqaVhxA,2593
+mapfolding-0.16.0.dist-info/licenses/LICENSE,sha256=NxH5Y8BdC-gNU-WSMwim3uMbID2iNDXJz7fHtuTdXhk,19346
+mapfolding-0.16.0.dist-info/METADATA,sha256=pxPw3oi1Fn2htgavXy2whDt43OX8f0S3D0eY6GxEUGg,5506
+mapfolding-0.16.0.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
+mapfolding-0.16.0.dist-info/entry_points.txt,sha256=-mH9DjW9tDRMPaeoSWKKywG35cR28m12H_jtmrB4eY8,98
+mapfolding-0.16.0.dist-info/top_level.txt,sha256=aG3bjFBoxxuaV3Iu1wZAd241Ubs3cdaJtKYBQBDIjsg,11
+mapfolding-0.16.0.dist-info/RECORD,,

mapFolding/someAssemblyRequired/A007822rawMaterials.py

@@ -1,46 +0,0 @@
-from astToolkit import extractFunctionDef  # noqa: D100
-from hunterMakesPy import raiseIfNone
-from mapFolding.someAssemblyRequired.infoBooth import (
-	dataclassInstanceIdentifierDEFAULT, sourceCallableIdentifierDEFAULT, theCountingIdentifierDEFAULT)
-import ast
-
-Z0Z_identifier = 'filterAsymmetricFolds'
-ImaString = f"""
-def {Z0Z_identifier}(state: MapFoldingState) -> MapFoldingState:
-	state.indexLeaf = 0
-	leafConnectee = 0
-	while leafConnectee < state.leavesTotal + 1:
-		leafNumber = int(state.leafBelow[state.indexLeaf])
-		state.leafComparison[leafConnectee] = (leafNumber - state.indexLeaf + state.leavesTotal) % state.leavesTotal
-		state.indexLeaf = leafNumber
-		leafConnectee += 1
-
-	indexInMiddle = state.leavesTotal // 2
-	state.indexMiniGap = 0
-	while state.indexMiniGap < state.leavesTotal + 1:
-		ImaSymmetricFold = True
-		leafConnectee = 0
-		while leafConnectee < indexInMiddle:
-			if state.leafComparison[(state.indexMiniGap + leafConnectee) % (state.leavesTotal + 1)] != state.leafComparison[(state.indexMiniGap + state.leavesTotal - 1 - leafConnectee) % (state.leavesTotal + 1)]:
-				ImaSymmetricFold = False
-				break
-			leafConnectee += 1
-		if ImaSymmetricFold:
-			state.groupsOfFolds += 1
-		state.indexMiniGap += 1
-
-	return state
-"""
-
-FunctionDef_filterAsymmetricFolds: ast.FunctionDef = raiseIfNone(extractFunctionDef(ast.parse(ImaString), Z0Z_identifier))
-del ImaString
-
-ImaString = f"{dataclassInstanceIdentifierDEFAULT} = {Z0Z_identifier}({dataclassInstanceIdentifierDEFAULT})"
-Z0Z_incrementCount = ast.parse(ImaString).body[0]
-del ImaString
-
-
-ImaString = 'state.groupsOfFolds = (state.groupsOfFolds + 1) // 2'
-Z0Z_adjustFoldsTotal = ast.parse(ImaString).body[0]
-del ImaString
-