Lines Matching refs:m235
555 it's not clear how to get the internal uses of m235 to share a single
560 >>> def m235():
562 ... me_times2 = times(2, m235())
563 ... me_times3 = times(3, m235())
564 ... me_times5 = times(5, m235())
571 inefficient: each call of m235() leads to 3 recursive calls, and in
578 >>> result = m235()
601 >>> def m235():
603 ... # Gack: m235 below actually refers to a LazyList.
604 ... me_times2 = times(2, m235)
605 ... me_times3 = times(3, m235)
606 ... me_times5 = times(5, m235)
615 >>> m235 = LazyList(m235())
617 ... print [m235[j] for j in range(15*i, 15*(i+1))]
650 The algorithms "m235" (Hamming) and Fibonacci presented above are both
672 m235 to share a single generator".
675 >>> def m235():
686 >>> it = m235()
