FM / python3.13

/opt/imh/python3.13/lib/python3.13

Name	Size	Mode	Actions
asyncio/	-	0755	rm
collections/	-	0755	rm
concurrent/	-	0755	rm
config-3.13-x86_64-linux-gnu/	-	0755	rm
ctypes/	-	0755	rm
curses/	-	0755	rm
dbm/	-	0755	rm
email/	-	0755	rm
encodings/	-	0755	rm
ensurepip/	-	0755	rm
html/	-	0755	rm
http/	-	0755	rm
idlelib/	-	0755	rm
importlib/	-	0755	rm
json/	-	0755	rm
lib-dynload/	-	0755	rm
logging/	-	0755	rm
multiprocessing/	-	0755	rm
pathlib/	-	0755	rm
pydoc_data/	-	0755	rm
re/	-	0755	rm
site-packages/	-	0755	rm
sqlite3/	-	0755	rm
sysconfig/	-	0755	rm
tkinter/	-	0755	rm
tomllib/	-	0755	rm
turtledemo/	-	0755	rm
unittest/	-	0755	rm
urllib/	-	0755	rm
venv/	-	0755	rm
wsgiref/	-	0755	rm
xml/	-	0755	rm
xmlrpc/	-	0755	rm
zipfile/	-	0755	rm
zoneinfo/	-	0755	rm
_pyrepl/	-	0755	rm
__phello__/	-	0755	rm
__pycache__/	-	0755	rm
abc.py	6538	0644	edit dl rm
antigravity.py	500	0644	edit dl rm
argparse.py	101661	0644	edit dl rm
ast.py	65339	0644	edit dl rm
base64.py	21630	0755	edit dl rm
bdb.py	35343	0644	edit dl rm
bisect.py	3423	0644	edit dl rm
bz2.py	11969	0644	edit dl rm
calendar.py	26077	0644	edit dl rm
cmd.py	15316	0644	edit dl rm
code.py	13170	0644	edit dl rm
codecs.py	36978	0644	edit dl rm
codeop.py	5828	0644	edit dl rm
colorsys.py	4062	0644	edit dl rm
compileall.py	20665	0644	edit dl rm
configparser.py	53831	0644	edit dl rm
contextlib.py	27801	0644	edit dl rm
contextvars.py	129	0644	edit dl rm
copy.py	8975	0644	edit dl rm
copyreg.py	7614	0644	edit dl rm
cProfile.py	6624	0755	edit dl rm
csv.py	19178	0644	edit dl rm
dataclasses.py	64545	0644	edit dl rm
datetime.py	268	0644	edit dl rm
decimal.py	2798	0644	edit dl rm
difflib.py	83367	0644	edit dl rm
dis.py	40962	0644	edit dl rm
doctest.py	109414	0644	edit dl rm
enum.py	85593	0644	edit dl rm
filecmp.py	10652	0644	edit dl rm
fileinput.py	15717	0644	edit dl rm
fnmatch.py	6180	0644	edit dl rm
fractions.py	40090	0644	edit dl rm
ftplib.py	34735	0644	edit dl rm
functools.py	39123	0644	edit dl rm
genericpath.py	6247	0644	edit dl rm
getopt.py	7488	0644	edit dl rm
getpass.py	6233	0644	edit dl rm
gettext.py	21534	0644	edit dl rm
glob.py	19720	0644	edit dl rm
graphlib.py	9648	0644	edit dl rm
gzip.py	24633	0644	edit dl rm
hashlib.py	9446	0644	edit dl rm
heapq.py	23024	0644	edit dl rm
hmac.py	7716	0644	edit dl rm
imaplib.py	54040	0644	edit dl rm
inspect.py	128276	0644	edit dl rm
io.py	3582	0644	edit dl rm
ipaddress.py	81635	0644	edit dl rm
keyword.py	1073	0644	edit dl rm
LICENSE.txt	13809	0644	edit dl rm
linecache.py	7284	0644	edit dl rm
locale.py	79033	0644	edit dl rm
lzma.py	13399	0644	edit dl rm
mailbox.py	81644	0644	edit dl rm
mimetypes.py	23851	0644	edit dl rm
modulefinder.py	23792	0644	edit dl rm
netrc.py	7031	0644	edit dl rm
ntpath.py	32806	0644	edit dl rm
nturl2path.py	2374	0644	edit dl rm
numbers.py	11769	0644	edit dl rm
opcode.py	2825	0644	edit dl rm
operator.py	10980	0644	edit dl rm
optparse.py	60369	0644	edit dl rm
os.py	41627	0644	edit dl rm
pdb.py	90925	0755	edit dl rm
pickle.py	66957	0644	edit dl rm
pickletools.py	94052	0644	edit dl rm
pkgutil.py	18281	0644	edit dl rm
platform.py	47345	0755	edit dl rm
plistlib.py	29794	0644	edit dl rm
poplib.py	14604	0644	edit dl rm
posixpath.py	18360	0644	edit dl rm
pprint.py	24158	0644	edit dl rm
profile.py	23140	0755	edit dl rm
pstats.py	29296	0644	edit dl rm
pty.py	6137	0644	edit dl rm
pyclbr.py	11396	0644	edit dl rm
pydoc.py	110064	0755	edit dl rm
py_compile.py	7837	0644	edit dl rm
queue.py	13455	0644	edit dl rm
quopri.py	7184	0755	edit dl rm
random.py	37006	0644	edit dl rm
reprlib.py	8068	0644	edit dl rm
rlcompleter.py	7918	0644	edit dl rm
runpy.py	12885	0644	edit dl rm
sched.py	6351	0644	edit dl rm
secrets.py	1984	0644	edit dl rm
selectors.py	19457	0644	edit dl rm
shelve.py	8810	0644	edit dl rm
shlex.py	13353	0644	edit dl rm
shutil.py	57463	0644	edit dl rm
signal.py	2495	0644	edit dl rm
site.py	25568	0644	edit dl rm
smtplib.py	43532	0755	edit dl rm
socket.py	37759	0644	edit dl rm
socketserver.py	28065	0644	edit dl rm
sre_compile.py	231	0644	edit dl rm
sre_constants.py	232	0644	edit dl rm
sre_parse.py	229	0644	edit dl rm
ssl.py	52706	0644	edit dl rm
stat.py	6147	0644	edit dl rm
statistics.py	61831	0644	edit dl rm
string.py	11786	0644	edit dl rm
stringprep.py	12917	0644	edit dl rm
struct.py	257	0644	edit dl rm
subprocess.py	89486	0644	edit dl rm
symtable.py	14207	0644	edit dl rm
tabnanny.py	11532	0755	edit dl rm
tarfile.py	114239	0755	edit dl rm
tempfile.py	32406	0644	edit dl rm
textwrap.py	19939	0644	edit dl rm
this.py	1003	0644	edit dl rm
threading.py	55300	0644	edit dl rm
timeit.py	13464	0755	edit dl rm
token.py	2489	0644	edit dl rm
tokenize.py	21568	0644	edit dl rm
trace.py	29714	0755	edit dl rm
traceback.py	66524	0644	edit dl rm
tracemalloc.py	18047	0644	edit dl rm
tty.py	2035	0644	edit dl rm
turtle.py	145215	0644	edit dl rm
types.py	11207	0644	edit dl rm
typing.py	132718	0644	edit dl rm
uuid.py	29458	0644	edit dl rm
warnings.py	26948	0644	edit dl rm
wave.py	23254	0644	edit dl rm
weakref.py	21513	0644	edit dl rm
webbrowser.py	24285	0755	edit dl rm
zipapp.py	8618	0644	edit dl rm
zipimport.py	32890	0644	edit dl rm
_aix_support.py	4021	0644	edit dl rm
_android_support.py	6895	0644	edit dl rm
_apple_support.py	2256	0644	edit dl rm
_collections_abc.py	32264	0644	edit dl rm
_colorize.py	2848	0644	edit dl rm
_compat_pickle.py	8735	0644	edit dl rm
_compression.py	5681	0644	edit dl rm
_ios_support.py	2672	0644	edit dl rm
_markupbase.py	14653	0644	edit dl rm
_opcode_metadata.py	9265	0644	edit dl rm
_osx_support.py	22023	0644	edit dl rm
_pydatetime.py	91983	0644	edit dl rm
_pydecimal.py	227286	0644	edit dl rm
_pyio.py	93693	0644	edit dl rm
_pylong.py	11830	0644	edit dl rm
_py_abc.py	6189	0644	edit dl rm
_sitebuiltins.py	3128	0644	edit dl rm
_strptime.py	34734	0644	edit dl rm
_sysconfigdata__linux_x86_64-linux-gnu.py	45021	0644	edit dl rm
_threading_local.py	4363	0644	edit dl rm
_weakrefset.py	5893	0644	edit dl rm
__future__.py	5218	0644	edit dl rm
__hello__.py	227	0644	edit dl rm

Edit: /opt/imh/python3.13/lib/python3.13/graphlib.py (9648B)

from types import GenericAlias

__all__ = ["TopologicalSorter", "CycleError"]

_NODE_OUT = -1
_NODE_DONE = -2

class _NodeInfo:
    __slots__ = "node", "npredecessors", "successors"

def __init__(self, node):
        # The node this class is augmenting.
        self.node = node

# Number of predecessors, generally >= 0. When this value falls to 0,
        # and is returned by get_ready(), this is set to _NODE_OUT and when the
        # node is marked done by a call to done(), set to _NODE_DONE.
        self.npredecessors = 0

# List of successor nodes. The list can contain duplicated elements as
        # long as they're all reflected in the successor's npredecessors attribute.
        self.successors = []

class CycleError(ValueError):
    """Subclass of ValueError raised by TopologicalSorter.prepare if cycles
    exist in the working graph.

If multiple cycles exist, only one undefined choice among them will be reported
    and included in the exception. The detected cycle can be accessed via the second
    element in the *args* attribute of the exception instance and consists in a list
    of nodes, such that each node is, in the graph, an immediate predecessor of the
    next node in the list. In the reported list, the first and the last node will be
    the same, to make it clear that it is cyclic.
    """

pass

class TopologicalSorter:
    """Provides functionality to topologically sort a graph of hashable nodes"""

def __init__(self, graph=None):
        self._node2info = {}
        self._ready_nodes = None
        self._npassedout = 0
        self._nfinished = 0

if graph is not None:
            for node, predecessors in graph.items():
                self.add(node, *predecessors)

def _get_nodeinfo(self, node):
        if (result := self._node2info.get(node)) is None:
            self._node2info[node] = result = _NodeInfo(node)
        return result

def add(self, node, *predecessors):
        """Add a new node and its predecessors to the graph.

Both the *node* and all elements in *predecessors* must be hashable.

If called multiple times with the same node argument, the set of dependencies
        will be the union of all dependencies passed in.

It is possible to add a node with no dependencies (*predecessors* is not provided)
        as well as provide a dependency twice. If a node that has not been provided before
        is included among *predecessors* it will be automatically added to the graph with
        no predecessors of its own.

Raises ValueError if called after "prepare".
        """
        if self._ready_nodes is not None:
            raise ValueError("Nodes cannot be added after a call to prepare()")

# Create the node -> predecessor edges
        nodeinfo = self._get_nodeinfo(node)
        nodeinfo.npredecessors += len(predecessors)

# Create the predecessor -> node edges
        for pred in predecessors:
            pred_info = self._get_nodeinfo(pred)
            pred_info.successors.append(node)

def prepare(self):
        """Mark the graph as finished and check for cycles in the graph.

If any cycle is detected, "CycleError" will be raised, but "get_ready" can
        still be used to obtain as many nodes as possible until cycles block more
        progress. After a call to this function, the graph cannot be modified and
        therefore no more nodes can be added using "add".
        """
        if self._ready_nodes is not None:
            raise ValueError("cannot prepare() more than once")

self._ready_nodes = [
            i.node for i in self._node2info.values() if i.npredecessors == 0
        ]
        # ready_nodes is set before we look for cycles on purpose:
        # if the user wants to catch the CycleError, that's fine,
        # they can continue using the instance to grab as many
        # nodes as possible before cycles block more progress
        cycle = self._find_cycle()
        if cycle:
            raise CycleError(f"nodes are in a cycle", cycle)

def get_ready(self):
        """Return a tuple of all the nodes that are ready.

Initially it returns all nodes with no predecessors; once those are marked
        as processed by calling "done", further calls will return all new nodes that
        have all their predecessors already processed. Once no more progress can be made,
        empty tuples are returned.

Raises ValueError if called without calling "prepare" previously.
        """
        if self._ready_nodes is None:
            raise ValueError("prepare() must be called first")

# Get the nodes that are ready and mark them
        result = tuple(self._ready_nodes)
        n2i = self._node2info
        for node in result:
            n2i[node].npredecessors = _NODE_OUT

# Clean the list of nodes that are ready and update
        # the counter of nodes that we have returned.
        self._ready_nodes.clear()
        self._npassedout += len(result)

return result

def is_active(self):
        """Return ``True`` if more progress can be made and ``False`` otherwise.

Progress can be made if cycles do not block the resolution and either there
        are still nodes ready that haven't yet been returned by "get_ready" or the
        number of nodes marked "done" is less than the number that have been returned
        by "get_ready".

Raises ValueError if called without calling "prepare" previously.
        """
        if self._ready_nodes is None:
            raise ValueError("prepare() must be called first")
        return self._nfinished < self._npassedout or bool(self._ready_nodes)

def __bool__(self):
        return self.is_active()

def done(self, *nodes):
        """Marks a set of nodes returned by "get_ready" as processed.

This method unblocks any successor of each node in *nodes* for being returned
        in the future by a call to "get_ready".

Raises ValueError if any node in *nodes* has already been marked as
        processed by a previous call to this method, if a node was not added to the
        graph by using "add" or if called without calling "prepare" previously or if
        node has not yet been returned by "get_ready".
        """

if self._ready_nodes is None:
            raise ValueError("prepare() must be called first")

n2i = self._node2info

for node in nodes:

# Check if we know about this node (it was added previously using add()
            if (nodeinfo := n2i.get(node)) is None:
                raise ValueError(f"node {node!r} was not added using add()")

# If the node has not being returned (marked as ready) previously, inform the user.
            stat = nodeinfo.npredecessors
            if stat != _NODE_OUT:
                if stat >= 0:
                    raise ValueError(
                        f"node {node!r} was not passed out (still not ready)"
                    )
                elif stat == _NODE_DONE:
                    raise ValueError(f"node {node!r} was already marked done")
                else:
                    assert False, f"node {node!r}: unknown status {stat}"

# Mark the node as processed
            nodeinfo.npredecessors = _NODE_DONE

# Go to all the successors and reduce the number of predecessors, collecting all the ones
            # that are ready to be returned in the next get_ready() call.
            for successor in nodeinfo.successors:
                successor_info = n2i[successor]
                successor_info.npredecessors -= 1
                if successor_info.npredecessors == 0:
                    self._ready_nodes.append(successor)
            self._nfinished += 1

def _find_cycle(self):
        n2i = self._node2info
        stack = []
        itstack = []
        seen = set()
        node2stacki = {}

for node in n2i:
            if node in seen:
                continue

while True:
                if node in seen:
                    # If we have seen already the node and is in the
                    # current stack we have found a cycle.
                    if node in node2stacki:
                        return stack[node2stacki[node] :] + [node]
                    # else go on to get next successor
                else:
                    seen.add(node)
                    itstack.append(iter(n2i[node].successors).__next__)
                    node2stacki[node] = len(stack)
                    stack.append(node)

# Backtrack to the topmost stack entry with
                # at least another successor.
                while stack:
                    try:
                        node = itstack[-1]()
                        break
                    except StopIteration:
                        del node2stacki[stack.pop()]
                        itstack.pop()
                else:
                    break
        return None

def static_order(self):
        """Returns an iterable of nodes in a topological order.

The particular order that is returned may depend on the specific
        order in which the items were inserted in the graph.

Using this method does not require to call "prepare" or "done". If any
        cycle is detected, :exc:`CycleError` will be raised.
        """
        self.prepare()
        while self.is_active():
            node_group = self.get_ready()
            yield from node_group
            self.done(*node_group)

__class_getitem__ = classmethod(GenericAlias)

cmd: