On Wed, Aug 22, 2012 at 07:01:37AM -0700, Andrew Mathas wrote:
>Am I right in thinking that FiniteSets() and InfiniteSets() have not yet
>been implemented? It seems that FinitenumeratedSets() and
>InfinitenumeratedSets() do both exist.
They are, but only in
trac_10963-more_functorial_c
Am I right in thinking that FiniteSets() and InfiniteSets() have not yet
been implemented? It seems that FinitenumeratedSets() and
InfinitenumeratedSets() do both exist.
Btw, Nicolas, I had a quick look at trac #12955 but it wasn't clear to me
what had been done and what was left.
Andrew
On M
On Mon, Aug 20, 2012 at 06:12:49AM +0200, Vincent Delecroix wrote:
> if my_set in FiniteSets():
># some stuff for finite sets
>...
> elif my_set in InfiniteSets():
># some stuff for infinite sets
>...
> elif my_set in Sets():
># some stuff for finite or infinite sets
>...
>
Dear Andrew,
On Sun, Aug 19, 2012 at 04:52:45PM -0700, Andrew Mathas wrote:
>Recently when playing around with standard tableaux, which are enumerated
>sets, I rewrote their getitem methods because I thought that they should
>support slices. At the time I thought that this shou
Hi Andrew,
> I don't know whether this is generally thought to be a good idea, but I
> like being able to write things like:
>
> sage: StandardTableaux(40)[0:10]
I like it also! And hacking the __getitem__ for any enumerated set is
not that hard. The standard way to access the i-th tableau is by
Hi Vincent,
Recently when playing around with standard tableaux, which are enumerated
sets, I rewrote their getitem methods because I thought that they should
support slices. At the time I thought that this should go into the
enumerated set code but I wasn't sure where to put it. Modulo the
do
