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

mapfolding-0.16.2.dist-info/RECORD

@@ -0,0 +1,115 @@
+easyRun/A000682.py,sha256=nJJrmVycQUe1H7ms11QGz1ZyYUVdZsjEGtuJk97yxQ0,713
+easyRun/A005316.py,sha256=WCIqsNSevjgUSnTe24d6zWKLZnJSoy14piSt6G26WuE,434
+easyRun/NOTcountingFolds.py,sha256=k9nApcEWdMRSp8P25-bgQ78X4u6tmVR7Rc-22pyG7no,795
+easyRun/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+easyRun/countFolds.py,sha256=piPyd7Z_D9ulvQv7iP2JwS7uam2CbVTIZyF_1a3ZELw,1181
+easyRun/meanders.py,sha256=mka_tZvhQaJeY_nlOe8a0AE86_iI3tkwc7EeZ9uZ0Lg,1826
+mapFolding/__init__.py,sha256=OxFw-BmIomKuRv_YWHAekLJasfFo3LfBxQpS3gHi6K0,1867
+mapFolding/_dataPacking.py,sha256=zNRzXxAeg1a0DjlAB9IWeG82Rq7ALLEUzNfQDgoj2oA,3440
+mapFolding/_theSSOT.py,sha256=n3Y_cEFS385N8MaS5fMYgYSGmDyngOrmWcY8pK58OYo,5244
+mapFolding/_theTypes.py,sha256=_5yMvUDhEOe1bZSYB3IDipOnUNbFg6xENpoKd1h372c,7075
+mapFolding/basecamp.py,sha256=g_33al4s3-wZLq5tdgG5M6HBoN8B5P_9ZAc0z7EM0gg,16749
+mapFolding/beDRY.py,sha256=0vJwnsvz6_jR8gfuU38vW9KoMTnRqyaYaAwbJcKLhFI,12674
+mapFolding/dataBaskets.py,sha256=wgtBYqMjgr9O2tnui59pFiinNqZy5ZtF_WhpbURJpmQ,20154
+mapFolding/filesystemToolkit.py,sha256=Ex5tyugRQurXIgUNVtkQYfWMq8fM4e-izX01MBXU5_8,11006
+mapFolding/oeis.py,sha256=wRKRvDG2mChrwQOMMLuL5xvU0zUYA0PhHbpJynwOKpY,17661
+mapFolding/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+mapFolding/algorithms/__init__.py,sha256=gARPqfySaeSWMfApQ5wSxzy7ZdgLdKYsLqsRSEYWwWI,28
+mapFolding/algorithms/daoOfMapFolding.py,sha256=ncTIiBfTsM8SNVx9qefZ0bBcBtviWLSk4iPv3Z9nGiE,5442
+mapFolding/algorithms/matrixMeanders.py,sha256=swU6xSo0QhhmA_FxmZhmqvGLJ0h_rS_75jO-SHETWLA,3489
+mapFolding/algorithms/matrixMeandersBeDry.py,sha256=92qk8dSXn2YxtUYhzSFpJpKDRUx6vbfMaRCbJt9baw0,7539
+mapFolding/algorithms/matrixMeandersNumPy.py,sha256=DsMUnB-tsttBm4ib385BaYS2Dnr-KCokKWfK7RjQ780,17147
+mapFolding/algorithms/matrixMeandersPandas.py,sha256=9Pm49HdK0g2MJ15CuZoXOFbdn8JcE0GHzz2p9NB3xvA,13167
+mapFolding/algorithms/oeisIDbyFormula.py,sha256=LLwCxmMY6minSuOWZHu1I9hKKNZP1ihe3ubGeH2uPDk,11762
+mapFolding/algorithms/zCuzDocStoopidoeisIDbyFormula.py,sha256=eGf_gvHUuHAPFFQZd3NIaozY2sQUGse_njtZ8_AyZ-U,2438
+mapFolding/reference/A000682facts.py,sha256=wRg5uy72M-o-cYEF3waCa7NjTUZ3XOoD9dmkTaUiH0o,23510
+mapFolding/reference/A005316facts.py,sha256=Cg2Pqtv3Dnk8IZOqer8Wu3Ie2uwJV_M0Kmr6_QXjKuQ,11768
+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/prefixNotationNotes.py,sha256=R9MUdS0vLEyaVdCio2AAfxEpBz6FDp7cZotEE47nFdU,1001
+mapFolding/reference/matrixMeandersAnalysis/signatures.py,sha256=nmZ88_MW-DirFlwpsbGvC1y7OxVlSKvDX4J0Hecd6zk,20472
+mapFolding/reference/meandersDumpingGround/A005316JavaPort.py,sha256=syMHicfioP-0GrOq7GnEpuAFSNvRwnbGim0mqV862sA,4885
+mapFolding/reference/meandersDumpingGround/A005316imperative.py,sha256=UEbXPkORngVo0UrwS81SY2gwz1XWAaMZ0rgA7HMiVYk,3793
+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/matrixMeandersNumPyV1finalForm.py,sha256=G4358jHFr7hdOa709c8nYdR3eMMZjUqcxbS-L2aAOqw,24428
+mapFolding/reference/meandersDumpingGround/matrixMeandersSimpleQueue.py,sha256=pOfaS315OKIBG9GSqSJwUDcEhfnV2XduM9IPqHrBvJg,4083
+mapFolding/reference/meandersDumpingGround/matrixMeandersSlicePop.py,sha256=XyiesSQAH1dRplYx_CdR1FzcXvgmmxzj27V4aIqPp7o,5353
+mapFolding/someAssemblyRequired/RecipeJob.py,sha256=9gLalEg3HeJb-HOUy38Uwm7oO-DdRX6q1Q2S58e4FKI,9899
+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=Zj0oCfx-puGcmSmilrVXC2rMKLfWx85yfsm3qTpqNSw,17274
+mapFolding/someAssemblyRequired/makeJobTheorem2codon.py,sha256=J8QJXijA39wu87YsB-WaPj0eYTRkE17SnWVd_FrUgf8,11542
+mapFolding/someAssemblyRequired/makingModules_count.py,sha256=AZpKfkXVXd2uk59OuxZWXNiy5NGeDwTJRHK0bvEuv-g,15158
+mapFolding/someAssemblyRequired/makingModules_doTheNeedful.py,sha256=ppv94hTqUoJbHKT3TRXr5LI8lBV5EJSylzz9_9OD3fw,6452
+mapFolding/someAssemblyRequired/toolkitMakeModules.py,sha256=jxoDetQXL9zXXcAuTzdiYgvoB95ksSx7ZdsgKqsKMnM,7967
+mapFolding/someAssemblyRequired/toolkitNumba.py,sha256=3ujtBaA27CX8yVApnfNRzFpZd3GvsHv1H1vyTiiJIZk,14905
+mapFolding/someAssemblyRequired/transformationTools.py,sha256=ElTZFcobLvT-dplODTGt7NX8oLke2xvEVg3hTCNoHgs,11561
+mapFolding/someAssemblyRequired/A007822/A007822rawMaterials.py,sha256=lg-h91FgAZ3v4LfgpP5RyPByW17eiorJt4fC435b_B0,2989
+mapFolding/someAssemblyRequired/A007822/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+mapFolding/someAssemblyRequired/A007822/makeA007822AsynchronousModules.py,sha256=urXQOME95x_p5DnWUl0z-8Kq60QzyCXIdSnxpp-klS0,12629
+mapFolding/someAssemblyRequired/A007822/makeA007822Modules.py,sha256=kHxVW4n92fRPX_4U4XMcjZCKad_PwxS2IRX2QVIFxDQ,4330
+mapFolding/someAssemblyRequired/mapFolding/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+mapFolding/someAssemblyRequired/mapFolding/makeMapFoldingModules.py,sha256=YvSzypYv4KER_ue1wWGtQ4WtSpkrPhkT0SJmji4J1qg,16743
+mapFolding/someAssemblyRequired/meanders/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+mapFolding/someAssemblyRequired/meanders/makeMeandersModules.py,sha256=GR4HAB07gXU9nLoXcYd5TfxKeVEjIlrD-ZOo3Mek45o,3309
+mapFolding/syntheticModules/__init__.py,sha256=evVFqhCGa-WZKDiLcnQWjs-Bj34eRnfSLqz_d7dFYZY,83
+mapFolding/syntheticModules/countParallelNumba.py,sha256=nhB3Z9Jl4NffJrXCAl4_EHp-ERqP0KoWFeToKlBwB7A,7877
+mapFolding/syntheticModules/daoOfMapFoldingNumba.py,sha256=5oMb8pttNKslN6wss9JIQXSnmjgE2q_2-3fIrh1pEW0,6033
+mapFolding/syntheticModules/dataPacking.py,sha256=lGWAeE-R1nh9ZBVhGkGLWrma6RWIXIWmaV-ZOV2WJ-8,2429
+mapFolding/syntheticModules/dataPackingA007822.py,sha256=Jxk3sQKRye65qfsWur2l--afzQPyG_4I86eYJKPWauI,6244
+mapFolding/syntheticModules/initializeState.py,sha256=OTiVi1Ywnlwk8tbwSIFjPJa_yBCINoapaCzGXDAJq_k,3121
+mapFolding/syntheticModules/theorem2.py,sha256=sqo8AA7CqvejAEuNqo5KIx7shjCQsuh8l8ThJot5RPA,3262
+mapFolding/syntheticModules/theorem2Numba.py,sha256=m7xRzaAXTAAYMRo1rW3KR5G1ghvVcTMGe-scJXHm1XA,3758
+mapFolding/syntheticModules/theorem2Trimmed.py,sha256=sJ228Qxd9dAxM7GTegFC5algm8uI-Y17NSaaID4ELq8,2933
+mapFolding/syntheticModules/A007822/__init__.py,sha256=evVFqhCGa-WZKDiLcnQWjs-Bj34eRnfSLqz_d7dFYZY,83
+mapFolding/syntheticModules/A007822/algorithm.py,sha256=y0MAGfaO1-4V5iaBTSaLDenUAkv8spRLjLxBChxqgYM,7058
+mapFolding/syntheticModules/A007822/algorithmNumba.py,sha256=ZpaDVxT8bsGiItn34kmIwXj-yrhdi4KQE8Mu4ZTaYnM,7192
+mapFolding/syntheticModules/A007822/asynchronous.py,sha256=Vy9OOvlIUrCqMsAPZs5JMviMqW4T-E6kRWX2a_cu-ho,6315
+mapFolding/syntheticModules/A007822/asynchronousAnnex.py,sha256=vyJcmo_eIS8s9e4sfE8eFnbR2HgExQ4Q5KNPzTKBooU,2629
+mapFolding/syntheticModules/A007822/asynchronousAnnexNumba.py,sha256=BD5XWR31xdPMV1AN6BUDhacEPuOjjktwT3nMVVYgvZA,2474
+mapFolding/syntheticModules/A007822/asynchronousNumba.py,sha256=rYSyYZ-4bZieUw1dL-mfdvnowLGVXbYiuN7CMmbv3hY,6116
+mapFolding/syntheticModules/A007822/asynchronousTheorem2.py,sha256=6GYBuNdykHkyeNN9oiuntQqTyzNZcWJSLm4boyfU0cU,3685
+mapFolding/syntheticModules/A007822/asynchronousTrimmed.py,sha256=C6QOKe4wDdl_mfjnosOSj64eOTkzQYDUWdL3O575Nq8,3339
+mapFolding/syntheticModules/A007822/initializeState.py,sha256=YzI2D1PoPsESF-JarzYx3xlTzdrc0YSUJ2nKIIZRfnY,4314
+mapFolding/syntheticModules/A007822/theorem2.py,sha256=jJjGseP29kDbRpqiDPryh1FSU0rHEE-WRvtcEWyGBWM,4463
+mapFolding/syntheticModules/A007822/theorem2Numba.py,sha256=QhH1GHZRBZFTghhPn4F_9_J79Ufc2Kj3Nsd6q6g0RHA,7002
+mapFolding/syntheticModules/A007822/theorem2Trimmed.py,sha256=KmZhvkTHqx2YlxkkYZGGXZMg5HdiJA9bXexgJOqugiY,4132
+mapFolding/syntheticModules/meanders/__init__.py,sha256=evVFqhCGa-WZKDiLcnQWjs-Bj34eRnfSLqz_d7dFYZY,83
+mapFolding/syntheticModules/meanders/bigInt.py,sha256=RP_mwMFvmOgvrnladm6sY5Cb1OPTS2XREjA4zucFqzc,2932
+mapFolding/tests/__init__.py,sha256=QVCHSMFVvTxV3mAyYOLkMFAFyBJ514zdoVnDmpBJnTo,1336
+mapFolding/tests/conftest.py,sha256=5vV_Vy5ZrV3uoP9bQ8B-Kqc0zMrL7KAhsPJwchMDb6w,15700
+mapFolding/tests/test_computations.py,sha256=0RDfA2FSBIV-wMaE5CGjc2fJ4gGfSTBQM9u3SAz7FIg,8656
+mapFolding/tests/test_filesystem.py,sha256=0rYQ62f4e3HOoymXrxDWbqNEBJQ7DGN8RUOMI84tE2Q,3892
+mapFolding/tests/test_oeis.py,sha256=M4Fb0e4_h9QTX9Oy6l5-M1UQfNqeonoGVOn0DJI9huE,4854
+mapFolding/tests/test_other.py,sha256=ScBiJ78LnyAaW-RhxcouX6Xw10wgpSdqfvT4LO3WjnQ,4766
+mapFolding/tests/test_tasks.py,sha256=_pr9JRWjjNKA7sww70XvkJJdGPruBVzubM63RmD_Du0,4013
+mapFolding/zCuzDocStoopid/__init__.py,sha256=uKcGXsaYKH9kQUGHjaY0EtWtU6qybb9Fs09ZYKEFMNs,236
+mapFolding/zCuzDocStoopid/makeDocstrings.py,sha256=cQl-B-RlAkFijATUTWfKCael46foH-ZsOp1EHoYxoGs,3212
+mapfolding-0.16.2.dist-info/licenses/LICENSE,sha256=NxH5Y8BdC-gNU-WSMwim3uMbID2iNDXJz7fHtuTdXhk,19346
+mapfolding-0.16.2.dist-info/METADATA,sha256=ZU8DJZ5s9nTi3OYvTAc-IRY2BkcaDLkvFtmshYSL9hY,7570
+mapfolding-0.16.2.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
+mapfolding-0.16.2.dist-info/entry_points.txt,sha256=-mH9DjW9tDRMPaeoSWKKywG35cR28m12H_jtmrB4eY8,98
+mapfolding-0.16.2.dist-info/top_level.txt,sha256=jNj7ccwEy_9uqs0hsQCO_rPXgaGn8-IMqXePQN6nZTY,19
+mapfolding-0.16.2.dist-info/RECORD,,

{mapfolding-0.16.0.dist-info → mapfolding-0.16.2.dist-info}/top_level.txt

@@ -1 +1,2 @@
+easyRun
 mapFolding

mapFolding/algorithms/getBucketsTotal.py

@@ -1,137 +0,0 @@
-"""Buckets."""
-from mapFolding import MatrixMeandersState
-from mapFolding.reference.A005316facts import bucketsIf_k_EVEN_by_nLess_k, bucketsIf_k_ODD_by_nLess_k
-from math import exp, log
-from typing import NamedTuple
-import math
-
-class ImaKey(NamedTuple):
-	"""keys for dictionaries."""
-
-	oeisID: str
-	kIsOdd: bool
-	nLess_kIsOdd: bool
-
-def getBucketsTotal(state: MatrixMeandersState, safetyMultiplicand: float = 1.2) -> int:
-	"""Estimate the total number of non-unique curveLocations that will be computed from the existing curveLocations.
-
-	Notes
-	-----
-	Subexponential bucketsTotal unified estimator parameters (derived in reference notebook).
-
-	The model is: log(buckets) = intercept + bN*log(n) + bK*log(k) + bD*log(n-k) + g_r*(k/n) + g_r2*(k/n)^2 + g_s*((n-k)/n) + offset(subseries)
-	Subseries key: f"{oeisID}_kOdd={int(kIsOdd)}_dOdd={int(nLess_kIsOdd)}" with a reference subseries offset of zero.
-	These coefficients intentionally remain in-source (SSOT) to avoid runtime JSON parsing overhead and to support reproducibility.
-	"""
-	dictionaryExponentialCoefficients: dict[ImaKey, float] = {
-		(ImaKey(oeisID='', kIsOdd=False, nLess_kIsOdd=True)): 0.834,
-		(ImaKey(oeisID='', kIsOdd=False, nLess_kIsOdd=False)): 1.5803,
-		(ImaKey(oeisID='', kIsOdd=True, nLess_kIsOdd=True)): 1.556,
-		(ImaKey(oeisID='', kIsOdd=True, nLess_kIsOdd=False)): 1.8047,
-	}
-
-	logarithmicOffsets: dict[ImaKey, float] ={
-		(ImaKey('A000682', kIsOdd=False, nLess_kIsOdd=False)): 0.0,
-		(ImaKey('A000682', kIsOdd=False, nLess_kIsOdd=True)): -0.07302547148212568,
-		(ImaKey('A000682', kIsOdd=True, nLess_kIsOdd=False)): -0.00595307513938792,
-		(ImaKey('A000682', kIsOdd=True, nLess_kIsOdd=True)): -0.012201222865243722,
-		(ImaKey('A005316', kIsOdd=False, nLess_kIsOdd=False)): -0.6392728422078733,
-		(ImaKey('A005316', kIsOdd=False, nLess_kIsOdd=True)): -0.6904925299923548,
-		(ImaKey('A005316', kIsOdd=True, nLess_kIsOdd=False)): 0.0,
-		(ImaKey('A005316', kIsOdd=True, nLess_kIsOdd=True)): 0.0,
-	}
-
-	logarithmicParameters: dict[str, float] = {
-		'intercept': -166.1750299793178,
-		'log(n)': 1259.0051001675547,
-		'log(k)': -396.4306071056408,
-		'log(nLess_k)': -854.3309503739766,
-		'k/n': 716.530410654819,
-		'(k/n)^2': -2527.035113444166,
-		'normalized k': -882.7054406339189,
-	}
-
-	bucketsTotalMaximumBy_kOfMatrix: dict[int, int] = {1:3, 2:12, 3:40, 4:125, 5:392, 6:1254, 7:4087, 8:13623, 9:46181, 10:159137, 11:555469, 12:1961369, 13:6991893, 14:25134208}
-
-	xCommon = 1.57
-
-	nLess_k: int = state.n - state.kOfMatrix
-	kIsOdd: bool = bool(state.kOfMatrix & 1)
-	nLess_kIsOdd: bool = bool(nLess_k & 1)
-	kIsEven: bool = not kIsOdd
-	bucketsTotal: int = -8
-
-	"""NOTE temporary notes
-	I have a fault in my thinking. bucketsTotal increases as k decreases until ~0.4k, then bucketsTotal decreases rapidly to 1. I
-	have ignored the decreasing side. In the formulas for estimation, I didn't differentiate between increasing and decreasing.
-	So, I probably need to refine the formulas. I guess I need to add checks to the if/else monster, too.
-
-	While buckets is increasing:
-		3 types of estimates:
-			1. Exponential growth.
-			2. Logarithmic growth.
-			3. Hard ceiling.
-	While buckets is decreasing:
-		1. Hard ceiling, same as increasing side.
-		2. ???
-		3. buckets = 1.
-
-	The formula for exponential growth _never_ underestimates. I haven't measured by how much it overestimates.
-
-	"""
-
-	bucketsTotalAtMaximum: bool = state.kOfMatrix <= ((state.n - 1 - (state.kOfMatrix % 2)) // 3)
-	bucketsTotalGrowsExponentially: bool = state.kOfMatrix > nLess_k
-	bucketsTotalGrowsLogarithmically: bool = state.kOfMatrix > ((state.n - (state.n % 3)) // 3)
-
-	if bucketsTotalAtMaximum:
-		if state.kOfMatrix in bucketsTotalMaximumBy_kOfMatrix:
-			bucketsTotal = bucketsTotalMaximumBy_kOfMatrix[state.kOfMatrix]
-		else:
-			c = 0.95037
-			r = 3.3591258254
-			if kIsOdd:
-				c = 0.92444
-				r = 3.35776
-			bucketsTotal = int(c * r**state.kOfMatrix * safetyMultiplicand)
-
-	elif bucketsTotalGrowsExponentially:
-		if (state.oeisID == 'A005316') and kIsOdd and (nLess_k in bucketsIf_k_ODD_by_nLess_k):
-			# If I already know bucketsTotal.
-			bucketsTotal = bucketsIf_k_ODD_by_nLess_k[nLess_k]
-		elif (state.oeisID == 'A005316') and kIsEven and (nLess_k in bucketsIf_k_EVEN_by_nLess_k):
-			# If I already know bucketsTotal.
-			bucketsTotal = bucketsIf_k_EVEN_by_nLess_k[nLess_k]
-		else: # I estimate bucketsTotal during exponential growth.
-			xInstant: int = math.ceil(nLess_k / 2)
-			A000682adjustStartingCurveLocations: float = 0.25
-			startingConditionsCoefficient: float = dictionaryExponentialCoefficients[ImaKey('', kIsOdd, nLess_kIsOdd)]
-			if kIsOdd and nLess_kIsOdd:
-				A000682adjustStartingCurveLocations = 0.0
-			if state.oeisID == 'A000682': # NOTE Net effect is between `*= n` and `*= n * 2.2` if n=46.
-				startingConditionsCoefficient *= state.n * (((state.n // 2) + 2) ** A000682adjustStartingCurveLocations)
-			bucketsTotal = int(startingConditionsCoefficient * math.exp(xCommon * xInstant))
-
-	elif state.kOfMatrix <= max(bucketsTotalMaximumBy_kOfMatrix.keys()):
-		# If `kOfMatrix` is low, use maximum bucketsTotal. 1. Can't underestimate. 2. Skip computation that can underestimate.
-		# 3. The potential difference in memory use is relatively small.
-		bucketsTotal = bucketsTotalMaximumBy_kOfMatrix[state.kOfMatrix]
-
-	elif bucketsTotalGrowsLogarithmically:
-		xPower: float = (0
-			+ logarithmicParameters['intercept']
-			+ logarithmicParameters['log(n)'] * log(state.n)
-			+ logarithmicParameters['log(k)'] * log(state.kOfMatrix)
-			+ logarithmicParameters['log(nLess_k)'] * log(nLess_k)
-			+ logarithmicParameters['k/n'] * (state.kOfMatrix / state.n)
-			+ logarithmicParameters['(k/n)^2'] * (state.kOfMatrix / state.n)**2
-			+ logarithmicParameters['normalized k'] * nLess_k / state.n
-			+ logarithmicOffsets[ImaKey(state.oeisID, kIsOdd, nLess_kIsOdd)]
-		)
-
-		bucketsTotal = int(exp(xPower * safetyMultiplicand))
-
-	else:
-		message = "I shouldn't be here."
-		raise SystemError(message)
-	return bucketsTotal

mapFolding/reference/matrixMeandersAnalysis/evenEven.py

@@ -1,144 +0,0 @@
-"""
-Matrix Meanders Buckets Estimation Formula.
-
-This module provides a function to estimate the number of buckets in matrix meanders
-analysis based on parameters n and k. The formula was derived through regression
-analysis on empirical data and achieves an R² score of 0.9978.
-
-Author: Generated from Jupyter notebook analysis
-Date: September 2025
-"""
-import math
-
-def estimateBucketsFromParametersNandK(parameterN: int, parameterK: int) -> float:
-    """
-    Estimate the number of buckets in matrix meanders analysis based on parameters n and k.
-
-    This function implements a log-polynomial regression model derived from empirical data analysis
-    of matrix meanders with even-even configurations. The model was trained on 34 data points
-    and achieved an R² score of 0.9978, indicating excellent predictive performance.
-
-    The underlying formula is:
-    buckets = exp(0.087760 + 0.447340*n - 0.058715*k - 0.014116*n² + 0.072333*n*k - 0.090631*k²) - 1
-
-    Parameters
-    ----------
-    parameterN : int
-        The n parameter (must be positive integer, typically even)
-    parameterK : int
-        The k parameter (must be positive integer, typically even)
-
-    Returns
-    -------
-    float
-        Estimated number of buckets
-
-    Raises
-    ------
-    ValueError
-        If parameterN or parameterK are not positive integers
-
-    Example:
-    --------
-    >>> estimateBucketsFromParametersNandK(20, 10)
-    3656.4
-    >>> estimateBucketsFromParametersNandK(44, 22)
-    32715318.1
-
-    Notes
-    -----
-    This formula is based on empirical data and is most accurate for values
-    within the training range (n: 4-44, k: 2-22). Extrapolation beyond this
-    range should be done with caution.
-
-    The underlying mathematical relationship shows that buckets grow exponentially
-    with both n and k, with complex polynomial interactions captured in the logarithmic space.
-
-    Performance Metrics:
-    - R² Score: 0.9978
-    - Mean Absolute Error: 4.02% across all training examples
-    - Median Error: 2.69%
-    - Maximum Error: 18.86% (on smallest values)
-    """
-    # Input validation
-    if not isinstance(parameterN, int) or parameterN <= 0:
-        raise ValueError(f"parameterN must be a positive integer, got {parameterN}")
-    if not isinstance(parameterK, int) or parameterK <= 0:
-        raise ValueError(f"parameterK must be a positive integer, got {parameterK}")
-
-    # Convert to float for calculations
-    n = float(parameterN)
-    k = float(parameterK)
-
-    # Log-polynomial formula coefficients (derived from regression analysis)
-    # Formula: log(buckets + 1) = intercept + c1*n + c2*k + c3*n² + c4*n*k + c5*k²
-    interceptValue = 0.087760
-    coefficientN = 0.447340
-    coefficientK = -0.058715
-    coefficientNSquared = -0.014116
-    coefficientNTimesK = 0.072333
-    coefficientKSquared = -0.090631
-
-    # Calculate log(buckets + 1)
-    logBucketsPlusOne = (interceptValue +
-                        coefficientN * n +
-                        coefficientK * k +
-                        coefficientNSquared * (n * n) +
-                        coefficientNTimesK * (n * k) +
-                        coefficientKSquared * (k * k))
-
-    # Transform back to original scale: buckets = exp(log(buckets + 1)) - 1
-    estimatedBuckets = math.exp(logBucketsPlusOne) - 1.0
-
-    return max(0.0, estimatedBuckets)  # Ensure non-negative result
-
-
-def validateFormulaAccuracy() -> None:
-    """
-    Validate the formula against known test cases from the training data.
-
-    This function demonstrates the accuracy of the formula by testing it
-    against several known data points from the original dataset.
-    """
-    # Test cases from the original dataset (n, k, expected_buckets)
-    testCases = [
-        (4, 2, 4),
-        (20, 10, 3592),
-        (36, 18, 1666843),
-        (44, 22, 35674291)
-    ]
-
-    print("Formula Validation Results:")
-    print("-" * 50)
-    print(f"{'n':<4} {'k':<4} {'Expected':<12} {'Predicted':<12} {'Error %':<8}")
-    print("-" * 50)
-
-    totalError = 0.0
-    for n, k, expected in testCases:
-        predicted = estimateBucketsFromParametersNandK(n, k)
-        error = abs((expected - predicted) / expected) * 100
-        totalError += error
-
-        # Format large numbers appropriately
-        expectedStr = f"{expected:.0f}" if expected < 1e6 else f"{expected:.2e}"
-        predictedStr = f"{predicted:.1f}" if predicted < 1e6 else f"{predicted:.2e}"
-
-        print(f"{n:<4} {k:<4} {expectedStr:<12} {predictedStr:<12} {error:<8.1f}")
-
-    avgError = totalError / len(testCases)
-    print("-" * 50)
-    print(f"Average Error: {avgError:.2f}%")
-
-
-if __name__ == "__main__":
-    # Run validation when script is executed directly
-    validateFormulaAccuracy()
-
-    # Demonstrate usage
-    print("\nUsage Examples:")
-    print("-" * 30)
-
-    examples = [(8, 4), (20, 10), (36, 18)]
-    for n, k in examples:
-        result = estimateBucketsFromParametersNandK(n, k)
-        print(f"estimateBucketsFromParametersNandK({n}, {k}) = {result:.1f}")

mapFolding/reference/matrixMeandersAnalysis/oddEven.py

@@ -1,54 +0,0 @@
-from math import exp as math_exp, log as math_log
-
-def estimateBuckets(n: int, k: int) -> float:
-    """Estimate the number of buckets for given integers n and k.
-
-    Model form (log-space):
-        log(estimate) = a
-            + b * log(n)
-            + c * log(k)
-            + d * log(n)*log(k)
-            + e * (k / n)
-            + f * (n / k)
-
-    Coefficients were obtained via ordinary least squares fit on log(buckets)
-    using the dataset in df_oddEven.csv (38 observations). The regression achieved
-    R^2 ≈ {coefficient_determination:.5f} (log space) with MAPE ≈ {mean_absolute_percentage_error:.2f}% on training data.
-
-    NOTE: This is an empirical approximation; extrapolation outside the range
-    n ∈ [{min(n_values)}, {max(n_values)}], k ∈ [{min(k_values)}, {max(k_values)}] may be unreliable.
-
-    Parameters
-    ----------
-    n : int
-        Primary size parameter (must be > 0)
-    k : int
-        Secondary size parameter (must be > 0)
-
-    Returns
-    -------
-    float
-        Estimated bucket count (positive real number). Caller may round if an
-        integer is desired.
-    """
-    if not isinstance(n, int) or n <= 0:
-        raise ValueError(f'allegedInt n must be positive int, got {n!r}')
-    if not isinstance(k, int) or k <= 0:
-        raise ValueError(f'allegedInt k must be positive int, got {k!r}')
-
-    a = -679.088264366881
-    b =  864.829109159972
-    c = -873.871846814867
-    d =    3.487829177620
-    e =  943.512567960048
-    f = -193.640628682536
-
-    ln_n = math_log(n)
-    ln_k = math_log(k)
-    value_log = (a
-                 + b * ln_n
-                 + c * ln_k
-                 + d * ln_n * ln_k
-                 + e * (k / n)
-                 + f * (n / k))
-    return math_exp(value_log)

mapFolding/trim_memory.py

@@ -1,62 +0,0 @@
-"""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-0.16.0.dist-info/METADATA

@@ -1,85 +0,0 @@
-Metadata-Version: 2.4
-Name: mapFolding
-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
-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,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
-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
-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 :: Implementation :: CPython
-Classifier: Topic :: Scientific/Engineering :: Information Analysis
-Classifier: Topic :: Scientific/Engineering :: Mathematics
-Classifier: Topic :: Software Development :: Code Generators
-Classifier: Topic :: Software Development :: Compilers
-Classifier: Topic :: Software Development :: Libraries :: Python Modules
-Classifier: Topic :: Software Development :: Pre-processors
-Classifier: Typing :: Typed
-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
-Provides-Extra: development
-Requires-Dist: memray; sys_platform == "linux" and extra == "development"
-Requires-Dist: mypy; extra == "development"
-Requires-Dist: pyupgrade; extra == "development"
-Requires-Dist: py-spy; extra == "development"
-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"
-Requires-Dist: pytest; extra == "testing"
-Dynamic: license-file
-
-# mapFolding
-
-[![pip install mapFolding](https://img.shields.io/badge/pip%20install-mapFolding-gray.svg?colorB=3b434b)](https://pypi.org/project/mapFolding/)
-
-Map folding, meanders, stamp folding, semi-meanders. Experiment with algorithm transformations and code optimization.
-
-Command line:
-
-- getOEISids
-- OEIS_for_n
-
-The package is focused on mapFolding and stamp folding. But "mapFolding/_oeisFormulas" has some infrastructure for meanders and semi-meanders.
-
-There are innovations and insights in the mapFolding stuff.
-
-## My recovery
-
-[![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://github.com/hunterhogan/mapFolding/blob/main/CC-BY-NC-4.0.png)](https://creativecommons.org/licenses/by-nc/4.0/)