Re: [sage-combinat-devel] queue is broken?

2012-02-10 Thread Christian Stump
Hi Nicolas -- trac_9469-category-membership_without_arguments-nt.patch now gives a non trivial reject in categories/category.py. Best, Christian -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post to this group, send email to sage-c

Re: [sage-combinat-devel] queue is broken?

2012-02-10 Thread Nicolas M. Thiery
On Fri, Feb 10, 2012 at 09:09:42AM +0100, Christian Stump wrote: > trac_9469-category-membership_without_arguments-nt.patch now gives a > non trivial reject in categories/category.py. Sage version? Nicolas -- Nicolas M. Thiéry "Isil" http://Nicolas.Thiery.name/ -

Re: [sage-combinat-devel] queue is broken?

2012-02-10 Thread Christian Stump
> Sage version? 4.8 -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.co

Re: [sage-combinat-devel] queue is broken?

2012-02-10 Thread Anne Schilling
On 2/10/12 5:35 AM, Christian Stump wrote: >> Sage version? > > 4.8 It does not work for me either with sage 4.8 applying trac_12476-lattice_join_matrix_speedup-fh.patch applying trac_8-finite_enumset_list_cache-fh.patch applying trac_9469-category-membership_without_arguments-nt.patch patch

Re: [sage-combinat-devel] queue is broken?

2012-02-10 Thread Nicolas M. Thiery
On Fri, Feb 10, 2012 at 08:07:46AM -0800, Anne Schilling wrote: > Could you please fix this, so people with patches later in the queue can work > on them? Getting there. The queue should apply on 4.8 and 5.0, at least up to bigmess-nt.patch excluded. Sorry for the trouble.

Re: [sage-combinat-devel] queue is broken?

2012-02-10 Thread Nicolas M. Thiery
On Fri, Feb 10, 2012 at 06:04:49PM +0100, Nicolas M. Thiery wrote: > Getting there. The queue should apply on 4.8 and 5.0, at least up to > bigmess-nt.patch excluded. It should all apply now ... Nicolas -- Nicolas M. Thiéry "Isil" http://Nicolas.Thiery.name/ --

Re: [sage-combinat-devel] queue is broken?

2012-02-10 Thread Anne Schilling
On 2/10/12 10:56 AM, Nicolas M. Thiery wrote: > On Fri, Feb 10, 2012 at 06:04:49PM +0100, Nicolas M. Thiery wrote: >> Getting there. The queue should apply on 4.8 and 5.0, at least up to >> bigmess-nt.patch excluded. > > It should all apply now ... I still get a rejection in sage-4.8: applying t

Re: [sage-combinat-devel] queue is broken?

2012-02-10 Thread Nicolas M. Thiery
On Fri, Feb 10, 2012 at 11:22:15AM -0800, Anne Schilling wrote: > I still get a rejection in sage-4.8: > applying trac_10963-more_functorial_constructions-nt-4.7.2.patch > patching file sage/categories/category.py Shoot. Fixed in principle. Nicolas -- Nicolas M. Thi

Re: [sage-combinat-devel] queue is broken?

2012-02-10 Thread Anne Schilling
On 2/10/12 12:51 PM, Nicolas M. Thiery wrote: > On Fri, Feb 10, 2012 at 11:22:15AM -0800, Anne Schilling wrote: >> I still get a rejection in sage-4.8: >> applying trac_10963-more_functorial_constructions-nt-4.7.2.patch >> patching file sage/categories/category.py > > Shoot. Fixed in principle. N

[sage-combinat-devel] lazy enumerated set

2012-02-10 Thread Vincent Delecroix
Hello, Together with the language-team, we decided to implement a LazyEnumeratedSet (see my patch in the queue) which takes as input an iterable (finite or infinite) and mimic a set which contains the element of the iterable. It is very useful when we do not want to implement a specific class... W

[sage-combinat-devel] comments/questions on poset code

2012-02-10 Thread Anne Schilling
Hi! I have recently used the poset code quite a lot and would also like to add some methods, but do have some questions: * Is it currently possible to construct a poset from a linear extension (basically by relabeling the nodes of the parent poset)? It might be nice to accept a linear extensi

Re: [sage-combinat-devel] comments/questions on poset code

2012-02-10 Thread Martin Rubey
Anne Schilling writes: > * I have an implementation of tau_i and various generalizations of promotion > operators on > a poset. The easiest and fastest to implement these, is to do so on linear > extensions and > then pull them back to posets. Where should these methods go since there is >