Z0Z-tools 2.2.2__tar.gz → 2.2.3__tar.gz

{z0z_tools-2.2.2/Z0Z_tools.egg-info → z0z_tools-2.2.3}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: Z0Z_tools
-Version: 2.2.2
+Version: 2.2.3
 Summary: Typing, documenting, and improving toolz and cytoolz.
 Author-email: Hunter Hogan <HunterHogan@pm.me>
 License-Expression: CC-BY-NC-4.0
@@ -35,6 +35,8 @@ Provides-Extra: development
 Requires-Dist: astToolkit; extra == "development"
 Requires-Dist: hunterMakesPy; extra == "development"
 Requires-Dist: pytest-cov; extra == "development"
+Requires-Dist: cython>=3.0; extra == "development"
+Requires-Dist: setuptools>=74.1.0; extra == "development"
 Provides-Extra: testing
 Requires-Dist: pytest; extra == "testing"
 Dynamic: license-file
@@ -90,6 +92,13 @@ from humpy_cytoolz.curried import operator
 pip install Z0Z_tools
 ```
 
+## Sources
+
+1. [toolz](https://github.com/pytoolz/toolz)
+2. [cytoolz](https://github.com/pytoolz/cytoolz)
+3. [toolz-stubs](https://github.com/mgrinshpon/toolz-stubs)
+4. [cytoolz-stubs](https://github.com/OutSquareCapital/cytoolz-stubs)
+
 ## My recovery
 
 [![Static Badge](https://img.shields.io/badge/2011_August-Homeless_since-blue?style=flat)](https://HunterThinks.com/support)

{z0z_tools-2.2.2 → z0z_tools-2.2.3}/README.md

@@ -49,6 +49,13 @@ from humpy_cytoolz.curried import operator
 pip install Z0Z_tools
 ```
 
+## Sources
+
+1. [toolz](https://github.com/pytoolz/toolz)
+2. [cytoolz](https://github.com/pytoolz/cytoolz)
+3. [toolz-stubs](https://github.com/mgrinshpon/toolz-stubs)
+4. [cytoolz-stubs](https://github.com/OutSquareCapital/cytoolz-stubs)
+
 ## My recovery
 
 [![Static Badge](https://img.shields.io/badge/2011_August-Homeless_since-blue?style=flat)](https://HunterThinks.com/support)

z0z_tools-2.2.3/Z0Z_tools/__init__.py

@@ -0,0 +1,11 @@
+"""Filesystem helpers for Z0Z_tools.
+
+The repository also distributes the top-level `humpy_toolz`, `humpy_cytoolz`, and `humpy_tlz`
+packages.
+"""
+
+from __future__ import annotations
+
+from Z0Z_tools.functionsNeedAHome import (
+	between吗 as between吗, consecutive吗 as consecutive吗, DOTitems as DOTitems, DOTkeys as DOTkeys, DOTvalues as DOTvalues, exclude as exclude,
+	reverseLookup as reverseLookup, thisHasThat吗 as thisHasThat吗, thisNotHaveThat吗 as thisNotHaveThat吗)

z0z_tools-2.2.3/Z0Z_tools/functionsNeedAHome.py

@@ -0,0 +1,236 @@
+# ruff: noqa: DOC201, D100, D103
+from __future__ import annotations
+
+from collections.abc import Hashable, Sequence
+from humpy_cytoolz import curry as syntacticCurry
+from hunterMakesPy import Ordinals
+from more_itertools import extract
+from operator import eq
+from typing import TYPE_CHECKING, TypeVar
+
+if TYPE_CHECKING:
+	from collections.abc import Container, Iterable, Iterator, Mapping
+	from typing import Any
+
+小于 = TypeVar("小于", bound=Ordinals)
+个 = TypeVar("个")
+文件 = TypeVar("文件", bound=Hashable)
+文义 = TypeVar("文义")
+
+#======== Boolean antecedents ================================================
+
+@syntacticCurry
+def between吗(floor: 小于, ceiling: 小于, comparand: 小于) -> bool:
+	"""Inclusive `floor <= comparand <= ceiling`."""
+	return floor <= comparand <= ceiling
+
+def consecutive吗(flatContainer: Sequence[int]) -> bool:
+	"""Are the integers in `flatContainer` consecutive, either ascending or descending?"""
+	difference: int = flatContainer[-1] - flatContainer[0]
+	direction: int = (difference > 0) - (difference < 0)
+	ImaRangeOfInt = range(flatContainer[0], flatContainer[-1] + direction, direction)
+	return (abs(difference) == (len(flatContainer) - 1)) and (all(map(eq, flatContainer, ImaRangeOfInt)))
+
+@syntacticCurry
+def thisHasThat吗(this: Container[个], that: 个) -> bool:
+	"""You can test whether `that` is present in `this`.
+
+	You can use `thisHasThat` in an `if` statement, or you can pass `thisHasThat` as a
+	predicate to a filtering utility described in the module docstring.
+
+	Parameters
+	----------
+	this : Container[个]
+		Container to search.
+	that : 个
+		Value to find.
+
+	Returns
+	-------
+	thatIsPresent : bool
+		`True` if `that in this`.
+
+	References
+	----------
+	[1] `operator.contains` (Python documentation)
+		https://docs.python.org/3/library/operator.html#operator.contains
+
+	"""
+	return that in this
+
+@syntacticCurry
+def thisNotHaveThat吗(this: Container[个], that: 个) -> bool:
+	return not thisHasThat吗(this, that)
+
+#======== Filtering functions ================================================
+
+def exclude(flatContainer: Sequence[个], indices: Iterable[int]) -> Iterator[个]:
+	"""Yield items from `flatContainer` whose positions are not in `indices`."""
+	lengthIterable: int = len(flatContainer)
+
+	def normalizeIndex(index: int) -> int:
+		if index < 0:
+			index = (index + lengthIterable) % lengthIterable
+		return index
+	indicesInclude: list[int] = sorted(set(range(lengthIterable)).difference(map(normalizeIndex, indices)))
+	return extract(flatContainer, indicesInclude)
+
+#======== Disaggregation and deconstruction functions ================================================
+
+def DOTitems(dictionary: Mapping[文件, 文义], /) -> Iterator[tuple[文件, 文义]]:
+	"""Create an `Iterator` of key-value pairs from a mapping.
+
+	You can use this function to convert `dictionary.items()` into an `Iterator` that you can
+	pass to functions requiring iterators rather than views. The function is analogous to
+	`dict.items()` [1] but returns an `Iterator` instead of a dictionary view.
+
+	Parameters
+	----------
+	dictionary : Mapping[文件, 文义]
+		Source mapping from which to extract key-value pairs.
+
+	Returns
+	-------
+	aRiverOfItems : Iterator[tuple[文件, 文义]]
+		`Iterator` yielding each `(key, value)` pair from `dictionary`.
+
+	Examples
+	--------
+	The function is used to initialize iteration queues from filtered dictionaries.
+
+		dequePileLeaf: deque[tuple[Pile, Leaf]] = deque(sorted(DOTitems(valfilter(mappingHasKey(dictionaryConditionalLeafPredecessors),
+			leavesPinned))))
+
+	The function is used to create sorted item sequences for triple-wise processing.
+
+		piles3consecutive: deque[tuple[tuple[Pile, LeafSpace], tuple[Pile, LeafSpace], tuple[Pile, LeafSpace]]] = deque(triplewise(sorted(DOTitems(permutationSpace))))
+
+	References
+	----------
+	[1] Mapping.items() - Python documentation
+		https://docs.python.org/3/library/stdtypes.html#dict.items
+
+	"""
+	return iter(dictionary.items())
+
+def DOTkeys(dictionary: Mapping[个, Any], /) -> Iterator[个]:
+	"""Create an `Iterator` of keys from a mapping.
+
+	You can use this function to convert `dictionary.keys()` into an `Iterator` that you can
+	pass to functions requiring iterators rather than views. The function is analogous to
+	`dict.keys()` [1] but returns an `Iterator` instead of a dictionary view.
+
+	Parameters
+	----------
+	dictionary : Mapping[个, Any]
+		Source mapping from which to extract keys.
+
+	Returns
+	-------
+	aRiverOfKeys : Iterator[个]
+		`Iterator` yielding each key from `dictionary`.
+
+	Examples
+	--------
+	The function is used to extract keys for dictionary dissociation.
+
+		return (leavesPinned, dissociatePiles(permutationSpace, *DOTkeys(leavesPinned)))
+
+	The function is used to identify leaves with singleton domains.
+
+		leavesWithDomainOf1: set[Leaf] = set(DOTkeys(valfilter((1).__eq__, leafAndItsDomainSize))).difference(leavesPinned.values()).difference([state.leavesTotal])
+
+	References
+	----------
+	[1] Mapping.keys() - Python documentation
+		https://docs.python.org/3/library/stdtypes.html#dict.keys
+
+	"""
+	return iter(dictionary.keys())
+
+def DOTvalues(dictionary: Mapping[Any, 个], /) -> Iterator[个]:
+	"""Create an `Iterator` of values from a mapping.
+
+	You can use this function to convert `dictionary.values()` into an `Iterator` that you can
+	pass to functions requiring iterators rather than views. The function is analogous to
+	`dict.values()` [1] but returns an `Iterator` instead of a dictionary view.
+
+	Parameters
+	----------
+	dictionary : Mapping[Any, 个]
+		Source mapping from which to extract values.
+
+	Returns
+	-------
+	aRiverOfValues : Iterator[个]
+		`Iterator` yielding each value from `dictionary`.
+
+	Examples
+	--------
+	The function is used to extract leaf domains for anti-option computation.
+
+		if not (permutationSpace := _reducePileRangesOfLeaves(state, permutationSpace, deque(pilesUndetermined.items()), makeLeafAntiOptions(state.leavesTotal, DOTvalues(leavesPinned)))):
+
+	The function is used to count leaf occurrences across domains.
+
+		leafAndItsDomainSize: Counter[Leaf] = Counter(chain(chain.from_iterable(map(getIteratorOfLeaves, DOTvalues(pilesUndetermined))), DOTvalues(leavesPinned)))
+
+	The function is used to extract folding sequences from pinned leaves.
+
+		folding = tuple(DOTvalues(extractPinnedLeaves(permutationSpace)))
+
+	References
+	----------
+	[1] Mapping.values() - Python documentation
+		https://docs.python.org/3/library/stdtypes.html#dict.values
+
+	"""
+	return iter(dictionary.values())
+
+def reverseLookup(dictionary: dict[文件, 文义], keyValue: 文义) -> 文件 | None:
+	"""Find the key in a dictionary that maps to a specified value.
+
+	You can use this function to perform reverse dictionary lookup: given a value, find the
+	key that maps to that value. The function iterates through `dictionary.items()` [1] and
+	returns the first key where `dictionary[key] == keyValue`. When no matching key exists,
+	the function returns `None`.
+
+	Parameters
+	----------
+	dictionary : dict[文件, 文义]
+		Dictionary to search for `keyValue`.
+	keyValue : 文义
+		Value to locate in `dictionary.values()`.
+
+	Returns
+	-------
+	keyOrNone : 文件 | None
+		The key that maps to `keyValue`, or `None` when no key maps to `keyValue`.
+
+	Examples
+	--------
+	The function is used to find which pile contains a specific leaf.
+
+		pileOfLeaf一零: Pile = raiseIfNone(reverseLookup(state.permutationSpace, leaf一零))
+		pileOfLeaf首零一: Pile = raiseIfNone(reverseLookup(state.permutationSpace, leaf首零一))
+
+	Important
+	---------
+	The function assumes all values in `dictionary` are distinct. When multiple keys map to
+	`keyValue`, the function returns an arbitrary matching key (whichever appears first during
+	iteration). The function is not efficient for membership testing: use `keyValue in dictionary.values()`
+	instead. When you expect a key to exist, combine with `raiseIfNone` [2] rather than checking
+	for `None`.
+
+	References
+	----------
+	[1] dict.items() - Python documentation
+		https://docs.python.org/3/library/stdtypes.html#dict.items
+	[2] hunterMakesPy.raiseIfNone - Context7
+		https://context7.com/hunterhogan/huntermakespy
+
+	"""
+	for key, value in dictionary.items():
+		if value == keyValue:
+			return key
+	return None

{z0z_tools-2.2.2 → z0z_tools-2.2.3/Z0Z_tools.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: Z0Z_tools
-Version: 2.2.2
+Version: 2.2.3
 Summary: Typing, documenting, and improving toolz and cytoolz.
 Author-email: Hunter Hogan <HunterHogan@pm.me>
 License-Expression: CC-BY-NC-4.0
@@ -35,6 +35,8 @@ Provides-Extra: development
 Requires-Dist: astToolkit; extra == "development"
 Requires-Dist: hunterMakesPy; extra == "development"
 Requires-Dist: pytest-cov; extra == "development"
+Requires-Dist: cython>=3.0; extra == "development"
+Requires-Dist: setuptools>=74.1.0; extra == "development"
 Provides-Extra: testing
 Requires-Dist: pytest; extra == "testing"
 Dynamic: license-file
@@ -90,6 +92,13 @@ from humpy_cytoolz.curried import operator
 pip install Z0Z_tools
 ```
 
+## Sources
+
+1. [toolz](https://github.com/pytoolz/toolz)
+2. [cytoolz](https://github.com/pytoolz/cytoolz)
+3. [toolz-stubs](https://github.com/mgrinshpon/toolz-stubs)
+4. [cytoolz-stubs](https://github.com/OutSquareCapital/cytoolz-stubs)
+
 ## My recovery
 
 [![Static Badge](https://img.shields.io/badge/2011_August-Homeless_since-blue?style=flat)](https://HunterThinks.com/support)

{z0z_tools-2.2.2 → z0z_tools-2.2.3}/Z0Z_tools.egg-info/SOURCES.txt

@@ -4,6 +4,7 @@ LICENSE-Welch
 README.md
 pyproject.toml
 Z0Z_tools/__init__.py
+Z0Z_tools/functionsNeedAHome.py
 Z0Z_tools/py.typed
 Z0Z_tools.egg-info/PKG-INFO
 Z0Z_tools.egg-info/SOURCES.txt

{z0z_tools-2.2.2 → z0z_tools-2.2.3}/Z0Z_tools.egg-info/requires.txt

@@ -4,6 +4,8 @@ typing_extensions>=4.10.0
 astToolkit
 hunterMakesPy
 pytest-cov
+cython>=3.0
+setuptools>=74.1.0
 
 [testing]
 pytest