mapFolding 0.3.8__py3-none-any.whl → 0.3.10__py3-none-any.whl

mapFolding/__init__.py

@@ -0,0 +1,56 @@
+# fundamentals
+from mapFolding.theSSOT import (
+    computationState,
+    EnumIndices,
+    getDispatcherCallable,
+    getPathPackage,
+    indexMy,
+    indexTrack,
+    myPackageNameIs,
+)
+
+# Datatype management
+from mapFolding.theSSOT import (
+    hackSSOTdatatype,
+    hackSSOTdtype,
+    setDatatypeElephino,
+    setDatatypeFoldsTotal,
+    setDatatypeLeavesTotal,
+    setDatatypeModule,
+)
+
+# Synthesize modules
+from mapFolding.theSSOT import (
+    getAlgorithmCallable,
+    getAlgorithmSource,
+    getPathJobRootDEFAULT,
+    getPathSyntheticModules,
+    moduleOfSyntheticModules,
+)
+
+# Parameters for the prima donna
+from mapFolding.theSSOT import (
+    ParametersNumba,
+    parametersNumbaDEFAULT,
+    parametersNumbaFailEarly,
+    parametersNumbaParallelDEFAULT,
+    parametersNumbaSuperJit,
+    parametersNumbaSuperJitParallel,
+)
+
+from mapFolding.beDRY import (
+    getFilenameFoldsTotal,
+    getPathFilenameFoldsTotal,
+    outfitCountFolds,
+    saveFoldsTotal,
+)
+
+from mapFolding.basecamp import countFolds
+from mapFolding.oeis import clearOEIScache, getOEISids, oeisIDfor_n
+
+__all__ = [
+    'clearOEIScache',
+    'countFolds',
+    'getOEISids',
+    'oeisIDfor_n',
+]

mapFolding/basecamp.py

@@ -0,0 +1,55 @@
+from mapFolding import computationState, getDispatcherCallable, getPathFilenameFoldsTotal, outfitCountFolds, saveFoldsTotal
+from typing import Optional, Sequence, Union
+import os
+
+def countFolds(listDimensions: Sequence[int]
+                , pathLikeWriteFoldsTotal: Optional[Union[str, os.PathLike[str]]] = None
+                , computationDivisions: Optional[Union[int, str]] = None
+                , CPUlimit: Optional[Union[int, float, bool]] = None
+                , **keywordArguments: Optional[Union[str, bool]]
+                ) -> int:
+    """Count the total number of possible foldings for a given map dimensions.
+
+    Parameters:
+        listDimensions: List of integers representing the dimensions of the map to be folded.
+        pathLikeWriteFoldsTotal (None): Path, filename, or pathFilename to write the total fold count to.
+            If a directory is provided, creates a file with a default name based on map dimensions.
+        computationDivisions (None):
+            Whether and how to divide the computational work. See notes for details.
+        CPUlimit (None): This is only relevant if there are `computationDivisions`: whether and how to limit the CPU usage. See notes for details.
+        **keywordArguments: Datatype management.
+    Returns:
+        foldsTotal: Total number of distinct ways to fold a map of the given dimensions.
+
+    Computation divisions:
+        - 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`
+
+    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.
+
+    N.B.: You probably don't want to divide the computation into tasks.
+        If you want to compute a large `foldsTotal`, dividing the computation into tasks is usually a bad idea. Dividing the algorithm into tasks is inherently inefficient: efficient division into tasks means there would be no overlap in the work performed by each task. When dividing this algorithm, the amount of overlap is between 50% and 90% by all tasks: at least 50% of the work done by every task must be done by _all_ tasks. If you improve the computation time, it will only change by -10 to -50% depending on (at the very least) the ratio of the map dimensions and the number of leaves. If an undivided computation would take 10 hours on your computer, for example, the computation will still take at least 5 hours but you might reduce the time to 9 hours. Most of the time, however, you will increase the computation time. If logicalCores >= leavesTotal, it will probably be faster. If logicalCores <= 2 * leavesTotal, it will almost certainly be slower for all map dimensions.
+    """
+    stateUniversal: computationState = outfitCountFolds(listDimensions, computationDivisions=computationDivisions, CPUlimit=CPUlimit, **keywordArguments)
+
+    pathFilenameFoldsTotal = None
+    if pathLikeWriteFoldsTotal is not None:
+        pathFilenameFoldsTotal = getPathFilenameFoldsTotal(stateUniversal['mapShape'], pathLikeWriteFoldsTotal)
+
+    dispatcher = getDispatcherCallable()
+    dispatcher(**stateUniversal)
+
+    foldsTotal = int(stateUniversal['foldGroups'][0:-1].sum() * stateUniversal['foldGroups'][-1])
+
+    if pathFilenameFoldsTotal is not None:
+        saveFoldsTotal(pathFilenameFoldsTotal, foldsTotal)
+
+    return foldsTotal

mapFolding/beDRY.py

@@ -0,0 +1,376 @@
+"""A relatively stable API for oft-needed functionality."""
+from mapFolding import (
+    computationState,
+    getPathJobRootDEFAULT,
+    hackSSOTdtype,
+    indexMy,
+    indexTrack,
+    setDatatypeElephino,
+    setDatatypeFoldsTotal,
+    setDatatypeLeavesTotal,
+)
+from numpy import integer
+from numpy.typing import DTypeLike, NDArray
+from typing import Any, List, Optional, Sequence, Tuple, Type, Union
+from Z0Z_tools import defineConcurrencyLimit, intInnit, oopsieKwargsie
+import numba
+import numpy
+import os
+import pathlib
+import sys
+
+def getFilenameFoldsTotal(mapShape: Union[Sequence[int], numpy.ndarray[Tuple[int], numpy.dtype[integer[Any]]]]) -> str:
+    """Make a standardized filename for the computed value `foldsTotal`.
+
+    The filename takes into account
+        - the dimensions of the map, aka `mapShape`, aka `listDimensions`
+        - no spaces in the filename
+        - safe filesystem characters across platforms
+        - unique extension
+        - avoiding potential problems when Python is manipulating the filename, including
+            - treating the file stem as a valid Python identifier, such as
+                - not starting with a number
+                - not using reserved words
+                - no dashes or other special characters
+            - uh, I can't remember, but I found some frustrating edge limitations
+        - if 'p' is still the first character, I picked that because it was the original identifier for the map shape in Lunnan's code
+
+    Parameters:
+        mapShape: A sequence of integers representing the dimensions of the map (e.g., [3, 2] for a 3x2 map)
+
+    Returns:
+        filenameFoldsTotal: A filename string in format 'pNxM.foldsTotal' where N,M are sorted dimensions
+    """
+    return 'p' + 'x'.join(str(dim) for dim in sorted(mapShape)) + '.foldsTotal'
+
+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 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.
+
+    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.
+
+    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.
+            Defaults to None.
+
+    Returns:
+        pathlib.Path: Complete path to the folds total file.
+    """
+    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
+    else:
+        pathFilenameFoldsTotal = pathlib.Path(getPathJobRootDEFAULT(), pathLikeWriteFoldsTotal) # type: ignore
+
+    pathFilenameFoldsTotal.parent.mkdir(parents=True, exist_ok=True)
+    return pathFilenameFoldsTotal
+
+def getTaskDivisions(computationDivisions: Optional[Union[int, str]], concurrencyLimit: int, CPUlimit: Optional[Union[bool, float, int]], listDimensions: Sequence[int]) -> int:
+    """
+    Determines whether or how to divide the computation into tasks.
+
+    Parameters
+    ----------
+    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`
+    concurrencyLimit:
+        Maximum number of concurrent tasks allowed
+    CPUlimit: for error reporting
+    listDimensions: for error reporting
+
+    Returns
+    -------
+    taskDivisions:
+
+    Raises
+    ------
+    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.
+    """
+    taskDivisions = 0
+    leavesTotal = getLeavesTotal(listDimensions)
+    if not computationDivisions:
+        pass
+    elif 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(f"I received {computationDivisions} for the parameter, `computationDivisions`, but the so-called programmer didn't implement code for that.")
+
+    if taskDivisions > leavesTotal:
+        raise ValueError(f"Problem: `taskDivisions`, ({taskDivisions}), is greater than `leavesTotal`, ({leavesTotal}), which will cause duplicate counting of the folds.\n\nChallenge: you cannot directly set `taskDivisions` or `leavesTotal`. They are derived from parameters that may or may not still be named `computationDivisions`, `CPUlimit` , and `listDimensions` and from dubious-quality Python code.\n\nFor those parameters, I received {computationDivisions=}, {CPUlimit=}, and {listDimensions=}.\n\nPotential solutions: get a different hobby or set `computationDivisions` to a different value.")
+
+    return taskDivisions
+
+def makeConnectionGraph(listDimensions: Sequence[int], **keywordArguments: Optional[Type]) -> numpy.ndarray[Tuple[int, int, int], numpy.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.
+
+    Parameters
+        listDimensions: A sequence of integers representing the dimensions of the map.
+        **keywordArguments: Datatype management.
+
+    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')
+    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, leavesTotal + 1), dtype=datatype)
+    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)
+    for indexDimension in range(dimensionsTotal):
+        for activeLeaf1ndex in range(1, leavesTotal + 1):
+            for connectee1ndex in range(1, activeLeaf1ndex + 1):
+                isFirstCoord = coordinateSystem[indexDimension, connectee1ndex] == 1
+                isLastCoord = coordinateSystem[indexDimension, connectee1ndex] == arrayDimensions[indexDimension]
+                exceedsActive = connectee1ndex + cumulativeProduct[indexDimension] > activeLeaf1ndex
+                isEvenParity = (coordinateSystem[indexDimension, activeLeaf1ndex] & 1) == (coordinateSystem[indexDimension, connectee1ndex] & 1)
+
+                if (isEvenParity and isFirstCoord) or (not isEvenParity and (isLastCoord or exceedsActive)):
+                    connectionGraph[indexDimension, activeLeaf1ndex, connectee1ndex] = connectee1ndex
+                elif isEvenParity and not isFirstCoord:
+                    connectionGraph[indexDimension, activeLeaf1ndex, connectee1ndex] = connectee1ndex - cumulativeProduct[indexDimension]
+                elif not isEvenParity and not (isLastCoord or exceedsActive):
+                    connectionGraph[indexDimension, activeLeaf1ndex, connectee1ndex] = connectee1ndex + cumulativeProduct[indexDimension]
+
+    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.
+
+    Parameters:
+        shape (Union[int, Tuple[int, ...]]): 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.
+            If None, defaults to dtypeLargeDEFAULT. Defaults to None.
+
+    Returns:
+        numpy.ndarray: 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:
+    """
+    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
+
+    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.
+    """
+    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
+
+    my = makeDataContainer(len(indexMy), hackSSOTdtype('my'))
+
+    mapShape = tuple(sorted(validateListDimensions(listDimensions)))
+    concurrencyLimit = setCPUlimit(CPUlimit)
+    my[indexMy.taskDivisions] = getTaskDivisions(computationDivisions, concurrencyLimit, CPUlimit, mapShape)
+
+    foldGroups = makeDataContainer(max(my[indexMy.taskDivisions] + 1, 2), hackSSOTdtype('foldGroups'))
+    leavesTotal = getLeavesTotal(mapShape)
+    foldGroups[-1] = leavesTotal
+
+    my[indexMy.dimensionsTotal] = len(mapShape)
+    my[indexMy.leaf1ndex] = 1
+    stateInitialized = computationState(
+        connectionGraph = makeConnectionGraph(mapShape, datatype=hackSSOTdtype('connectionGraph')),
+        foldGroups = foldGroups,
+        mapShape = numpy.array(mapShape, dtype=hackSSOTdtype('mapShape')),
+        my = my,
+        gapsWhere = makeDataContainer(int(leavesTotal) * int(leavesTotal) + 1, hackSSOTdtype('gapsWhere')),
+        track = makeDataContainer((len(indexTrack), leavesTotal + 1), hackSSOTdtype('track')),
+        )
+
+    return stateInitialized
+
+def parseDimensions(dimensions: Sequence[int], parameterName: str = 'listDimensions') -> List[int]:
+    """
+    Parse and validate dimensions are non-negative integers.
+
+    Parameters:
+        dimensions: Sequence of integers representing dimensions
+        parameterName ('listDimensions'): Name of the parameter for error messages. Defaults to 'listDimensions'
+    Returns:
+        listNonNegative: List of validated non-negative integers
+    Raises:
+        ValueError: If any dimension is negative or if the list is empty
+        TypeError: If any element cannot be converted to integer (raised by intInnit)
+    """
+    listValidated = intInnit(dimensions, parameterName)
+    listNonNegative = []
+    for dimension in listValidated:
+        if dimension < 0:
+            raise ValueError(f"Dimension {dimension} must be non-negative")
+        listNonNegative.append(dimension)
+
+    return listNonNegative
+
+def saveFoldsTotal(pathFilename: Union[str, os.PathLike[str]], foldsTotal: int) -> None:
+    """
+    Save foldsTotal with multiple fallback mechanisms.
+
+    Parameters:
+        pathFilename: Target save location
+        foldsTotal: Critical computed value to save
+    """
+    try:
+        pathFilenameFoldsTotal = pathlib.Path(pathFilename)
+        pathFilenameFoldsTotal.parent.mkdir(parents=True, exist_ok=True)
+        pathFilenameFoldsTotal.write_text(str(foldsTotal))
+    except Exception as ERRORmessage:
+        try:
+            print(f"\nfoldsTotal foldsTotal foldsTotal foldsTotal foldsTotal\n\n{foldsTotal=}\n\nfoldsTotal foldsTotal foldsTotal foldsTotal foldsTotal\n")
+            print(ERRORmessage)
+            print(f"\nfoldsTotal foldsTotal foldsTotal foldsTotal foldsTotal\n\n{foldsTotal=}\n\nfoldsTotal foldsTotal foldsTotal foldsTotal foldsTotal\n")
+            randomnessPlanB = (int(str(foldsTotal).strip()[-1]) + 1) * ['YO_']
+            filenameInfixUnique = ''.join(randomnessPlanB)
+            pathFilenamePlanB = os.path.join(os.getcwd(), 'foldsTotal' + filenameInfixUnique + '.txt')
+            writeStreamFallback = open(pathFilenamePlanB, 'w')
+            writeStreamFallback.write(str(foldsTotal))
+            writeStreamFallback.close()
+            print(str(pathFilenamePlanB))
+        except Exception:
+            print(foldsTotal)
+
+def setCPUlimit(CPUlimit: Optional[Any]) -> int:
+    """Sets CPU limit for Numba concurrent operations. Note that it can only affect Numba-jitted functions that have not yet been imported.
+
+    Parameters:
+        CPUlimit: whether and how to limit the CPU usage. See notes for details.
+    Returns:
+        concurrencyLimit: The actual concurrency limit that was set
+    Raises:
+        TypeError: If CPUlimit is not of the expected types
+
+    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.
+    """
+    if not (CPUlimit is None or isinstance(CPUlimit, (bool, int, float))):
+        CPUlimit = oopsieKwargsie(CPUlimit)
+
+    concurrencyLimit = int(defineConcurrencyLimit(CPUlimit))
+    numba.set_num_threads(concurrencyLimit)
+
+    return concurrencyLimit
+
+def validateListDimensions(listDimensions: Sequence[int]) -> List[int]:
+    """
+    Validates and sorts a sequence of at least two positive dimensions.
+
+    Parameters:
+        listDimensions: A sequence of integer dimensions to be validated.
+
+    Returns:
+        dimensionsValidSorted: A list, with at least two elements, of only positive integers.
+
+    Raises:
+        ValueError: If the input listDimensions is None.
+        NotImplementedError: If the resulting list of positive dimensions has fewer than two elements.
+    """
+    if not listDimensions:
+        raise ValueError("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)