danielutils 0.9.77__tar.gz → 0.9.80__tar.gz

{danielutils-0.9.77/danielutils.egg-info → danielutils-0.9.80}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: danielutils
-Version: 0.9.77
+Version: 0.9.80
 Summary: A python utils library for things I find useful
 Author-email: danielnachumdev <danielnachumdev@gmail.com>
 License: MIT License
@@ -41,7 +41,7 @@ License-File: LICENSE
 [![Python 3.10.11](https://img.shields.io/badge/python-3.10.11-blue.svg)](https://www.python.org/downloads/release/python-31011/)
 [![gitleaks](https://github.com/danielnachumdev/danielutils/actions/workflows/gitleaks.yml/badge.svg)](https://github.com/danielnachumdev/danielutils/actions/workflows/gitleaks.yml)
 [![CodeQL](https://github.com/danielnachumdev/danielutils/actions/workflows/github-code-scanning/codeql/badge.svg)](https://github.com/danielnachumdev/danielutils/actions/workflows/github-code-scanning/codeql)
-# danielutils v=0.9.75
+# danielutils v=0.9.80
 A utils library for things that I find useful for my coding workflow.\
 Feel free to use and / or contribute / improve my code :)
 

{danielutils-0.9.77 → danielutils-0.9.80}/README.md

@@ -4,7 +4,7 @@
 [![Python 3.10.11](https://img.shields.io/badge/python-3.10.11-blue.svg)](https://www.python.org/downloads/release/python-31011/)
 [![gitleaks](https://github.com/danielnachumdev/danielutils/actions/workflows/gitleaks.yml/badge.svg)](https://github.com/danielnachumdev/danielutils/actions/workflows/gitleaks.yml)
 [![CodeQL](https://github.com/danielnachumdev/danielutils/actions/workflows/github-code-scanning/codeql/badge.svg)](https://github.com/danielnachumdev/danielutils/actions/workflows/github-code-scanning/codeql)
-# danielutils v=0.9.75
+# danielutils v=0.9.80
 A utils library for things that I find useful for my coding workflow.\
 Feel free to use and / or contribute / improve my code :)
 

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/abstractions/database/database.py

@@ -1,5 +1,5 @@
 from abc import ABC, abstractmethod
-from typing import Any, TypeVar, Generic, Optional
+from typing import Any, TypeVar, Generic, Optional, Set
 
 K = TypeVar('K')
 V = TypeVar('V')
@@ -12,7 +12,7 @@ class Database(ABC, Generic[K, V]):
     DEFAULT = None
 
     def __init__(self) -> None:
-        self._subscribers: set[Database] = set()
+        self._subscribers: Set[Database] = set()
 
     def _register_subscriber(self, subscriber: 'Database') -> None:
         self._subscribers.add(subscriber)

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/abstractions/multiprogramming/worker.py

@@ -1,11 +1,11 @@
 from threading import Thread
 from abc import ABC, abstractmethod
-from typing import Optional, Any,Tuple as t_tuple
+from typing import Optional, Any,Tuple as Tuple
 from logging import error
 import danielutils # this is explicitly this way to prevent circular import
 from ...reflection import get_python_version
 if get_python_version() >= (3, 9):
-    from builtins import tuple as t_tuple  # type:ignore
+    from builtins import tuple as Tuple  # type:ignore
 
 
 class Worker(ABC):
@@ -59,7 +59,7 @@ class Worker(ABC):
         """
         self.pool._notify_subscribers()  # pylint: disable=protected-access
 
-    def acquire(self) -> Optional[t_tuple[Any]]:
+    def acquire(self) -> Optional[Tuple[Any]]:
         """acquire a new job object to work on from the pool
         will return a tuple of only one object (the job) or None if there are no more jobs
         Returns:

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/abstractions/multiprogramming/worker_pool.py

@@ -1,11 +1,11 @@
 from queue import Queue
-from typing import Optional, Any, Type as t_type, Tuple as t_tuple, List as t_list
+from typing import Optional, Any, Type as t_type, Tuple as Tuple, List as List
 from threading import Semaphore
 from .worker import Worker
 from ...reflection import get_python_version
 
 if get_python_version() >= (3, 9):
-    from builtins import type as t_type, tuple as t_tuple, list as t_list  # type:ignore
+    from builtins import type as t_type, tuple as Tuple, list as List  # type:ignore
 
 
 class WorkerPool:
@@ -15,9 +15,9 @@ class WorkerPool:
     def __init__(self, num_workers: int, worker_class: t_type[Worker], w_kwargs: dict, global_variables: dict) -> None:
         self.num_workers = num_workers
         self.global_variables: dict = global_variables
-        self.q: Queue[t_tuple[Any]] = Queue()
+        self.q: Queue[Tuple[Any]] = Queue()
         self.worker_class = worker_class
-        self.workers: t_list[Worker] = []
+        self.workers: List[Worker] = []
         self.sem = Semaphore(0)
         self.w_kwargs = w_kwargs
 
@@ -34,7 +34,7 @@ class WorkerPool:
         self.q.put((job,))
         self.sem.release()
 
-    def _acquire(self) -> Optional[t_tuple[Any]]:
+    def _acquire(self) -> Optional[Tuple[Any]]:
         """acquire a new job from the pool
 
         Returns:

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/abstractions/repl.py

@@ -1,9 +1,9 @@
 import copy, re
-from typing import Any, Callable, Union, Tuple as t_tuple, List as t_list, Dict as t_dict
+from typing import Any, Callable, Union, Tuple as Tuple, List as List, Dict as Dict
 from ..reflection import get_python_version  # pylint :disable=relative-beyond-top-level
 
 if get_python_version() >= (3, 9):
-    from builtins import tuple as t_tuple, list as t_list, dict as t_dict  # type:ignore
+    from builtins import tuple as Tuple, list as List, dict as Dict  # type:ignore
 
 
 class Argument:
@@ -20,7 +20,7 @@ class Command:
     """
 
     def __init__(self, command: Union[Argument, str], callback: Callable,
-                 explanation: str = "", *, options: t_tuple[Argument, ...] = tuple()) -> None:
+                 explanation: str = "", *, options: Tuple[Argument, ...] = tuple()) -> None:
         self.command = command if isinstance(
             command, Argument) else Argument(command)
         self.callback = callback
@@ -41,10 +41,10 @@ class REPL:
     """
 
     # pylint: disable=dangerous-default-value
-    def __init__(self, routes: t_list[Command], *, prompt_symbol: str = ">>> ", exit_keywords: set = {"exit", "quit"}):
+    def __init__(self, routes: List[Command], *, prompt_symbol: str = ">>> ", exit_keywords: set = {"exit", "quit"}):
         self.prompt_symbol = prompt_symbol
         self.exit_keywords = copy.copy(exit_keywords)
-        self.routes: t_dict[str, Command] = {
+        self.routes: Dict[str, Command] = {
             com.command.name: com for com in routes}
 
     def run(self) -> None:

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/better_builtins/typed_builtins/factory.py

@@ -1,17 +1,17 @@
 import types
 from abc import abstractmethod
-from typing import Any, Iterable, List as t_list, Set as t_set, Dict as t_dict, Tuple as t_tuple
+from typing import Any, Iterable, List as List, Set as Set, Dict as Dict, Tuple as Tuple
 from ...functions import types_subseteq, isoftype
 from ...reflection import get_caller_name, get_python_version
 
 if get_python_version() >= (3, 9):
-    from builtins import list as t_list, set as t_set, dict as t_dict, tuple as t_tuple  # type:ignore
+    from builtins import list as List, set as Set, dict as Dict, tuple as Tuple  # type:ignore
 # needed for python 3.8
 class_to_type = {
-    list: t_list,
-    set: t_set,
-    dict: t_dict,
-    t_tuple: t_tuple,
+    list: List,
+    set: Set,
+    dict: Dict,
+    Tuple: Tuple,
 }
 
 

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/better_builtins/typed_builtins/tlist.py

@@ -7,7 +7,7 @@ from .factory import create_typed_class
 T = TypeVar("T", bound=Any)
 
 
-# class ptlist(t_list[T], Generic[T]):
+# class ptlist(List[T], Generic[T]):
 #     """like 'list' but with runtime type safety
 #     """
 
@@ -18,7 +18,7 @@ T = TypeVar("T", bound=Any)
 #     def __instancecheck__(self, instance: Any) -> bool:
 #         if isinstance(instance, ptlist):
 #             return types_subseteq(instance._params, self._params)
-#         return isoftype(instance, t_list[self._params])  # type: ignore
+#         return isoftype(instance, List[self._params])  # type: ignore
 
 #     def __init__(self, item) -> None:
 #         if not get_caller_name(0) == "__class_getitem__":

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/colors.py

@@ -17,7 +17,7 @@ class ColoredText:
     """
 
     @staticmethod  # type:ignore
-    @validate
+    @validate  # type:ignore
     def from_rgb(red: int, green: int, blue: int, text: str) -> str:
         """Applies an RGB color to the given text.
 

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/conversions/main_conversions.py

@@ -1,7 +1,7 @@
 from ..decorators import validate
 
 
-@validate
+@validate  # type:ignore
 def char_to_int(c: str) -> int:
     """convert char to its representing int value
 
@@ -14,7 +14,7 @@ def char_to_int(c: str) -> int:
     return ord(c)
 
 
-@validate
+@validate  # type:ignore
 def int_to_char(num: int) -> str:
     """convert int to its corresponding char
 
@@ -27,7 +27,7 @@ def int_to_char(num: int) -> str:
     return chr(num)
 
 
-@validate
+@validate  # type:ignore
 def hex_to_char(h: str) -> str:
     """convert hex number to char
 
@@ -40,7 +40,7 @@ def hex_to_char(h: str) -> str:
     return int_to_char(hex_to_dec(h))
 
 
-@validate
+@validate  # type:ignore
 def hex_to_dec(h: str) -> int:
     """convert hex to dec
 
@@ -53,7 +53,7 @@ def hex_to_dec(h: str) -> int:
     return int(h, 16)
 
 
-@validate
+@validate  # type:ignore
 def char_to_hex(c: str) -> str:
     """convert char to hex
 
@@ -66,7 +66,7 @@ def char_to_hex(c: str) -> str:
     return int_to_hex(char_to_int(c))
 
 
-@validate
+@validate  # type:ignore
 def dec_to_hex(num: int) -> str:
     """convert decimal number to hex
 
@@ -79,7 +79,7 @@ def dec_to_hex(num: int) -> str:
     return int_to_hex(num)
 
 
-@validate
+@validate  # type:ignore
 def int_to_hex(num: int) -> str:
     """converts an int to it's hex representation
 
@@ -92,7 +92,7 @@ def int_to_hex(num: int) -> str:
     return hex(num)
 
 
-@validate
+@validate  # type:ignore
 def bytes_to_str(b: bytes) -> str:
     """decodes bytes to str
 
@@ -105,7 +105,7 @@ def bytes_to_str(b: bytes) -> str:
     return b.decode("utf-8")
 
 
-@validate
+@validate  # type:ignore
 def str_to_bytes(s: str) -> bytes:
     """encodes a string to bytes
 

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/conversions/specialized_conversions/to_int.py

@@ -1,12 +1,12 @@
 """functions that convert values to int"""
-from typing import Union, List as t_list
+from typing import Union, List as List
 from ..main_conversions import char_to_int
 from ...reflection import get_python_version
 if get_python_version() >= (3, 9):
-    from builtins import list as t_list
+    from builtins import list as List
 
 
-def to_int(value: str) -> Union[int, t_list[int]]:
+def to_int(value: str) -> Union[int, List[int]]:
     """converts a single character or a full string to an int or list of int respectively
     """
     if len(value) == 1:

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/data_structures/graph/graph.py

@@ -1,11 +1,11 @@
-from typing import Optional, Generator, List as t_list, Set as t_set, Dict as t_dict, Generic, \
+from typing import Optional, Generator, List as List, Set as Set, Dict as Dict, Generic, \
     TypeVar, Iterable, Iterator
 from ..queue import Queue
 from .multinode import MultiNode
 from ...reflection import get_python_version
 
 if get_python_version() >= (3, 9):
-    from builtins import list as t_list, set as t_set, dict as t_dict
+    from builtins import list as List, set as Set, dict as Dict
 
 T = TypeVar("T")
 
@@ -16,11 +16,11 @@ class Graph(Generic[T]):
     This class represents a directed graph, where nodes can be connected through edges.
 
     Attributes:
-        nodes (Optional[t_list[MultiNode]]): A list of MultiNode instances representing the nodes in the graph.
+        nodes (Optional[List[MultiNode]]): A list of MultiNode instances representing the nodes in the graph.
                                              Default is an empty list.
 
     Methods:
-        __init__(self, nodes: Optional[t_list[MultiNode]] = None): Initialize the Graph with given nodes.
+        __init__(self, nodes: Optional[List[MultiNode]] = None): Initialize the Graph with given nodes.
         add_node(self, node): Add a node to the graph.
         _extended_dfs(self) -> Generator: Perform an extended depth-first search on the graph.
         dfs(self) -> Generator: Perform a depth-first search on the graph.
@@ -30,13 +30,13 @@ class Graph(Generic[T]):
 
     """
 
-    def to_dict(self) -> t_dict[T, t_set[T]]:
+    def to_dict(self) -> Dict[T, Set[T]]:
         """
         converts the graph to a dictionary.
         Returns:
             dict: A dictionary representing the graph.
         """
-        dct: t_dict[T, t_set[T]] = {}
+        dct: Dict[T, Set[T]] = {}
         for node in self:
             v = dct.get(node.data, set())
             for child in node:
@@ -45,7 +45,7 @@ class Graph(Generic[T]):
         return dct
 
     @staticmethod
-    def from_dict(dct: t_dict[T, Iterable[T]]) -> "Graph[T]":
+    def from_dict(dct: Dict[T, Iterable[T]]) -> "Graph[T]":
         """
         converts a dictionary to a graph.
         Args:
@@ -55,7 +55,7 @@ class Graph(Generic[T]):
             Graph[T]: A graph representing the given dictionary.
         """
         g: Graph[T] = Graph()
-        seen: t_dict[T, MultiNode[T]] = {}
+        seen: Dict[T, MultiNode[T]] = {}
         for k, v in dct.items():
             seen[k] = seen.get(k, MultiNode(k))
 
@@ -66,8 +66,8 @@ class Graph(Generic[T]):
             g.add_node(seen[k])
         return g
 
-    def __init__(self, nodes: Optional[t_list[MultiNode[T]]] = None):
-        self.nodes: t_list[MultiNode[T]] = nodes if nodes is not None else []
+    def __init__(self, nodes: Optional[List[MultiNode[T]]] = None):
+        self.nodes: List[MultiNode[T]] = nodes if nodes is not None else []
 
     def add_node(self, node: MultiNode[T]) -> None:
         """Add a node to the graph.
@@ -77,7 +77,7 @@ class Graph(Generic[T]):
         """
         self.nodes.append(node)
 
-    def _extended_dfs(self) -> Generator[MultiNode[T], None, t_list[MultiNode[T]]]:
+    def _extended_dfs(self) -> Generator[MultiNode[T], None, List[MultiNode[T]]]:
         """Perform an extended depth-first search on the graph.
 
         This private method performs an extended depth-first search (DFS) on the graph,
@@ -91,7 +91,7 @@ class Graph(Generic[T]):
         enter_times: dict = {}
         exit_times: dict = {}
         travel_index: int = 1
-        all_nodes: t_list[MultiNode] = []
+        all_nodes: List[MultiNode] = []
 
         def handle_node(node: MultiNode[T]) -> Generator[MultiNode[T], None, None]:
             nonlocal travel_index
@@ -143,7 +143,7 @@ class Graph(Generic[T]):
         """
         yield from self._extended_dfs()
 
-    def topological_sort(self) -> t_list[MultiNode[T]]:
+    def topological_sort(self) -> List[MultiNode[T]]:
         """Get a topological sort of the graph nodes.
 
         This method performs a topological sort on the graph using the private _extended_dfs method.
@@ -169,7 +169,7 @@ class Graph(Generic[T]):
         q: Queue[MultiNode[T]] = Queue()
         for node in self.nodes:
             q.push(node)
-        seen: t_set[MultiNode] = set()
+        seen: Set[MultiNode] = set()
         for node in q:
             if node not in seen:
                 seen.add(node)

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/data_structures/graph/multinode.py

@@ -1,9 +1,9 @@
-from typing import Optional, Generator, TypeVar, Generic, List as t_list
+from typing import Optional, Generator, TypeVar, Generic, List as List
 
 from ...reflection import get_python_version
 
 if get_python_version() >= (3, 9):
-    from builtins import list as t_list
+    from builtins import list as List
 T = TypeVar("T")
 
 
@@ -11,9 +11,9 @@ class MultiNode(Generic[T]):
     """A node class with no limit to children amount
     """
 
-    def __init__(self, data: T, children: Optional[t_list[Optional['MultiNode[T]']]] = None):
+    def __init__(self, data: T, children: Optional[List[Optional['MultiNode[T]']]] = None):
         self.data: T = data
-        self._children: t_list[Optional[MultiNode[T]]] = children if children is not None else []
+        self._children: List[Optional[MultiNode[T]]] = children if children is not None else []
 
     def __getitem__(self, index) -> T:
         return self._children[index]

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/data_structures/queue/queue.py

@@ -1,8 +1,8 @@
-from typing import Generic, TypeVar, Iterator, List as t_list
+from typing import Generic, TypeVar, Iterator, List as List
 from ...reflection import get_python_version
 
 if get_python_version() >= (3, 9):
-    from builtins import list as t_list
+    from builtins import list as List
 T = TypeVar("T")
 
 
@@ -57,7 +57,7 @@ class Queue(Generic[T]):
     def __iter__(self) -> Iterator[T]:
         return iter(self.data)
 
-    def push_many(self, arr: t_list[T]):
+    def push_many(self, arr: List[T]):
         """will push many objects to the Queue
 
         Args:

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/data_structures/trees/binary_syntax_tree.py

@@ -1,9 +1,9 @@
-from typing import Union, Any, Callable,Dict as t_dict
+from typing import Union, Any, Callable,Dict as Dict
 from .binary_tree import BinaryTree
 from ..graph import BinaryNode
 from ...reflection import get_python_version
 if get_python_version()>=(3,9):
-    from builtins import dict as t_dict
+    from builtins import dict as Dict
 
 class BinarySyntaxTree(BinaryTree):
     """
@@ -11,7 +11,7 @@ class BinarySyntaxTree(BinaryTree):
     """
 
     @staticmethod
-    def _evaluate_node(v: BinaryNode, operator_func_dict: t_dict[Any, Callable[[Any, Any], Any]]):
+    def _evaluate_node(v: BinaryNode, operator_func_dict: Dict[Any, Callable[[Any, Any], Any]]):
         if not isinstance(v, BinaryNode) or v.left is None and v.right is None:
             return v
 
@@ -74,7 +74,7 @@ class BinarySyntaxTree(BinaryTree):
     def __reversed__(self) -> "BinarySyntaxTree":
         return self.reverse()
 
-    def evaluate(self, operator_func_dict: t_dict[Any, Callable[[Any, Any], Any]]) -> Any:
+    def evaluate(self, operator_func_dict: Dict[Any, Callable[[Any, Any], Any]]) -> Any:
         return BinarySyntaxTree._evaluate_node(self.root, operator_func_dict)
 
 

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/date.py

@@ -2,7 +2,7 @@ import json
 from .decorators import validate
 
 
-@validate
+@validate  # type:ignore # type:ignore
 def dict_to_json(dct: dict) -> str:
     """converts a python dict to a json object
 
@@ -15,7 +15,7 @@ def dict_to_json(dct: dict) -> str:
     return json.dumps(dct, indent=4)
 
 
-@validate
+@validate  # type:ignore
 def json_to_dict(json_str: str) -> dict:
     """converts a json object from a string to a python dict
 

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/decorators/atomic.py

@@ -10,7 +10,7 @@ P = ParamSpec("P")
 FuncT = Callable[P, T]  # type:ignore
 
 
-@validate
+@validate  # type:ignore
 def atomic(func: FuncT) -> FuncT:
     """will make function thread safe by making it
     accessible for only one thread at one time

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/decorators/attach.py

@@ -8,7 +8,7 @@ P = ParamSpec("P")
 FuncT = Callable[P, T]  # type:ignore
 
 
-@validate(strict=False)
+@validate  # type:ignore(strict=False)
 def attach(before: Optional[Callable] = None, after: Optional[Callable] = None) -> Callable[[FuncT], FuncT]:
     """attaching functions to a function
 

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/decorators/decorate_conditionally.py

@@ -3,7 +3,7 @@ from typing import Callable, Optional, Union
 from .validate import validate
 
 
-@validate(strict=False)
+@validate  # type:ignore(strict=False)
 def decorate_conditionally(decorator: Callable, predicate: Union[bool, Callable[[], bool]], *,
                            decorator_args: Optional[list] = None, decorator_kwargs: Optional[dict] = None):
     """will decorate a function iff the predicate is True or returns True

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/decorators/limit_recursion.py

@@ -11,7 +11,7 @@ P = ParamSpec("P")
 FuncT = Callable[P, T]  # type:ignore
 
 
-@validate
+@validate  # type:ignore
 def limit_recursion(max_depth: int, return_value: Any = None, quiet: bool = True) -> Callable[[FuncT], FuncT]:
     """decorator to limit recursion of functions
 

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/decorators/memo.py

@@ -1,22 +1,22 @@
 import functools
-from typing import Callable, Any, TypeVar, Dict as t_dict
+from typing import Callable, Any, TypeVar, Dict
 from copy import deepcopy
 from .validate import validate
-from ..versioned_imports import ParamSpec, t_dict
+from ..versioned_imports import ParamSpec
 
 T = TypeVar("T")
 P = ParamSpec("P")
 FuncT = Callable[P, T]  # type:ignore
 
 
-@validate
+@validate  # type:ignore
 def memo(func: FuncT) -> FuncT:
     """decorator to memorize function calls in order to improve performance by using more memory
 
     Args:
         func (Callable): function to memorize
     """
-    cache: t_dict[tuple, Any] = {}
+    cache: Dict[tuple, Any] = {}
 
     @functools.wraps(func)
     def wrapper(*args, **kwargs):

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/decorators/overload.py

@@ -1,11 +1,11 @@
-from typing import Callable, cast, Any, TypeVar, Dict as t_dict, List as t_list
+from typing import Callable, cast, Any, TypeVar, Dict
 import inspect
 import functools
 from ..reflection import is_function_annotated_properly
 from ..functions import isoftype, isoneof, isoneof_strict
 from ..exceptions import OverloadDuplication, OverloadNotFound
 from .deprecate import deprecate
-from ..versioned_imports import ParamSpec, t_dict, t_list
+from ..versioned_imports import ParamSpec
 
 T = TypeVar("T")
 P = ParamSpec("P")
@@ -14,7 +14,7 @@ T2 = TypeVar("T2")
 P2 = ParamSpec("P2")
 FuncT2 = Callable[P2, T2]  # type:ignore
 
-__overload_dict: t_dict[str, t_dict[tuple, Callable]] = {}
+__overload_dict: Dict[str, Dict[tuple, Callable]] = {}
 
 
 @deprecate("'explicit_global_overload' is a legacy decorator please use 'overload' instead")
@@ -122,7 +122,7 @@ class overload:
         overload._validate(func)
         self._qualname = func.__qualname__
         self._moudle = func.__module__
-        self._functions: t_dict[int, t_list[Callable]] = {}
+        self._functions: Dict[int, Dict[Callable]] = {}
         self._functions[overload._get_key(func)] = [func]
         functools.wraps(func)(self)
 

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/decorators/partially_implemented.py

@@ -9,7 +9,7 @@ P = ParamSpec("P")
 FuncT = Callable[P, T]  # type:ignore
 
 
-@validate
+@validate  # type:ignore
 def PartiallyImplemented(func: FuncT) -> FuncT:
     """decorator to mark function as not fully implemented for development purposes
 

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/decorators/timeout.py

@@ -9,7 +9,7 @@ P = ParamSpec("P")
 FuncT = Callable[P, T]  # type:ignore
 
 
-@validate
+@validate  # type:ignore
 def timeout(duration: Union[int, float], silent: bool = False) -> Callable[[FuncT], FuncT]:
     """A decorator to limit runtime for a function
 

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/decorators/total_ordering.py

@@ -1,4 +1,4 @@
-from typing import Callable, Union, Any
+from typing import Callable, Any, Dict, List
 
 
 def is_default_implementation(func: Callable) -> bool:
@@ -10,7 +10,7 @@ def usable(func: Callable) -> bool:
 
 
 def total_ordering(cls: type) -> type:
-    funcs: dict[str, Callable[[Any, Any], Any]] = {
+    funcs: Dict[str, Callable[[Any, Any], Any]] = {
         '__eq__': getattr(cls, '__eq__'),
         '__ne__': getattr(cls, '__ne__'),
         '__gt__': getattr(cls, '__gt__'),
@@ -18,11 +18,11 @@ def total_ordering(cls: type) -> type:
         '__lt__': getattr(cls, '__lt__'),
         '__le__': getattr(cls, '__le__'),
     }
-    g1: list[Callable[[Any, Any], Any]] = [funcs["__eq__"], funcs["__ne__"]]
+    g1: List[Callable[[Any, Any], Any]] = [funcs["__eq__"], funcs["__ne__"]]
     u1 = any(map(usable, g1))
-    g2: list[Callable[[Any, Any], Any]] = [funcs["__ge__"], funcs["__gt__"]]
+    g2: List[Callable[[Any, Any], Any]] = [funcs["__ge__"], funcs["__gt__"]]
     u2 = any(map(usable, g2))
-    g3: list[Callable[[Any, Any], Any]] = [funcs["__lt__"], funcs["__le__"]]
+    g3: List[Callable[[Any, Any], Any]] = [funcs["__lt__"], funcs["__le__"]]
     u3 = any(map(usable, g3))
     if sum(map(int, [u1, u2, u3])) < 2:
         raise ValueError("There are not enough functions from different groups implemented")

{danielutils-0.9.77 → danielutils-0.9.80}/danielutils/decorators/validate.py

@@ -199,7 +199,7 @@ def validate(strict: Union[FuncT, bool] = True) -> FuncT:
 #     return result
 # return wrapper
 
-# @validate
+# @validate  # type:ignore
 # def NotImplemented(func: Callable) -> Callable:
 #     """decorator to mark function as not implemented for development purposes