renew project

Author: linjing-lab

README.md

@@ -89,7 +89,8 @@ explain:
 - sortingx-1.1.0 is the first version aligned with the `list.sort()` usage method.
 - sortingx-1.1.1 is the first stable version accelerated with typing_extensions.
 - sortingx-1.1.2 is the first stable version that has a return value and extends the iterable data types.
-- sortingx-1.1.3 is the stable version that complete the typing of local variables and align with `sorted()` usage method.
+- sortingx-1.1.3 is the version that complete the typing of local variables and align with `sorted()` usage method.
+- sortingx-1.2.0 is the end version of sorting series, which optimize the kernel of generate.
 
 ## LICENSE
 

README_release.md

@@ -8,5 +8,6 @@
 |v1.1.1|`pip install sortingx==1.1.1`|Complete Typing and Accelerate|√|
 |v1.1.2|`pip install sortingx==1.1.2`|Support More Iterative Data Types|√|
 |v1.1.3|`pip install sortingx==1.1.3`|Typing Check with More Local Variables|√|
+|v1.2.0|`pip install sortingx==1.2.0`|Optimize Generate Function's Kernel|√|
 
 </div>

sortingx/__init__.py

@@ -16,6 +16,6 @@
 
 from .sorting import bubble, insert, shell, heap, quick, merge
 
-__version__ = '1.1.3'
+__version__ = '1.2.0'
 
 assert sys.version_info >= (3, 7, 0)

sortingx/_utils.py

@@ -17,7 +17,7 @@
 # Data Generated by Mapping.
 def generate(__iterable: List[_T], key: Optional[Callable[[_T], SupportsRichComparison]]=None) -> List[_T]:
     compare: List[_T] = list(map(key, __iterable)) if key != None else __iterable
-    compare: List[_T] = ([[value] for value in compare] if (compare and not isinstance(compare[0], Iterable)) else compare) if key != None else __iterable
+    compare: List[_T] = ([[value] for value in compare] if (compare and not isinstance(compare[0], (list, tuple))) else compare) if key != None else __iterable
     return compare
 
 # Redefined Comparison Rules: A High-Speed State Selection Function.

sortingx/sorting.py

@@ -86,7 +86,6 @@ def shell(__iterable: Iterable[_T], key: Optional[Callable[[_T], SupportsRichCom
         gap: int = int(gap / 3)
     return __iterable
 
-
 def heap(__iterable: Iterable[_T], key: Optional[Callable[[_T], SupportsRichComparison]]=None, reverse: bool=False) -> List[_T]:
     '''
     :param __iterable: iterable data.