400 lines
9.4 KiB
Python
400 lines
9.4 KiB
Python
#!/usr/bin/env python
|
|
# encoding: utf-8
|
|
|
|
|
|
from itertools import zip_longest, chain
|
|
|
|
|
|
class Stack(object):
|
|
"""Docstring for Stack """
|
|
|
|
def __init__(self):
|
|
self.items = []
|
|
|
|
def pushFromList(self, list):
|
|
"""Push the list in the stack
|
|
|
|
:param list: a list
|
|
"""
|
|
for i in list[::-1]:
|
|
self.push(i)
|
|
|
|
def isEmpty(self):
|
|
""" Says if the stack is empty
|
|
|
|
"""
|
|
return self.items == []
|
|
|
|
def push(self, item):
|
|
"""Push an item in the stack
|
|
|
|
"""
|
|
self.items.append(item)
|
|
|
|
def pop(self):
|
|
"""Getting the last item and remove it
|
|
:returns: last item
|
|
|
|
"""
|
|
return self.items.pop()
|
|
|
|
def peek(self, posi=0):
|
|
"""Getting the last item
|
|
:param posi: which item to peek 0 (last) 1 (the onebefore the last)...
|
|
:returns: the item
|
|
|
|
"""
|
|
return self.items[-1 - posi]
|
|
|
|
def __len__(self):
|
|
return len(self.items)
|
|
|
|
def __str__(self):
|
|
return str(self.items) + " -> "
|
|
|
|
def __add__(self, addList):
|
|
return self.items + addList
|
|
|
|
|
|
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 first_elem(ll):
|
|
"""Get the first element in imbricates lists
|
|
# TODO: Fonction pourrie mais j'ai pas le temps de faire mieux! |mar. janv. 28 22:32:22 CET 2014
|
|
|
|
:param list: list of lists of lists...
|
|
:returns: the first element
|
|
|
|
>>> first_elem(1)
|
|
1
|
|
>>> first_elem([1,2])
|
|
1
|
|
>>> first_elem([["abc"]])
|
|
'a'
|
|
>>> first_elem("abc")
|
|
'a'
|
|
>>> first_elem([[[1,2],[3,4]], [5,6]])
|
|
1
|
|
>>> first_elem([[["ab",2],[3,4]], [5,6]])
|
|
'a'
|
|
|
|
"""
|
|
if hasattr(ll, '__contains__'):
|
|
if len(ll) == 1 and isinstance(ll, str):
|
|
return ll[0]
|
|
else:
|
|
return first_elem(ll[0])
|
|
else:
|
|
return ll
|
|
|
|
|
|
def last_elem(ll):
|
|
"""Get the last element in imbricates lists
|
|
# TODO: Fonction pourrie mais j'ai pas le temps de faire mieux! |mar. janv. 28 22:32:22 CET 2014
|
|
|
|
:param list: list of lists of lists...
|
|
:returns: the last element
|
|
|
|
>>> last_elem(1)
|
|
1
|
|
>>> last_elem([1,2])
|
|
2
|
|
>>> last_elem([["abc"]])
|
|
'c'
|
|
>>> last_elem("abc")
|
|
'c'
|
|
>>> last_elem([[[1,2],[3,4]], [5,6]])
|
|
6
|
|
>>> last_elem([[["ab",2],[3,4]], [5,6]])
|
|
6
|
|
|
|
"""
|
|
if hasattr(ll, '__contains__'):
|
|
if len(ll) == 1 and isinstance(ll, str):
|
|
return ll[-1]
|
|
else:
|
|
return last_elem(ll[-1])
|
|
else:
|
|
return ll
|
|
|
|
|
|
def add_in_dict(dict1, dict2):
|
|
"""Merge dictionary keys and add the content from dict1 and dict2
|
|
|
|
:param dict1: first dictionary
|
|
:param dict2: second dictionary
|
|
:returns: merged and added dictionary
|
|
|
|
>>> add_in_dict({'a':1, 'b':2}, {'c':3, 'd': 4}) == {'d': 4, 'a': 1, 'c': 3, 'b': 2}
|
|
True
|
|
>>> add_in_dict({'a':1, 'b':2}, {'a':3, 'b': 4}) == {'a': 4, 'b': 6}
|
|
True
|
|
>>> add_in_dict({'a':1, 'b':2}, {'a':3, 'c': 4}) == {'a': 4, 'b': 2, 'c': 4}
|
|
True
|
|
|
|
"""
|
|
new_dict = {}
|
|
new_dict.update(dict1)
|
|
for (k, v) in dict2.items():
|
|
if k in new_dict.keys():
|
|
new_dict[k] += v
|
|
else:
|
|
new_dict[k] = v
|
|
|
|
return new_dict
|
|
|
|
|
|
def remove_in_dict(d, value=0):
|
|
""" In a dictionary, remove keys which have certain value
|
|
|
|
:param d: the dictionary
|
|
:param value: value to remove
|
|
:returns: new dictionary whithout unwanted value
|
|
|
|
>>> remove_in_dict({'b': 1, 'a': 0}) == {'b': 1}
|
|
True
|
|
>>> remove_in_dict({'b': 1, 'a': 0}, 1) == {'a': 0}
|
|
True
|
|
"""
|
|
new_dict = {}
|
|
for (k, v) in d.items():
|
|
if v != value:
|
|
new_dict[k] = v
|
|
return new_dict
|
|
|
|
|
|
def convolution_dict(D1, D2, op=lambda x, y: x * y,
|
|
op_key=lambda x, y: x + y,
|
|
commutative=True, op_twice=lambda x, y: x + y):
|
|
"""Convolution of two dictionaries
|
|
|
|
:param D1: First dictionary
|
|
:param D2: Second dictionary
|
|
:param op: Operation of perform in value
|
|
:param commutative: keys are commutative?
|
|
:param op_twice: operation on value if the key appear twice
|
|
|
|
>>> convolution_dict({"a": 1, "b":3}, {"a":2, "":4}) == {"aa":2, "a": 4, "ba":6, "b":12}
|
|
True
|
|
>>> convolution_dict({"a": 1, "b":3}, {"a":2, "b":4}) == {"aa":2, "ab":10, "bb":12}
|
|
True
|
|
>>> convolution_dict({"a": 1, "b":3}, {"a":2, "b":4}, commutative = False) == {"aa":2, "ab":10, "bb":12}
|
|
False
|
|
>>> convolution_dict({"a": 1, "b":3}, {"a":2, "b":4}, commutative = False) == {"aa":2, "ab":4,"ba":6, "bb":12}
|
|
True
|
|
>>> convolution_dict({"a": 1, "b":3}, {"a":2, "b":4}, \
|
|
op_twice = lambda x,y:[x,y]) == {"aa":2, "ab":[4,6], "bb":12}
|
|
True
|
|
|
|
"""
|
|
new_dict = {}
|
|
|
|
for k1 in sorted(D1.keys()):
|
|
for k2 in sorted(D2.keys()):
|
|
if op_key(k1, k2) in new_dict.keys():
|
|
key = op_key(k1, k2)
|
|
new_dict[key] = op_twice(new_dict[key], op(D1[k1], D2[k2]))
|
|
|
|
elif op_key(k2, k1) in new_dict.keys() and commutative:
|
|
key = op_key(k2, k1)
|
|
new_dict[key] = op_twice(new_dict[key], op(D1[k1], D2[k2]))
|
|
|
|
else:
|
|
key = op_key(k1, k2)
|
|
new_dict[key] = op(D1[k1], D2[k2])
|
|
|
|
return new_dict
|
|
|
|
|
|
def spe_zip(l1, l2):
|
|
"""Zip two lists, if a list is longer, only it's element are taken
|
|
|
|
>>> spe_zip([1,2], [3,4])
|
|
[[1, 3], [2, 4]]
|
|
>>> spe_zip([1,2], [3,4,5])
|
|
[[1, 3], [2, 4], 5]
|
|
"""
|
|
tmp = list(zip_longest(l1, l2))
|
|
ans = []
|
|
for i in tmp:
|
|
if None in i:
|
|
j = [a for a in i if a is not None][-1]
|
|
else:
|
|
j = list(i)
|
|
ans.append(j)
|
|
return ans
|
|
|
|
|
|
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 if isinstance(i,list)
|
|
else [i]
|
|
for i in list_list
|
|
]
|
|
|
|
return list(transpose_fill(list_in_list))
|
|
|
|
|
|
def transpose_fill(list_lists):
|
|
"""Transpose a list of list and if inside list have not the same length, fill with last token
|
|
|
|
:list_lists: a list of list to transpose
|
|
:returns: generator which generate lines of the transposed matrix
|
|
|
|
>>> list(transpose_fill([[1], [2, 3], [4, 5, 6]]))
|
|
[[1, 2, 4], [1, 3, 5], [1, 3, 6]]
|
|
"""
|
|
for i in range(max([len(l) for l in list_lists])):
|
|
col = []
|
|
for l in list_lists:
|
|
try:
|
|
col.append(l[i])
|
|
except IndexError:
|
|
col.append(l[-1])
|
|
|
|
yield col
|
|
|
|
|
|
def postfix_op(numbers, operator, neutral = 0):
|
|
"""Convert a list of numbers into a postfix addition
|
|
|
|
:numbers: list of numbers
|
|
:operator: the operator to join with
|
|
:neutral: default value if the list is empty
|
|
:returns: Postfix list of succecive attition of number
|
|
|
|
>>> from .operator import op
|
|
>>> postfix_op([1], op.add)
|
|
[1]
|
|
>>> postfix_op([1, 2], op.add)
|
|
[1, 2, +]
|
|
>>> postfix_op([1, 2, 3], op.add)
|
|
[1, 2, +, 3, +]
|
|
>>> postfix_op([1, 2, 3], op.mul)
|
|
[1, 2, *, 3, *]
|
|
>>> postfix_op(1, op.add)
|
|
[1]
|
|
>>> postfix_op([], op.add)
|
|
[0]
|
|
>>> postfix_op([], op.mul, 1)
|
|
[1]
|
|
"""
|
|
if not isinstance(numbers, list):
|
|
return [numbers]
|
|
elif numbers == []:
|
|
return [neutral]
|
|
else:
|
|
ans = [[a, operator] if i != 0 else [a]
|
|
for (i, a) in enumerate(numbers)]
|
|
return list(chain.from_iterable(ans))
|
|
|
|
def isOperator(exp):
|
|
"""Check if the expression is an opération in "+-*/:^"
|
|
|
|
:param exp: an expression
|
|
:returns: boolean
|
|
|
|
"""
|
|
|
|
# return (type(exp) == str and exp in "+-*/:^")
|
|
try:
|
|
exp.isOperator
|
|
except AttributeError:
|
|
return 0
|
|
return 1
|
|
|
|
|
|
def isNumber(exp):
|
|
"""Check if the expression can be a number
|
|
|
|
:param exp: an expression
|
|
:returns: True if the expression can be a number and false otherwise
|
|
|
|
"""
|
|
try:
|
|
exp.isNumber
|
|
except AttributeError:
|
|
if isinstance(exp, int):
|
|
return 1
|
|
else:
|
|
return 0
|
|
return 1
|
|
|
|
|
|
def isPolynom(exp):
|
|
"""Check if the expression can be a polynom
|
|
|
|
:param exp: an expression
|
|
:returns: True if the expression can be a polynom and false otherwise
|
|
|
|
>>> from mapytex.calculus.polynom import Polynom
|
|
>>> p = Polynom([1,2])
|
|
>>> isPolynom(p)
|
|
1
|
|
>>> isPolynom(1)
|
|
0
|
|
>>> isPolynom("a")
|
|
0
|
|
|
|
"""
|
|
try:
|
|
exp._isPolynom
|
|
except AttributeError:
|
|
return 0
|
|
return 1
|
|
|
|
|
|
def isNumerand(exp):
|
|
"""Check is the expression is something we can compute with
|
|
|
|
>>> isNumerand(1)
|
|
1
|
|
>>> from mapytex.calculus.polynom import Polynom
|
|
>>> p = Polynom([1,2])
|
|
>>> isNumerand(p)
|
|
1
|
|
>>> from mapytex.calculus.fraction import Fraction
|
|
>>> f = Fraction(12)
|
|
>>> isNumerand(f)
|
|
1
|
|
>>> isNumerand("a")
|
|
0
|
|
|
|
|
|
"""
|
|
return isNumber(exp) or isPolynom(exp)
|
|
|
|
if __name__ == '__main__':
|
|
import doctest
|
|
doctest.testmod()
|
|
|
|
|
|
# -----------------------------
|
|
# Reglages pour 'vim'
|
|
# vim:set autoindent expandtab tabstop=4 shiftwidth=4:
|
|
# cursor: 16 del
|