On Wednesday, September 10, 2014 2:11:17 PM UTC+1, Nathann Cohen wrote:
>
> 1) Change the current code to handle 0-based AND 1-based permutations; or
> 2) Have two versions of each function
>
IMHO its rather easy. You never really do arithmetic with the indices in
combinatorics as they are just arbitrary labels. 90% of the work will be
just moving loop ranges to a single method that differs in the two
implementations:
for i in range(1,n+1):
do_something(i)
to
for i in self._range(n):
do_something(i)
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
