mapFolding 0.5.0__py3-none-any.whl → 0.5.1__py3-none-any.whl

mapFolding/reference/flattened.py

@@ -1,377 +0,0 @@
-"""The algorithm flattened into semantic sections.
-This version is not maintained, so you may see differences from the current version."""
-from numpy import integer
-from numpy.typing import NDArray
-from typing import List, Any, Final, Optional, Union, Sequence, Tuple, Type, TypedDict
-import enum
-import numpy
-import sys
-
-def countFolds(listDimensions: Sequence[int], computationDivisions = None, CPUlimit: Optional[Union[int, float, bool]] = None):
-	def doWhile():
-
-		while activeLeafGreaterThan0Condition():
-
-			if activeLeafIsTheFirstLeafCondition() or leafBelowSentinelIs1Condition():
-
-				if activeLeafGreaterThanLeavesTotalCondition():
-					foldsSubTotalsIncrement()
-
-				else:
-
-					findGapsInitializeVariables()
-					while loopingTheDimensions():
-
-						if dimensionsUnconstrainedCondition():
-							dimensionsUnconstrainedIncrement()
-
-						else:
-
-							leafConnecteeInitialization()
-							while loopingLeavesConnectedToActiveLeaf():
-								if thereAreComputationDivisionsYouMightSkip():
-									countGaps()
-								leafConnecteeUpdate()
-
-						dimension1ndexIncrement()
-
-					if allDimensionsAreUnconstrained():
-						insertUnconstrainedLeaf()
-
-					indexMiniGapInitialization()
-					while loopingToActiveGapCeiling():
-						filterCommonGaps()
-						indexMiniGapIncrement()
-
-			while backtrackCondition():
-				backtrack()
-
-			if placeLeafCondition():
-				placeLeaf()
-
-	def activeGapIncrement():
-		my[indexMy.gap1ndex] += 1
-
-	def activeLeafGreaterThan0Condition():
-		return my[indexMy.leaf1ndex] > 0
-
-	def activeLeafGreaterThanLeavesTotalCondition():
-		return my[indexMy.leaf1ndex] > the[indexThe.leavesTotal]
-
-	def activeLeafIsTheFirstLeafCondition():
-		return my[indexMy.leaf1ndex] <= 1
-
-	def activeLeafNotEqualToTaskDivisionsCondition():
-		return my[indexMy.leaf1ndex] != the[indexThe.taskDivisions]
-
-	def allDimensionsAreUnconstrained():
-		return my[indexMy.dimensionsUnconstrained] == the[indexThe.dimensionsTotal]
-
-	def backtrack():
-		my[indexMy.leaf1ndex] -= 1
-		track[indexTrack.leafBelow, track[indexTrack.leafAbove, my[indexMy.leaf1ndex]]] = track[indexTrack.leafBelow, my[indexMy.leaf1ndex]]
-		track[indexTrack.leafAbove, track[indexTrack.leafBelow, my[indexMy.leaf1ndex]]] = track[indexTrack.leafAbove, my[indexMy.leaf1ndex]]
-
-	def backtrackCondition():
-		return my[indexMy.leaf1ndex] > 0 and my[indexMy.gap1ndex] == track[indexTrack.gapRangeStart, my[indexMy.leaf1ndex] - 1]
-
-	def computationDivisionsCondition():
-		return the[indexThe.taskDivisions] == int(False)
-
-	def countGaps():
-		gapsWhere[my[indexMy.gap1ndexCeiling]] = my[indexMy.leafConnectee]
-		if track[indexTrack.countDimensionsGapped, my[indexMy.leafConnectee]] == 0:
-			gap1ndexCeilingIncrement()
-		track[indexTrack.countDimensionsGapped, my[indexMy.leafConnectee]] += 1
-
-	def dimension1ndexIncrement():
-		my[indexMy.dimension1ndex] += 1
-
-	def dimensionsUnconstrainedCondition():
-		return connectionGraph[my[indexMy.dimension1ndex], my[indexMy.leaf1ndex], my[indexMy.leaf1ndex]] == my[indexMy.leaf1ndex]
-
-	def dimensionsUnconstrainedIncrement():
-		my[indexMy.dimensionsUnconstrained] += 1
-
-	def filterCommonGaps():
-		gapsWhere[my[indexMy.gap1ndex]] = gapsWhere[my[indexMy.indexMiniGap]]
-		if track[indexTrack.countDimensionsGapped, gapsWhere[my[indexMy.indexMiniGap]]] == the[indexThe.dimensionsTotal] - my[indexMy.dimensionsUnconstrained]:
-			activeGapIncrement()
-		track[indexTrack.countDimensionsGapped, gapsWhere[my[indexMy.indexMiniGap]]] = 0
-
-	def findGapsInitializeVariables():
-		my[indexMy.dimensionsUnconstrained] = 0
-		my[indexMy.gap1ndexCeiling] = track[indexTrack.gapRangeStart, my[indexMy.leaf1ndex] - 1]
-		my[indexMy.dimension1ndex] = 1
-
-	def foldsSubTotalsIncrement():
-		foldsSubTotals[my[indexMy.taskIndex]] += the[indexThe.leavesTotal]
-
-	def gap1ndexCeilingIncrement():
-		my[indexMy.gap1ndexCeiling] += 1
-
-	def indexMiniGapIncrement():
-		my[indexMy.indexMiniGap] += 1
-
-	def indexMiniGapInitialization():
-		my[indexMy.indexMiniGap] = my[indexMy.gap1ndex]
-
-	def insertUnconstrainedLeaf():
-		my[indexMy.indexLeaf] = 0
-		while my[indexMy.indexLeaf] < my[indexMy.leaf1ndex]:
-			gapsWhere[my[indexMy.gap1ndexCeiling]] = my[indexMy.indexLeaf]
-			my[indexMy.gap1ndexCeiling] += 1
-			my[indexMy.indexLeaf] += 1
-
-	def leafBelowSentinelIs1Condition():
-		return track[indexTrack.leafBelow, 0] == 1
-
-	def leafConnecteeInitialization():
-		my[indexMy.leafConnectee] = connectionGraph[my[indexMy.dimension1ndex], my[indexMy.leaf1ndex], my[indexMy.leaf1ndex]]
-
-	def leafConnecteeUpdate():
-		my[indexMy.leafConnectee] = connectionGraph[my[indexMy.dimension1ndex], my[indexMy.leaf1ndex], track[indexTrack.leafBelow, my[indexMy.leafConnectee]]]
-
-	def loopingLeavesConnectedToActiveLeaf():
-		return my[indexMy.leafConnectee] != my[indexMy.leaf1ndex]
-
-	def loopingTheDimensions():
-		return my[indexMy.dimension1ndex] <= the[indexThe.dimensionsTotal]
-
-	def loopingToActiveGapCeiling():
-		return my[indexMy.indexMiniGap] < my[indexMy.gap1ndexCeiling]
-
-	def placeLeaf():
-		my[indexMy.gap1ndex] -= 1
-		track[indexTrack.leafAbove, my[indexMy.leaf1ndex]] = gapsWhere[my[indexMy.gap1ndex]]
-		track[indexTrack.leafBelow, my[indexMy.leaf1ndex]] = track[indexTrack.leafBelow, track[indexTrack.leafAbove, my[indexMy.leaf1ndex]]]
-		track[indexTrack.leafBelow, track[indexTrack.leafAbove, my[indexMy.leaf1ndex]]] = my[indexMy.leaf1ndex]
-		track[indexTrack.leafAbove, track[indexTrack.leafBelow, my[indexMy.leaf1ndex]]] = my[indexMy.leaf1ndex]
-		track[indexTrack.gapRangeStart, my[indexMy.leaf1ndex]] = my[indexMy.gap1ndex]
-		my[indexMy.leaf1ndex] += 1
-
-	def placeLeafCondition():
-		return my[indexMy.leaf1ndex] > 0
-
-	def taskIndexCondition():
-		return my[indexMy.leafConnectee] % the[indexThe.taskDivisions] == my[indexMy.taskIndex]
-
-	def thereAreComputationDivisionsYouMightSkip():
-		if computationDivisionsCondition():
-			return True
-		if activeLeafNotEqualToTaskDivisionsCondition():
-			return True
-		if taskIndexCondition():
-			return True
-		return False
-
-	stateUniversal = outfitFoldings(listDimensions, computationDivisions=computationDivisions, CPUlimit=CPUlimit)
-	connectionGraph: Final[numpy.ndarray] = stateUniversal['connectionGraph']
-	foldsSubTotals = stateUniversal['foldsSubTotals']
-	gapsWhere = stateUniversal['gapsWhere']
-	my = stateUniversal['my']
-	the: Final[numpy.ndarray] = stateUniversal['the']
-	track = stateUniversal['track']
-
-	if the[indexThe.taskDivisions] == int(False):
-		doWhile()
-	else:
-		stateUniversal['my'] = my.copy()
-		stateUniversal['gapsWhere'] = gapsWhere.copy()
-		stateUniversal['track'] = track.copy()
-		for indexSherpa in range(the[indexThe.taskDivisions]):
-			my = stateUniversal['my'].copy()
-			my[indexMy.taskIndex] = indexSherpa
-			gapsWhere = stateUniversal['gapsWhere'].copy()
-			track = stateUniversal['track'].copy()
-			doWhile()
-
-	return numpy.sum(foldsSubTotals).item()
-
-@enum.verify(enum.CONTINUOUS, enum.UNIQUE) if sys.version_info >= (3, 11) else lambda x: x
-class EnumIndices(enum.IntEnum):
-	"""Base class for index enums."""
-	@staticmethod
-	def _generate_next_value_(name, start, count, last_values):
-		"""0-indexed."""
-		return count
-
-	def __index__(self) -> int:
-		"""Adapt enum to the ultra-rare event of indexing a NumPy 'ndarray', which is not the
-		same as `array.array`. See NumPy.org; I think it will be very popular someday."""
-		return self
-
-class indexMy(EnumIndices):
-	"""Indices for dynamic values."""
-	dimension1ndex = enum.auto()
-	dimensionsUnconstrained = enum.auto()
-	gap1ndex = enum.auto()
-	gap1ndexCeiling = enum.auto()
-	indexLeaf = enum.auto()
-	indexMiniGap = enum.auto()
-	leaf1ndex = enum.auto()
-	leafConnectee = enum.auto()
-	taskIndex = enum.auto()
-
-class indexThe(EnumIndices):
-	"""Indices for static values."""
-	dimensionsTotal = enum.auto()
-	leavesTotal = enum.auto()
-	taskDivisions = enum.auto()
-
-class indexTrack(EnumIndices):
-	"""Indices for state tracking array."""
-	leafAbove = enum.auto()
-	leafBelow = enum.auto()
-	countDimensionsGapped = enum.auto()
-	gapRangeStart = enum.auto()
-
-class computationState(TypedDict):
-	connectionGraph: NDArray[integer[Any]]
-	foldsSubTotals: NDArray[integer[Any]]
-	mapShape: Tuple[int, ...]
-	my: NDArray[integer[Any]]
-	gapsWhere: NDArray[integer[Any]]
-	the: NDArray[integer[Any]]
-	track: NDArray[integer[Any]]
-
-dtypeLarge = numpy.int64
-dtypeMedium = dtypeLarge
-
-def getLeavesTotal(listDimensions: Sequence[int]) -> int:
-	"""
-	How many leaves are in the map.
-
-	Parameters:
-		listDimensions: A list of integers representing dimensions.
-
-	Returns:
-		productDimensions: The product of all positive integer dimensions.
-	"""
-	listNonNegative = parseDimensions(listDimensions, 'listDimensions')
-	listPositive = [dimension for dimension in listNonNegative if dimension > 0]
-
-	if not listPositive:
-		return 0
-	else:
-		productDimensions = 1
-		for dimension in listPositive:
-			if dimension > sys.maxsize // productDimensions:
-				raise OverflowError(f"I received {dimension=} in {listDimensions=}, but the product of the dimensions exceeds the maximum size of an integer on this system.")
-			productDimensions *= dimension
-
-		return productDimensions
-
-def getTaskDivisions(computationDivisions: Optional[Union[int, str]], concurrencyLimit: int, CPUlimit: Optional[Union[bool, float, int]], listDimensions: Sequence[int]):
-	if not computationDivisions:
-		return 0
-	else:
-		leavesTotal = getLeavesTotal(listDimensions)
-		taskDivisions = 0
-	if isinstance(computationDivisions, int):
-		taskDivisions = computationDivisions
-	elif isinstance(computationDivisions, str):
-		computationDivisions = computationDivisions.lower()
-		if computationDivisions == "maximum":
-			taskDivisions = leavesTotal
-		elif computationDivisions == "cpu":
-			taskDivisions = min(concurrencyLimit, leavesTotal)
-	else:
-		raise ValueError("Not my problem.")
-
-	if taskDivisions > leavesTotal:
-		raise ValueError("What are you doing?")
-
-	return taskDivisions
-
-def makeConnectionGraph(listDimensions: Sequence[int], **keywordArguments: Optional[Type]) -> NDArray[integer[Any]]:
-	datatype = keywordArguments.get('datatype', dtypeMedium)
-	mapShape = validateListDimensions(listDimensions)
-	leavesTotal = getLeavesTotal(mapShape)
-	arrayDimensions = numpy.array(mapShape, dtype=datatype)
-	dimensionsTotal = len(arrayDimensions)
-
-	cumulativeProduct = numpy.multiply.accumulate([1] + mapShape, dtype=datatype)
-	coordinateSystem = numpy.zeros((dimensionsTotal + 1, leavesTotal + 1), dtype=datatype)
-	for dimension1ndex in range(1, dimensionsTotal + 1):
-		for leaf1ndex in range(1, leavesTotal + 1):
-			coordinateSystem[dimension1ndex, leaf1ndex] = ( ((leaf1ndex - 1) // cumulativeProduct[dimension1ndex - 1]) % arrayDimensions[dimension1ndex - 1] + 1 )
-
-	connectionGraph = numpy.zeros((dimensionsTotal + 1, leavesTotal + 1, leavesTotal + 1), dtype=datatype)
-	for dimension1ndex in range(1, dimensionsTotal + 1):
-		for activeLeaf1ndex in range(1, leavesTotal + 1):
-			for connectee1ndex in range(1, activeLeaf1ndex + 1):
-				isFirstCoord = coordinateSystem[dimension1ndex, connectee1ndex] == 1
-				isLastCoord = coordinateSystem[dimension1ndex, connectee1ndex] == arrayDimensions[dimension1ndex - 1]
-				exceedsActive = connectee1ndex + cumulativeProduct[dimension1ndex - 1] > activeLeaf1ndex
-				isEvenParity = (coordinateSystem[dimension1ndex, activeLeaf1ndex] & 1) == (coordinateSystem[dimension1ndex, connectee1ndex] & 1)
-
-				if (isEvenParity and isFirstCoord) or (not isEvenParity and (isLastCoord or exceedsActive)):
-					connectionGraph[dimension1ndex, activeLeaf1ndex, connectee1ndex] = connectee1ndex
-				elif isEvenParity and not isFirstCoord:
-					connectionGraph[dimension1ndex, activeLeaf1ndex, connectee1ndex] = connectee1ndex - cumulativeProduct[dimension1ndex - 1]
-				elif not isEvenParity and not (isLastCoord or exceedsActive):
-					connectionGraph[dimension1ndex, activeLeaf1ndex, connectee1ndex] = connectee1ndex + cumulativeProduct[dimension1ndex - 1]
-				else:
-					connectionGraph[dimension1ndex, activeLeaf1ndex, connectee1ndex] = connectee1ndex
-	return connectionGraph
-
-def makeDataContainer(shape, datatype: Optional[Type] = None):
-	if datatype is None:
-		datatype = dtypeMedium
-	return numpy.zeros(shape, dtype=datatype)
-
-def outfitFoldings(listDimensions: Sequence[int], computationDivisions: Optional[Union[int, str]] = None, CPUlimit: Optional[Union[bool, float, int]] = None, **keywordArguments: Optional[Type]) -> computationState:
-	datatypeMedium = keywordArguments.get('datatypeMedium', dtypeMedium)
-	datatypeLarge = keywordArguments.get('datatypeLarge', dtypeLarge)
-
-	the = makeDataContainer(len(indexThe), datatypeMedium)
-
-	mapShape = tuple(sorted(validateListDimensions(listDimensions)))
-	the[indexThe.leavesTotal] = getLeavesTotal(mapShape)
-	the[indexThe.dimensionsTotal] = len(mapShape)
-	concurrencyLimit = setCPUlimit(CPUlimit)
-	the[indexThe.taskDivisions] = getTaskDivisions(computationDivisions, concurrencyLimit, CPUlimit, listDimensions)
-
-	stateInitialized = computationState(
-		connectionGraph = makeConnectionGraph(mapShape, datatype=datatypeMedium),
-		foldsSubTotals = makeDataContainer(the[indexThe.leavesTotal], datatypeLarge),
-		mapShape = mapShape,
-		my = makeDataContainer(len(indexMy), datatypeLarge),
-		gapsWhere = makeDataContainer(int(the[indexThe.leavesTotal]) * int(the[indexThe.leavesTotal]) + 1, datatypeMedium),
-		the = the,
-		track = makeDataContainer((len(indexTrack), the[indexThe.leavesTotal] + 1), datatypeLarge)
-		)
-
-	stateInitialized['my'][indexMy.leaf1ndex] = 1
-	return stateInitialized
-
-def parseDimensions(dimensions: Sequence[int], parameterName: str = 'unnamed parameter') -> List[int]:
-	# listValidated = intInnit(dimensions, parameterName)
-	listNOTValidated = dimensions if isinstance(dimensions, (list, tuple)) else list(dimensions)
-	listNonNegative = []
-	for dimension in listNOTValidated:
-		if dimension < 0:
-			raise ValueError(f"Dimension {dimension} must be non-negative")
-		listNonNegative.append(dimension)
-	if not listNonNegative:
-		raise ValueError("At least one dimension must be non-negative")
-	return listNonNegative
-
-def setCPUlimit(CPUlimit: Union[bool, float, int, None]) -> int:
-	# if not (CPUlimit is None or isinstance(CPUlimit, (bool, int, float))):
-	#	 CPUlimit = oopsieKwargsie(CPUlimit)
-	# concurrencyLimit = defineConcurrencyLimit(CPUlimit)
-	# numba.set_num_threads(concurrencyLimit)
-	concurrencyLimitHARDCODED = 1
-	concurrencyLimit = concurrencyLimitHARDCODED
-	return concurrencyLimit
-
-def validateListDimensions(listDimensions: Sequence[int]) -> List[int]:
-	if not listDimensions:
-		raise ValueError(f"listDimensions is a required parameter.")
-	listNonNegative = parseDimensions(listDimensions, 'listDimensions')
-	dimensionsValid = [dimension for dimension in listNonNegative if dimension > 0]
-	if len(dimensionsValid) < 2:
-		raise NotImplementedError(f"This function requires listDimensions, {listDimensions}, to have at least two dimensions greater than 0. You may want to look at https://oeis.org/.")
-	return sorted(dimensionsValid)

mapFolding/reference/hunterNumba.py

@@ -1,132 +0,0 @@
-from typing import List
-import numba
-import numpy
-
-@numba.jit(cache=True, nopython=True, fastmath=True)
-def countFolds(listDimensions: List[int]) -> int:
-	"""
-	Count the number of distinct ways to fold a map with at least two positive dimensions.
-
-	Parameters:
-		listDimensions: A list of integers representing the dimensions of the map. Error checking and DRY code are impermissible in the numba and jax universes. Validate the list yourself before passing here. There might be some tools for that in this package unless I have become a pyL33t coder.
-
-	Returns:
-		foldsTotal: The total number of distinct folds for the given map dimensions.
-	"""
-	def integerSmall(value) -> numpy.uint8:
-		return numpy.uint8(value)
-
-	def integerLarge(value) -> numpy.uint64:
-		return numpy.uint64(value)
-
-	dtypeMedium = numpy.uint8
-	dtypeMaximum = numpy.uint16
-
-	leavesTotal = integerSmall(1)
-	for 个 in listDimensions:
-		leavesTotal = leavesTotal * integerSmall(个)
-	dimensionsTotal = integerSmall(len(listDimensions))
-
-	"""How to build a leaf connection graph, also called a "Cartesian Product Decomposition"
-	or a "Dimensional Product Mapping", with sentinels:
-	Step 1: find the cumulative product of the map's dimensions"""
-	cumulativeProduct = numpy.ones(dimensionsTotal + 1, dtype=dtypeMedium)
-	for dimension1ndex in range(1, dimensionsTotal + 1):
-		cumulativeProduct[dimension1ndex] = cumulativeProduct[dimension1ndex - 1] * listDimensions[dimension1ndex - 1]
-
-	"""Step 2: for each dimension, create a coordinate system """
-	"""coordinateSystem[dimension1ndex, leaf1ndex] holds the dimension1ndex-th coordinate of leaf leaf1ndex"""
-	coordinateSystem = numpy.zeros((dimensionsTotal + 1, leavesTotal + 1), dtype=dtypeMedium)
-	for dimension1ndex in range(1, dimensionsTotal + 1):
-		for leaf1ndex in range(1, leavesTotal + 1):
-			coordinateSystem[dimension1ndex, leaf1ndex] = ((leaf1ndex - 1) // cumulativeProduct[dimension1ndex - 1]) % listDimensions[dimension1ndex - 1] + 1
-
-	"""Step 3: create a huge empty connection graph"""
-	connectionGraph = numpy.zeros((dimensionsTotal + 1, leavesTotal + 1, leavesTotal + 1), dtype=dtypeMedium)
-
-	"""Step for... for... for...: fill the connection graph"""
-	for dimension1ndex in range(1, dimensionsTotal + 1):
-		for leaf1ndex in range(1, leavesTotal + 1):
-			for leafConnectee in range(1, leaf1ndex + 1):
-				connectionGraph[dimension1ndex, leaf1ndex, leafConnectee] = (0 if leafConnectee == 0
-								else ((leafConnectee if coordinateSystem[dimension1ndex, leafConnectee] == 1
-											else leafConnectee - cumulativeProduct[dimension1ndex - 1])
-									if (coordinateSystem[dimension1ndex, leaf1ndex] & 1) == (coordinateSystem[dimension1ndex, leafConnectee] & 1)
-									else (leafConnectee if coordinateSystem[dimension1ndex, leafConnectee] == listDimensions[dimension1ndex-1]
-											or leafConnectee + cumulativeProduct[dimension1ndex - 1] > leaf1ndex
-											else leafConnectee + cumulativeProduct[dimension1ndex - 1])))
-
-	"""Indices of array `track` (to "track" the execution state), which is a collection of one-dimensional arrays each of length `leavesTotal + 1`."""
-	leafAbove = numba.literally(0)
-	leafBelow = numba.literally(1)
-	countDimensionsGapped = numba.literally(2)
-	gapRangeStart = numba.literally(3)
-	track = numpy.zeros((4, leavesTotal + 1), dtype=dtypeMedium)
-
-	gapsWhere = numpy.zeros(integerLarge(integerLarge(leavesTotal) * integerLarge(leavesTotal) + 1), dtype=dtypeMaximum)
-
-	foldsTotal = integerLarge(0)
-	leaf1ndex = integerSmall(1)
-	gap1ndex = integerSmall(0)
-
-	while leaf1ndex > 0:
-		if leaf1ndex <= 1 or track[leafBelow, 0] == 1:
-			if leaf1ndex > leavesTotal:
-				foldsTotal += leavesTotal
-			else:
-				dimensionsUnconstrained = integerSmall(0)
-				"""Track possible gaps for leaf1ndex in each section"""
-				gap1ndexCeiling = track[gapRangeStart, leaf1ndex - 1]
-
-				"""Count possible gaps for leaf1ndex in each section"""
-				dimension1ndex = integerSmall(1)
-				while dimension1ndex <= dimensionsTotal:
-					if connectionGraph[dimension1ndex, leaf1ndex, leaf1ndex] == leaf1ndex:
-						dimensionsUnconstrained += 1
-					else:
-						leafConnectee = connectionGraph[dimension1ndex, leaf1ndex, leaf1ndex]
-						while leafConnectee != leaf1ndex:
-							gapsWhere[gap1ndexCeiling] = leafConnectee
-							if track[countDimensionsGapped, leafConnectee] == 0:
-								gap1ndexCeiling += 1
-							track[countDimensionsGapped, leafConnectee] += 1
-							leafConnectee = connectionGraph[dimension1ndex, leaf1ndex, track[leafBelow, leafConnectee]]
-					dimension1ndex += 1
-
-				"""If leaf1ndex is unconstrained in all sections, it can be inserted anywhere"""
-				if dimensionsUnconstrained == dimensionsTotal:
-					indexLeaf = integerSmall(0)
-					while indexLeaf < leaf1ndex:
-						gapsWhere[gap1ndexCeiling] = indexLeaf
-						gap1ndexCeiling += 1
-						indexLeaf += 1
-
-				"""Filter gaps that are common to all sections"""
-				indexMiniGap = gap1ndex
-				while indexMiniGap < gap1ndexCeiling:
-					gapsWhere[gap1ndex] = gapsWhere[indexMiniGap]
-					if track[countDimensionsGapped, gapsWhere[indexMiniGap]] == dimensionsTotal - dimensionsUnconstrained:
-						gap1ndex += 1
-					"""Reset track[countDimensionsGapped] for next iteration"""
-					track[countDimensionsGapped, gapsWhere[indexMiniGap]] = 0
-					indexMiniGap += 1
-
-		"""Recursive backtracking steps"""
-		while leaf1ndex > 0 and gap1ndex == track[gapRangeStart, leaf1ndex - 1]:
-			leaf1ndex -= 1
-			track[leafBelow, track[leafAbove, leaf1ndex]] = track[leafBelow, leaf1ndex]
-			track[leafAbove, track[leafBelow, leaf1ndex]] = track[leafAbove, leaf1ndex]
-
-		"""Place leaf in valid position"""
-		if leaf1ndex > 0:
-			gap1ndex -= 1
-			track[leafAbove, leaf1ndex] = gapsWhere[gap1ndex]
-			track[leafBelow, leaf1ndex] = track[leafBelow, track[leafAbove, leaf1ndex]]
-			track[leafBelow, track[leafAbove, leaf1ndex]] = leaf1ndex
-			track[leafAbove, track[leafBelow, leaf1ndex]] = leaf1ndex
-			"""Save current gap index"""
-			track[gapRangeStart, leaf1ndex] = gap1ndex
-			"""Move to next leaf"""
-			leaf1ndex += 1
-
-	return int(foldsTotal)

mapFolding/reference/irvineJavaPort.py

@@ -1,120 +0,0 @@
-"""
-Ported from the Java version by Sean A. Irvine:
-https://github.com/archmageirvine/joeis/blob/80e3e844b11f149704acbab520bc3a3a25ac34ff/src/irvine/oeis/a001/A001415.java
-
-Citation: mapFolding/citations/jOEIS.bibtex
-"""
-def foldings(p: list[int], res: int = 0, mod: int = 0) -> int:
-	"""
-	Compute the total number of foldings for a map with dimensions specified in p.
-
-	Parameters:
-		p: List of integers representing the dimensions of the map.
-		res: Residue for modulo operation (integer).
-		mod: Modulus for modulo operation (integer).
-
-	Returns:
-		total_count: The total number of foldings (integer).
-	"""
-	n = 1  # Total number of leaves
-	d = len(p)  # Number of dimensions
-	for dimension in p:
-		n *= dimension
-
-	# Initialize arrays/lists
-	A = [0] * (n + 1)	   # Leaf above leaf m
-	B = [0] * (n + 1)	   # Leaf below leaf m
-	count = [0] * (n + 1)   # Counts for potential gaps
-	gapter = [0] * (n + 1)  # Indices for gap stack per leaf
-	gap = [0] * (n * n + 1) # Stack of potential gaps
-
-	# Compute arrays P, C, D as per the algorithm
-	P = [1] * (d + 1)
-	for i in range(1, d + 1):
-		P[i] = P[i - 1] * p[i - 1]
-
-	# C[i][m] holds the i-th coordinate of leaf m
-	C = [[0] * (n + 1) for _ in range(d + 1)]
-	for i in range(1, d + 1):
-		for m in range(1, n + 1):
-			C[i][m] = ((m - 1) // P[i - 1]) - ((m - 1) // P[i]) * p[i - 1] + 1
-
-	# D[i][l][m] computes the leaf connected to m in section i when inserting l
-	D = [[[0] * (n + 1) for _ in range(n + 1)] for _ in range(d + 1)]
-	for i in range(1, d + 1):
-		for l in range(1, n + 1):
-			for m in range(1, l + 1):
-				delta = C[i][l] - C[i][m]
-				if delta % 2 == 0:
-					# If delta is even
-					if C[i][m] == 1:
-						D[i][l][m] = m
-					else:
-						D[i][l][m] = m - P[i - 1]
-				else:
-					# If delta is odd
-					if C[i][m] == p[i - 1] or m + P[i - 1] > l:
-						D[i][l][m] = m
-					else:
-						D[i][l][m] = m + P[i - 1]
-
-	# Initialize variables for backtracking
-	total_count = 0  # Total number of foldings
-	g = 0			# Gap index
-	l = 1			# Current leaf
-
-	# Start backtracking loop
-	while l > 0:
-		# If we have processed all leaves, increment total count
-		if l > n:
-			total_count += 1
-		else:
-			dd = 0	 # Number of sections where leaf l is unconstrained
-			gg = g	 # Temporary gap index
-			g = gapter[l - 1]  # Reset gap index for current leaf
-
-			# Count possible gaps for leaf l in each section
-			for i in range(1, d + 1):
-				if D[i][l][l] == l:
-					dd += 1
-				else:
-					m = D[i][l][l]
-					while m != l:
-						if mod == 0 or l != mod or m % mod == res:
-							gap[gg] = m
-							if count[m] == 0:
-								gg += 1
-							count[m] += 1
-						m = D[i][l][B[m]]
-
-			# If leaf l is unconstrained in all sections, it can be inserted anywhere
-			if dd == d:
-				for m in range(l):
-					gap[gg] = m
-					gg += 1
-
-			# Filter gaps that are common to all sections
-			for j in range(g, gg):
-				gap[g] = gap[j]
-				if count[gap[j]] == d - dd:
-					g += 1
-				count[gap[j]] = 0  # Reset count for next iteration
-
-		# Recursive backtracking steps
-		while l > 0 and g == gapter[l - 1]:
-			# No more gaps to try, backtrack to previous leaf
-			l -= 1
-			B[A[l]] = B[l]
-			A[B[l]] = A[l]
-
-		if l > 0:
-			# Try next gap for leaf l
-			g -= 1
-			A[l] = gap[g]
-			B[l] = B[A[l]]
-			B[A[l]] = l
-			A[B[l]] = l
-			gapter[l] = g  # Save current gap index
-			l += 1		 # Move to next leaf
-
-	return total_count