hello,
i'm looking for a way to have all possible length fixed n-uples from a
list, i think generators can help, but was not able to do it myself,
maybe some one could point me out to an idea to do it ?
for example, from :
l = [0, 1, 2, 3, 4]
and searching for n-uples of 3, i should produce :
(
hello,
while trying to play with generator, i was looking for an idea to get
the position of a inner list inside another one, here is my first idea
:
- first find position of first inner element,
- and then see if the slice starting from here is equal to the inner
->
>>> def subPositions(alist,
