mapFolding 0.3.12__py3-none-any.whl → 0.4.0__py3-none-any.whl

mapFolding/reference/hunterNumba.py

@@ -4,129 +4,129 @@ 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)
+	"""
+	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

@@ -5,116 +5,116 @@ https://github.com/archmageirvine/joeis/blob/80e3e844b11f149704acbab520bc3a3a25a
 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.
+	"""
+	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).
+	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
+	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
+	# 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]
+	# 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
+	# 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]
+	# 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
+	# 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
+	# 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]]
+			# 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
+			# 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
+			# 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]
+		# 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
+		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
+	return total_count