Data Structures

li = ['a', 'b', 'c', 'd']
li.index('c') # => 2
li.append('e')
li.pop() # => 'e'
len(li)  # => 4
li[1:3]  # => ['b', 'c']
del li[1]
# ['a', 'c', 'd']  others shift over
li[1:1] = 'b'
# ['a', 'b', 'c', 'd']

for e in li:
    print(e)

for idx, e in enumerate(li):
    print(idx, '-->', e)

[f'={s}=' for s in li]
# => ['=a=', '=b=', '=c=', '=d=']

# Partition a list into n-sized chunks.
def partition(coll, n):
    return [ coll[i:i+n] for i in range(0, len(coll), n) ]

>>> list(zip([1, 2, 3], ['a', 'b', 'c'], [11, 22, 33]))
[(1, 'a', 11), (2, 'b', 22), (3, 'c', 33)]

>>> a = [[1, 2], [3, 4], [5, 6]]
>>> for i in a:
...  print(i)
...
[1, 2]
[3, 4]
[5, 6]
>>> for i in list(zip(*a)):
...  print(i)
...
(1, 3, 5)
(2, 4, 6)

d = {'a': 1, 'b': 2}
d['c'] = 3

d['z'] = 4
del d['z']

# dict comprehension
d2 = {k: some_fn(k) for k in some_list}

for k,v in d.items():
    print(k, '-->', v)

# These all give you back views on the dict; if you
# change `d`, ks/vs/itms change too.
ks   = d.keys()
vs   = d.values()
itms = d.items()

list(d)  #=> ['a', 'c', 'b'] that is, just the keys

dict.fromkeys(['a', 'b', 'c'])        # => `{'a': None, 'c': None, 'b': None}`
dict.fromkeys(['a', 'b', 'c'], True)  # => `{'a': True, 'c': True, 'b': True}`

s = {'a', 'b', 'c'}
s.add('d')
s.discard('d') # ok if 'd' not in s
s.remove('d')  # exception if 'd' not in s
s.pop()

# set comprehension
s = {some_func(x) for x in s}

s1.difference(s2)           # s1 minus elems in s2
s1.intersection(s2)         # elems in both s1 and s2
s1.symmetric_difference(s2) # elems in s1 *or* s2, but not in both
s1.union(s2)