New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
IncidenceStructure.__contains__ #16727
Comments
Branch: u/ncohen/16727 |
Commit: |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:3
at least some tests should use some "real" incidence structures, not just 1-element examples... |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:5
Replying to @sagetrac-git:
Well, test on non-degenerate examples, please! Your favourite STS on 15 points will do for sure... |
comment:6
Hey Dima I have no idea what doctest you want me to write but I am not going to lose 10 minutes per try until I find out. Add a commit to the branch if you don't like my doctests. Nathann |
Changed branch from u/ncohen/16727 to public/16727 |
comment:7
Replying to @nathanncohen:
A degenerate input is a corner case: one-element hypergraphs and complete uniform hypergraphs are surely degenerate inputs. Such tests don't stress much of the implementation, as you can imagine. |
comment:8
Dima, are you aware that the only thing we are testing here is whether an element belongs to a LIST ? Python does not care at all what the elements are, it is all pointers as far as it is concerned.
Add your commit. Nathann |
comment:9
Replying to @nathanncohen:
Good doctests should test the function as if it were a blackbox. |
comment:10
Religion does not work on me.
I am not against doctests, I am against your spending my time on this. I believe that this function is sufficiently doctested, and I already added tests because you asked. If they don't satisfy you for some reason, I do not mind it but you will have to write your own and add it to the branch. Nathann |
comment:11
Replying to @nathanncohen:
It has nothing to do with religion, this is just common sense, sorry.
I believe that I explained sufficiently clear that testing only corner cases does not work, yet you added another corner case test, for a complete uniform hypergraph is a corner case, AFAIK. And I have elected to be a reviewer, sorry. It is my job to decide what a sufficient doctest is, not yours. |
comment:12
Yo !
A uniform hypergraph is a "corner case" in hypergraph theory. Not as an example of Python list. I mixed integers and strings, and order. That's how I tested non-corner cases that made sense from the point of view of what this function does. It is also a doctest of the bug I reported in this ticket's description.
Indeed, but when you see that you cannot explain what you want without making lose the other guy's time because he apparently does not get it, you can save everybody by writing the 4 lines yourself. Nathann |
comment:13
Replying to @nathanncohen:
OK, will do...
|
comment:14
Replying to @dimpase:
after I'm done building 6.3.beta7, that is... |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:16
Yoooooooooooooooo ! The tests pass, so if that's okay for you... Nathann |
Reviewer: Dima Pasechnik |
Changed branch from public/16727 to |
Right now it is obtained through
.__iter__
, and it does not do the jobCC: @videlec @KPanComputes @dimpase
Component: combinatorial designs
Author: Nathann Cohen
Branch/Commit:
c69307c
Reviewer: Dima Pasechnik
Issue created by migration from https://trac.sagemath.org/ticket/16727
The text was updated successfully, but these errors were encountered: