mapFolding 0.17.0__py3-none-any.whl → 0.18.0__py3-none-any.whl

mapFolding/algorithms/A000136elimination.py

@@ -1,163 +0,0 @@
-from itertools import permutations, starmap
-from typing import Final
-
-def isThisValid(folding: tuple[int, ...]) -> bool:
-	"""Verify that a folding sequence is possible.
-
-	Parameters
-	----------
-	folding : list[int]
-		List of integers representing the folding sequence.
-
-	Returns
-	-------
-	valid : bool
-		True if the folding sequence is valid, False otherwise.
-
-	Notes
-	-----
-	All 8 forbidden forms
-		[k, r, k+1, r+1] [r, k+1, r+1, k] [k+1, r+1, k, r] [r+1, k, r, k+1]
-		[r, k, r+1, k+1] [k, r+1, k+1, r] [r+1, k+1, r, k] [k+1, r, k, r+1]
-
-	I selected the four forms in which k precedes r. Because of the flow, I _think_ that is why these four are sufficient.
-
-	Citation
-	--------
-	John E. Koehler, Folding a strip of stamps, Journal of Combinatorial Theory, Volume 5, Issue 2, 1968, Pages 135-152, ISSN
-	0021-9800, https://doi.org/10.1016/S0021-9800(68)80048-1.
-	(https://www.sciencedirect.com/science/article/pii/S0021980068800481)
-
-	See Also
-	--------
-	- "[Annotated, corrected, scanned copy]" at https://oeis.org/A001011.
-	- Citation in BibTeX format "citations/KOEHLER1968135.bib".
-	"""
-	leavesTotal: int = len(folding)
-	for index, leaf in enumerate(folding[0:-1]):												# `[0:-1]` No room to interpose
-		if leaf == leavesTotal:
-			continue
-		indexLeafRightSide: int = folding.index(leaf+1)
-		leafIsOdd: int = leaf & 1
-
-		for indexInterposer, interposer in enumerate(folding[index + 1:None], start=index + 1):	# [k != r]
-			if leafIsOdd != (interposer & 1):													# [k%2 == r%2]
-				continue
-			if interposer == leavesTotal:
-				continue
-
-			indexInterposerRightSide: int = folding.index(interposer + 1)
-
-			if (index < indexInterposer < indexLeafRightSide < indexInterposerRightSide			# [k, r, k+1, r+1]
-			or  index < indexInterposerRightSide < indexLeafRightSide < indexInterposer			# [k, r+1, k+1, r]
-			or  indexLeafRightSide < indexInterposerRightSide < index < indexInterposer			# [k+1, r+1, k, r]
-			or  indexInterposerRightSide < index < indexInterposer < indexLeafRightSide			# [r+1, k, r, k+1]
-				):
-				return False
-	return True
-
-def count(prefix: list[int], permutands: list[int], postfix: list[int]) -> int:
-	"""Count the number of valid foldings for a given fixed start and remaining leaves.
-
-	Parameters
-	----------
-	prefix : list[int]
-		List of integers representing the fixed start of the folding sequence.
-	permutands : list[int]
-		List of elements to permute into permutations.
-	postfix : list[int]
-		List of integers representing the fixed end of the folding sequence.
-
-	Returns
-	-------
-	groupsOfFolds : int
-		Number of valid foldings, which each represent a group of folds, for the given configuration.
-	"""
-	groupsOfFolds: int = 0
-	for aPermutation in permutations(permutands):
-		groupsOfFolds += isThisValid((*prefix, *aPermutation, *postfix))
-	return groupsOfFolds
-
-def staging(prefix: list[int], permutands: list[int]) -> int:
-	"""Segregate sequences with a final `2`: necessary as part of excluding leading `1,2`.
-
-	Parameters
-	----------
-	prefix : list[int]
-		List of integers representing the fixed start of the folding sequence.
-	permutands : list[int]
-		List of elements to permute into permutations.
-
-	Notes
-	-----
-	Transformation indices:
-
-	1,3,4,5,6,2,
-	1,2,6,5,4,3,
-
-	All valid sequences that end with '2' are in the first half.
-	All valid sequences that start with '1,2' are in the second half.
-	The remaining valid sequences are evenly split between the two halves.
-	Therefore:
-		1. Filter out all '1,2' before checking validity.
-		2. If a valid sequence ends in '2', add 2 to the total count.
-		3. If a valid sequence does not end in '2', add 1 to the total count.
-
-	`leaf = leavesTotal` is evenly distributed in each half like this: (ex. from A007822(7))
-	^1,14, ,14,$ 612
-	,14,$ ^1,14, 1486
-	"""
-	groupsOfFolds: int = 0
-	postfix: list[int] = []
-	if 2 in permutands:
-		postfix.append(2)
-		postfixComplement: list[int] = permutands.copy()
-		postfixComplement.remove(2)
-		groupsOfFolds += count(prefix, postfixComplement, postfix) * 2
-		for leafPostfix in postfixComplement:
-			groupsOfFolds += count(prefix, [leaf for leaf in permutands if leaf != leafPostfix], [leafPostfix])
-	else:
-		groupsOfFolds += count(prefix, permutands, postfix)
-	return groupsOfFolds
-
-def doTheNeedful(n: int) -> int:
-	"""Count the number of valid foldings for a given number of leaves."""
-	leavesTotal: Final[int] = n
-	listToPermute: list[tuple[list[int], list[int]]] = []
-
-	prefix: list[int] = [1]
-	listLeaves: Final[list[int]] = list(range(leavesTotal, 1, -1))
-
-	permutands: list[int] = listLeaves.copy()
-
-# ------- Exclude leading 2 -------------------------------
-# NOTE 1,{3..n},{2..n}...
-	excludeLeading2: list[int] = permutands.copy()
-	excludeLeading2.remove(2)
-	listToPermute.extend([([*prefix, leafPrefix], [leaf for leaf in permutands if leaf != leafPrefix]) for leafPrefix in excludeLeading2])
-	del excludeLeading2
-
-# ------- Exclude interposed 2 ----------------------------
-# NOTE 1,{3..n},{3..n},{2..n}...
-# NOTE 1,{n,if n&1},{2..n-1}...
-	for aTuple in listToPermute.copy():
-		if len(aTuple[0]) != 2 or leavesTotal < 4:
-			continue
-		interposer: int = aTuple[0][1]
-		excludeInterposed2: list[int] = permutands.copy()
-		excludeInterposed2.remove(2)
-		excludeInterposed2.remove(interposer)
-		if interposer == leavesTotal and interposer & 1:
-			listToPermute.append(([*aTuple[0], 2], excludeInterposed2))
-		listToPermute.extend([([*aTuple[0], leafPrefix], [leaf for leaf in permutands if leaf not in (leafPrefix, interposer)]) for leafPrefix in excludeInterposed2])
-		listToPermute.remove(aTuple)
-		del aTuple, excludeInterposed2, interposer
-
-	return sum(starmap(staging, listToPermute)) * leavesTotal
-
-# ------- Exclude interposed 3 ----------------------------
-# NOTE 1,{3..n},{3..n},{2..n}...,{3..n}
-# NOTE 1,{3..n},{3..n},{3..n}...,{4..n},{3..n},{2}
-# NOTE 1,{3..n-1},...,{n,if ~n&1},{2}
-# NOTE 1,{n,if n&1},{2..n-1}...
-

mapFolding/algorithms/A000136eliminationParallel.py

@@ -1,77 +0,0 @@
-from concurrent.futures import Future, ProcessPoolExecutor
-from itertools import permutations
-
-def isThisValid(folding: list[int]) -> bool:
-	"""Verify that a folding sequence is possible.
-
-	Parameters
-	----------
-	folding : list[int]
-		List of integers representing the folding sequence.
-
-	Returns
-	-------
-	valid : bool
-		True if the folding sequence is valid, False otherwise.
-	"""
-	leavesTotal: int = len(folding)
-	for index, leaf in enumerate(folding[0:-1]):	# Last leaf cannot interpose
-		if leaf == leavesTotal:
-			continue
-		indexLeafRightSide: int = folding.index(leaf+1)
-		leafIsOdd: int = leaf & 1
-
-		for indexInterposer, interposer in enumerate(folding[index + 1:None], start=index + 1):	# [k != r]
-			if leafIsOdd != (interposer & 1):											# [k%2 == r%2]
-				continue
-			if interposer == leavesTotal:
-				continue
-
-			indexInterposerRightSide: int = folding.index(interposer + 1)
-
-			if (index < indexInterposer < indexLeafRightSide < indexInterposerRightSide	# [k, r, k+1, r+1]
-			or  index < indexInterposerRightSide < indexLeafRightSide < indexInterposer	# [k, r+1, k+1, r]
-			or  indexLeafRightSide < indexInterposerRightSide < index < indexInterposer	# [k+1, r+1, k, r]
-			or  indexInterposerRightSide < index < indexInterposer < indexLeafRightSide	# [r+1, k, r, k+1]
-				):
-				return False
-	return True
-
-def count(fixed: list[int], permutands: list[int]) -> int:
-	"""Count the number of valid foldings for a given fixed start and remaining leaves.
-
-	Parameters
-	----------
-	fixed : list[int]
-		List of integers representing the fixed start of the folding sequence.
-	permutands : list[int]
-		List of elements to permute into permutations.
-	"""
-	validTotal: int = 0
-	for aPermutation in permutations(permutands):
-		validTotal += isThisValid([*fixed, *aPermutation])
-	return validTotal
-
-def doTheNeedful(n: int, processesMaximum: int) -> int:
-	"""Count the number of valid foldings for a given number of leaves."""
-	validTotal: int = 0
-	listLeavesTruncated: list[int] = list(range(2, n + 1))
-# NOTE Design goals:
-# Minimize creation/destruction of processes.
-# Use all processes until the end.
-# A valid sequence takes many times more cycles to process than a sequence that is proved invalid in the first few elements.
-# So, dividing purely on the number of sequences is not optimal.
-# Prefer generators of lists over lists of lists.
-
-# In the current system, each `Future` leads to a returned value, which is then summed. But, I don't care about any specific
-# `Future`. I would rather have the processes "consume" work from a common well and return their results when the work is done.
-	workers: int = min(processesMaximum, n - 1)
-	with ProcessPoolExecutor(max_workers=workers) as processPool:
-		listFutures: list[Future[int]] = []
-		for index in range(len(listLeavesTruncated)):
-			permutands: list[int] = listLeavesTruncated.copy()
-			fixedLeaves: list[int] = [1, permutands.pop(index)]
-			listFutures.append(processPool.submit(count, fixedLeaves, permutands))
-		for futureCount in listFutures:
-			validTotal += futureCount.result()
-	return validTotal * n

mapfolding-0.17.0.dist-info/RECORD

@@ -1,107 +0,0 @@
-easyRun/A000682.py,sha256=VhzR_7ZqEkbDGug0AvW_TqS9W6a3t-ws572DqjZ_mqI,700
-easyRun/A005316.py,sha256=WCIqsNSevjgUSnTe24d6zWKLZnJSoy14piSt6G26WuE,434
-easyRun/NOTcountingFolds.py,sha256=da9U8q_D_YL94mLhlVSBjdKyKABzbi9nOw-oTeKh9O8,1161
-easyRun/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-easyRun/countFolds.py,sha256=LF36qsSMvc9RwzE969kQrGHctRf3mMuCxBkjy-sn-q4,1461
-easyRun/generateAllModules.py,sha256=xsXFs0BwQ_O5m5rqMjhgMOZ3lj9ssmc3Qdxazp7_uAI,622
-easyRun/meanders.py,sha256=Npcq5RL7WR6mFEZYlHLaUzedULbQxkGT8i7ydbH8DCA,1827
-mapFolding/__init__.py,sha256=ZVkNS11uN04EWDBazqkY4AeVZC9UOXV_W-1V9QZgnl0,1913
-mapFolding/_theSSOT.py,sha256=QuyDsMCbqv3Au4RUgdYPcyR89JrT9WkzcauzybpgKzU,5384
-mapFolding/_theTypes.py,sha256=0uf4x31ilFxIO6sbiSd39H5_7VWBKxColVmfy3oIafk,7376
-mapFolding/basecamp.py,sha256=cNZ104ZbVjV_tagjzn6DuobLyLJpJs418_ew64xYORw,15788
-mapFolding/beDRY.py,sha256=0vJwnsvz6_jR8gfuU38vW9KoMTnRqyaYaAwbJcKLhFI,12674
-mapFolding/dataBaskets.py,sha256=K6M8NG8oqsTUpTR-S_VJFNeDfHV936q65PMtUMNVYrI,26484
-mapFolding/filesystemToolkit.py,sha256=ic69Y043xrdoFjKqiB0YJ6Zp8oosBWwdXi_hmg79PVs,10134
-mapFolding/oeis.py,sha256=2sqdFgYguB4sDpcYGYB_mJL57k9sHs7FUXF05pvIEak,17300
-mapFolding/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-mapFolding/algorithms/A000136constraintPropagation.py,sha256=LJky_I57WIEVXkD8MGiD7bglgy9OvkxWisYrmwSyVAI,5443
-mapFolding/algorithms/A000136elimination.py,sha256=M-kEYknUSdvoXpXrver6tq48MReUhEo_amNoIDKJBM4,5869
-mapFolding/algorithms/A000136eliminationParallel.py,sha256=X3L3hOaqsu7uT9pcyCmKPHElXhoLC-YRGZo2IfpyZtQ,3081
-mapFolding/algorithms/A086345.py,sha256=te3Zy76eJLE3dSFsK7hXTHJapewM1u43GBUV78fL2z8,2492
-mapFolding/algorithms/__init__.py,sha256=gARPqfySaeSWMfApQ5wSxzy7ZdgLdKYsLqsRSEYWwWI,28
-mapFolding/algorithms/daoOfMapFolding.py,sha256=ncTIiBfTsM8SNVx9qefZ0bBcBtviWLSk4iPv3Z9nGiE,5442
-mapFolding/algorithms/matrixMeanders.py,sha256=g8h9sF1emt5OQCXe3EVA_g0FdhvNu7Wo1FI4kMFsqZY,5167
-mapFolding/algorithms/matrixMeandersNumPyndas.py,sha256=giCqLNnxu4RbGERtyAJb5mbvMd1ZbzLR_EoRiEjCXUY,39140
-mapFolding/algorithms/oeisIDbyFormula.py,sha256=jinaLXJb3annODlyidtNZkKIKUuFKp_yzjEZMHSMhQ0,11782
-mapFolding/algorithms/symmetricFolds.py,sha256=g_3Xm3UQ4KwduDdsQJPwQxrIXdBmBjei2_idsLgIIZQ,1200
-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/A086345Wu.py,sha256=3FJlvcVkrQL2hz4IN2NdzmdMW0weWfYh9l1pnXBTQnc,1110
-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=GcnFazAClLsgh4JoO1n-iCtO5aSKJB0SMsKu3RCV--4,3721
-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=6yHwW22032ysBgoG9LXxUyvWlKjQgxpB-f8lI213YZ0,20677
-mapFolding/reference/meandersDumpingGround/A005316JavaPort.py,sha256=syMHicfioP-0GrOq7GnEpuAFSNvRwnbGim0mqV862sA,4885
-mapFolding/reference/meandersDumpingGround/A005316imperative.py,sha256=UEbXPkORngVo0UrwS81SY2gwz1XWAaMZ0rgA7HMiVYk,3793
-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/matrixMeandersBaselineV2.py,sha256=VpRiIGhnk-DbxwsHwCeCwXqcKLSNyHl-iRGLDH9ZGMY,7674
-mapFolding/reference/meandersDumpingGround/matrixMeandersNumPyV1finalForm.py,sha256=yMEF8GIz_1lMMkJiMk-5lek9TAAoqEzfkMbQP80dC_Y,24425
-mapFolding/reference/meandersDumpingGround/matrixMeandersSlicePop.py,sha256=XyiesSQAH1dRplYx_CdR1FzcXvgmmxzj27V4aIqPp7o,5353
-mapFolding/someAssemblyRequired/RecipeJob.py,sha256=8sIRcgP8yFeUplw4GgR5eN8CwVK1ELXPU2xaC2UCLvY,13102
-mapFolding/someAssemblyRequired/__init__.py,sha256=tDDYGBKNhZgcVXZIW-HnUeyXAMdURTOKandc59dUZ7s,5835
-mapFolding/someAssemblyRequired/_toolIfThis.py,sha256=QC2cmCea18BZ_WpoWoErYCWhROvmd40_i_nBO7YFRaE,6378
-mapFolding/someAssemblyRequired/_toolkitContainers.py,sha256=r2Ll4ZW6dz_EDPW2IViYKggsNYbB5L0JfHLbcxXq7EI,14884
-mapFolding/someAssemblyRequired/getLLVMforNoReason.py,sha256=tY0-2K0BFkwLAAjSrFJLPoG8CevDHOFc3OH3TxXANzg,2806
-mapFolding/someAssemblyRequired/infoBooth.py,sha256=nkuBBb_owBCQijqum98QzeKjoIsFrHB5-1pIWObcH0E,2446
-mapFolding/someAssemblyRequired/makeJobTheorem2Numba.py,sha256=z_hXGdl6WbgTZXEKUWZ0FJ9yVfRxXhZyqzgbsLXD9Z4,18189
-mapFolding/someAssemblyRequired/makeJobTheorem2codon.py,sha256=Y51NC5LkdieIjcCyVdeAaXrJzjYKfzNJlRZmlSSGDqk,10133
-mapFolding/someAssemblyRequired/makingModules_count.py,sha256=qudUryuwExzD92_o14OaDg8_Gy3NaHDXLCGttG8hrNI,15068
-mapFolding/someAssemblyRequired/makingModules_doTheNeedful.py,sha256=jp3OmAcTXifxL2XH3AfIMK30nE6Vg9kTCiSDLcUoSEI,3277
-mapFolding/someAssemblyRequired/toolkitMakeModules.py,sha256=wdu-DBdevmoZKc8icl-lzDQ-q0-0iIbligwNYyMztcY,6854
-mapFolding/someAssemblyRequired/toolkitNumba.py,sha256=ABmNjqMfDlUbHfo69eSoFzJRKPe3pkSrfd4YIeGFYdY,14947
-mapFolding/someAssemblyRequired/transformationTools.py,sha256=UD0LIrJkEdvZMvJLbMWXfbXhVKG7oxsSPCmkfRrXXNA,11598
-mapFolding/someAssemblyRequired/A007822/A007822rawMaterials.py,sha256=HbnYk4th5p_jCJI-WzIED8a35JZSLVpecZyTaSIfKXM,1609
-mapFolding/someAssemblyRequired/A007822/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-mapFolding/someAssemblyRequired/A007822/_asynchronousAnnex.py,sha256=eGZrTkNWlMXgzMx86IQJk7-QH7UwYoBHXFfMZ_MYL6E,1727
-mapFolding/someAssemblyRequired/A007822/makeA007822AsynchronousModules.py,sha256=qnLLG-uN6KMKxYCOrNsyDET6aYkT8HLXYuzYrK2vfTo,5621
-mapFolding/someAssemblyRequired/A007822/makeA007822Modules.py,sha256=qDQDd_mT40Di56-Dg1iYoFiMXzbcupkF81T3CUAPboE,5193
-mapFolding/someAssemblyRequired/mapFoldingModules/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-mapFolding/someAssemblyRequired/mapFoldingModules/makeMapFoldingModules.py,sha256=braLUATAOUlsJyaVBQnLCSGDYAbwfS7UOkLd4BFhxbM,16355
-mapFolding/someAssemblyRequired/meanders/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-mapFolding/someAssemblyRequired/meanders/makeMeandersModules.py,sha256=fvIXxxJ6DLfsxgcOMJsht8_JxdbAKfltgQgA3PsYeBM,3444
-mapFolding/syntheticModules/__init__.py,sha256=evVFqhCGa-WZKDiLcnQWjs-Bj34eRnfSLqz_d7dFYZY,83
-mapFolding/syntheticModules/countParallelNumba.py,sha256=_-OoZ07-5oC3WeB603tXUGT9c9-kmsDVtcluMTM8y1U,7784
-mapFolding/syntheticModules/daoOfMapFoldingNumba.py,sha256=OYaMwdyFzlll0OYlUwxQSvyLHgI4QzkDGkCPen1TFJ4,5946
-mapFolding/syntheticModules/initializeState.py,sha256=54kXfjv6Fqv-yQij13736ixDcVzdMIakwlBqd_kN8mw,3122
-mapFolding/syntheticModules/theorem2.py,sha256=QabuLPZ1q0_fK0lkNs1b2QqBbokUkUYGazoK-UF4ssM,3263
-mapFolding/syntheticModules/theorem2Numba.py,sha256=WtEXVExU_ipBwSgztZCPjDayzmL4xd1AecIGenqX1o0,5656
-mapFolding/syntheticModules/theorem2Trimmed.py,sha256=6vOlPYom9XsMyjyu8vIe9pvWbTlfpyow60x3iBvx8Ek,2931
-mapFolding/syntheticModules/A007822/__init__.py,sha256=evVFqhCGa-WZKDiLcnQWjs-Bj34eRnfSLqz_d7dFYZY,83
-mapFolding/syntheticModules/A007822/algorithm.py,sha256=rgdABvNKUVtHokn6IwDF_8-FdYsOUNka-rgK-v8PPXU,7020
-mapFolding/syntheticModules/A007822/asynchronous.py,sha256=cHkhBTW4bjXbv1wGijZcjyps9KRNBHBgyq39-ZsvqrY,8523
-mapFolding/syntheticModules/A007822/initializeState.py,sha256=is2AwFWZbTq1rHKRMSJN5pzAlMWu2dLgjw8o9nZwbvk,4059
-mapFolding/syntheticModules/A007822/theorem2.py,sha256=hciTpia3zUZJfl0EqNvn7Sz3PGxPLNczST7fXWzz-JU,4216
-mapFolding/syntheticModules/A007822/theorem2Numba.py,sha256=XyhYEVIl0Dyeu7sgtBDGMTOSZurQJyep1TlHYYdt3Hw,6932
-mapFolding/syntheticModules/A007822/theorem2Trimmed.py,sha256=kZgAK2qka_xoC7H9UiLef0mrG31WRK4Hte2Nf4HiCuI,3884
-mapFolding/syntheticModules/meanders/__init__.py,sha256=evVFqhCGa-WZKDiLcnQWjs-Bj34eRnfSLqz_d7dFYZY,83
-mapFolding/syntheticModules/meanders/bigInt.py,sha256=He9Ty9XPQFyt33Ye-LQA2WbaQFRkGpG7SDL9m7IlTA0,4213
-mapFolding/tests/__init__.py,sha256=QVCHSMFVvTxV3mAyYOLkMFAFyBJ514zdoVnDmpBJnTo,1336
-mapFolding/tests/conftest.py,sha256=5vV_Vy5ZrV3uoP9bQ8B-Kqc0zMrL7KAhsPJwchMDb6w,15700
-mapFolding/tests/test_computations.py,sha256=fnufZVKMXij4MMf_QdW1vkk1RVI-YYr0luRfIt5usMY,9419
-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.17.0.dist-info/licenses/LICENSE,sha256=NxH5Y8BdC-gNU-WSMwim3uMbID2iNDXJz7fHtuTdXhk,19346
-mapfolding-0.17.0.dist-info/METADATA,sha256=u8MLZMKsZA4wagvD749W_dpC3y89ghNnc7bt2kAhU_s,7737
-mapfolding-0.17.0.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
-mapfolding-0.17.0.dist-info/entry_points.txt,sha256=-mH9DjW9tDRMPaeoSWKKywG35cR28m12H_jtmrB4eY8,98
-mapfolding-0.17.0.dist-info/top_level.txt,sha256=jNj7ccwEy_9uqs0hsQCO_rPXgaGn8-IMqXePQN6nZTY,19
-mapfolding-0.17.0.dist-info/RECORD,,