Representation of recursive list

[DeaD_EyE]

Guess you have following code:

1 2 3

x = [1, 2, 3] x.append(x) print(x)

The output:

Hide/Show

Output:
[1, 2, 3, [...]]

Did you know/expect that?

It's infinite, because it refers on itself.
You can do this:

Hide/Show

1 2 3 4 5

def infinite_loop():     x = [1, 2, 3]     x.append(x)     while True:         x = x[-1]

[snippsat]

Cool not seen that before.
pprint gives some more info.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

λ ptpython >>> from pprint import pprint   >>> x = [1, 2, 3] >>> x.append(x) >>> x [1, 2, 3, [...]]   >>> pprint(x) [1, 2, 3, <Recursion on list with id=88766544>]   >>> x[-1] [1, 2, 3, [...]] >>> x == x[-1] True