Mapytex/generic.py

106 lines
2.3 KiB
Python
Raw Normal View History

#!/usr/bin/env python
# encoding: utf-8
class Stack(object):
2013-08-07 23:12:11 +00:00
"""Docstring for Stack """
2013-08-07 23:12:11 +00:00
def __init__(self):
"""@todo: to be defined1 """
self.items = []
2013-08-07 23:12:11 +00:00
def pushFromList(self, list):
"""Push the list in the stack
2013-07-18 17:43:36 +00:00
2013-08-07 23:12:11 +00:00
:param list: a list
"""
for i in list[::-1]:
self.push(i)
2013-07-18 17:43:36 +00:00
2013-08-07 23:12:11 +00:00
def isEmpty(self):
""" Says if the stack is empty
:returns: @todo
2013-08-07 23:12:11 +00:00
"""
return self.items == []
2013-08-07 23:12:11 +00:00
def push(self, item):
"""Push an item in the stack
2013-08-07 23:12:11 +00:00
:param item: @todo
:returns: @todo
2013-08-07 23:12:11 +00:00
"""
self.items.append(item)
2013-08-07 23:12:11 +00:00
def pop(self):
"""Getting the last item and remove it
:returns: last item
2013-08-07 23:12:11 +00:00
"""
return self.items.pop()
2013-08-07 23:12:11 +00:00
def peek(self, posi = 0):
"""Getting the last item
2013-07-18 17:43:36 +00:00
:param posi: which item to peek 0 (last) 1 (the onebefore the last)...
2013-08-07 23:12:11 +00:00
:returns: the item
2013-08-07 23:12:11 +00:00
"""
return self.items[-1 - posi]
2013-08-07 23:12:11 +00:00
def __len__(self):
return len(self.items)
2013-08-07 23:12:11 +00:00
def __str__(self):
return str(self.items) + " -> "
2013-08-07 23:12:11 +00:00
def __add__(self, addList):
return self.items + addList
2013-11-01 21:58:42 +00:00
def flatten_list(a, result=None):
"""Flattens a nested list.
>>> flatten_list([ [1, 2, [3, 4] ], [5, 6], 7])
[1, 2, 3, 4, 5, 6, 7]
"""
if result is None:
result = []
for x in a:
if isinstance(x, list):
flatten_list(x, result)
else:
result.append(x)
return result
def expand_list(list_list):
"""Expand list of list
>>> expand_list([1,2,[3,4],5,[6,7,8]])
[[1, 2, 3, 5, 6], [1, 2, 4, 5, 7], [1, 2, 4, 5, 8]]
>>> expand_list([1,2,4,5,6,7,8])
[[1, 2, 4, 5, 6, 7, 8]]
"""
list_in_list = [i for i in list_list if type(i) == list].copy()
try:
nbr_ans_list = max([len(i) for i in list_in_list])
ans = [list_list.copy() for i in range(nbr_ans_list)]
for (i,l) in enumerate(ans):
for (j,e) in enumerate(l):
if type(e) == list:
ans[i][j] = e[min(i,len(e)-1)]
# S'il n'y a pas de liste dans la liste (2e exemple)
2013-11-01 21:58:42 +00:00
except ValueError:
ans = [list_list]
return ans
# -----------------------------
# Reglages pour 'vim'
# vim:set autoindent expandtab tabstop=4 shiftwidth=4:
# cursor: 16 del