Skip to content

Commit

Permalink
Increase to v1.2.1
Browse files Browse the repository at this point in the history
  • Loading branch information
cleoold committed Jun 2, 2023
1 parent c26c8ba commit 1b08397
Show file tree
Hide file tree
Showing 9 changed files with 26 additions and 18 deletions.
12 changes: 6 additions & 6 deletions doc/api/more/types_linq.more.more_enumerable.md
Original file line number Diff line number Diff line change
Expand Up @@ -434,7 +434,7 @@ Example
```

Revisions
~ main: Added method parameter to support more ranking methods.
~ v1.2.1: Added method parameter to support more ranking methods.
~ v1.0.0: New.

---
Expand All @@ -455,7 +455,7 @@ Such comparer takes two values and return positive ints when lhs > rhs, negative
if lhs < rhs, and 0 if they are equal.

Revisions
~ main: Added method parameter to support more ranking methods.
~ v1.2.1: Added method parameter to support more ranking methods.
~ v1.0.0: New.

---
Expand Down Expand Up @@ -489,7 +489,7 @@ Example
```

Revisions
~ main: Added method parameter to support more ranking methods.
~ v1.2.1: Added method parameter to support more ranking methods.
~ v1.0.0: New.

---
Expand All @@ -511,7 +511,7 @@ Such comparer takes two values and return positive ints when lhs > rhs, negative
if lhs < rhs, and 0 if they are equal.

Revisions
~ main: Added method parameter to support more ranking methods.
~ v1.2.1: Added method parameter to support more ranking methods.
~ v1.0.0: New.

---
Expand Down Expand Up @@ -818,7 +818,7 @@ Example
```

Revisions
~ main: New.
~ v1.2.1: New.

---

Expand All @@ -843,5 +843,5 @@ Raises [`DirectedGraphNotAcyclicError`](apiref.DirectedGraphNotAcyclicError) if
topological ordering cannot be produced.

Revisions
~ main: New.
~ v1.2.1: New.

2 changes: 1 addition & 1 deletion doc/api/more/types_linq.more.more_enums.md
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@ Enumeration to select different methods of assigning rankings when breaking
[ties](https://en.wikipedia.org/wiki/Ranking#Strategies_for_assigning_rankings).

Revisions
~ main: New.
~ v1.2.1: New.

### Bases

Expand Down
2 changes: 1 addition & 1 deletion doc/api/more/types_linq.more.more_error.md
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@ from types_linq.more import DirectedGraphNotAcyclicError
Exception raised when a cycle exists in a graph.

Revisions
~ main: New.
~ v1.2.1: New.

### Bases

Expand Down
2 changes: 1 addition & 1 deletion doc/conf.py
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,7 @@
# -- Project information -----------------------------------------------------

project = 'types-linq'
copyright = '2022, cleoold'
copyright = '2023, cleoold'
author = 'cleoold'


Expand Down
8 changes: 8 additions & 0 deletions doc/to-start/changelog.rst
Original file line number Diff line number Diff line change
Expand Up @@ -3,6 +3,14 @@ Changelog

`GitHub Releases <https://github.com/cleoold/types-linq/releases>`_

v1.2.1
********

- Fix CachedEnumerable buffering bug when capacity is zero
- Add traverse_topological() to MoreEnumerable class
- Add ranking methods MoreEnumerable.rank() and rank_by() methods
- The documentation page now has hyperlinks for some terminologies in this release

v1.2.0
********

Expand Down
2 changes: 1 addition & 1 deletion setup.py
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,7 @@

setup(
name='types-linq',
version='v1.2.0',
version='v1.2.1',
url='https://github.com/cleoold/types-linq',
license='BSD 2-Clause License',
author='cleoold',
Expand Down
12 changes: 6 additions & 6 deletions types_linq/more/more_enumerable.pyi
Original file line number Diff line number Diff line change
Expand Up @@ -330,7 +330,7 @@ class MoreEnumerable(Enumerable[TSource_co]):
```
Revisions
~ main: Added method parameter to support more ranking methods.
~ v1.2.1: Added method parameter to support more ranking methods.
~ v1.0.0: New.
'''

Expand All @@ -348,7 +348,7 @@ class MoreEnumerable(Enumerable[TSource_co]):
if lhs < rhs, and 0 if they are equal.
Revisions
~ main: Added method parameter to support more ranking methods.
~ v1.2.1: Added method parameter to support more ranking methods.
~ v1.0.0: New.
'''

Expand Down Expand Up @@ -379,7 +379,7 @@ class MoreEnumerable(Enumerable[TSource_co]):
```
Revisions
~ main: Added method parameter to support more ranking methods.
~ v1.2.1: Added method parameter to support more ranking methods.
~ v1.0.0: New.
'''

Expand All @@ -398,7 +398,7 @@ class MoreEnumerable(Enumerable[TSource_co]):
if lhs < rhs, and 0 if they are equal.
Revisions
~ main: Added method parameter to support more ranking methods.
~ v1.2.1: Added method parameter to support more ranking methods.
~ v1.0.0: New.
'''

Expand Down Expand Up @@ -655,7 +655,7 @@ class MoreEnumerable(Enumerable[TSource_co]):
```
Revisions
~ main: New.
~ v1.2.1: New.
'''

def traverse_topological2(self,
Expand All @@ -675,5 +675,5 @@ class MoreEnumerable(Enumerable[TSource_co]):
topological ordering cannot be produced.
Revisions
~ main: New.
~ v1.2.1: New.
'''
2 changes: 1 addition & 1 deletion types_linq/more/more_enums.py
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@ class RankMethods(Enum):
[ties](https://en.wikipedia.org/wiki/Ranking#Strategies_for_assigning_rankings).
Revisions
~ main: New.
~ v1.2.1: New.
'''
dense = auto()
'''
Expand Down
2 changes: 1 addition & 1 deletion types_linq/more/more_error.py
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@ class DirectedGraphNotAcyclicError(InvalidOperationError):
Exception raised when a cycle exists in a graph.
Revisions
~ main: New.
~ v1.2.1: New.
'''

def __init__(self, cycle: Tuple[object, object]) -> None:
Expand Down

0 comments on commit 1b08397

Please sign in to comment.