mapFolding 0.4.1__py3-none-any.whl → 0.4.2__py3-none-any.whl

mapFolding/beDRY.py

@@ -2,6 +2,7 @@
 from mapFolding import (
 	computationState,
 	getPathJobRootDEFAULT,
+	hackSSOTdatatype,
 	hackSSOTdtype,
 	indexMy,
 	indexTrack,
@@ -9,9 +10,9 @@ from mapFolding import (
 	setDatatypeFoldsTotal,
 	setDatatypeLeavesTotal,
 )
-from numpy import integer
+from numpy import dtype, integer, ndarray
 from numpy.typing import DTypeLike, NDArray
-from typing import Any, List, Optional, Sequence, Tuple, Type, Union
+from typing import Any, List, Optional, Sequence, Tuple, Union
 from Z0Z_tools import defineConcurrencyLimit, intInnit, oopsieKwargsie
 import numba
 import numpy
@@ -19,7 +20,7 @@ import os
 import pathlib
 import sys
 
-def getFilenameFoldsTotal(mapShape: Union[Sequence[int], numpy.ndarray[Tuple[int], numpy.dtype[integer[Any]]]]) -> str:
+def getFilenameFoldsTotal(mapShape: Union[Sequence[int], ndarray[Tuple[int], dtype[integer[Any]]]]) -> str:
 	"""Make a standardized filename for the computed value `foldsTotal`.
 
 	The filename takes into account
@@ -67,30 +68,29 @@ def getLeavesTotal(listDimensions: Sequence[int]) -> int:
 
 		return productDimensions
 
-def getPathFilenameFoldsTotal(mapShape: Union[Sequence[int], numpy.ndarray[Tuple[int], numpy.dtype[integer[Any]]]], pathLikeWriteFoldsTotal: Optional[Union[str, os.PathLike[str]]] = None) -> pathlib.Path:
-	"""Get path for folds total file.
+def getPathFilenameFoldsTotal(mapShape: Union[Sequence[int], ndarray[Tuple[int], dtype[integer[Any]]]], pathLikeWriteFoldsTotal: Optional[Union[str, os.PathLike[str]]] = None) -> pathlib.Path:
+	"""Get a standardized path and filename for the computed value `foldsTotal`.
 
-	This function determines the file path for storing fold totals. If a path is provided,
-	it will use that path. If the path is a directory, it will append a default filename.
-	The function ensures the parent directory exists by creating it if necessary.
+	If you provide a directory, the function will append a standardized filename. If you provide a filename
+	or a relative path and filename, the function will prepend the default path.
 
 	Parameters:
-		mapShape (Sequence[int]): List of dimensions for the map folding problem.
-		pathLikeWriteFoldsTotal (Union[str, os.PathLike[str]], optional): Path where to save
-			the folds total. Can be a file path or directory path. If None, uses default path.
+		mapShape: List of dimensions for the map folding problem.
+		pathLikeWriteFoldsTotal (pathJobRootDEFAULT): Path, filename, or relative path and filename. If None, uses default path.
 			Defaults to None.
 
 	Returns:
-		pathlib.Path: Complete path to the folds total file.
+		pathFilenameFoldsTotal: Absolute path and filename.
 	"""
-	pathFilenameFoldsTotal = pathlib.Path(pathLikeWriteFoldsTotal) if pathLikeWriteFoldsTotal is not None else getPathJobRootDEFAULT()
-	if pathFilenameFoldsTotal.is_dir():
-		filenameFoldsTotalDEFAULT = getFilenameFoldsTotal(mapShape)
-		pathFilenameFoldsTotal = pathFilenameFoldsTotal / filenameFoldsTotalDEFAULT
-	elif pathlib.Path(pathLikeWriteFoldsTotal).is_absolute(): # type: ignore
-		pathFilenameFoldsTotal = pathlib.Path(pathLikeWriteFoldsTotal) # type: ignore
+	pathLikeSherpa = pathlib.Path(pathLikeWriteFoldsTotal) if pathLikeWriteFoldsTotal is not None else None
+	if not pathLikeSherpa:
+		pathLikeSherpa = getPathJobRootDEFAULT()
+	if pathLikeSherpa.is_dir():
+		pathFilenameFoldsTotal = pathLikeSherpa / getFilenameFoldsTotal(mapShape)
+	elif pathLikeSherpa.is_absolute():
+		pathFilenameFoldsTotal = pathLikeSherpa
 	else:
-		pathFilenameFoldsTotal = pathlib.Path(getPathJobRootDEFAULT(), pathLikeWriteFoldsTotal) # type: ignore
+		pathFilenameFoldsTotal = getPathJobRootDEFAULT() / pathLikeSherpa
 
 	pathFilenameFoldsTotal.parent.mkdir(parents=True, exist_ok=True)
 	return pathFilenameFoldsTotal
@@ -107,23 +107,23 @@ def getTaskDivisions(computationDivisions: Optional[Union[int, str]], concurrenc
 		- int: direct set the number of task divisions; cannot exceed the map's total leaves
 		- "maximum": divides into `leavesTotal`-many `taskDivisions`
 		- "cpu": limits the divisions to the number of available CPUs, i.e. `concurrencyLimit`
-	concurrencyLimit:
-		Maximum number of concurrent tasks allowed
-	CPUlimit: for error reporting
-	listDimensions: for error reporting
+		concurrencyLimit:
+			Maximum number of concurrent tasks allowed
+		CPUlimit: for error reporting
+		listDimensions: for error reporting
 
 	Returns
 	-------
-	taskDivisions:
+		taskDivisions:
 
 	Raises
 	------
-	ValueError
-		If computationDivisions is an unsupported type or if resulting task divisions exceed total leaves
+		ValueError
+			If computationDivisions is an unsupported type or if resulting task divisions exceed total leaves
 
 	Notes
 	-----
-	Task divisions cannot exceed total leaves to prevent duplicate counting of folds.
+	Task divisions should not exceed total leaves to prevent duplicate counting of folds.
 	"""
 	taskDivisions = 0
 	leavesTotal = getLeavesTotal(listDimensions)
@@ -145,7 +145,7 @@ def getTaskDivisions(computationDivisions: Optional[Union[int, str]], concurrenc
 
 	return taskDivisions
 
-def makeConnectionGraph(listDimensions: Sequence[int], **keywordArguments: Optional[Type]) -> numpy.ndarray[Tuple[int, int, int], numpy.dtype[integer[Any]]]:
+def makeConnectionGraph(listDimensions: Sequence[int], **keywordArguments: Optional[str]) -> ndarray[Tuple[int, int, int], dtype[integer[Any]]]:
 	"""
 	Constructs a multi-dimensional connection graph representing the connections between the leaves of a map with the given dimensions.
 	Also called a Cartesian product decomposition or dimensional product mapping.
@@ -157,21 +157,22 @@ def makeConnectionGraph(listDimensions: Sequence[int], **keywordArguments: Optio
 	Returns
 		connectionGraph: A 3D numpy array with shape of (dimensionsTotal, leavesTotal + 1, leavesTotal + 1).
 	"""
-	if keywordArguments.get('datatype', None):
-		setDatatypeLeavesTotal(keywordArguments['datatype']) # type: ignore
-	datatype = hackSSOTdtype('connectionGraph')
+	ImaSetTheDatatype = keywordArguments.get('datatype', None)
+	if ImaSetTheDatatype:
+		setDatatypeLeavesTotal(ImaSetTheDatatype)
+	dtype = hackSSOTdtype('connectionGraph')
 	mapShape = validateListDimensions(listDimensions)
 	leavesTotal = getLeavesTotal(mapShape)
-	arrayDimensions = numpy.array(mapShape, dtype=datatype)
+	arrayDimensions = numpy.array(mapShape, dtype=dtype)
 	dimensionsTotal = len(arrayDimensions)
 
-	cumulativeProduct = numpy.multiply.accumulate([1] + mapShape, dtype=datatype)
-	coordinateSystem = numpy.zeros((dimensionsTotal, leavesTotal + 1), dtype=datatype)
+	cumulativeProduct = numpy.multiply.accumulate([1] + mapShape, dtype=dtype)
+	coordinateSystem = numpy.zeros((dimensionsTotal, leavesTotal + 1), dtype=dtype)
 	for indexDimension in range(dimensionsTotal):
 		for leaf1ndex in range(1, leavesTotal + 1):
 			coordinateSystem[indexDimension, leaf1ndex] = ( ((leaf1ndex - 1) // cumulativeProduct[indexDimension]) % arrayDimensions[indexDimension] + 1 )
 
-	connectionGraph = numpy.zeros((dimensionsTotal, leavesTotal + 1, leavesTotal + 1), dtype=datatype)
+	connectionGraph = numpy.zeros((dimensionsTotal, leavesTotal + 1, leavesTotal + 1), dtype=dtype)
 	for indexDimension in range(dimensionsTotal):
 		for activeLeaf1ndex in range(1, leavesTotal + 1):
 			for connectee1ndex in range(1, activeLeaf1ndex + 1):
@@ -190,70 +191,54 @@ def makeConnectionGraph(listDimensions: Sequence[int], **keywordArguments: Optio
 	return connectionGraph
 
 def makeDataContainer(shape: Union[int, Tuple[int, ...]], datatype: Optional[DTypeLike] = None) -> NDArray[integer[Any]]:
-	"""Create a zeroed-out `numpy.ndarray` with the given shape and datatype.
+	"""Create a zeroed-out `ndarray` with the given shape and datatype.
 
 	Parameters:
-		shape (Union[int, Tuple[int, ...]]): The shape of the array. Can be an integer for 1D arrays
+		shape: The shape of the array. Can be an integer for 1D arrays
 			or a tuple of integers for multi-dimensional arrays.
-		datatype (Optional[DTypeLike], optional): The desired data type for the array.
+		datatype: The desired data type for the array.
 			If None, defaults to dtypeLargeDEFAULT. Defaults to None.
 
 	Returns:
-		numpy.ndarray: A new array of given shape and type, filled with zeros.
+		dataContainer: A new array of given shape and type, filled with zeros.
 	"""
 	if datatype is None:
 		datatype = hackSSOTdtype('dtypeFoldsTotal')
 	return numpy.zeros(shape, dtype=datatype)
 
-def outfitCountFolds(listDimensions: Sequence[int]
-						, computationDivisions: Optional[Union[int, str]] = None
-						, CPUlimit: Optional[Union[bool, float, int]] = None
-						, **keywordArguments: Optional[Union[str, bool]]) -> computationState:
+def outfitCountFolds(listDimensions: Sequence[int], computationDivisions: Optional[Union[int, str]] = None, CPUlimit: Optional[Union[bool, float, int]] = None, **keywordArguments: Optional[Union[str, bool]]) -> computationState:
 	"""
 	Initializes and configures the computation state for map folding computations.
 
-	Parameters
-	----------
-	listDimensions:
-		The dimensions of the map to be folded
-	computationDivisions (None):
-		Specifies how to divide computations:
-		- None: no division of the computation into tasks; sets task divisions to 0
-		- int: direct set the number of task divisions; cannot exceed the map's total leaves
-		- "maximum": divides into `leavesTotal`-many `taskDivisions`
-		- "cpu": limits the divisions to the number of available CPUs, i.e. `concurrencyLimit`
-	CPUlimit (None):
-		Whether and how to limit the CPU usage. See notes for details.
-	**keywordArguments:
-		Datatype management.
-
-	Returns
-	-------
-	computationState
-		An initialized computation state containing:
-		- connectionGraph: Graph representing connections in the map
-		- foldsSubTotals: Array tracking total folds
-		- mapShape: Validated and sorted dimensions of the map
-		- my: Array for internal state tracking
-		- gapsWhere: Array tracking gap positions
-		- the: Static settings and metadata
-		- track: Array for tracking computation progress
+	Parameters:
+		listDimensions: The dimensions of the map to be folded
+		computationDivisions (None): see `getTaskDivisions`
+		CPUlimit (None): see `setCPUlimit`
+		**keywordArguments: Datatype management.
 
-	Limits on CPU usage `CPUlimit`:
-		- `False`, `None`, or `0`: No limits on CPU usage; uses all available CPUs. All other values will potentially limit CPU usage.
-		- `True`: Yes, limit the CPU usage; limits to 1 CPU.
-		- Integer `>= 1`: Limits usage to the specified number of CPUs.
-		- Decimal value (`float`) between 0 and 1: Fraction of total CPUs to use.
-		- Decimal value (`float`) between -1 and 0: Fraction of CPUs to *not* use.
-		- Integer `<= -1`: Subtract the absolute value from total CPUs.
+	Returns:
+		stateInitialized: The initialized computation state
 	"""
-	kwourGrapes = keywordArguments.get('sourGrapes', False)
-	kwatatype = keywordArguments.get('datatypeElephino', None)
-	if kwatatype: setDatatypeElephino(kwatatype, sourGrapes=kwourGrapes) # type: ignore
-	kwatatype = keywordArguments.get('datatypeFoldsTotal', None)
-	if kwatatype: setDatatypeFoldsTotal(kwatatype, sourGrapes=kwourGrapes) # type: ignore
-	kwatatype = keywordArguments.get('datatypeLeavesTotal', None)
-	if kwatatype: setDatatypeLeavesTotal(kwatatype, sourGrapes=kwourGrapes) # type: ignore
+	kwourGrapes = keywordArguments.get('sourGrapes', None)
+	if kwourGrapes:
+		sourGrapes = True
+	else:
+		sourGrapes = False
+
+	ImaSetTheDatatype = keywordArguments.get('datatypeElephino', None)
+	if ImaSetTheDatatype:
+		ImaSetTheDatatype = str(ImaSetTheDatatype)
+		setDatatypeElephino(ImaSetTheDatatype, sourGrapes)
+
+	ImaSetTheDatatype = keywordArguments.get('datatypeFoldsTotal', None)
+	if ImaSetTheDatatype:
+		ImaSetTheDatatype = str(ImaSetTheDatatype)
+		setDatatypeFoldsTotal(ImaSetTheDatatype, sourGrapes)
+
+	ImaSetTheDatatype = keywordArguments.get('datatypeLeavesTotal', None)
+	if ImaSetTheDatatype:
+		ImaSetTheDatatype = str(ImaSetTheDatatype)
+		setDatatypeLeavesTotal(ImaSetTheDatatype, sourGrapes)
 
 	my = makeDataContainer(len(indexMy), hackSSOTdtype('my'))
 
@@ -268,7 +253,7 @@ def outfitCountFolds(listDimensions: Sequence[int]
 	my[indexMy.dimensionsTotal] = len(mapShape)
 	my[indexMy.leaf1ndex] = 1
 	stateInitialized = computationState(
-		connectionGraph = makeConnectionGraph(mapShape, datatype=hackSSOTdtype('connectionGraph')),
+		connectionGraph = makeConnectionGraph(mapShape, datatype=hackSSOTdatatype('connectionGraph')),
 		foldGroups = foldGroups,
 		mapShape = numpy.array(mapShape, dtype=hackSSOTdtype('mapShape')),
 		my = my,

mapFolding/someAssemblyRequired/synthesizeNumba.py

@@ -252,6 +252,7 @@ def makeAstModuleForOneCallable(pythonSource: str, callableTarget: str, paramete
 	if inlineCallables:
 		dictionaryFunctionDef = {statement.name: statement for statement in astModule.body if isinstance(statement, ast.FunctionDef)}
 		callableInlinerWorkhorse = RecursiveInliner(dictionaryFunctionDef)
+		# NOTE the inliner assumes each function is not called more than once
 		FunctionDefTarget = callableInlinerWorkhorse.inlineFunctionBody(callableTarget)
 	else:
 		FunctionDefTarget = next((node for node in astModule.body if isinstance(node, ast.FunctionDef) and node.name == callableTarget), None)

mapFolding/syntheticModules/numba_countInitialize.py

@@ -2,9 +2,9 @@ from mapFolding import indexMy
 from mapFolding import indexTrack
 from numba import jit
 from numba import uint8
+from numpy import dtype
 from numpy import ndarray
 from numpy import integer
-from numpy import dtype
 from typing import Tuple
 from typing import Any
 

mapFolding/syntheticModules/numba_countParallel.py

@@ -1,12 +1,12 @@
 from mapFolding import indexMy
 from mapFolding import indexTrack
+from numba import prange
+from numba import int64
 from numba import jit
 from numba import uint8
-from numba import int64
-from numba import prange
+from numpy import dtype
 from numpy import ndarray
 from numpy import integer
-from numpy import dtype
 from typing import Tuple
 from typing import Any
 

mapFolding/syntheticModules/numba_countSequential.py

@@ -1,11 +1,11 @@
 from mapFolding import indexMy
 from mapFolding import indexTrack
+from numba import int64
 from numba import jit
 from numba import uint8
-from numba import int64
+from numpy import dtype
 from numpy import ndarray
 from numpy import integer
-from numpy import dtype
 from typing import Tuple
 from typing import Any
 
@@ -34,10 +34,10 @@ def countSequential(connectionGraph: ndarray[Tuple[int, int, int], dtype[integer
                 gap1ndexCeiling = gapRangeStart[leaf1ndex - 1]
                 indexDimension = 0
                 while indexDimension < dimensionsTotal:
-                    if connectionGraph[indexDimension, leaf1ndex, leaf1ndex] == leaf1ndex:
+                    leafConnectee = connectionGraph[indexDimension, leaf1ndex, leaf1ndex]
+                    if leafConnectee == leaf1ndex:
                         dimensionsUnconstrained -= 1
                     else:
-                        leafConnectee = connectionGraph[indexDimension, leaf1ndex, leaf1ndex]
                         while leafConnectee != leaf1ndex:
                             gapsWhere[gap1ndexCeiling] = leafConnectee
                             if countDimensionsGapped[leafConnectee] == 0:

mapFolding/syntheticModules/numba_doTheNeedful.py

@@ -2,12 +2,12 @@ from mapFolding.syntheticModules.numba_countInitialize import countInitialize
 from mapFolding.syntheticModules.numba_countParallel import countParallel
 from mapFolding.syntheticModules.numba_countSequential import countSequential
 from mapFolding import indexMy
+from numba import int64
 from numba import jit
 from numba import uint8
-from numba import int64
+from numpy import dtype
 from numpy import ndarray
 from numpy import integer
-from numpy import dtype
 from typing import Tuple
 from typing import Any
 

mapFolding/theDao.py

@@ -78,6 +78,9 @@ def leafConnecteeInitialization(connectionGraph: ndarray[Tuple[int, int, int], d
 def leafConnecteeUpdate(connectionGraph: ndarray[Tuple[int, int, int], dtype[integer[Any]]], my: ndarray[Tuple[int], dtype[integer[Any]]], track: ndarray[Tuple[int, int], dtype[integer[Any]]]) -> None:
 	my[indexMy.leafConnectee.value] = connectionGraph[my[indexMy.indexDimension.value], my[indexMy.leaf1ndex.value], track[indexTrack.leafBelow.value, my[indexMy.leafConnectee.value]]]
 
+def activeLeafConnectedToItself(my: ndarray[Tuple[int], dtype[integer[Any]]]) -> Any:
+	return my[indexMy.leafConnectee.value] == my[indexMy.leaf1ndex.value]
+
 def loopingLeavesConnectedToActiveLeaf(my: ndarray[Tuple[int], dtype[integer[Any]]]) -> Any:
 	return my[indexMy.leafConnectee.value] != my[indexMy.leaf1ndex.value]
 
@@ -195,10 +198,10 @@ def countSequential( connectionGraph: ndarray[Tuple[int, int, int], dtype[intege
 			else:
 				findGapsInitializeVariables(my=my, track=track)
 				while loopUpToDimensionsTotal(my=my):
-					if dimensionsUnconstrainedCondition(connectionGraph=connectionGraph, my=my):
+					leafConnecteeInitialization(connectionGraph=connectionGraph, my=my)
+					if activeLeafConnectedToItself(my=my):
 						dimensionsUnconstrainedDecrement(my=my)
 					else:
-						leafConnecteeInitialization(connectionGraph=connectionGraph, my=my)
 						while loopingLeavesConnectedToActiveLeaf(my=my):
 							countGaps(gapsWhere=gapsWhere, my=my, track=track)
 							leafConnecteeUpdate(connectionGraph=connectionGraph, my=my, track=track)

mapFolding/theSSOTnumba.py

@@ -18,23 +18,16 @@ Old notes that are not entirely accurate.
 
 | **Option**			  | **Description**									 | **Why**			   | **Size**		| **But**				  |
 | ----------------------- | --------------------------------------------------- | --------------------- | --------------- | ------------------------ |
-| `_dbg_extend_lifetimes` | Debug option to extend object lifetimes			 | Debugging			 |				 |						  |
-| `_dbg_optnone`		  | Disable optimization for debugging				  | Debugging			 |				 |						  |
-| `debug`				 | Enable debug mode with additional checks			| Debugging			 |				 |						  |
 | `no_rewrites`		   | Disable AST rewrites optimization				   | Debugging			 |				 |						  |
-| `boundscheck`		   | Enable array bounds checking (slows execution)	  | Error checking		| Larger		  | Slower				   |
 | `error_model`		   | Divide by zero: kill or chill?					  | Error checking		| ?			   |						  |
 | `_nrt`				  | Enable No Runtime type checking					 | Startup speed		 | Smaller		 | No type protection	   |
-| `fastmath`			  | Reduce float potential precision					| Float speed		   | Smaller		 | Discriminatory, untested |
 | `forceinline`		   | Force function inlining							 | Reduce function calls | Likely larger   |						  |
-| `forceobj`			  | Force object mode compilation					   | Inclusiveness		 | Larger		  | Slower execution		 |
 | `inline`				| Algorithmically choose inlining					 | Speed				 | Slightly larger |						  |
 | `looplift`			  | Enable loop lifting optimization					| Speed (if applicable) | Larger		  | Exclusionary			 |
 | `no_cfunc_wrapper`	  | Disable C function wrapper generation			   | Size				  | Smaller		 | Exclusionary			 |
 | `no_cpython_wrapper`	| Disable Python C-API wrapper generation			 | Size				  | Smallest		| Exclusionary			 |
 
 """
-# NOTE Deepseek removed forceinline=True, inline='always'
 # TODO try to implement all possible parameters, but use `NotRequired` for the more esoteric ones
 class ParametersNumba(TypedDict):
 	_dbg_extend_lifetimes: NotRequired[bool]

{mapFolding-0.4.1.dist-info → mapFolding-0.4.2.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.2
 Name: mapFolding
-Version: 0.4.1
+Version: 0.4.2
 Summary: Count distinct ways to fold a map (or a strip of stamps)
 Author-email: Hunter Hogan <HunterHogan@pm.me>
 License: CC-BY-NC-4.0

{mapFolding-0.4.1.dist-info → mapFolding-0.4.2.dist-info}/RECORD

@@ -1,10 +1,10 @@
 mapFolding/__init__.py,sha256=_YjoypHXmWLmEWwhFVgKO83Uf28ksesT9F73oJoAIPE,1323
 mapFolding/basecamp.py,sha256=v0VCF_Zgm_XBHcz4bqblsxfHwAxZKgenW6um77quWLk,3751
-mapFolding/beDRY.py,sha256=XVtLraG9VnC4yG2HkaFwZRh2td4ZHMjTQvnbcD_W130,17133
+mapFolding/beDRY.py,sha256=ejl-eIZTqAHCBNIND0pP_F9BxkPEWIlVXbCTk2Ki8x8,15751
 mapFolding/oeis.py,sha256=3hv71o8bhckjY0nsSY5JTJ2LrpJcuhZ9j3mP6LWLIQc,11124
-mapFolding/theDao.py,sha256=SmyTbP1iwRAnpuq2ngdJKooXUA1_PR0VRHQ4fcJskMY,12713
+mapFolding/theDao.py,sha256=vyln6gXdRp87Xhtuy31bjCpMv_8vL4KH6s1fH40V9oA,12832
 mapFolding/theSSOT.py,sha256=QrEMPREjEbt1H8HcrM2Nm_hv7JsFWRG3lHdUU0Jrv-w,10238
-mapFolding/theSSOTnumba.py,sha256=zGq2zlZZeuxiNSO2Fs_AqV6UhybJAJuDw-2lMVvDS2w,5133
+mapFolding/theSSOTnumba.py,sha256=5jTbJyu9XASYC4eIoUj98eVKWdWyjZw-XF3V2GK8cLg,4445
 mapFolding/reference/flattened.py,sha256=S6D9wiFTlbeoetEqaMLOcA-R22BHOzjqPRujffNxxUM,14875
 mapFolding/reference/hunterNumba.py,sha256=jDS0ORHkIhcJ1rzA5hT49sZHKf3rgJOoGesUCcbKFFY,6054
 mapFolding/reference/irvineJavaPort.py,sha256=7GvBU0tnS6wpFgkYad3465do9jBQW-2bYvbCYyABPHM,3341
@@ -18,25 +18,25 @@ mapFolding/someAssemblyRequired/__init__.py,sha256=wtec_hIz-AKz0_hGdXsWnCKTcCxdM
 mapFolding/someAssemblyRequired/getLLVMforNoReason.py,sha256=nX8tghZClYt7zJd6RpZBXhE_h-CGRHOS17biqiEdf-o,855
 mapFolding/someAssemblyRequired/makeJob.py,sha256=c9sTRUK90snTCcXCvs86VKBH6z_nt3OVFjNs_WgCoIg,2422
 mapFolding/someAssemblyRequired/synthesizeModuleJAX.py,sha256=jatvtYhK5ZJK-YmCKATt7w3icFXXO79cZDAYVrU9bgA,1258
-mapFolding/someAssemblyRequired/synthesizeNumba.py,sha256=mPCjp4N-dOJRC4TvZGkqAqFKDWEPhWH9v0Cq5AWHlBA,17279
+mapFolding/someAssemblyRequired/synthesizeNumba.py,sha256=3JF1FZwSB-dhLUM_pMy11dI4x1dnWOFQSfJytZHYl0M,17351
 mapFolding/someAssemblyRequired/synthesizeNumbaGeneralized.py,sha256=k8IaCT74ZPhHyra0MbCRdt_5k0Ov3vJgXlN5tbLVnf4,13998
 mapFolding/someAssemblyRequired/synthesizeNumbaJob.py,sha256=2sKZgc5kyyz2KaoApcazj_37UgBqAkxORFeROWWU5tk,9038
 mapFolding/someAssemblyRequired/synthesizeNumbaModules.py,sha256=_iRXjMASB_BnYJeH8Rt7FlC-GE7lkZ1Hy292XTaUCu4,3785
 mapFolding/syntheticModules/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-mapFolding/syntheticModules/numba_countInitialize.py,sha256=geHketfekZTgu5gbc8E3SShPmbW3gDybg5PCBpXdsa8,4274
-mapFolding/syntheticModules/numba_countParallel.py,sha256=kOI5PU90AExPvlWwU0BHVVFjlHlmUFp1KdtlmthQ71E,5517
-mapFolding/syntheticModules/numba_countSequential.py,sha256=zFFRv9oLtOih9TpbtARpVAPt-NfZxh0ygXuj-wfPjUg,3732
-mapFolding/syntheticModules/numba_doTheNeedful.py,sha256=6WuXKDMVa_C56dLlmXNvFl04MlU8-WVasqbAaxsgI-o,1368
+mapFolding/syntheticModules/numba_countInitialize.py,sha256=9u-Skda9ntDxo_CiD5T4lUU1-Ts5GDZ33zs_Ybf77-Q,4274
+mapFolding/syntheticModules/numba_countParallel.py,sha256=96-TDwLJgZhR9tFm2bqVDpk8TuWPx_2qFH7oNV78yUI,5517
+mapFolding/syntheticModules/numba_countSequential.py,sha256=WCcPYnkyNpZS7SRMvx1A-IMIAFP5iHL9u9sj9gR8Yhw,3688
+mapFolding/syntheticModules/numba_doTheNeedful.py,sha256=zBXDEN4DJTpCu_ho314-MWdS_08kP_vAgV-8sJDVgvo,1368
 tests/__init__.py,sha256=eg9smg-6VblOr0kisM40CpGnuDtU2JgEEWGDTFVOlW8,57
-tests/conftest.py,sha256=7Ims3QcOzqBXu_k0kX9bt6PieC-OoIpc7OGxzdT2ELc,11826
+tests/conftest.py,sha256=vH1BSOs8G6nIPWKFkSQFmX031IZqNFC4oiEia74mkHU,10554
 tests/test_computations.py,sha256=qBha4IggMfr6ZH06W3M66enTA6PWsx8vkDp5eqYFM9M,4765
 tests/test_oeis.py,sha256=31kdO1vnu2Lon43vM-YJVS4g40Ic03DWNER-cJcpxX4,4916
 tests/test_other.py,sha256=u0vINT5EyVsXTNTR2DZIMpWCg4FH471jjHLRzC2JX7U,8351
 tests/test_tasks.py,sha256=iq6_dh43JQkC2vAWXua0Xe915BKFGbvRJAkmbco854A,2389
 tests/test_types.py,sha256=58tmPG9WOeGGAQbdQK_h_7t4SnENnZugH4WXlI8-L-M,171
-mapFolding-0.4.1.dist-info/LICENSE,sha256=NxH5Y8BdC-gNU-WSMwim3uMbID2iNDXJz7fHtuTdXhk,19346
-mapFolding-0.4.1.dist-info/METADATA,sha256=iJiWfEzXVheLtyLLWT2BNis5xsisnhllS17hnPwiRws,7633
-mapFolding-0.4.1.dist-info/WHEEL,sha256=In9FTNxeP60KnTkGw7wk6mJPYd_dQSjEZmXdBdMCI-8,91
-mapFolding-0.4.1.dist-info/entry_points.txt,sha256=F3OUeZR1XDTpoH7k3wXuRb3KF_kXTTeYhu5AGK1SiOQ,146
-mapFolding-0.4.1.dist-info/top_level.txt,sha256=1gP2vFaqPwHujGwb3UjtMlLEGN-943VSYFR7V4gDqW8,17
-mapFolding-0.4.1.dist-info/RECORD,,
+mapFolding-0.4.2.dist-info/LICENSE,sha256=NxH5Y8BdC-gNU-WSMwim3uMbID2iNDXJz7fHtuTdXhk,19346
+mapFolding-0.4.2.dist-info/METADATA,sha256=EPivaT4-_Ygz9_DobQKBIigNnDkWtUq7vm6hJtYiDeQ,7633
+mapFolding-0.4.2.dist-info/WHEEL,sha256=In9FTNxeP60KnTkGw7wk6mJPYd_dQSjEZmXdBdMCI-8,91
+mapFolding-0.4.2.dist-info/entry_points.txt,sha256=F3OUeZR1XDTpoH7k3wXuRb3KF_kXTTeYhu5AGK1SiOQ,146
+mapFolding-0.4.2.dist-info/top_level.txt,sha256=1gP2vFaqPwHujGwb3UjtMlLEGN-943VSYFR7V4gDqW8,17
+mapFolding-0.4.2.dist-info/RECORD,,

tests/conftest.py

@@ -101,36 +101,6 @@ def makeDictionaryFoldsTotalKnown() -> Dict[Tuple[int,...], int]:
 			dimensions = settings['getMapShape'](n)
 			dimensions.sort()
 			dictionaryMapDimensionsToFoldsTotalKnown[tuple(dimensions)] = foldingsTotal
-
-	# Are we in a place that has jobs?
-	pathJobDEFAULT = getPathJobRootDEFAULT()
-	if pathJobDEFAULT.exists():
-		# Are there foldsTotal files?
-		for pathFilenameFoldsTotal in pathJobDEFAULT.rglob('*.foldsTotal'):
-			if pathFilenameFoldsTotal.is_file():
-				try:
-					listDimensions = eval(pathFilenameFoldsTotal.stem)
-				except Exception:
-					continue
-				# Are the dimensions in the dictionary?
-				if isinstance(listDimensions, list) and all(isinstance(dimension, int) for dimension in listDimensions):
-					listDimensions.sort()
-					if tuple(listDimensions) in dictionaryMapDimensionsToFoldsTotalKnown:
-						continue
-					# Are the contents a reasonably large integer?
-					try:
-						foldsTotal = pathFilenameFoldsTotal.read_text()
-					except Exception:
-						continue
-					# Why did I sincerely believe this would only be three lines of code?
-					if foldsTotal.isdigit():
-						foldsTotalInteger = int(foldsTotal)
-						if foldsTotalInteger > 85109616 * 10**3:
-							# You made it this far, so fuck it: put it in the dictionary
-							dictionaryMapDimensionsToFoldsTotalKnown[tuple(listDimensions)] = foldsTotalInteger
-						dictionaryMapDimensionsToFoldsTotalKnown[tuple(listDimensions)] = foldsTotalInteger
-					# The sunk-costs fallacy claims another victim!
-
 	return dictionaryMapDimensionsToFoldsTotalKnown
 
 """