#19778: McFarland 1973 construction for difference sets
-------------------------------------+-------------------------------------
Reporter: vdelecroix | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.0
Component: combinatorial | Resolution:
designs | Merged in:
Keywords: | Reviewers:
Authors: Vincent Delecroix | Work issues:
Report Upstream: N/A | Commit:
Branch: | 8bd17be0e663eb02be619bf9e8feba5067e288f5
u/vdelecroix/19778 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
Replying to [comment:6 ncohen]:
> I'm not being passive-aggressive here, just asking the question:
considering the following timings, do you think that we should care?
>
> {{{
> sage: %timeit [factor(i) for i in range(2,10000)]
> 10 loops, best of 3: 78.7 ms per loop
> sage: %timeit [designs.difference_family(i,3,existence=True) for i in
range(10000)]
> 1 loops, best of 3: 1.58 s per loop
> }}}
>
> I don't know if another timing makes more sense. I merely tried the
first I could think of.
This is more about code organization rather than timings. The previous
version of the code was
{{{
D = None
... # try some stuff
if D is None:
... # try other stuff
if D is None:
... # try another one
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/19778#comment:7>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
