#19345: Fast lexicographic iterator for module over ZZ/nZZ
-----------------------------+-------------------------------------
Reporter: vdelecroix | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.10
Component: coding theory | Keywords:
Merged in: | Authors: Vincent Delecroix
Reviewers: | Report Upstream: N/A
Work issues: | Branch: #6452
Commit: | Dependencies:
Stopgaps: |
-----------------------------+-------------------------------------
We implement a reasonably fast lexicographic iterator for modules over
`ZZ/nZZ`. We integrate a `minimum_weight` method that could be used as an
alternative to GAP in some part of `sage.codings`.
Before
{{{
sage: R = IntegerModRing(6)
sage: M = FreeModule(R, 4)
sage: timeit('for u in M: pass')
25 loops, best of 3: 9.11 ms per loop
sage: U = M.span([M((1,1,0,2)), M((2,2,3,0))])
sage: timeit('for u in U: pass')
625 loops, best of 3: 641 µs per loop
}}}
After
{{{
sage: timeit('for u in M: pass')
625 loops, best of 3: 283 µs per loop
sage: timeit('for u in U: pass')
625 loops, best of 3: 41.5 µs per loop
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/19345>
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 http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.