#19620: fast (lazy) infinite words
-------------------------------------+-------------------------------------
Reporter: vdelecroix | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.0
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Vincent Delecroix | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/vdelecroix/19620 | 1e506ee2885dc086f24973db538dc4682ace1e01
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
Right. For me a word already has some combinatorial flavour. It is already
a mathematical object. The `lazy_list` would be one possible backend. An
other one (which is the object of this ticket) is using a reallocable
`char *`.
Note that you can avoid precomputations with word initialization with the
option `check=False`
{{{
sage: W = Words()
sage: w = W(lambda n: haha[n], check=False) # no precomputation
sage: w[0]
Traceback (most recent call last):
...
NameError: global name 'haha' is not defined
}}}
Ideally you should start with `W = W = Words(SymmetricFunctions(QQ))` but
that ends up with `AttributeError: 'SymmetricFunctions_with_category'
object has no attribute 'cardinality'`.
--
Ticket URL: <http://trac.sagemath.org/ticket/19620#comment:15>
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.
