Opened 2 years ago
Closed 2 years ago
#30963 closed enhancement (fixed)
remove CombinatorialClass in graph_path.py
Reported by: | Frédéric Chapoton | Owned by: | |
---|---|---|---|
Priority: | major | Milestone: | sage-9.3 |
Component: | graph theory | Keywords: | |
Cc: | Merged in: | ||
Authors: | Frédéric Chapoton | Reviewers: | Travis Scrimshaw |
Report Upstream: | N/A | Work issues: | |
Branch: | 2ac6bde (Commits, GitHub, GitLab) | Commit: | 2ac6bde9f0e9458553ad15d2ed2ea71d3c439743 |
Dependencies: | Stopgaps: |
Description
as part of #12913
Change History (12)
comment:1 Changed 2 years ago by
Branch: | → u/chapoton/30963 |
---|---|
Commit: | → 26212a54a2062dae4984e44e413d54f6c865f191 |
Status: | new → needs_review |
comment:2 Changed 2 years ago by
Reviewers: | → Travis Scrimshaw |
---|
Failures seem unrelated, but why did you get rid of this doctest?
-
src/sage/combinat/graph_path.py
diff --git a/src/sage/combinat/graph_path.py b/src/sage/combinat/graph_path.py index dc2c7ce..620ef03 100644
a b class GraphPaths_all(CombinatorialClass, GraphPaths_common): 239 240 240 241 sage: G = DiGraph({1:[2,2,3], 2:[3,4], 3:[4], 4:[5,5]}, multiedges=True) 241 242 sage: p = GraphPaths(G) 242 sage: p == loads(dumps(p))243 True244 243 """ 245 244 self.graph = g 245 Parent.__init__(self, category=FiniteEnumeratedSets()) 246 246 247 247 def __repr__(self): 248 248 """
comment:3 follow-up: 4 Changed 2 years ago by
Hello Travis,
failures on darwin patchbot are due to usage of python 3.9
failures on petitbonum are because of a pexpect problem with singular #30945
Here, I have a problem with loads-dumps, because I cannot use UniqueRepresentation
, the input (a graph) being not compatible with that. Should I make a custom __eq__
and __ne__
to be able to restore this doctest ?
comment:4 Changed 2 years ago by
Replying to chapoton:
Here, I have a problem with loads-dumps, because I cannot use
UniqueRepresentation
, the input (a graph) being not compatible with that. Should I make a custom__eq__
and__ne__
to be able to restore this doctest ?
Yes, I think that is best. In fact, the lack of equality testing might end up being a backwards incompatible change (although I do see it as being unlikely). Probably also should have a __hash__
too...
comment:5 Changed 2 years ago by
Commit: | 26212a54a2062dae4984e44e413d54f6c865f191 → 6e4666b354e0f048c7f5c5f98b9a959f08e6b017 |
---|
Branch pushed to git repo; I updated commit sha1. New commits:
6e4666b | adding __eq__ and __ne__ for GraphPaths pickling
|
comment:8 Changed 2 years ago by
one moment, I see that I forgot to put back all the loads-dumps doctests..
comment:9 Changed 2 years ago by
Commit: | 6e4666b354e0f048c7f5c5f98b9a959f08e6b017 → 2ac6bde9f0e9458553ad15d2ed2ea71d3c439743 |
---|---|
Status: | positive_review → needs_review |
Branch pushed to git repo; I updated commit sha1 and set ticket back to needs_review. New commits:
2ac6bde | adding back loads-dumps
|
comment:10 Changed 2 years ago by
done. I also removed the .Facade()
that I added before and was probably used wrongly. Back to needs review, sorry for that.
comment:11 Changed 2 years ago by
Status: | needs_review → positive_review |
---|
given the green bot, I will allow mself to set this back to positive
comment:12 Changed 2 years ago by
Branch: | u/chapoton/30963 → 2ac6bde9f0e9458553ad15d2ed2ea71d3c439743 |
---|---|
Resolution: | → fixed |
Status: | positive_review → closed |
New commits:
remove CombinatorialClass in graph_path.py