Opened 5 years ago
Closed 5 years ago
#25690 closed defect (fixed)
Fix documentation of Partition.next()
Reported by: | mathzeta2 | Owned by: | |
---|---|---|---|
Priority: | major | Milestone: | sage-8.3 |
Component: | combinatorics | Keywords: | days94, beginner |
Cc: | Merged in: | ||
Authors: | Tomer Bauer | Reviewers: | Martin Rubey |
Report Upstream: | N/A | Work issues: | |
Branch: | a9d2a3f (Commits, GitHub, GitLab) | Commit: | a9d2a3f0aa9faad21993a268b9fb289a3ccdd665 |
Dependencies: | Stopgaps: |
Description
The next()
method of a Partition p
returns the partition that lexicographically follows p
of the same size. We suggest to update the documentation accordingly.
sage: Partitions(3)([1,1,1]).next() False sage: Partitions()([1,1,1]).next() # One might expect to get [4]. False sage: PI = iter(Partitions()) sage: [PI.next() for i in range(8)] [[], [1], [2], [1, 1], [3], [2, 1], [1, 1, 1], [4]]
Change History (4)
comment:1 Changed 5 years ago by
Branch: | → u/mathzeta2/25690_partition_next_doc |
---|---|
Commit: | → a9d2a3f0aa9faad21993a268b9fb289a3ccdd665 |
comment:2 Changed 5 years ago by
Status: | new → needs_review |
---|
comment:3 Changed 5 years ago by
Reviewers: | → Martin Rubey |
---|---|
Status: | needs_review → positive_review |
comment:4 Changed 5 years ago by
Branch: | u/mathzeta2/25690_partition_next_doc → a9d2a3f0aa9faad21993a268b9fb289a3ccdd665 |
---|---|
Resolution: | → fixed |
Status: | positive_review → closed |
Note: See
TracTickets for help on using
tickets.
Thanks!