renew project

Author: linjing-lab

README.md

@@ -98,6 +98,7 @@ By the way, I didn't complete all the iterative data types, in order to develop
 - [sortingx-1.2.2](https://github.com/linjing-lab/sorting-algorithms/tree/v1.2.2) is the package that support `range`, `zip`, `dict_keys`, `dict_values`, `dict_items` additionally, you can choose what suitable data you want to input.
 - [sortingx-1.2.3](https://github.com/linjing-lab/sorting-algorithms/tree/v1.2.3) is the package that corrected the situation where elements are equal in `compare`, support more input data, like data as `[['Jack', (98, 100)], ['Bob', (98, 99)], ['Jessi', (98, 97)]]` and key as `lambda x: x[1][0]`.
 - [sortingx-1.3.0](https://github.com/linjing-lab/sorting-algorithms/tree/v1.3.0) is the final version that fully aligned with the `sorted`', reduces redundant data exchanging. like data as `[('Alex', 97, 90, 98, 95), ('Jack', 97, 88, 98, 92), ('Peter', 92, 95, 92, 96), ('Li', 97, 89, 98, 92)]` and key as `key=lambda x: x[1]`.
+- [sortingx-1.3.1](https://github.com/linjing-lab/sorting-algorithms/tree/v1.3.1) is the improved version from v1.3.0, and pre-operations from `_utils` are more conise to reduce shallow copy in Runtime.
 
 refer to [this](./README_release.md) for downloaded info.
 

README_release.md

@@ -13,6 +13,7 @@
 |v1.2.2|`pip install sortingx==1.2.2`|Change Convert Function to Make it More Robust|√|
 |v1.2.3|`pip install sortingx==1.2.3`|Add Verify Function to Solve Comparison of Equal|√|
 |v1.3.0|`pip install sortingx==1.3.0`|Revamp Redundant Data Exchanging About Equal Elements|√|
+|v1.3.1|`pip install sortingx==1.3.1`|Reduce Shallow Replication in Pre-operations during Runtime|√|
 
 </div>
 

sortingx/__init__.py

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

sortingx/_utils.py

@@ -22,8 +22,7 @@ def generate(__iterable: List[_T], key: Optional[Callable[[_T], SupportsRichComp
 
     :return: data generated by map.
     '''
-    compare: List[_T] = list(map(key, __iterable)) if key != None else __iterable
-    return compare
+    return list(map(key, __iterable)) if key != None else __iterable
 
 # Verify Elements Are Equal before Comparison.
 def verify(compare: List[_T]) -> bool:
@@ -41,6 +40,4 @@ def convert(__iterable: Iterable[_T]) -> List[_T]:
 
     :return: converted result in a list.
     '''
-    if isinstance(__iterable, list): # represents unifying data as list, not refer to allowing some input that is not suitable for sorting.
-        return __iterable
-    return list(__iterable) # iterable data (except list) are convert to list.
+    return __iterable if isinstance(__iterable, list) else list(__iterable) # iterable data (except list) are converted to list.

test_.py

@@ -16,6 +16,6 @@ def __repr__(self):
     Student('Peter', 'B', 10),
 )
 
-output = sorted(student_objects, key=attrgetter('grade', 'age'))
-test = six.merge(student_objects, key=attrgetter('grade', 'age'))
+output = sorted(student_objects, key=attrgetter('age'))
+test = six.merge(student_objects, key=attrgetter('age'))
 print(test, '\n', output)