🔀 Merge branch 'stable' into 'tuto-pysdur'

# Conflicts:
#   README.md
This commit is contained in:
Freezed 2021-04-21 23:46:36 +00:00
commit 1ab191438c
75 changed files with 246821 additions and 2 deletions

4
.gitignore vendored Normal file
View File

@ -0,0 +1,4 @@
*__pycache__*
.scores
*/.*
*.pyc

View File

@ -1,3 +1,10 @@
# homework
# My Python Sandbox
Code for https://gitlab.com/forga/process/fr/embarquement/-/issues/6
A place for trainings & some scripts worth keeping.
Started originally with [Open Classrooms](https://openclassrooms.com/) courses
## Tuto
Crash test for [_A durable Python script_](https://gitlab.com/forga/process/fr/embarquement/-/issues/6)

View File

@ -0,0 +1,42 @@
#!/usr/bin/env python3
#-*- coding:utf-8 -*-
"""
source : https://medium.com/@george.shuklin/mocking-complicated-init-in-python-6ef9850dd202
"""
class Compl(object):
def __init__(self, arg1, arg2):
self.var1 = complicated_to_mock(arg1)
self.var2 = self.var2.complicated_to_mocK2(arg2)
if self.var1 in self.var2 and self.var1 != self.var2:
self.var3 = self.var2 - self.var1 + ctm3(ctm4())
self.foo = {
"1": {"price": "2.7", "quantity": "10"},
"2": {"price": "8.0", "quantity": "2"},
}
def simple(self, arg3):
if arg3 > self.var1:
return None
else:
return arg3 - self.var1
from unittest.mock import patch
def test_simple_none():
with patch.object(Compl, "__init__", lambda x, y, z: None):
c = Compl(None, None)
c.var1 = 0
c.foo = {"foo":"bar", "FOO":"BAR"}
assert c.simple(1) is None
assert [i for i in c.foo.keys()] == ["foo", "FOO"]
def test_simple_substraction():
with patch.object(Compl, "__init__", lambda x, y, z: None):
c = Compl(None, None)
c.var1 = 1
assert c.simple(1) == 0

View File

@ -0,0 +1,53 @@
#!/usr/bin/env python3
# coding: utf8
"""
Author: freezed <git@freezed.me> 2019-09-06
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
"""
import io
import base64
from PIL import Image
def main(source_img_b64_str, height=100, width=100):
"""
Resize a Base64 string image
:param source_img_b64_str:
:param height: new height in pixel
:param width: new width in pixel
:type source_img_b64_str: str A full Base64 encoded image (PNG)
:type height: int
:type width: int
:return: The same image resized Base64 encoded
:rtype: str
:Tests:
>>> src = "data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAS4AAACYCAYAAABapASfAAAA5klEQVR4nO3UsQ2AMBAEwe2U778JSCjAkS3QjHT5RVsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADwP1Ndp08ArJrqfjdHnwAsmoQL+KBJtAAAAAAAAAAAAAAAAAAAYIsHJxwG/A1QeRMAAAAASUVORK5CYII="
>>> main(src)
'data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAGQAAABkCAYAAABw4pVUAAAATUlEQVR4nO3OQQ0AMAgEMJxu/k3AGwWXbK2CVgEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAo046wNbpANtNBwAAAH42ANwBv4bl/B8AAAAASUVORK5CYII='
"""
head_b64_str = source_img_b64_str.split(",")[0]
body_b64_str = source_img_b64_str.split(",")[1]
body_b64_bytes = base64.b64decode(body_b64_str)
body_file_like = io.BytesIO(body_b64_bytes)
body_pil_image = Image.open(body_file_like)
resized_body_pil_image = body_pil_image.resize((height, width))
new_img_bytes = io.BytesIO()
resized_body_pil_image.save(new_img_bytes, format="PNG")
new_img_bytes = new_img_bytes.getvalue()
new_body_b64_str = base64.b64encode(new_img_bytes).decode()
return "{},{}".format(head_b64_str, new_body_b64_str)
if __name__ == "__main__":
import doctest
doctest.testmod()

View File

@ -0,0 +1,20 @@
# _chat_ TODO-list
- [x] ~~server crash when a client quit~~
- [x] ~~clean client exit with <ctrl-c>~~
- [x] ~~clean server exit with <ctrl-c>~~
- [x] ~~broadcasting messages to all client connected~~
- [x] ~~show message on server when client use <ctrl+c>~~
- [x] ~~crash after 2 <ctrl+c> in client~~
- [x] ~~sending welcome message only at 1st client connection FIX #20~~
- [x] ~~client freeze when sending empty string or spaces~~
- [x] ~~move closing connection at the script's end~~
- [x] ~~asking/using client-nickname~~
- [x] ~~clean the prompt and std.out a bit messy since broadcasting~~
- [ ] using wlist with select.select for hardening the script
- [ ] convert logic to oreiented object
- [ ] server crash witn opened connection with <ctrl+Z>
- [ ] add some commands: help, list user, disconnect user, etc.
- [ ] add time logging
- [ ] server crash if a client is killed
- [ ] …

View File

@ -0,0 +1,69 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
client.py
Networking test, client-server talking script
"""
import socket, signal, select, sys
MSG_ARG_ERROR = "Usage: client.py hostname port"
if len(sys.argv) < 3:
print(MSG_ARG_ERROR)
sys.exit(1)
HOST = sys.argv[1]
PORT = int(sys.argv[2])
BUFFER = 1024
MSG_SERVER_CONNECTED = "Serveur connecté @{}:{}"
MSG_CLOSE_CONNECTION = "Connexion vers [{}:{}] fermée"
def prompt():
sys.stdout.write('~')
sys.stdout.flush()
def handler(signum, frame):
""" Catch <ctrl+c> signal for clean stop"""
print()
print(MSG_CLOSE_CONNECTION.format(*(SERVER_CONNECTION.getpeername())))
SERVER_CONNECTION.send(b"QUIT")
SERVER_CONNECTION.close()
sys.exit(0)
signal.signal(signal.SIGINT, handler)
SERVER_CONNECTION = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
try:
SERVER_CONNECTION.connect((HOST, PORT))
except ConnectionRefusedError as except_detail:
print("ConnectionRefusedError: «{}». Unable to connect".format(except_detail))
sys.exit()
print(MSG_SERVER_CONNECTED.format(HOST, PORT))
while 1:
inputs = [sys.stdin, SERVER_CONNECTION]
rlist, wlist, elist = select.select(inputs, [], [])
for socket in rlist:
if socket == SERVER_CONNECTION: # incomming message
data = socket.recv(BUFFER).decode()
if not data:
print(MSG_CLOSE_CONNECTION.format(HOST, PORT))
sys.exit()
else:
#print data
sys.stdout.write(data)
prompt()
else: # sending message
msg = sys.stdin.readline().encode()
SERVER_CONNECTION.send(msg)
prompt()
SERVER_CONNECTION.close()

View File

@ -0,0 +1,103 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
server.py
Networking test, client-server talking script
"""
import select, signal, socket, sys
HOST = ''
PORT = 5555
BUFFER = 1024
SERVER_LOG = "{}:{}|{name}|{msg}"
MSG_DISCONNECTED = "<gone away to infinity, and beyond>"
MSG_SERVER_STOP = "Server stop"
MSG_START_SERVER = "Server is running, listening on port {}.\n\tPress <ctrl+c> to stop"
MSG_USER_IN = "<entered the chatroom>"
MSG_WELCOME = "Welcome. First do something usefull and type your name: ".encode()
MSG_SALUTE = "Hi, {}, everyone is listening to you:\n"
inputs = []
user_name = []
def handler(signum, frame):
""" Catch <ctrl+c> signal for clean stop"""
print()
inputs.remove(MAIN_CONNECTION)
i = 1
for socket in inputs:
print(SERVER_LOG.format(*socket.getpeername(), name=user_name[i], msg="closed client socket"))
socket.close()
i += 1
inputs.clear()
print(MSG_SERVER_STOP)
MAIN_CONNECTION.close()
sys.exit(0)
signal.signal(signal.SIGINT, handler)
def broadcast(sender, name, message):
# send message to all clients, except the sender
message = "{}~ {}\n".format(name, message)
for socket in inputs:
if socket != MAIN_CONNECTION and socket != sender:
try:
socket.send(message.encode())
except :
socket.close()
inputs.remove(socket)
# Creation de la connection
MAIN_CONNECTION = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
MAIN_CONNECTION.setsockopt(socket.SOL_SOCKET, socket.SO_REUSEADDR, 1)
MAIN_CONNECTION.bind((HOST, PORT))
MAIN_CONNECTION.listen(5)
inputs.append(MAIN_CONNECTION)
user_name.append("MAIN_CONNECTION")
print(MSG_START_SERVER.format(PORT))
while 1:
# get the list of sockets which are ready to be read through select
# timeout 50ms
rlist, wlist, xlist = select.select(inputs, [], [], 0.05)
for socket in rlist:
# Listen for new client connection
if socket == MAIN_CONNECTION:
socket_object, socket_addr = socket.accept()
inputs.append(socket_object)
user_name.append(False)
print(SERVER_LOG.format(*socket_addr, name="unknow", msg="connected"))
socket_object.send(MSG_WELCOME)
else: # receiving data
data = socket.recv(BUFFER).decode().strip()
peername = socket.getpeername()
s_idx = inputs.index(socket)
uname = user_name[s_idx]
if data.upper() == "QUIT":
print(SERVER_LOG.format(*peername, name=uname, msg="disconnected"))
broadcast(socket, uname, MSG_DISCONNECTED)
inputs.remove(socket)
user_name.pop(s_idx)
socket.close()
elif user_name[s_idx] is False: # setting username
# insert username naming rule here
user_name[s_idx] = data
socket.send(MSG_SALUTE.format(user_name[s_idx]).encode())
print(SERVER_LOG.format(*peername, name=data, msg="set user name"))
broadcast(socket, user_name[s_idx], MSG_USER_IN)
elif data:
print(SERVER_LOG.format(*peername, name=uname, msg=data))
broadcast(socket, uname, data)
else:
msg = "uncommon transmission:«{}»".format(data)
print(SERVER_LOG.format(*peername, name=uname, msg=msg))
socket.send(("server do not transmit: {}\n".format(msg)).encode())

View File

@ -0,0 +1,16 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Cours OC/python 3 - Entre chaînes et listes
[Ex 2.3: afficherflottant](https://openclassrooms.com/courses/apprenez-a-programmer-en-python/les-listes-et-tuples-2-2#/id/r-2232398)
Fournit une string formate en float
"""
from package.fonctions import afficher_flottant
afficher_flottant(1.123456789)
afficher_flottant(0.1)

View File

@ -0,0 +1,30 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Cours OC/python 3 - Les structures conditionnelles
[Ex 1.4: Bisextile](https://openclassrooms.com/courses/apprenez-a-programmer-en-python/les-structures-conditionnelles#/id/r-231173)
Déterminer si une année saisie par l'utilisateur est bissextile
"""
annee = input("Saisir une année:")
annee = int(annee)
if (annee % 400) == 0 :
print(annee," est bisextile (divisible par 400)")
elif (annee % 4) == 0 and (annee % 100) != 0:
print(annee," est bisextile (divisible par 4, mais pas par 100)")
else:
print(annee," n'est PAS bisextile.")
liste = []
# La suite ne fait pas parti du TP: bonus perso
print("Voici la liste des annees bisextiles entre 1900 & 2030 :")
for a in range(1900,2030):
if ((a % 400) == 0) or ((a % 4) == 0 and (a % 100) != 0):
liste.append(a)
print(liste)

View File

@ -0,0 +1,110 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author: freezed <git@freezed.me> 2018-01-17
Licence: `GNU GPL v3`_
Version: 0.1
.. _GNU GPL v3: http://www.gnu.org/licenses/
"""
class TableauNoir:
"""
Definis une surface sur laquelle on peut ecrire.
On peut lire et effacer, par jeu de methodes. L'attribut
modifie est 'surface'
"""
def __init__(self):
"""Par defaut, notre surface est vide"""
self.surface = ""
def ecrire(self, texte):
"""
Methode permettant d'ecrire sur la surface du tableau.
Si la surface n'est pas vide, on saute une ligne avant de
rajouter le message a ecrire
:texte a: Le texte a ajouter au tableuu
:type a: string
:return: None
"""
if self.surface != "":
self.surface += "\n"
self.surface += texte
def lire(self):
"""
Cette methode se charge d'afficher, grace a print,
la surface du tableau
"""
print(self.surface)
def effacer(self):
"""Cette methode permet d'effacer la surface du tableau"""
self.surface = ""
class Duree:
"""
Classe contenant des durees sous la forme d'un nombre de minutes
et de secondes
"""
def __init__(self, min=0, sec=0):
"""Constructeur de la classe"""
self.min = min # Nombre de minutes
self.sec = sec # Nombre de secondes
def __str__(self):
"""Affichage MM:SS"""
return "{:02}:{:02}".format(self.min, self.sec)
def __add__(self, objet_a_ajouter):
"""L'objet a ajouter est un entier, le nombre de secondes"""
self.sec += objet_a_ajouter # On ajoute la duree
if self.sec >= 60: # Si le nombre de secondes >= 60
self.min += self.sec // 60
self.sec = self.sec % 60
return self # On renvoie la nouvelle duree
def __sub__(self, objet_a_soustraire):
"""
Soustrait le nombre de seconde passe en parametre
Ne retourne jamais de duree negative
:param a: secondes a soustraire
:type a: int
:return: object
"""
allsec = (self.min * 60) + self.sec
if objet_a_soustraire > allsec:
self.min = 0
self.sec = 0
else:
allsec -= objet_a_soustraire # On soustrait la duree
self.min = allsec // 60
self.sec = allsec % 60
return self # On renvoie la nouvelle duree
if __name__ == "__main__":
# pseudo-tests de la class «Duree»
print("[03:05]:", Duree(3, 5)) # __add__
print("[03:55]:", Duree(3, 5) + 50)
print("[05:35]:", Duree(3, 5) + 150)
print("[14:41]:", Duree(13, 51) + 50)
print("[11:05]:", Duree(10, 3*5) + 50)
print("[10:00]:", Duree(10, 5) - 5)
print("[00:05]:", Duree(10, 5) - 600)
print("[00:00]:", Duree(2, 5) - 600)

View File

@ -0,0 +1,73 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Cours OC/python 3
[Les decorateurs](https://openclassrooms.com/courses/apprenez-a-programmer-en-python/les-decorateurs)
Author: freezed <git@freezed.me> 2018-02-05
Version: 0.1
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
:Example:
>>> hello_world()
La fonction appelee: <function hello_world at 0x7f923c95f158> est obsolete.
>>> wait_for()
"""
import time
def my_decorator(function):
""" test de decorateur """
def modified_func():
""" Function modifiee utilisee par le decorateur """
print("Appel de la fonction: {}".format(function))
return function()
return modified_func
def obsolete_exception(function):
""" Decorateur empechant l'execution d'une fonction obsolete """
def modd_func():
print("La fonction appelee: {} est obsolete.".format(function))
return modd_func
def time_checker(seconds):
""" Recoit le parametre passe en argument du decorateur """
def time_decorator(function):
""" Le decorateur """
def modified_func(*args, **kwargs):
""" Function renvoyee par le decorateur """
tstp_begin = time.time()
exec_initial_func = function(*args, **kwargs)
tstp_end = time.time()
duration = tstp_end - tstp_begin
if duration > seconds:
print("La fonction {} à mis {}s pour s'executer".format( \
function, round(duration, 1)))
return exec_initial_func
return modified_func
return time_decorator
@obsolete_exception
def hello_world():
print("Hello World")
@time_checker(3)
def wait_for(name="à vous"):
input("Bonjour {}, appuyez sur la touche enter…".format(name))
if __name__ == "__main__":
""" Starting doctests """
import doctest
doctest.testmod()

View File

@ -0,0 +1,281 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author: freezed <freezed@users.noreply.github.com> 2018-01-25
Version: 0.1
Licence: `GNU GPL v3`: http://www.gnu.org/licenses/
"""
class DictionnaireOrdonne:
"""
Dictionnaire ordonne
====================
Objet ressemblant a un dict, avec des capacitees de tri.
Les cles et valeurs se trouvant dans des listes de meme
taille, il suffira de prendre l'indice dans une liste pour
savoir quel objet lui correspond dans l'autre. Par exemple,
la cle d'indice 0 est couplee avec la valeur d'indice 0.
:Example:
>>> fruits = DictionnaireOrdonne()
>>> fruits
{}
>>> fruits["pomme"] = 52
>>> fruits["poire"] = 34
>>> fruits["prune"] = 128
>>> fruits["melon"] = 15
>>> fruits
{'pomme': 52, 'poire': 34, 'prune': 128, 'melon': 15}
>>> fruits.sort()
>>> print(fruits)
{'melon': 15, 'poire': 34, 'pomme': 52, 'prune': 128}
>>> legumes = DictionnaireOrdonne(carotte = 26, haricot = 48)
# Test possible seulement avec python 3.6,
# voir: www.python.org/dev/peps/pep-0468/
#>>> print(legumes)
#{'carotte': 26, 'haricot': 48}
>>> len(legumes)
2
>>> legumes.reverse()
>>> fruits = fruits + legumes
>>> fruits
{'melon': 15, 'poire': 34, 'pomme': 52, 'prune': 128, 'haricot': 48, 'carotte': 26}
>>> del fruits['haricot']
>>> del fruits['betterave']
ValueError: «'betterave' is not in list»
>>> 'haricot' in fruits
False
>>> 'pomme' in fruits
True
>>> legumes['haricot']
48
>>> fruits['betterave']
ValueError: «'betterave' is not in list»
>>> for cle in legumes:
... print(cle)
...
haricot
carotte
>>> fruits.keys()
['melon', 'poire', 'pomme', 'prune', 'carotte']
>>> legumes.keys()
['haricot', 'carotte']
>>> fruits.values()
[15, 34, 52, 128, 26]
>>> legumes.values()
[48, 26]
>>> for nom, qtt in legumes.items():
... print("{0} ({1})".format(nom, qtt))
...
haricot (48)
carotte (26)
>>> liste = [0,1,2,3]
>>> tentative1 = DictionnaireOrdonne(liste)
Un dict() est attendu en argument!
>>> dico_vide = {}
>>> tentative2 = DictionnaireOrdonne(dico_vide)
>>> tentative2
{}
>>> mots = {'olive': 51, 'identite': 43, 'mercredi': 25, 'prout': 218, 'assiette': 8, 'truc': 26}
>>> mots_ordonne = DictionnaireOrdonne(mots)
>>> mots_ordonne.sort()
>>> mots_ordonne
{'assiette': 8, 'mercredi': 25, 'truc': 26, 'identite': 43, 'olive': 51, 'prout': 218}
"""
def __init__(self, filled_dict={}, **kwargs):
"""
Peu prendre aucun parametre ou:
- un dictionnaire 'filled_dict' en 1er argument
- des valeurs nommees dans 'kwargs'
"""
# Creation des attributs qui stokeront les cles et valeurs
self._keys_list = list()
self._values_list = list()
# Si 'filled_dict' est un dict() non vide, ajout du contenu
if type(filled_dict) not in (dict, DictionnaireOrdonne):
#raise TypeError("Un dict() est attendu en argument!")
print("Un dict() est attendu en argument!")
else:
for key, val in filled_dict.items():
self._keys_list.append(key)
self._values_list.append(val)
# Si les kwargs ne sont pas vide, ajout du contenu
if len(kwargs) != 0:
for key, val in kwargs.items():
self._keys_list.append(key)
self._values_list.append(val)
def __add__(self, other_dict_ord):
"""
On doit pouvoir ajouter deux dictionnaires ordonnes
(dico1 + dico2) ; les cles et valeurs du second dictionnaire
sont ajoutees au premier.
"""
i = 0
while i < len(other_dict_ord):
self._keys_list.append(other_dict_ord._keys_list[i])
self._values_list.append(other_dict_ord._values_list[i])
i += 1
return self
def __contains__(self, key_to_find):
""" Cherche une cle dans notre objet (cle in dictionnaire) """
return key_to_find in self._keys_list
def __delitem__(self, key_to_del):
""" Acces avec crochets pour suppression (del objet[cle]) """
try:
index_to_del = self._keys_list.index(key_to_del)
except ValueError as except_detail:
print("ValueError: «{}»".format(except_detail))
else:
del self._keys_list[index_to_del]
del self._values_list[index_to_del]
def __iter__(self):
"""Parcours de l'objet, renvoi l'iterateur des cles"""
return iter(self._keys_list)
def __getitem__(self, key_to_get):
""" Acces aux crochets pour recuperer une valeur (objet[cle]) """
try:
find_key = self._keys_list.index(key_to_get)
except ValueError as except_detail:
print("ValueError: «{}»".format(except_detail))
else:
print(self._values_list[find_key])
def __len__(self):
""" Retourne la taille de l'objet grace a la fonction len """
return len(self._keys_list)
def __repr__(self):
"""
Affiche l'objet dans l'interpreteur ou grâce a la fonction
print: ({cle1: valeur1, cle2: valeur2, }).
"""
# contiendra le txt a afficher
object_repr = list()
# Si l'objet n'est pas vide
if len(self._keys_list) != 0:
for i in range(0, len(self._keys_list)):
object_repr.append("'{}': {}".format(self._keys_list[i], self._values_list[i]))
return "{0}{1}{2}".format(
"{",
", ".join(object_repr),
"}"
)
def __setitem__(self, cle, valeur):
"""
Acces avec crochets pour modif (objet[cle] = valeur). Si la cle
existe on ecrase l'ancienne valeur, sinon on ajoute le couple
cle-valeur a la fin
"""
try:
index = self._keys_list.index(cle)
self._keys_list[index] = cle
self._values_list[index] = valeur
except ValueError:
self._keys_list.append(cle)
self._values_list.append(valeur)
def __str__(self):
"""
Methode pour afficher le dictionnaire avec «print()» ou pour
le convertir en chaine grâce aec «str()». Redirige sur __repr__
"""
return repr(self)
def keys(self):
"""
La methode keys() (renvoyant la liste des cles) doit etre
mises en œuvre. Le type de retour de ces methodes est laisse
a votre initiative : il peut s'agir d'iterateurs ou de
generateurs (tant qu'on peut les parcourir)
"""
return list(self._keys_list)
def sort(self, reverse=False):
"""
L'objet doit definir les methodes sort pour le trier et reverse
pour l'inverser. Le tri de l'objet doit se faire en fonction
des cles
"""
# Peut etre un peu overkill… voir methode dans la correction
# pour trier on stocke les couples de cle & valeur sous forme
# de tuple dans une liste temporaire
liste_temporaire = list()
if len(self._keys_list) != 0: # Seulement si il y a des donnees
for i in range(0, len(self._keys_list)): # on parcour chaque entee
liste_temporaire.append((self._keys_list[i], self._values_list[i]))
# Tri des tuples par la valeur par une comprension de liste
liste_permute = [(val, cle) for cle, val in liste_temporaire]
liste_triee = [(cle, val) for val, cle in sorted(liste_permute, reverse=reverse)]
# On range les donnees tries dans attributs de l'objet
self._keys_list = [cle for cle, val in liste_triee]
self._values_list = [val for cle, val in liste_triee]
def reverse(self):
"""
L'objet doit definir les methodes sort pour le trier et reverse
pour l'inverser. Le tri de l'objet doit se faire en fonction
des cles
"""
return self.sort(reverse=True)
def items(self):
"""Renvoi un generateur contenant les couples (cle, valeur)"""
for key, val in enumerate(self._keys_list):
yield (val, self._values_list[key])
def values(self):
"""
La methode values() (renvoi la liste des valeurs) doit etre
mises en œuvre. Le type de retour de ces methodes est laisse
a votre initiative : il peut s'agir d'iterateurs ou de
generateurs (tant qu'on peut les parcourir)
"""
return list(self._values_list)
if __name__ == "__main__":
""" Active les doctests """
import doctest
doctest.testmod()

View File

@ -0,0 +1,257 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author: freezed <freezed@users.noreply.github.com> 2018-01-25
Version: 0.1
Licence: `GNU GPL v3`: http://www.gnu.org/licenses/
"""
class DictionnaireOrdonne:
"""
Dictionnaire ordonne
====================
Notre dictionnaire ordonné. L'ordre des données est maintenu
et il peut donc, contrairement aux dictionnaires usuels, être trié
ou voir l'ordre de ses données inversées
:Example:
>>> fruits = DictionnaireOrdonne()
>>> fruits
{}
>>> fruits["pomme"] = 52
>>> fruits["poire"] = 34
>>> fruits["prune"] = 128
>>> fruits["melon"] = 15
>>> fruits
{'pomme': 52, 'poire': 34, 'prune': 128, 'melon': 15}
>>> fruits.sort()
>>> print(fruits)
{'melon': 15, 'poire': 34, 'pomme': 52, 'prune': 128}
>>> legumes = DictionnaireOrdonne(carotte = 26, haricot = 48)
# Test possible seulement avec python 3.6,
# voir: www.python.org/dev/peps/pep-0468/
#>>> print(legumes)
#{'carotte': 26, 'haricot': 48}
>>> len(legumes)
2
>>> legumes.reverse()
>>> fruits = fruits + legumes
>>> fruits
{'melon': 15, 'poire': 34, 'pomme': 52, 'prune': 128, 'haricot': 48, 'carotte': 26}
>>> del fruits['haricot']
>>> 'haricot' in fruits
False
>>> 'pomme' in fruits
True
>>> legumes['haricot']
48
>>> for cle in legumes:
... print(cle)
...
haricot
carotte
>>> fruits.keys()
['melon', 'poire', 'pomme', 'prune', 'carotte']
>>> legumes.keys()
['haricot', 'carotte']
>>> fruits.values()
[15, 34, 52, 128, 26]
>>> legumes.values()
[48, 26]
>>> for nom, qtt in legumes.items():
... print("{0} ({1})".format(nom, qtt))
...
haricot (48)
carotte (26)
>>> mots = {'olive': 51, 'identite': 43, 'mercredi': 25, 'prout': 218, 'assiette': 8, 'truc': 26}
>>> mots_ordonne = DictionnaireOrdonne(mots)
>>> mots_ordonne.sort()
>>> mots_ordonne
{'assiette': 8, 'identite': 43, 'mercredi': 25, 'olive': 51, 'prout': 218, 'truc': 26}
"""
def __init__(self, base={}, **donnees):
"""Constructeur de notre objet. Il peut ne prendre aucun paramètre
(dans ce cas, le dictionnaire sera vide) ou construire un
dictionnaire remplis grâce :
- au dictionnaire 'base' passé en premier paramètre ;
- aux valeurs que l'on retrouve dans 'donnees'."""
self._cles = [] # Liste contenant nos clés
self._valeurs = [] # Liste contenant les valeurs correspondant à nos clés
# On vérifie que 'base' est un dictionnaire exploitable
if type(base) not in (dict, DictionnaireOrdonne):
raise TypeError( \
"le type attendu est un dictionnaire (usuel ou ordonne)")
# On récupère les données de 'base'
for cle in base:
self[cle] = base[cle]
# On récupère les données de 'donnees'
for cle in donnees:
self[cle] = donnees[cle]
def __repr__(self):
"""Représentation de notre objet. C'est cette chaîne qui sera affichée
quand on saisit directement le dictionnaire dans l'interpréteur, ou en
utilisant la fonction 'repr'"""
chaine = "{"
premier_passage = True
for cle, valeur in self.items():
if not premier_passage:
chaine += ", " # On ajoute la virgule comme séparateur
else:
premier_passage = False
chaine += repr(cle) + ": " + repr(valeur)
chaine += "}"
return chaine
def __str__(self):
"""Fonction appelée quand on souhaite afficher le dictionnaire grâce
à la fonction 'print' ou le convertir en chaîne grâce au constructeur
'str'. On redirige sur __repr__"""
return repr(self)
def __len__(self):
"""Renvoie la taille du dictionnaire"""
return len(self._cles)
def __contains__(self, cle):
"""Renvoie True si la clé est dans la liste des clés, False sinon"""
return cle in self._cles
def __getitem__(self, cle):
"""Renvoie la valeur correspondant à la clé si elle existe, lève
une exception KeyError sinon"""
if cle not in self._cles:
raise KeyError( \
"La clé {0} ne se trouve pas dans le dictionnaire".format( \
cle))
else:
indice = self._cles.index(cle)
return self._valeurs[indice]
def __setitem__(self, cle, valeur):
"""Méthode spéciale appelée quand on cherche à modifier une clé
présente dans le dictionnaire. Si la clé n'est pas présente, on l'ajoute
à la fin du dictionnaire"""
if cle in self._cles:
indice = self._cles.index(cle)
self._valeurs[indice] = valeur
else:
self._cles.append(cle)
self._valeurs.append(valeur)
def __delitem__(self, cle):
"""Méthode appelée quand on souhaite supprimer une clé"""
if cle not in self._cles:
raise KeyError( \
"La clé {0} ne se trouve pas dans le dictionnaire".format( \
cle))
else:
indice = self._cles.index(cle)
del self._cles[indice]
del self._valeurs[indice]
def __iter__(self):
"""Méthode de parcours de l'objet. On renvoie l'itérateur des clés"""
return iter(self._cles)
def __add__(self, autre_objet):
"""On renvoie un nouveau dictionnaire contenant les deux
dictionnaires mis bout à bout (d'abord self puis autre_objet)"""
if type(autre_objet) is not type(self):
raise TypeError( \
"Impossible de concaténer {0} et {1}".format( \
type(self), type(autre_objet)))
else:
nouveau = DictionnaireOrdonne()
# On commence par copier self dans le dictionnaire
for cle, valeur in self.items():
nouveau[cle] = valeur
# On copie ensuite autre_objet
for cle, valeur in autre_objet.items():
nouveau[cle] = valeur
return nouveau
def items(self):
"""Renvoie un générateur contenant les couples (cle, valeur)"""
for i, cle in enumerate(self._cles):
valeur = self._valeurs[i]
yield (cle, valeur)
def keys(self):
"""Cette méthode renvoie la liste des clés"""
return list(self._cles)
def values(self):
"""Cette méthode renvoie la liste des valeurs"""
return list(self._valeurs)
def reverse(self):
"""Inversion du dictionnaire"""
# On crée deux listes vides qui contiendront le nouvel ordre des clés
# et valeurs
cles = []
valeurs = []
for cle, valeur in self.items():
# On ajoute les clés et valeurs au début de la liste
cles.insert(0, cle)
valeurs.insert(0, valeur)
# On met ensuite à jour nos listes
self._cles = cles
self._valeurs = valeurs
def sort(self):
"""Méthode permettant de trier le dictionnaire en fonction de ses clés"""
# On trie les clés
cles_triees = sorted(self._cles)
# On crée une liste de valeurs, encore vide
valeurs = []
# On parcourt ensuite la liste des clés triées
for cle in cles_triees:
valeur = self[cle]
valeurs.append(valeur)
# Enfin, on met à jour notre liste de clés et de valeurs
self._cles = cles_triees
self._valeurs = valeurs
if __name__ == "__main__":
""" Active les doctests """
import doctest
doctest.testmod()

View File

@ -0,0 +1,73 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Cours OC/python 3
Module de test: essai d'utilisation d'un package
Utilise par:
- ../afficherflottant.py
"""
def table(n, m=11):
"""Chapitre 1.7 - Modularite
Affiche la table de multiplication d'un nombre
de 1 * n
a m * n """
for i in range(1, m):
print(i, "x", n, "=", i * n)
def afficher_flottant(flot):
"""Chapitre 2.3 - Entre chaînes et listes
Affiche un nombre a virgule flottante tronque a 3 decimales
et remplace le point (.) par une virgule (,)"""
if type(flot) is not float:
print("Le parametre doit etre de type float!")
else:
flot = str(flot)
entier, decimal = flot.split('.')
print(
','.join((entier, decimal[:3]))
)
def affiche(*liste_parametres, sep=' ', fin='\n'):
"""Chapitre 2.3 - Entre chaînes et listes:
Fonction chargée de reproduire le comportement de print.
Elle doit finir par faire appel à print pour afficher le résultat.
Mais les paramètres devront déjà avoir été formatés.
On doit passer à print une unique chaîne, en lui spécifiant de
ne rien mettre à la fin : print(chaine, end='')"""
contenu = str()
for parametre in liste_parametres:
contenu += str(parametre)
contenu += sep
contenu = contenu + fin
print(contenu, end='')
if __name__ == "__main__":
# Tests de la fonction 'affiche'
affiche("'string'", "'autre string; 1'", 2)
affiche(1.12, "'string'", "'autre string; 1'", 2)
affiche(False, True, 1.12, "'string'", "'autre string; 1'", 2)
# Tests de la fonction 'afficher_flottant'
#afficher_flottant(1.123456789)
#afficher_flottant(1.12)
#afficher_flottant(0.1)
#afficher_flottant("a")
#afficher_flottant(False)
#afficher_flottant(100)
# test de la fonction 'table'
#table(3)

View File

@ -0,0 +1,98 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author: freezed <freezed@users.noreply.github.com> 2018-03-23
Version: 0.1
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
testing kwargs in a function
:Example:
>>> d = {'a2': 'a', 'a3': 'blablabla'}
>>> test(6, **d)
a1:«6», a2:«a», a3:«blablabla»
>>> test(7)
a1:«7», a2:«default value for a2», a3:«default value for a3»
>>> test(8, a2='input a2')
a1:«8», a2:«input a2», a3:«default value for a3»
>>> test(9, a3='input a3')
a1:«9», a2:«default value for a2», a3:«input a3»
>>> test(10, a2='input a2', a3='input a3')
a1:«10», a2:«input a2», a3:«input a3»
====
>>> get_value('symbol', 'name', 'void', 0)
' '
>>> get_value('symbol', 'name', 'void')
[' ']
>>> get_value('tile', 'symbol', 'z', 0) is False
True
>>> get_value(ksel='collect', kval='name', vsel=True)
['needle', 'tube', 'ether']
>>> dico = {'kval': 'tile', 'ksel': 'ressurect', 'vsel': False}
>>> get_value(**dico)
['img/3-blue-transp-30.png', 'img/1-blue-transp-30.png', 'img/2-blue-transp-30.png', 'img/g-orange-transp-30.png', 'img/transp-30.png', 'img/player-30.png', False]
>>> dico = {'kval': 'tile', 'ksel': 'ressurect', 'vsel': False, 'nline': 0}
>>> get_value(**dico)
'img/3-blue-transp-30.png'
"""
LIST = [
{'symbol': 'n', 'name': 'needle', 'cross': True, 'ressurect': False, 'collect': True, 'tile': 'img/3-blue-transp-30.png'},
{'symbol': 't', 'name': 'tube', 'cross': True, 'ressurect': False, 'collect': True, 'tile': 'img/1-blue-transp-30.png'},
{'symbol': 'e', 'name': 'ether', 'cross': True, 'ressurect': False, 'collect': True, 'tile': 'img/2-blue-transp-30.png'},
{'symbol': 'E', 'name': 'exit', 'cross': True, 'ressurect': False, 'collect': False, 'tile': 'img/g-orange-transp-30.png'},
{'symbol': ' ', 'name': 'void', 'cross': True, 'ressurect': True, 'collect': False, 'tile': 'img/blue-white-30.png'},
{'symbol': '.', 'name': 'wall', 'cross': False, 'ressurect': False, 'collect': False, 'tile': 'img/transp-30.png'},
{'symbol': 'X', 'name': 'player', 'cross': False, 'ressurect': False, 'collect': False, 'tile': 'img/player-30.png'},
{'symbol': '\n', 'name': 'nlin', 'cross': False, 'ressurect': False, 'collect': False, 'tile': False},
]
def test(a1, **kwargs):
if 'a2' in kwargs:
a2 = kwargs['a2']
else:
a2 = 'default value for a2'
if 'a3' in kwargs:
a3 = kwargs['a3']
else:
a3 = 'default value for a3'
print('a1:«{}», a2:«{}», a3:«{}»'.format(a1, a2, a3))
def get_value(kval, ksel, vsel, nline=False):
"""
Return a value from LIST
:param str kval: key of the value returned
:param str ksel: key of the selection criteria
:param str vsel: value of the selection criteria
:return str/bool/:
"""
try:
if nline is False:
return [element[kval] for element in LIST if element[ksel] == vsel]
else:
return [element[kval] for element in LIST if element[ksel] == vsel][nline]
except IndexError as except_detail:
# print("IndexError: «{}»".format(except_detail))
return False
if __name__ == "__main__":
""" Starting doctests """
import doctest
doctest.testmod()

View File

@ -0,0 +1,27 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author:
https://openclassrooms.com/forum/sujet/exercices-du-cours-python-postez-ici?page=25#message-92220709
"""
from os import system
import subprocess
print("$ AFIGO")
input("Check ENTREE for scan dhcp")
system("clear")
print("")
print("IP LIST")
print("------------------------------------------------------------")
print("")
for i in range(0, 255):
a = subprocess.getoutput("host 192.168.1."+str(i))
if a == (str(i)+".1.168.192.in-addr.arpa has no PTR record"):
pass
else:
print(a)
pass
print("")
print("------------------------------------------------------------")

View File

@ -0,0 +1,86 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author: freezed <freezed@users.noreply.github.com> 2018-08-03
Version: 0.1
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
Basic implementation of PyMySQL
-- Local DB --
CREATE DATABASE loff CHARACTER SET 'utf8';
USE loff;
CREATE TABLE category(
`id`INT UNSIGNED NOT NULL AUTO_INCREMENT PRIMARY KEY,
`name` VARCHAR(200) UNIQUE
)ENGINE=InnoDB;
CREATE TABLE product(
`id` INT UNSIGNED NOT NULL AUTO_INCREMENT PRIMARY KEY,
`code` BIGINT UNSIGNED NOT NULL UNIQUE,
`url` VARCHAR(200),
`name` VARCHAR(200) UNIQUE,
`nutrition_grades` VARCHAR(1),
`category_id`INT UNSIGNED,
`substitute_id` INT UNSIGNED,
CONSTRAINT `fk_product_category`
FOREIGN KEY (category_id) REFERENCES category(id)
ON DELETE CASCADE,
CONSTRAINT `fk_product_substitute`
FOREIGN KEY (substitute_id) REFERENCES product(id)
ON DELETE SET NULL
)ENGINE=InnoDB;
"""
import pymysql
DB_CONFIG = {
'host': 'localhost',
'user': 'loff',
'password': 'loff',
'db': 'loff',
'charset': 'utf8',
'autocommit': False
}
CONF = {
'host': DB_CONFIG['host'],
'user': DB_CONFIG['user'],
'db': DB_CONFIG['db'],
'password': DB_CONFIG['password'],
'charset': DB_CONFIG['charset'],
'cursorclass': pymysql.cursors.DictCursor
}
REQUEST_LIST = [
"""INSERT INTO category (`name`) VALUES ('farces')""",
"""INSERT INTO product (`name`, `code`, `url`, `nutrition_grades`, \
`category_id`) SELECT "Farce de Veau", "3384480023221",
\"https://fr.openfoodfacts.org/produit/3384480023221/farce-de-veau-tendriade", \
"e", id AS category_id FROM category WHERE name = "farces";""",
"""INSERT INTO product (`name`, `code`, `url`, `nutrition_grades`, \
`category_id`) SELECT "Chair à saucisse Pur Porc", "3222472948438", \
"https://fr.openfoodfacts.org/produit/3222472948438/chair-a-saucisse-pur-porc-casino", \
"d", id AS category_id FROM category WHERE name = "farces";""",
"""INSERT INTO product (`name`, `code`, `url`, `nutrition_grades`, \
`category_id`) SELECT "Farce à Légumes, Pur Porc", "3254560320666", \
"https://fr.openfoodfacts.org/produit/3254560320666/farce-a-legumes-pur-porc-l-oiseau", \
"d", id AS category_id FROM category WHERE name = "farces";""",
"""SELECT c.name AS Category, p.code, p.name AS Product, \
p.nutrition_grades AS Nutriscore FROM category AS c \
LEFT JOIN product AS p ON c.id = p.category_id""",
]
CNX = pymysql.connect(**CONF)
CURSOR = CNX.cursor()
for idx, sql in enumerate(REQUEST_LIST):
CURSOR.execute(sql)
results = CURSOR.fetchall()
print("\n{}. [{}…] Rows affected: {}".format(idx, sql[87:100], CURSOR.rowcount))
# CNX.commit()
CURSOR.close()
CNX.close()

View File

@ -0,0 +1,32 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""1st implementation of signal module https://stackoverflow.com/q/48929752"""
import time
import signal
import os
import sys
def cls():
""" console clearing """
os.system('clear')
return
def handler(signal, frame):
""" Catch <ctrl+c> signal for clean stop"""
print("{}, script stops".format(time.strftime('%H:%M:%S')))
sys.exit(0)
signal.signal(signal.SIGINT, handler)
START_TIME = time.strftime('%H:%M:%S')
PROGRESSION = str()
while True:
time.sleep(2)
PROGRESSION += "."
cls()
print("{}, script starts\n{}".format(START_TIME, PROGRESSION))

View File

@ -0,0 +1,61 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
timeclient.py
Time & networking test, talking script
"""
import socket, signal, select, sys
MSG_ARG_ERROR = "Usage: client.py hostname port"
if len(sys.argv) < 3:
print(MSG_ARG_ERROR)
sys.exit(1)
HOST = sys.argv[1]
PORT = int(sys.argv[2])
BUFFER = 1024
MSG_SERVER_CONNECTED = "Serveur connecté @{}:{}"
MSG_CLOSE_CONNECTION = "Connexion vers [{}:{}] fermée"
def prompt():
sys.stdout.write('~')
sys.stdout.flush()
def handler(signum, frame):
""" Catch <ctrl+c> signal for clean stop"""
print()
print(MSG_CLOSE_CONNECTION.format(*(SERVER_CONNECTION.getpeername())))
SERVER_CONNECTION.send(b"QUIT")
SERVER_CONNECTION.close()
sys.exit(0)
signal.signal(signal.SIGINT, handler)
SERVER_CONNECTION = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
try:
SERVER_CONNECTION.connect((HOST, PORT))
except ConnectionRefusedError as except_detail:
print("ConnectionRefusedError: «{}». Unable to connect".format(except_detail))
sys.exit()
print(MSG_SERVER_CONNECTED.format(HOST, PORT))
inputs = [SERVER_CONNECTION]
while 1:
rlist, wlist, elist = select.select(inputs, [], [])
for socket in rlist:
if socket == SERVER_CONNECTION: # incomming message
data = socket.recv(BUFFER).decode()
if not data:
print(MSG_CLOSE_CONNECTION.format(HOST, PORT))
sys.exit()
else:
#print data
sys.stdout.write(data)
prompt()

View File

@ -0,0 +1,82 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
flushserver.py
Time & networking test, talking script
"""
import datetime, select, signal, socket, sys, time
HOST = ''
PORT = 5555
BUFFER = 1024
SERVER_LOG = "{}:{}|{msg}"
MSG_SERVER_STOP = "Server stop"
MSG_START_SERVER = "Server is running, listening on port {}.\n\tPress <ctrl+c> to stop"
inputs = []
def handler(signum, frame):
""" Catch <ctrl+c> signal for clean stop"""
print()
inputs.remove(MAIN_CONNECTION)
i = 1
for socket in inputs:
print(SERVER_LOG.format(*socket.getpeername(), msg="closed client socket"))
socket.close()
i += 1
inputs.clear()
print(MSG_SERVER_STOP)
MAIN_CONNECTION.close()
sys.exit(0)
signal.signal(signal.SIGINT, handler)
def broadcast(sender, name, message):
# send message to all clients, except the sender
message = "\n~{}~ {}".format(name, message)
for socket in inputs:
if socket != MAIN_CONNECTION and socket != sender:
try:
socket.send(message.encode())
except BrokenPipeError:
print(SERVER_LOG.format(*socket.getpeername(), msg="closed client socket"))
socket.close()
inputs.remove(socket)
# Creation de la connection
MAIN_CONNECTION = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
MAIN_CONNECTION.setsockopt(socket.SOL_SOCKET, socket.SO_REUSEADDR, 1)
MAIN_CONNECTION.bind((HOST, PORT))
MAIN_CONNECTION.listen(5)
inputs.append(MAIN_CONNECTION)
print(MSG_START_SERVER.format(PORT))
while 1:
# listening network
rlist, wlist, xlist = select.select(inputs, [], [], 0.05)
for socket in rlist:
# Listen for new client connection
if socket == MAIN_CONNECTION:
socket_object, socket_addr = socket.accept()
inputs.append(socket_object)
print(SERVER_LOG.format(*socket_addr, msg="connected"))
msg_time = str(datetime.datetime.now()).split('.')[0]
socket_object.send(msg_time.encode())
else: # receiving data
data = socket.recv(BUFFER).decode().strip()
peername = socket.getpeername()
if data.upper() == "QUIT":
print(SERVER_LOG.format(*peername, name=None, msg="disconnected"))
inputs.remove(socket)
socket.close()
timestamp = time.localtime()
if timestamp.tm_sec % 10 == 0:
broadcast(None, "CLOCK", time.strftime('%Y-%m-%d %H:%M:%S', timestamp))
time.sleep(1)

View File

@ -0,0 +1,29 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
format syntax with tuple
https://stackoverflow.com/q/48990106/6709630
"""
t = ("alpha", "omega")
v = "to"
m = "From {} {} {} "
ms = "From {0} to {1}"
msg = "From {0} {var} {1} "
expr_list = [
"t, v",
"m.format(t, v)",
"m.format(*t, v)",
"ms.format(t)",
"msg.format(t, v)",
"msg.format(t, var=v)",
"msg.format(*t, var=v)",
]
for num, expr in enumerate(expr_list):
try:
print("Expr{}, <{}>: «{}»".format(num, expr, eval(expr)))
except Exception as except_detail:
print("Expr{}, <{}> : Exception «{}»".format(num, expr, except_detail))

View File

@ -0,0 +1,135 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Cours OC/python 3 - TP: tous au ZCasino
[TP 1.9: zcasino](https://openclassrooms.com/courses/apprenez-a-programmer-en-python/tp-tous-au-zcasino)
Un petit jeu de roulette très simplifie
=======================================
Le joueur mise sur un numero compris entre 0 et 49
En choisissant son numero, il mise
Les numeros pairs sont noire, les impairs sont de rouge
Quand la roulette s'arrete:
-Si numero gagnant: gain = 3x la mise
-Si meme couleur: gain = 50% de la mise
-Sinon la mise est perdue
"""
import math
import random
import os
#############
# VARIABLES #
#############
jeu_continu = True
credit = 1000
filename = ".highscore"
old_highscore = -1
#########
# TEXTE #
#########
curr_symb = ""
disclamer = "Bienvenu à la roulette, vous avez un crédit de " + \
str(credit) + curr_symb + ": bonne partie."
err_plage = "Il faut saisir un nombre dans la plage indiquée! "
err_saisie = "Il faut saisir un nombre! "
msg_resultat = "\nLa bille s'arrête sur le nunéro: "
msg_numero = "\nVotre nombre est gagnant! Votre gain: "
msg_couleur = "\nVotre couleur est gagnante! Votre gain: "
msg_perdu = "\nVous perdez votre mise!"
msg_continue = "Pour arrêter la partie, tapez « n »: "
msg_solde = "Votre solde : "
msg_arret = "Vous avez décidé d'arrêter la partie avec un solde de: "
msg_final = "Votre solde à atteind 0€: la partie s'arrête"
msg_no_score = "Pas d'ancien score."
msg_best_score = "Bravo, vous battez le précédent record de gain qui était: "
msg_bad_score = "Le record de gain enregistré était: "
################
# DÉBUT DU JEU #
################
print(disclamer)
while jeu_continu is True:
# Saisie & validation du choix
choix_valeur = 50
while choix_valeur >= 50 or choix_valeur < 0:
choix_valeur = input("Quel numéro choisissez vous (0-49)?")
try:
choix_valeur = int(choix_valeur)
except ValueError:
print(err_saisie)
choix_valeur = 50
continue
if choix_valeur >= 50 or choix_valeur < 0:
print(err_plage)
# Saisie & validation de la mise
mise = 0
while mise <= 0 or mise > credit:
mise = input("Quelle est votre mise (1-" + str(credit) + "?)")
try:
mise = int(mise)
except ValueError:
print(err_saisie)
mise = 0
continue
if mise <= 0 or mise > credit:
print(err_plage)
result_valeur = random.randrange(50) # Roulette
# Comparaison
if result_valeur == choix_valeur:
gain = mise * 3
msg = msg_resultat + str(result_valeur) + msg_numero + \
str(gain) + curr_symb
elif result_valeur % 2 == choix_valeur % 2:
gain = math.ceil(mise / 2)
msg = msg_resultat + str(result_valeur) + msg_couleur + \
str(gain) + curr_symb
else:
gain = - mise
msg = msg_resultat + str(result_valeur) + msg_perdu
credit = credit + gain
print(msg) # Affichage de fin de tour
if credit > 0: # affiche credit
print(msg_solde + str(credit))
ask_continue = str(input(msg_continue)) # demande de continuer
if ask_continue == "n": # Arret demandé par le joueur
jeu_continu = False
msg_final = (msg_arret + str(credit) + curr_symb)
else:
jeu_continu = False # fin du jeu
if os.path.isfile(filename) is True: # On recupere le highscore
with open(filename, "r") as highscore:
old_highscore = int(highscore.read())
if old_highscore == -1: # Pas encore de partie gagnante
msg_score = msg_no_score
elif credit > old_highscore and old_highscore != -1: # Highscore battu
msg_score = msg_best_score + str(old_highscore) + curr_symb
else:
msg_score = msg_bad_score + str(old_highscore) + curr_symb
if (credit > 0 and old_highscore == -1) or credit > old_highscore:
with open(filename, "w") as highscore:
highscore.write(str(credit))
print(msg_final) # Affichage du message de fin de partie
print(msg_score) # Affichage du score/highscore

View File

@ -0,0 +1,76 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# Ce fichier abrite le code du ZCasino, un jeu de roulette adapté
from random import randrange
from math import ceil
# Déclaration des variables de départ
argent = 1000 # On a 1000 $ au début du jeu
continuer_partie = True # Booléen qui est vrai tant qu'on doit \
# continuer la partie
print("Vous vous installez à la table de roulette avec", argent, "$.")
while continuer_partie: # Tant qu'on doit continuer la partie
# on demande à l'utilisateur de saisir le nombre sur
# lequel il va miser
nombre_mise = -1
while nombre_mise < 0 or nombre_mise > 49:
nombre_mise = input("Tapez le nombre sur lequel vous voulez miser (entre 0 et 49) : ")
# On convertit le nombre misé
try:
nombre_mise = int(nombre_mise)
except ValueError:
print("Vous n'avez pas saisi de nombre")
nombre_mise = -1
continue
if nombre_mise < 0:
print("Ce nombre est négatif")
if nombre_mise > 49:
print("Ce nombre est supérieur à 49")
# À présent, on sélectionne la somme à miser sur le nombre
mise = 0
while mise <= 0 or mise > argent:
mise = input("Tapez le montant de votre mise : ")
# On convertit la mise
try:
mise = int(mise)
except ValueError:
print("Vous n'avez pas saisi de nombre")
mise = -1
continue
if mise <= 0:
print("La mise saisie est négative ou nulle.")
if mise > argent:
print("Vous ne pouvez miser autant, vous n'avez que", argent, "$")
# Le nombre misé et la mise ont été sélectionnés par
# l'utilisateur, on fait tourner la roulette
numero_gagnant = randrange(50)
print("La roulette tourne... ... et s'arrête sur le numéro", numero_gagnant)
# On établit le gain du joueur
if numero_gagnant == nombre_mise:
print("Félicitations ! Vous obtenez", mise * 3, "$ !")
argent += mise * 3
elif numero_gagnant % 2 == nombre_mise % 2: # ils sont de la même couleur
mise = ceil(mise * 0.5)
print("Vous avez misé sur la bonne couleur. Vous obtenez", mise, "$")
argent += mise
else:
print("Désolé l'ami, c'est pas pour cette fois. Vous perdez votre mise.")
argent -= mise
# On interrompt la partie si le joueur est ruiné
if argent <= 0:
print("Vous êtes ruiné ! C'est la fin de la partie.")
continuer_partie = False
else:
# On affiche l'argent du joueur
print("Vous avez à présent", argent, "$")
quitter = input("Souhaitez-vous quitter le casino (o/n) ? ")
if quitter == "o" or quitter == "O":
print("Vous quittez le casino avec vos gains.")
continuer_partie = False

View File

@ -0,0 +1,674 @@
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
<program> Copyright (C) <year> <name of author>
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
<http://www.gnu.org/licenses/>.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
<http://www.gnu.org/philosophy/why-not-lgpl.html>.

View File

@ -0,0 +1,10 @@
# Discovering [pytest](https://docs.pytest.org/en/latest/getting-started.html) with [Sam & Max](http://sametmax.com/tag/pytest/) & [Open Classrooms](https://openclassrooms.com/fr/courses/4425126-testez-votre-projet-avec-python "Testez votre projet avec Python")
This is a (partial) fork of my _study work_ [ocp5](https://github.com/freezed/ocp5/blob/master/README.md) providing code for discovering [`pytest`](https://docs.pytest.org/en/latest/contents.html).
Work is done with :
- `Python 3.6.4`
- `PyMySQL 0.9.2`
- `requests 2.11.1`
- `pytest 3.7.1`

View File

@ -0,0 +1,301 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author: freezed <freezed@users.noreply.github.com> 2018-08-04
Version: 0.1
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
Command line interface to interact with local DB
Choose a product in a list of aivaiable categories['results_list'],
the system gives you an alternative with a better 'nutriscore'.
You can save this product to get it later.
"""
from os import system
from db import Db
from config import DB_REQUEST, CLI_MSG_DISCLAIMER, CLI_MSG_ASK_IDX, \
CLI_MSG_ASK_ERR, CLI_MSG_QUIT, CLI_MSG_CHOOSEN_CAT, CLI_MSG_PROD, \
CLI_MSG_SUBST, CLI_MSG_NO_SUBST, CLI_MSG_CAT, CLI_MSG_CHOOSEN_PROD, \
CLI_MSG_DETAILLED_SUB, CLI_MAX_LEN, \
CLI_ITEM_LIST, CLI_MSG_ASK_BAK, CLI_MSG_BAK_DONE, CLI_MSG_INIT_MENU,\
CLI_MSG_SUBST_HEAD, CLI_MSG_SUBST_TITLE, CLI_MSG_SUBST_LIST
product_asked = {'valid_item': False}
cli_end_msg = CLI_MSG_QUIT
def ask_user(head_msg, item_list):
"""
Ask user to choose an item in the provided list, using numeric index
:head_msg: Text displayed in header
:item_list: Dict() containing all data about item (see `get_data_list()`)
:result:
- item:
- cli_end_msg:
- valid_item:
"""
valid_input = False
foot_msg = ""
while valid_input is False:
system('clear')
print(head_msg)
print(item_list['results_txt'])
print(foot_msg)
user_input = input(CLI_MSG_ASK_IDX.format(item_list['max_id']))
if user_input.lower() == "q":
valid_input = True
valid_item = False
item = ""
else:
try:
user_input = int(user_input)
# Response not int(), re-ask
except ValueError:
foot_msg += CLI_MSG_ASK_ERR.format(user_input)
else:
# Response is valid
if user_input <= item_list['max_id']:
valid_input = True
valid_item = True
item = item_list['results_list'][user_input]
# Response not in range, re-ask
else:
foot_msg += CLI_MSG_ASK_ERR.format(user_input)
return {
'item': item,
'cli_end_msg': foot_msg,
'valid_item': valid_item
}
def get_data_list(db_obj, sql):
"""
Gets data from DB & return them formated as a text list displayable on CLI
:db_obj: a database object [PyMySQL]
:sql: a SQL query
:Return: a dict containing details on requested data:
- max_id: maximum ID
- results_list: stored in a list of tuple (id, name, count)
- results_txt: in a string, text-formated
"""
db_obj.execute(sql)
max_id = int(db_obj.cursor.rowcount - 1)
results_list = [(idx, val['name'], val['option'], val['id'])
for idx, val in enumerate(db_obj.result)]
# Hacky results-split for rendering in 2 columns
res_even = [(
idx,
val['name'][:CLI_MAX_LEN].ljust(CLI_MAX_LEN),
val['option'], val['id']
) for idx, val in enumerate(db_obj.result) if idx % 2 == 0]
res_uneven = [(
idx,
val['name'][:CLI_MAX_LEN],
val['option'],
val['id']
) for idx, val in enumerate(db_obj.result) if idx % 2 != 0]
# category list
results_txt = ""
if len(res_uneven) == 0 and len(res_even) > 0:
results_txt += "{} : {}\n".format(
res_even[0][0],
res_even[0][1]
)
else:
for num, unused in enumerate(res_uneven):
results_txt += CLI_ITEM_LIST.format(
res_even[num][0],
res_even[num][1],
res_uneven[num][0],
res_uneven[num][1]
)
if len(res_uneven) < len(res_even):
num += 1
results_txt += "{} : {}\n".format(
res_even[num][0],
res_even[num][1]
)
return {
'max_id': max_id,
'results_list': results_list,
'results_txt': results_txt
}
def start_init_menu():
""" Ask for saved substitution or searching new one """
LOCAL_DB.execute(DB_REQUEST['list_substituated_prod'])
if LOCAL_DB.cursor.rowcount > 0:
menu_list = {
'results_txt': CLI_MSG_INIT_MENU,
'results_list': [False, True],
'max_id': 1
}
# Ask for saved list or search new one
menu_asked = ask_user(
CLI_MSG_DISCLAIMER,
menu_list
)
# Shows saved list
if menu_asked['valid_item'] and menu_asked['item']:
cli_msg_subst_recap = CLI_MSG_SUBST_TITLE + CLI_MSG_SUBST_HEAD
for row in LOCAL_DB.result:
cli_msg_subst_recap += CLI_MSG_SUBST_LIST.format(
pname=row['pname'][:CLI_MAX_LEN].center(CLI_MAX_LEN),
sname=row['sname'][:CLI_MAX_LEN].center(CLI_MAX_LEN),
)
return (True, cli_msg_subst_recap)
return (False, "")
return (False, "Pas de substitutions enregistée")
# Starts a DB connection
LOCAL_DB = Db()
################
# INITIAL MENU #
################
init_menu = start_init_menu()
#############################
# LISTS SAVED SUBSTITUTIONS #
#############################
if init_menu[0]:
cli_end_msg = init_menu[1]
####################
# LISTS CATEGORIES #
####################
else:
category_list = get_data_list(
LOCAL_DB,
DB_REQUEST['list_cat']
)
head_msg = CLI_MSG_DISCLAIMER
head_msg += init_menu[1]
head_msg += CLI_MSG_CAT
# Asks the user to select a category
category_asked = ask_user(
head_msg,
category_list
)
##################
# LISTS PRODUCTS #
##################
if category_asked['valid_item']:
product_list = get_data_list(
LOCAL_DB,
DB_REQUEST['list_prod'].format(category_asked['item'][3])
)
head_msg = CLI_MSG_DISCLAIMER
head_msg += CLI_MSG_CHOOSEN_CAT.format(category_asked['item'][1])
head_msg += CLI_MSG_PROD
# Asks the user to select a product
product_asked = ask_user(
head_msg,
product_list
)
####################
# LISTS SUBTITUTES #
####################
if product_asked['valid_item']:
substitute_list = get_data_list(
LOCAL_DB,
DB_REQUEST['list_substitute'].format(
category_asked['item'][3],
product_asked['item'][2]
)
)
head_msg = CLI_MSG_DISCLAIMER
head_msg += CLI_MSG_CHOOSEN_CAT.format(category_asked['item'][1])
head_msg += CLI_MSG_CHOOSEN_PROD.format(product_asked['item'][1])
head_msg += CLI_MSG_SUBST
# No substitute found
if substitute_list['max_id'] == -1:
cli_end_msg = CLI_MSG_NO_SUBST.format(
product_asked['item'][1],
product_asked['item'][2]
)
# Asks the user to select a substitute
elif substitute_list['max_id'] >= 0:
substit_asked = ask_user(
head_msg,
substitute_list
)
##########################
# SHOW SUBTITUTE DETAILS #
##########################
if substit_asked['valid_item']:
LOCAL_DB.execute(DB_REQUEST['select_substitute'].format(
substit_asked['item'][3]
))
head_msg = CLI_MSG_DISCLAIMER +\
CLI_MSG_CHOOSEN_CAT.format(substit_asked['item'][1])
backup_list = {
'results_txt': CLI_MSG_DETAILLED_SUB.format(
code=LOCAL_DB.result[0]['code'],
nutri=LOCAL_DB.result[0]['nutrition_grades'],
url=LOCAL_DB.result[0]['url']
) + CLI_MSG_ASK_BAK.format(
substit_asked['item'][1],
product_asked['item'][1]
),
'results_list': [False, True],
'max_id': 1
}
# Saves if user choose it
backup_asked = ask_user(
head_msg,
backup_list
)
if backup_asked['valid_item'] and backup_asked['item']:
LOCAL_DB.execute(DB_REQUEST['save_substitute'].format(
substit_asked['item'][3],
product_asked['item'][3]
))
if LOCAL_DB.cursor.rowcount == 1:
cli_end_msg = CLI_MSG_BAK_DONE
print(cli_end_msg)

View File

@ -0,0 +1,109 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author: freezed <freezed@users.noreply.github.com> 2018-07-27
Version: 0.1
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
This file is part of [ocp5](https://github.com/freezed/ocp5) project
"""
# API
FIELD_KEPT = {
'product': [
'product_name',
'nutrition_grades',
'categories_tags'
],
'category': [
'_id',
'url',
'product_name',
'nutrition_grades',
'categories_tags'
]
}
API_URL_CAT = "https://fr.openfoodfacts.org/category/{}/{}.json"
# CLI
DB_REQUEST = {
'list_cat': "SELECT c.name, COUNT(*) AS 'option', c.id AS 'id' FROM category AS c JOIN product AS p ON p.category_id = c.id GROUP BY c.name ORDER BY COUNT(*) DESC;",
'list_prod': "SELECT p.name, p.nutrition_grades AS 'option', p.id AS 'id' FROM product AS p LEFT JOIN category AS c ON p.category_id = c.id WHERE c.id = '{}' AND p.nutrition_grades IS NOT NULL AND p.substitute_id IS NULL;",
'list_substitute': "SELECT p.name, p.nutrition_grades AS 'option', p.id AS 'id' FROM product AS p LEFT JOIN category AS c ON p.category_id = c.id WHERE c.id = '{}' AND p.nutrition_grades < '{}'",
'select_substitute': "SELECT p.*, c.name FROM product AS p LEFT JOIN category AS c ON p.category_id = c.id WHERE p.id = '{}'",
'save_substitute': "UPDATE product SET substitute_id={} WHERE id={}",
'list_substituated_prod': "SELECT p.name AS pname, p.nutrition_grades AS pnutri, sub.name AS sname, sub.nutrition_grades AS snutri FROM product AS p LEFT JOIN category AS c ON p.category_id = c.id JOIN product AS sub ON sub.id = p.substitute_id WHERE p.substitute_id IS NOT NULL;",
}
CLI_MAX_LEN = 30
CLI_MSG_SUBST = "Substituts disponibles :\n"
CLI_MSG_QUIT = "\nAu revoir!"
CLI_ITEM_LIST = "{} : {} \t {} : {}\n"
CLI_MSG_INIT_MENU = CLI_MSG_SUBST + "Voulez vous les consulter?\n"\
"\n\t0: non\n\t1: oui"
CLI_MSG_ASK_BAK = "Sauvegarder «{}»\nen substitut du produit «{}»?"\
"\n\t0: non\n\t1: oui"
CLI_MSG_ASK_ERR = "\nSaisie incorrecte : «{}»"
CLI_MSG_ASK_IDX = "Index choisi [0-{}] :"
CLI_MSG_BAK_DONE = "\nSubstitut sauvegardé" + CLI_MSG_QUIT
CLI_MSG_CAT = "Catégories disponibles :\n"
CLI_MSG_CHOOSEN_CAT = "# # Categorie : [ {} ]\n"
CLI_MSG_CHOOSEN_PROD = "# Produits : [ {} ]\n"
CLI_MSG_DETAILLED_SUB = "Nutriscore [ {nutri} ]\tCode [ {code} ]"\
"\nURL:{url}\n\n"
CLI_MSG_DISCLAIMER = "# # # Bienvenu sur PyOFF # # #\n\n"
CLI_MSG_NO_SUBST = "Pas de substitut trouvé pour le produit «{}»"\
"(nutriscore : «{}»)" + CLI_MSG_QUIT
CLI_MSG_PROD = "Produits disponibles :\n"
CLI_MSG_SUBST_LIST = "{pname}\t{sname}\n"
CLI_MSG_SUBST_TITLE = "\n" + "# # SUBSTITUTIONS ENREGISTRÉES # #".center(
2 * CLI_MAX_LEN
) + "\n"
CLI_MSG_SUBST_HEAD = "PRODUIT :".center(CLI_MAX_LEN) + \
"SUBSTITUT :".center(CLI_MAX_LEN) + "\n"
# DATABASE
DB_CONFIG = {
'host': 'localhost',
'user': 'loff',
'password': 'loff',
'db': 'loff',
'charset': 'utf8',
'autocommit': True,
'file': 'create-db-loff.sql'
}
DB_MSG_TEMPLATE = {
"database": "DB «{}» contains these tables :",
"db_created": "DB «{}» created\n\n",
"tables": "{}\n",
"dashboard": "DB size : {dbsize}\nTable 'product' has «{rowprod}» "
"row(s)\nTable 'category' has «{rowcat}» row(s)"
}
# POPULATE
POP_MSG_TEMPLATE = {
'work': '\n# # # # # #\tC A T E G O R Y --[ {} ]--',
'fetch': '\tFetching data over API…',
'insert': '\tInserting data into DB…',
'missing': '\t/!\\ [ {} ] do not exists /!\\',
# '': '',
}
CATEGORY_LIST = [
'roti',
'tourtes',
'donuts',
'boudoirs',
'canards',
'macarons',
'gratins',
'bouillons',
'entrées',
'barres chocolatées',
'pizzas',
]

View File

@ -0,0 +1,28 @@
-- ---------------------------------------------
-- Creates a local DB to avoid requesting API --
-- ---------------------------------------------
CREATE DATABASE loff CHARACTER SET 'utf8';
USE loff;
CREATE TABLE category(
`id`INT UNSIGNED NOT NULL AUTO_INCREMENT PRIMARY KEY,
`name` VARCHAR(200) UNIQUE
)ENGINE=InnoDB;
CREATE TABLE product(
`id` INT UNSIGNED NOT NULL AUTO_INCREMENT PRIMARY KEY,
`code` BIGINT UNSIGNED NOT NULL UNIQUE,
`url` VARCHAR(200),
`name` VARCHAR(200) UNIQUE,
`nutrition_grades` VARCHAR(1),
`category_id`INT UNSIGNED,
`substitute_id` INT UNSIGNED,
CONSTRAINT `fk_product_category`
FOREIGN KEY (category_id) REFERENCES category(id)
ON DELETE CASCADE,
CONSTRAINT `fk_product_substitute`
FOREIGN KEY (substitute_id) REFERENCES product(id)
ON DELETE SET NULL
)ENGINE=InnoDB;

View File

@ -0,0 +1,222 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author: freezed <freezed@users.noreply.github.com> 2018-07-26
Version: 0.1
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
Connects DB, executes SQL statements
"""
import pymysql.cursors
from config import DB_CONFIG, DB_MSG_TEMPLATE
class Db():
"""
Manage DB class
:Tests:
>>> expect = ["DB «loff» contains these tables :['category', 'product']",\
"DB «loff» created"]
>>> class_test = Db()
>>> class_test.message.splitlines()[0] in expect
True
"""
def __init__(self):
""" Class initialiser """
self.message = ""
self.result = list()
# MYSQL server connexion, without DB selection
self.start_connexion(False)
first_summary_run = self.db_summary()
# No DB, create it
if first_summary_run is False:
request_list = self.get_sql_from_file()
if request_list is not False:
for sql_request in request_list:
self.cursor.execute(sql_request + ';')
self.message = DB_MSG_TEMPLATE['db_created'].format(
DB_CONFIG['db']
)
second_summary_run = self.db_summary()
if second_summary_run is False:
print('DB unknown error')
else:
self.message += second_summary_run
else:
self.message = first_summary_run
def db_summary(self):
"""
Search DB, SHOW TABLES, get DB size and count rows in tables
:return: False if DB not found, nothing otherwise (but sets messages)
:Tests:
>>> expect = ["DB «loff» contains these tables \
:['category', 'product']","DB «loff» created"]
>>> Db.start_connexion(Db, with_db=False)
>>> Db.db_summary(Db).splitlines()[0] in expect
True
"""
db_not_found = True
self.cursor.execute("SHOW DATABASES")
db_list = self.cursor.fetchall()
for idx, unused in enumerate(db_list):
if DB_CONFIG['db'] in db_list[idx].values():
db_not_found = False
self.cursor.execute("USE {}".format(DB_CONFIG['db']))
self.cursor.execute("SHOW TABLES")
tbl_list = self.cursor.fetchall()
# Get size information on DB
self.cursor.execute("""
SELECT table_schema "Full database",
CONCAT(
ROUND(
SUM(data_length + index_length)
/ 1024 / 1024, 1),
" MB") "dbsize"
FROM information_schema.tables
WHERE table_schema = "loff"
GROUP BY table_schema
UNION
SELECT "Rows in 'product' table", COUNT(*)
FROM product
UNION
SELECT "Rows in 'category' table", COUNT(*)
FROM category;
""")
dashboard = self.cursor.fetchall()
# Constructs DB information message
summary = DB_MSG_TEMPLATE['database'].format(
dashboard[0]['Full database'])
summary += DB_MSG_TEMPLATE['tables'].format(
[val['Tables_in_loff'] for val in tbl_list])
summary += DB_MSG_TEMPLATE['dashboard'].format(
dbsize=dashboard[0]['dbsize'].decode("utf-8"),
rowprod=dashboard[1]['dbsize'].decode("utf-8"),
rowcat=dashboard[2]['dbsize'].decode("utf-8"))
if db_not_found:
return False
else:
return summary
def execute(self, sql_request):
"""
Executes a request on DB
:Tests:
>>> Db.start_connexion(Db, with_db=True)
>>> Db.execute(Db, 'SHOW TABLES')
2
>>> Db.result == [{'Tables_in_loff': 'category'}, \
{'Tables_in_loff': 'product'}]
True
"""
# Connect to the database
self.start_connexion(self)
response = self.cursor.execute(sql_request)
self.result = self.cursor.fetchall()
return response
def get_sql_from_file(self, filename=DB_CONFIG['file']):
"""
Get the SQL instruction from a file
:return: a list of each SQL query whithout the trailing ";"
:Tests:
>>> Db.get_sql_from_file(Db, 'wronq_file.sql')
False
>>> Db.message
'File load error : wronq_file.sql'
"""
from os import path
# File did not exists
if path.isfile(filename) is False:
self.message = "File load error : {}".format(filename)
return False
else:
with open(filename, "r") as sql_file:
# Split file in list
ret = sql_file.read().split(';')
# drop last empty entry
ret.pop()
return ret
def start_connexion(self, with_db=True):
"""
Connect to MySQL Server
:Tests:
>>> DB_CONFIG['user'] = 'bob'
>>> Db.start_connexion(Db, with_db=True)
OperationalError: «(1045, "Access denied for user 'bob'@'localhost' \
(using password: YES)"
>>> DB_CONFIG['user'] = 'loff'
>>> DB_CONFIG['db'] = 'foobar'
>>> Db.start_connexion(Db, with_db=True)
OperationalError: «(1044, "Access denied for user 'loff'@'localhost' \
to database 'foobar'"
"""
cnx_conf = {
'host': DB_CONFIG['host'],
'user': DB_CONFIG['user'],
'password': DB_CONFIG['password'],
'charset': DB_CONFIG['charset'],
'autocommit': DB_CONFIG['autocommit'],
'cursorclass': pymysql.cursors.DictCursor
}
if with_db:
cnx_conf['db'] = DB_CONFIG['db']
try:
self.cnx = pymysql.connect(**cnx_conf)
self.cursor = self.cnx.cursor()
# For "Access denied" errors
except pymysql.err.OperationalError as except_detail:
print("OperationalError: «{}»".format(except_detail))
def __del__(self):
""" Object destruction"""
self.cursor.close()
self.cnx.close()
if __name__ == "__main__":
import doctest
doctest.testmod()

View File

@ -0,0 +1,322 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author: freezed <freezed@users.noreply.github.com> 2018-07-24
Version: 0.1
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
Call Open Food Facts API to populate a local MariaDB/MySQL database with product data
This DB will serve an CLI client which gives alternative products with better
nurition grade.
"""
import json
import requests
from config import FIELD_KEPT, API_URL_CAT
def get_product(code, from_file=False):
"""
Call Open Food Facts API to get data of a single product
"""
ERR_FILE = "File load error : {}"
filename = 'sample/product-{}.json'.format(str(code))
try:
int(code)
except ValueError: # as except_detail:
# print("Exception: «{}»".format(except_detail))
print(ERR_FILE.format(filename))
else:
if from_file:
from os import path
# File did not exists
if path.isfile(filename) is False:
print(ERR_FILE.format(filename))
status = 404
product_json = {'status': 0}
else:
with open(filename, "r") as json_file:
product_json = json.loads(json_file.read())
status = 200
else:
response = requests.get(
"https://fr.openfoodfacts.org/api/v0/product/{}.json".format(code)
)
product_json = json.loads(response.text)
status = response.status_code
if product_json['status'] and status == 200:
product_kept = {
'code': code,
'url': "https://fr.openfoodfacts.org/product/{}/".format(code)
}
for field in FIELD_KEPT['product']:
product_kept[field] = product_json['product'][field]
return product_kept
else:
return False
def get_category(name, from_file=False):
"""
Call Open Food Facts API to get data of products in a single category
:return: Dict filled with products & kept fields
First try, TODO :
- work offline with local JSON
- need to get all the products of a category
:Tests ONLINE:
>>> prod_false = get_category('1664')
>>> prod_false
False
>>> prod_bles = get_category('blés')
:Tests OFFLINE:
# >>> prod_bles = get_category('biscuits', True)
>>> prod_bles['category'] == 'biscuits'
True
>>> 'count' in prod_bles
True
>>> 'product_name' in prod_bles['products'][0]
True
>>> 'nutrition_grades' in prod_bles['products'][0]
True
>>> 'categories_tags' in prod_bles['products'][0]
True
>>> get_category('wrong_file', True)
File load error : sample/category-wrong_file.json
False
# >>> pprint.pprint(prod_bles)
"""
if from_file:
from os import path
filename = 'sample/category-{}.json'.format(str(name))
# File did not exists
if path.isfile(filename) is False:
print("File load error : {}".format(filename))
status = 404
cat_json = {'count': 0}
else:
with open(filename, "r") as json_file:
cat_json = json.loads(json_file.read())
status = 200
# Requests over API
else:
page = 1
response = requests.get(API_URL_CAT.format(str(name), page))
cat_json = json.loads(response.text)
status = response.status_code
# Gets data
if cat_json['count'] > 0:
# Defines dict it will be returned
staging_data = {
# 'count': cat_json['count'],
'category': str(name),
'products': []
}
# Counts pages of this category
total_pages = int(cat_json['count'] // cat_json['page_size'])
if int(cat_json['count'] % cat_json['page_size']) > 0:
total_pages += 1
# Loops on data from 1st page
for idx, product_fields in enumerate(cat_json['products']):
staging_data['products'].append(dict())
for field in FIELD_KEPT['category']:
if field in product_fields:
staging_data['products'][idx][field] = product_fields[field]
else:
staging_data['products'][idx][field] = False
# Gets data for all other pages
while page < total_pages:
# Requests next page over API
page += 1
response = requests.get(API_URL_CAT.format(str(name), page))
cat_json = json.loads(response.text)
idx = len(staging_data['products'])
for product_fields in cat_json['products']:
staging_data['products'].append(dict())
for field in FIELD_KEPT['category']:
if field in product_fields:
staging_data['products'][idx][field] = product_fields[field]
else:
staging_data['products'][idx][field] = False
idx += 1
print("\t\t[…finish page {}/{} - {} ids]".format(page, total_pages, idx))
return staging_data
else:
return False
def false_to_null(sql_list):
""" Replacing nutrition_score="False" by nutrition_score=NULL """
for idx, request in enumerate(sql_list):
if "False" in request:
sql_list[idx] = "{}NULL{}".format(
request[:request.find('False')-1],
request[request.find('False')+6:]
)
return sql_list
def pick_category(cat_list):
"""
Picks only one category to associate the product in the local DB
One of the shortest tag (without langage prefix) is taken.
For improvement it is a good place to adds more work here, like selecting
by langage prefix.
:Tests:
>>> pick_category(['en:sugary-snacks', 'en:biscuits-and-cakes', \
'en:biscuits'])
'biscuits'
"""
if len(cat_list) > 1:
# get idx of the shortest tag
flip_list = [(len(cat), idx) for idx, cat in enumerate(cat_list)]
flip_list.sort()
shortest_tag_idx = flip_list[0][1]
return cat_list[shortest_tag_idx].split(":")[1]
elif len(cat_list) == 1:
return cat_list[0].split(":")[1]
else:
return False
def sql_generator(staging_data):
"""
Uses `staging_data` to generate SQL INSERT requests.
:staging_data: dict() created with `get_product()` or `get_category()`
:return: list() of SQL requests
:Tests:
>>> sql_generator(False) is False
True
>>> bisc = {'count': 4377,'category':'biscuits','products':[{'_id':'8480000141323','categories_tags':['en:sugary-snacks','en:biscuits-and-cakes','en:biscuits'],'nutrition_grades':'e','product_name':'Galletas María Dorada Hacendado','url':'https://fr-en.openfoodfacts.org/product/8480000141323/galletas-maria-dorada-hacendado'},{'_id':'3593551174971','categories_tags':['en:sugary-snacks','en:biscuits-and-cakes','en:biscuits'],'nutrition_grades':'False','product_name':'Les Broyés du Poitou','url':'https://fr-en.openfoodfacts.org/product/3593551174971/les-broyes-du-poitou-les-mousquetaires'}]}
>>> sql_list_bisc = sql_generator(bisc)
>>> sql_list_bisc[0]
"INSERT INTO category (`name`) VALUES ('biscuits');"
>>> sql_list_bisc[1]
'INSERT INTO product (`name`, `code`, `url`, `nutrition_grades`, `category_id`) SELECT "Galletas María Dorada Hacendado", "8480000141323", "https://fr-en.openfoodfacts.org/product/8480000141323/galletas-maria-dorada-hacendado", "e", id AS category_id FROM category WHERE name = "biscuits";'
>>> sql_list_bisc[2]
'INSERT INTO product (`name`, `code`, `url`, `nutrition_grades`, `category_id`) SELECT "Les Broyés du Poitou", "3593551174971", "https://fr-en.openfoodfacts.org/product/3593551174971/les-broyes-du-poitou-les-mousquetaires", NULL, id AS category_id FROM category WHERE name = "biscuits";'
>>> oreo = {'categories_tags':['en:sugary-snacks','en:biscuits-and-cakes','en:biscuits','en:chocolate-biscuits','es:sandwich-cookies'],'code':'8410000810004','nutrition_grades':'e','product_name':'Biscuit Oreo', 'url':'https://fr.openfoodfacts.org/product/8410000810004/'}
>>> sql_list_oreo = sql_generator(oreo)
>>> sql_list_oreo[0]
"INSERT INTO category (`name`) VALUES ('biscuits');"
>>> sql_list_oreo[1]
'INSERT INTO product (`name`, `code`, `url`, `nutrition_grades`, `category_id`) SELECT "Biscuit Oreo", "8410000810004", "https://fr.openfoodfacts.org/product/8410000810004/", "e", id AS category_id FROM category WHERE name = "biscuits";'
>>> oreo_nutri_null = {'categories_tags':['en:sugary-snacks','en:biscuits-and-cakes','en:biscuits','en:chocolate-biscuits','es:sandwich-cookies'],'code':'8410000810004','nutrition_grades':'False','product_name':'Biscuit Oreo', 'url':'https://fr.openfoodfacts.org/product/8410000810004/'}
>>> sql_list_oreo_nutri_null = sql_generator(oreo_nutri_null)
>>> sql_list_oreo_nutri_null[1]
'INSERT INTO product (`name`, `code`, `url`, `nutrition_grades`, `category_id`) SELECT "Biscuit Oreo", "8410000810004", "https://fr.openfoodfacts.org/product/8410000810004/", NULL, id AS category_id FROM category WHERE name = "biscuits";'
"""
sql_list = []
insert_cat = "INSERT INTO category (`name`) VALUES ('{}');"
insert_prod = """INSERT INTO product (`name`, `code`, `url`, `nutrition_grades`, `category_id`) \
SELECT "{name}", "{code}", "{url}", "{nutri}", id AS category_id \
FROM category \
WHERE name = "{cat}";"""
if staging_data is not False and 'category' in staging_data.keys():
used_category = staging_data['category']
# insert category
sql_list.append(insert_cat.format(used_category))
# insert products
for idx, val in enumerate(staging_data['products']):
sql_list.append(
insert_prod.format(
code=val['_id'],
url=val['url'],
name=val['product_name'],
nutri=val['nutrition_grades'],
cat=used_category
)
)
elif staging_data is not False and 'product_name' in staging_data.keys():
used_category = pick_category(staging_data['categories_tags'])
# insert category
sql_list.append(insert_cat.format(used_category))
sql_list.append(
insert_prod.format(
code=staging_data['code'],
url=staging_data['url'],
name=staging_data['product_name'],
nutri=staging_data['nutrition_grades'],
cat=used_category
)
)
else:
sql_list = False
if sql_list is not False:
sql_list = false_to_null(sql_list)
return sql_list
if __name__ == "__main__":
import doctest
doctest.testmod()

View File

@ -0,0 +1,63 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author: freezed <freezed@users.noreply.github.com> 2018-08-02
Version: 0.1
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
Populates local DB with data comming from Open Food Facts API
:Tests:
>>> CATEGORY_LIST.append('falsecategory')
"""
from random import choice
from os import system
import pymysql
from db import Db
from function import get_category, sql_generator
from config import DB_CONFIG, POP_MSG_TEMPLATE, CATEGORY_LIST
system('clear')
local_db = Db()
print(local_db.message)
for category in CATEGORY_LIST:
print(POP_MSG_TEMPLATE['work'].format(category))
print(POP_MSG_TEMPLATE['fetch'])
# gets data
staging_data = get_category(category)
# generates SQL
sql_list = sql_generator(staging_data)
# executes SQL
print(POP_MSG_TEMPLATE['insert'].format(category))
if sql_list is False:
print(POP_MSG_TEMPLATE['missing'].format(category))
else:
for idx, sql in enumerate(sql_list):
try:
response = local_db.cursor.execute(sql)
# For warnings, do not catch "Data truncated…" as expected
except pymysql.err.Warning as except_detail:
response = "Warning: «{}»".format(except_detail)
# Duplicate entry
except pymysql.err.IntegrityError as except_detail:
response = "0, {}".format(except_detail)
except pymysql.err.ProgrammingError as except_detail:
response = "ProgrammingError: «{}»".format(except_detail)
except pymysql.err.MySQLError as except_detail:
response = "MySQLError: «{}»".format(except_detail)
print("\t{}. [{}…] | Affected rows : «{}»".format(idx, sql[87:100], response))

View File

@ -0,0 +1,3 @@
PyMySQL==0.9.2
requests==2.11.1
pytest==3.7.1

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

View File

@ -0,0 +1,973 @@
{
"status": 1,
"status_verbose": "product found",
"product": {
"ingredients_text_with_allergens": "Farine de <span class=\"allergen\">blé</span> 73,5 %, sucre, <span class=\"allergen\">beurre</span> 13,6 %, <span class=\"allergen\">lait</span> écrémé en poudre 1,3 % (équivalent <span class=\"allergen\">lait</span> écrémé 13 %), sel, poudre à lever (carbonate acide de sodium, carbonate acide d'ammonium), correcteur d'acidité (acide citrique), arôme, sucre glace (sucre, amidon de maïs)",
"interface_version_created": "20120622",
"images": {
"1": {
"uploaded_t": 1423992885,
"uploader": "nissen",
"sizes": {
"100": {
"w": 75,
"h": 100
},
"400": {
"h": 400,
"w": 300
},
"full": {
"h": 3264,
"w": 2448
}
}
},
"2": {
"uploaded_t": 1423992900,
"uploader": "nissen",
"sizes": {
"100": {
"w": 75,
"h": 100
},
"400": {
"h": 400,
"w": 300
},
"full": {
"w": 2448,
"h": 3264
}
}
},
"3": {
"sizes": {
"100": {
"w": 75,
"h": 100
},
"400": {
"w": 300,
"h": 400
},
"full": {
"w": 2448,
"h": 3264
}
},
"uploader": "nissen",
"uploaded_t": 1423992913
},
"4": {
"uploaded_t": "1452804800",
"uploader": "openfoodfacts-contributors",
"sizes": {
"100": {
"h": 100,
"w": 75
},
"400": {
"h": 400,
"w": 300
},
"full": {
"h": 3264,
"w": 2448
}
}
},
"ingredients": {
"normalize": null,
"sizes": {
"100": {
"h": 75,
"w": 100
},
"200": {
"h": 150,
"w": 200
},
"400": {
"h": 300,
"w": 400
},
"full": {
"h": 2448,
"w": 3264
}
},
"imgid": "3",
"white_magic": null,
"geometry": "0x0-0-0",
"rev": "10"
},
"nutrition": {
"rev": "11",
"geometry": "0x0-0-0",
"sizes": {
"100": {
"h": 75,
"w": 100
},
"200": {
"w": 200,
"h": 150
},
"400": {
"h": 300,
"w": 400
},
"full": {
"w": 3264,
"h": 2448
}
},
"imgid": "2",
"white_magic": null,
"normalize": null
},
"nutrition_fr": {
"x1": "0.4210205078125",
"normalize": "false",
"x2": "400",
"y2": "215.24267578125",
"y1": "51.8046875",
"geometry": "3261x1334-3-422",
"angle": "270",
"imgid": "2",
"sizes": {
"100": {
"w": 100,
"h": 41
},
"200": {
"h": 82,
"w": 200
},
"400": {
"w": 400,
"h": 164
},
"full": {
"h": 1334,
"w": 3261
}
},
"rev": "23",
"white_magic": "false"
},
"ingredients_fr": {
"normalize": "false",
"x1": "0",
"imgid": "3",
"sizes": {
"100": {
"h": 9,
"w": 100
},
"200": {
"h": 19,
"w": 200
},
"400": {
"w": 400,
"h": 38
},
"full": {
"h": 301,
"w": 3184
}
},
"y2": "125.1796875",
"y1": "88.3046875",
"x2": "390.218994140625",
"geometry": "3184x301-0-720",
"angle": "270",
"white_magic": "false",
"rev": "22"
},
"front_fr": {
"rev": "13",
"geometry": "3264x1264-0-612",
"imgid": "1",
"white_magic": null,
"sizes": {
"100": {
"w": 100,
"h": 39
},
"200": {
"w": 200,
"h": 77
},
"400": {
"h": 155,
"w": 400
},
"full": {
"w": 3264,
"h": 1264
}
},
"normalize": null
},
"front": {
"rev": "13",
"geometry": "3264x1264-0-612",
"imgid": "1",
"white_magic": null,
"sizes": {
"100": {
"w": 100,
"h": 39
},
"200": {
"w": 200,
"h": 77
},
"400": {
"h": 155,
"w": 400
},
"full": {
"w": 3264,
"h": 1264
}
},
"normalize": null
}
},
"additives_original_tags": [
"en:e500ii",
"en:e503ii",
"en:e330"
],
"categories": "Snacks sucrés,Biscuits et gâteaux,Biscuits,Petits beurres",
"languages_hierarchy": [
"en:french"
],
"image_nutrition_url": "https://static.openfoodfacts.org/images/products/301/776/000/0109/nutrition_fr.23.400.jpg",
"additives": " [ farine-de-ble-73 -> fr:farine-de-ble-73 ] [ farine-de-ble -> fr:farine-de-ble ] [ farine-de -> fr:farine-de ] [ farine -> fr:farine ] [ 5 -> en:fd-c ] [ sucre -> fr:sucre ] [ beurre-13 -> fr:beurre-13 ] [ beurre -> fr:beurre ] [ 6 -> en:fd-c ] [ lait-ecreme-en-poudre-1 -> fr:lait-ecreme-en-poudre-1 ] [ lait-ecreme-en-poudre -> fr:lait-ecreme-en-poudre ] [ lait-ecreme-en -> fr:lait-ecreme-en ] [ lait-ecreme -> fr:lait-ecreme ] [ lait -> fr:lait ] [ 3 -> en:fd-c ] [ equivalent-lait-ecreme-13 -> fr:equivalent-lait-ecreme-13 ] [ equivalent-lait-ecreme -> fr:equivalent-lait-ecreme ] [ equivalent-lait -> fr:equivalent-lait ] [ equivalent -> fr:equivalent ] [ sel -> fr:sel ] [ poudre-a-lever -> fr:poudre-a-lever ] [ poudre-a -> fr:poudre-a ] [ poudre -> fr:poudre ] [ carbonate-acide-de-sodium -> en:e500ii -> exists -- ok ] [ carbonate-acide-d-ammonium -> en:e503ii -> exists -- ok ] [ correcteur-d-acidite -> fr:correcteur-d-acidite ] [ correcteur-d -> fr:correcteur-d ] [ correcteur -> fr:correcteur ] [ acide-citrique -> en:e330 -> exists -- ok ] [ arome -> fr:arome ] [ sucre-glace -> fr:sucre-glace ] [ sucre -> fr:sucre ] [ sucre -> fr:sucre ] [ amidon-de-mais -> fr:amidon-de-mais ] [ amidon-de -> fr:amidon-de ] [ amidon -> fr:amidon ] ",
"categories_hierarchy": [
"en:sugary-snacks",
"en:biscuits-and-cakes",
"en:biscuits",
"fr:petits-beurres"
],
"nova_groups_tags": [
"en:4-ultra-processed-food-and-drink-products"
],
"additives_n": 3,
"update_key": "nova1",
"nutrition_data_per": "100g",
"link": "",
"image_ingredients_small_url": "https://static.openfoodfacts.org/images/products/301/776/000/0109/ingredients_fr.22.200.jpg",
"image_front_url": "https://static.openfoodfacts.org/images/products/301/776/000/0109/front_fr.13.400.jpg",
"states_tags": [
"en:to-be-checked",
"en:complete",
"en:nutrition-facts-completed",
"en:ingredients-completed",
"en:expiration-date-completed",
"en:packaging-code-to-be-completed",
"en:characteristics-completed",
"en:categories-completed",
"en:brands-completed",
"en:packaging-completed",
"en:quantity-completed",
"en:product-name-completed",
"en:photos-validated",
"en:photos-uploaded"
],
"manufacturing_places_debug_tags": [],
"brands_debug_tags": [],
"stores_tags": [
"super-u"
],
"labels_tags": [
"en:green-dot"
],
"categories_prev_tags": [
"en:sugary-snacks",
"en:biscuits-and-cakes",
"en:biscuits",
"fr:petits-beurres"
],
"last_editor": "beniben",
"generic_name_fr": "Petits beurre",
"additives_prev_n": 3,
"traces": "Œufs,Fruits à coque,Graines de sésame",
"purchase_places": "Eure-et-Loir,France,Nantes",
"ingredients_n": "15",
"ingredients_hierarchy": [
"en:wheat-flour",
"en:sugar",
"en:butter",
"fr:lait-ecreme-en-poudre",
"en:milk",
"fr:équivalent _lait_ écrémé",
"en:salt",
"en:raising-agent",
"en:acidity-regulator",
"en:citric-acid",
"en:flavourings",
"en:icing-sugar",
"en:sugar",
"fr:carbonate-acide-de-sodium",
"fr:carbonate-acide-d-ammonium",
"en:sugar",
"fr:amidon-de-mais",
"en:starch"
],
"emb_codes_20141016": "",
"countries_hierarchy": [
"en:belgium",
"en:france",
"en:switzerland"
],
"editors_tags": [
"date-limite-app",
"openfoodfacts-contributors",
"nissen",
"beniben",
"tacite-mass-editor",
"manu1400",
"sebleouf",
"scanbot"
],
"labels_prev_hierarchy": [
"en:green-dot"
],
"nutrition_grades_tags": [
"e"
],
"id": "3017760000109",
"checkers": [],
"_keywords": [
"lu",
"le",
"veritable",
"et",
"biscuit",
"beurre",
"petit",
"gateaux",
"snack",
"sucre",
"point",
"vert"
],
"nucleotides_prev_tags": [],
"nova_group_debug": " -- ingredients/en:butter : 3 -- categories/en:sugary-snacks : 4",
"last_edit_dates_tags": [
"2018-04-10",
"2018-04",
"2018"
],
"minerals_tags": [],
"allergens": "blé, beurre, lait, lait",
"amino_acids_tags": [],
"emb_codes_tags": [],
"languages_codes": {
"fr": 6
},
"generic_name": "Petits beurre",
"no_nutrition_data": "",
"allergens_tags": [
"en:gluten",
"en:milk"
],
"complete": 1,
"traces_hierarchy": [
"en:eggs",
"en:nuts",
"en:sesame-seeds"
],
"purchase_places_debug_tags": [],
"countries_debug_tags": [],
"allergens_hierarchy": [
"en:gluten",
"en:milk"
],
"nutriments": {
"sodium_value": "0.5511811023622046",
"carbohydrates": "73",
"nova-group_100g": "4",
"fiber_value": "3",
"carbohydrates_100g": "73",
"carbohydrates_value": "73",
"saturated-fat_value": "7.6",
"fat_serving": 0.996,
"saturated-fat_100g": 7.6,
"proteins_value": "8",
"proteins": "8",
"sodium": 0.551181102362205,
"salt_value": "1.4",
"salt_serving": 0.116,
"sugars": "23",
"nova-group_serving": "4",
"fiber": "3",
"fiber_serving": 0.249,
"nutrition-score-fr_100g": 20,
"proteins_unit": "g",
"energy_serving": "154",
"sugars_unit": "g",
"sodium_unit": "g",
"nutrition-score-uk_100g": 20,
"energy_value": "1850",
"nova-group": "4",
"carbohydrates_unit": "g",
"nutrition-score-uk": 20,
"energy_unit": "kJ",
"saturated-fat_serving": 0.631,
"saturated-fat": 7.6,
"fiber_unit": "g",
"salt_unit": "g",
"proteins_100g": "8",
"salt": 1.4,
"sugars_100g": "23",
"saturated-fat_unit": "g",
"salt_100g": 1.4,
"fat_unit": "g",
"fat_value": "12",
"sugars_value": "23",
"carbohydrates_serving": 6.06,
"proteins_serving": 0.664,
"fat": "12",
"sodium_100g": 0.551181102362205,
"sodium_serving": 0.0457,
"nutrition-score-fr": 20,
"energy_100g": "1850",
"fat_100g": "12",
"energy": "1850",
"fiber_100g": "3",
"sugars_serving": 1.91
},
"labels": "Point Vert",
"scans_n": 303,
"ingredients_ids_debug": [
"farine-de-ble-73",
"5",
"sucre",
"beurre-13",
"6",
"lait-ecreme-en-poudre-1",
"3",
"equivalent-lait-ecreme-13",
"sel",
"poudre-a-lever",
"carbonate-acide-de-sodium",
"carbonate-acide-d-ammonium",
"correcteur-d-acidite",
"acide-citrique",
"arome",
"sucre-glace",
"sucre",
"amidon-de-mais"
],
"vitamins_prev_tags": [],
"packaging": "Carton,Plastique",
"serving_size_debug_tags": [],
"creator": "manu1400",
"correctors_tags": [
"manu1400",
"nissen",
"sebleouf",
"date-limite-app",
"scanbot",
"tacite-mass-editor",
"beniben"
],
"debug_tags": [
"43"
],
"last_modified_by": "beniben",
"categories_tags": [
"en:sugary-snacks",
"en:biscuits-and-cakes",
"en:biscuits",
"fr:petits-beurres"
],
"stores": "Super U",
"ingredients": [
{
"id": "en:wheat-flour",
"text": "Farine de _blé_",
"percent": "73.5",
"rank": 1
},
{
"id": "en:sugar",
"rank": 2,
"text": "sucre"
},
{
"rank": 3,
"percent": "13.6",
"text": "_beurre_",
"id": "en:butter"
},
{
"percent": "1.3",
"text": "_lait_ écrémé en poudre",
"rank": 4,
"id": "fr:lait-ecreme-en-poudre"
},
{
"id": "fr:équivalent _lait_ écrémé",
"text": "équivalent _lait_ écrémé",
"percent": "13",
"rank": 5
},
{
"text": "sel",
"rank": 6,
"id": "en:salt"
},
{
"text": "poudre à lever",
"rank": 7,
"id": "en:raising-agent"
},
{
"id": "en:acidity-regulator",
"text": "correcteur d'acidité",
"rank": 8
},
{
"id": "en:citric-acid",
"rank": 9,
"text": "acide citrique"
},
{
"text": "arôme",
"rank": 10,
"id": "en:flavourings"
},
{
"text": "sucre glace",
"rank": 11,
"id": "en:icing-sugar"
},
{
"id": "fr:carbonate-acide-de-sodium",
"text": "carbonate acide de sodium"
},
{
"id": "fr:carbonate-acide-d-ammonium",
"text": "carbonate acide d'ammonium"
},
{
"id": "en:sugar",
"text": "sucre"
},
{
"id": "fr:amidon-de-mais",
"text": "amidon de maïs"
}
],
"minerals_prev_tags": [],
"emb_codes_orig": "",
"additives_old_n": 3,
"traces_debug_tags": [],
"serving_quantity": 8.3,
"nutrient_levels_tags": [
"en:fat-in-moderate-quantity",
"en:saturated-fat-in-high-quantity",
"en:sugars-in-high-quantity",
"en:salt-in-moderate-quantity"
],
"amino_acids_prev_tags": [],
"countries_beforescanbot": "France",
"ingredients_tags": [
"en:wheat-flour",
"en:sugar",
"en:butter",
"fr:lait-ecreme-en-poudre",
"en:milk",
"fr:equivalent-lait-ecreme",
"en:salt",
"en:raising-agent",
"en:acidity-regulator",
"en:citric-acid",
"en:flavourings",
"en:icing-sugar",
"en:sugar",
"fr:carbonate-acide-de-sodium",
"fr:carbonate-acide-d-ammonium",
"en:sugar",
"fr:amidon-de-mais",
"en:starch"
],
"image_front_thumb_url": "https://static.openfoodfacts.org/images/products/301/776/000/0109/front_fr.13.100.jpg",
"quantity_debug_tags": [],
"nutrition_grades": "e",
"emb_codes_debug_tags": [],
"additives_debug_tags": [
"en-e500ii-added",
"en-e503ii-added"
],
"additives_tags": [
"en:e330",
"en:e500",
"en:e500ii",
"en:e503",
"en:e503ii"
],
"image_nutrition_small_url": "https://static.openfoodfacts.org/images/products/301/776/000/0109/nutrition_fr.23.200.jpg",
"code": "3017760000109",
"image_nutrition_thumb_url": "https://static.openfoodfacts.org/images/products/301/776/000/0109/nutrition_fr.23.100.jpg",
"informers": [
"manu1400"
],
"photographers": [],
"checkers_tags": [],
"ingredients_debug": [
"Farine de _blé_ 73",
",",
null,
null,
"5 %",
",",
null,
null,
" sucre",
",",
null,
null,
" _beurre_ 13",
",",
null,
null,
"6 %",
",",
null,
null,
" _lait_ écrémé en poudre 1",
",",
null,
null,
"3 % ",
"(",
null,
null,
"équivalent _lait_ écrémé 13 %)",
",",
null,
null,
" sel",
",",
null,
null,
" poudre à lever ",
":",
null,
null,
" ",
"(",
null,
null,
"carbonate acide de sodium",
",",
null,
null,
" carbonate acide d'ammonium)",
",",
null,
null,
" correcteur d'acidité ",
":",
null,
null,
" ",
"(",
null,
null,
"acide citrique)",
",",
null,
null,
" arôme",
",",
null,
null,
" sucre glace ",
"(",
null,
null,
"sucre",
",",
null,
null,
" amidon de maïs)"
],
"quantity": "200 g e",
"image_small_url": "https://static.openfoodfacts.org/images/products/301/776/000/0109/front_fr.13.200.jpg",
"languages": {
"en:french": 6
},
"emb_codes": "",
"countries_tags": [
"en:belgium",
"en:france",
"en:switzerland"
],
"nutrition_data_prepared_per": "100g",
"origins_tags": [],
"stores_debug_tags": [],
"unknown_ingredients_n": 1,
"cities_tags": [],
"pnns_groups_2": "Biscuits and cakes",
"image_thumb_url": "https://static.openfoodfacts.org/images/products/301/776/000/0109/front_fr.13.100.jpg",
"origins": "",
"labels_prev_tags": [
"en:green-dot"
],
"traces_tags": [
"en:eggs",
"en:nuts",
"en:sesame-seeds"
],
"fruits-vegetables-nuts_100g_estimate": 0,
"rev": 24,
"correctors": [
"manu1400"
],
"manufacturing_places_tags": [],
"misc_tags": [
"en:nutrition-no-fruits-vegetables-nuts",
"en:nutrition-no-fiber-or-fruits-vegetables-nuts",
"en:nutriscore-computed"
],
"ingredients_from_palm_oil_n": 0,
"last_image_t": 1457686800,
"manufacturing_places": "",
"photographers_tags": [
"nissen",
"openfoodfacts-contributors"
],
"additives_prev": " [ farine-de-ble-73 -> fr:farine-de-ble-73 ] [ farine-de-ble -> fr:farine-de-ble ] [ farine-de -> fr:farine-de ] [ farine -> fr:farine ] [ 5 -> en:fd-c ] [ sucre -> fr:sucre ] [ beurre-13 -> fr:beurre-13 ] [ beurre -> fr:beurre ] [ 6 -> en:fd-c ] [ lait-ecreme-en-poudre-1 -> fr:lait-ecreme-en-poudre-1 ] [ lait-ecreme-en-poudre -> fr:lait-ecreme-en-poudre ] [ lait-ecreme-en -> fr:lait-ecreme-en ] [ lait-ecreme -> fr:lait-ecreme ] [ lait -> fr:lait ] [ 3 -> en:fd-c ] [ equivalent-lait-ecreme-13 -> fr:equivalent-lait-ecreme-13 ] [ equivalent-lait-ecreme -> fr:equivalent-lait-ecreme ] [ equivalent-lait -> fr:equivalent-lait ] [ equivalent -> fr:equivalent ] [ sel -> fr:sel ] [ poudre-a-lever -> fr:poudre-a-lever ] [ poudre-a -> fr:poudre-a ] [ poudre -> fr:poudre ] [ carbonate-acide-de-sodium -> en:e500 -> exists -- ok ] [ carbonate-acide-d-ammonium -> en:e503 -> exists -- ok ] [ correcteur-d-acidite -> fr:correcteur-d-acidite ] [ correcteur-d -> fr:correcteur-d ] [ correcteur -> fr:correcteur ] [ acide-citrique -> en:e330 -> exists -- ok ] [ arome -> fr:arome ] [ sucre-glace -> fr:sucre-glace ] [ sucre -> fr:sucre ] [ sucre -> fr:sucre ] [ amidon-de-mais -> fr:amidon-de-mais ] [ amidon-de -> fr:amidon-de ] [ amidon -> fr:amidon ] ",
"languages_tags": [
"en:french",
"en:1"
],
"product_name_fr": "Le Véritable Petit Beurre",
"ingredients_original_tags": [
"en:wheat-flour",
"en:sugar",
"en:butter",
"fr:lait-ecreme-en-poudre",
"fr:équivalent _lait_ écrémé",
"en:salt",
"en:raising-agent",
"en:acidity-regulator",
"en:citric-acid",
"en:flavourings",
"en:icing-sugar",
"fr:carbonate-acide-de-sodium",
"fr:carbonate-acide-d-ammonium",
"en:sugar",
"fr:amidon-de-mais"
],
"last_image_dates_tags": [
"2016-03-11",
"2016-03",
"2016"
],
"brands_tags": [
"lu"
],
"link_debug_tags": [],
"ingredients_that_may_be_from_palm_oil_n": 0,
"selected_images": {
"front": {
"thumb": {
"fr": "https://static.openfoodfacts.org/images/products/301/776/000/0109/front_fr.13.100.jpg"
},
"small": {
"fr": "https://static.openfoodfacts.org/images/products/301/776/000/0109/front_fr.13.200.jpg"
},
"display": {
"fr": "https://static.openfoodfacts.org/images/products/301/776/000/0109/front_fr.13.400.jpg"
}
},
"nutrition": {
"thumb": {
"fr": "https://static.openfoodfacts.org/images/products/301/776/000/0109/nutrition_fr.23.100.jpg"
},
"display": {
"fr": "https://static.openfoodfacts.org/images/products/301/776/000/0109/nutrition_fr.23.400.jpg"
},
"small": {
"fr": "https://static.openfoodfacts.org/images/products/301/776/000/0109/nutrition_fr.23.200.jpg"
}
},
"ingredients": {
"display": {
"fr": "https://static.openfoodfacts.org/images/products/301/776/000/0109/ingredients_fr.22.400.jpg"
},
"small": {
"fr": "https://static.openfoodfacts.org/images/products/301/776/000/0109/ingredients_fr.22.200.jpg"
},
"thumb": {
"fr": "https://static.openfoodfacts.org/images/products/301/776/000/0109/ingredients_fr.22.100.jpg"
}
}
},
"new_additives_n": 3,
"additives_prev_tags": [
"en:e330",
"en:e500",
"en:e503"
],
"nutrient_levels": {
"sugars": "high",
"fat": "moderate",
"salt": "moderate",
"saturated-fat": "high"
},
"additives_old_tags": [
"en:e500",
"en:e503",
"en:e330"
],
"debug_param_sorted_langs": [
"fr"
],
"ingredients_text_fr": "Farine de _blé_ 73,5 %, sucre, _beurre_ 13,6 %, _lait_ écrémé en poudre 1,3 % (équivalent _lait_ écrémé 13 %), sel, poudre à lever (carbonate acide de sodium, carbonate acide d'ammonium), correcteur d'acidité (acide citrique), arôme, sucre glace (sucre, amidon de maïs)",
"states": "en:to-be-checked, en:complete, en:nutrition-facts-completed, en:ingredients-completed, en:expiration-date-completed, en:packaging-code-to-be-completed, en:characteristics-completed, en:categories-completed, en:brands-completed, en:packaging-completed, en:quantity-completed, en:product-name-completed, en:photos-validated, en:photos-uploaded",
"pnns_groups_1": "Sugary snacks",
"pnns_groups_1_tags": [
"sugary-snacks"
],
"nutrition_score_warning_no_fruits_vegetables_nuts": 1,
"countries": "Belgique,France,Suisse",
"generic_name_fr_debug_tags": [],
"ingredients_that_may_be_from_palm_oil_tags": [],
"_id": "3017760000109",
"last_modified_t": 1523339117,
"editors": [
"sebleouf",
"nissen",
"manu1400"
],
"completed_t": 1426072606,
"codes_tags": [
"code-13",
"3017760000109",
"301776000010x",
"30177600001xx",
"3017760000xxx",
"301776000xxxx",
"30177600xxxxx",
"3017760xxxxxx",
"301776xxxxxxx",
"30177xxxxxxxx",
"3017xxxxxxxxx",
"301xxxxxxxxxx",
"30xxxxxxxxxxx",
"3xxxxxxxxxxxx"
],
"image_ingredients_url": "https://static.openfoodfacts.org/images/products/301/776/000/0109/ingredients_fr.22.400.jpg",
"ingredients_from_or_that_may_be_from_palm_oil_n": 0,
"image_url": "https://static.openfoodfacts.org/images/products/301/776/000/0109/front_fr.13.400.jpg",
"product_name": "Le Véritable Petit Beurre",
"unknown_nutrients_tags": [],
"expiration_date_debug_tags": [],
"labels_debug_tags": [],
"lang_debug_tags": [],
"ingredients_n_tags": [
"15",
"11-20"
],
"nucleotides_tags": [],
"created_t": 1341146799,
"sortkey": 1523339117,
"categories_debug_tags": [],
"packaging_debug_tags": [],
"ingredients_text_fr_debug_tags": [],
"categories_prev_hierarchy": [
"en:sugary-snacks",
"en:biscuits-and-cakes",
"en:biscuits",
"fr:petits-beurres"
],
"ingredients_from_palm_oil_tags": [],
"entry_dates_tags": [
"2012-07-01",
"2012-07",
"2012"
],
"serving_size": "8,3 g",
"lang": "fr",
"product_name_fr_debug_tags": [],
"origins_debug_tags": [],
"informers_tags": [
"manu1400",
"nissen",
"sebleouf"
],
"states_hierarchy": [
"en:to-be-checked",
"en:complete",
"en:nutrition-facts-completed",
"en:ingredients-completed",
"en:expiration-date-completed",
"en:packaging-code-to-be-completed",
"en:characteristics-completed",
"en:categories-completed",
"en:brands-completed",
"en:packaging-completed",
"en:quantity-completed",
"en:product-name-completed",
"en:photos-validated",
"en:photos-uploaded"
],
"nutrition_data_per_debug_tags": [],
"pnns_groups_2_tags": [
"biscuits-and-cakes"
],
"ingredients_text_with_allergens_fr": "Farine de <span class=\"allergen\">blé</span> 73,5 %, sucre, <span class=\"allergen\">beurre</span> 13,6 %, <span class=\"allergen\">lait</span> écrémé en poudre 1,3 % (équivalent <span class=\"allergen\">lait</span> écrémé 13 %), sel, poudre à lever (carbonate acide de sodium, carbonate acide d'ammonium), correcteur d'acidité (acide citrique), arôme, sucre glace (sucre, amidon de maïs)",
"lc": "fr",
"additives_prev_original_tags": [
"en:e500",
"en:e503",
"en:e330"
],
"nutrition_score_debug": " -- energy 5 + sat-fat 7 + fr-sat-fat-for-fats 9 + sugars 5 + sodium 6 - fruits 0% 0 - fiber 3 - proteins 4 -- fsa 20 -- fr 20",
"nutrition_data": "on",
"max_imgid": "5",
"nova_groups": "4",
"labels_hierarchy": [
"en:green-dot"
],
"ingredients_text_debug": "Farine de _blé_ 73,5 %, sucre, _beurre_ 13,6 %, _lait_ écrémé en poudre 1,3 % (équivalent _lait_ écrémé 13 %), sel, poudre à lever : (carbonate acide de sodium, carbonate acide d'ammonium), correcteur d'acidité : (acide citrique), arôme, sucre glace (sucre, amidon de maïs)",
"image_front_small_url": "https://static.openfoodfacts.org/images/products/301/776/000/0109/front_fr.13.200.jpg",
"vitamins_tags": [],
"nutrition_data_prepared": "",
"packaging_tags": [
"carton",
"plastique"
],
"nutrition_grade_fr": "e",
"brands": "LU",
"expiration_date": "07/2015",
"image_ingredients_thumb_url": "https://static.openfoodfacts.org/images/products/301/776/000/0109/ingredients_fr.22.100.jpg",
"quality_tags": [
"quantity-contains-e",
"quantity-not-recognized"
],
"purchase_places_tags": [
"eure-et-loir",
"france",
"nantes"
],
"ingredients_text": "Farine de _blé_ 73,5 %, sucre, _beurre_ 13,6 %, _lait_ écrémé en poudre 1,3 % (équivalent _lait_ écrémé 13 %), sel, poudre à lever (carbonate acide de sodium, carbonate acide d'ammonium), correcteur d'acidité (acide citrique), arôme, sucre glace (sucre, amidon de maïs)",
"unique_scans_n": 265,
"nova_group": "4",
"nutrition_data_prepared_per_debug_tags": [],
"interface_version_modified": "20120622"
},
"code": "3017760000109"
}

File diff suppressed because it is too large Load Diff

View File

@ -0,0 +1,57 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import pytest
import function as target
@pytest.fixture()
def product_offline():
prod_beurre = target.get_product('3017760000109', True)
prod_oreo = target.get_product('8410000810004', True)
prod_false = target.get_product('1664', True)
prod_string = target.get_product('string', True)
return (prod_beurre, prod_oreo, prod_false, prod_string)
@pytest.fixture()
def product_online():
prod_beurre = target.get_product('3017760000109')
prod_oreo = target.get_product('8410000810004')
return (prod_beurre, prod_oreo)
def test_get_product_stdout(capsys):
target.get_product('1664', True)
captured = capsys.readouterr()
assert captured.out == "File load error : sample/product-1664.json\n"
target.get_product('string', True)
captured = capsys.readouterr()
assert captured.out == "File load error : sample/product-string.json\n"
def test_get_product(product_offline):
# :Tests OFFLINE:
prod_beurre, prod_oreo, prod_false, prod_string = product_offline
assert prod_beurre['product_name'] == 'Le Véritable Petit Beurre'
assert prod_beurre['nutrition_grades'] == 'e'
assert prod_beurre['categories_tags'] == [
'en:sugary-snacks',
'en:biscuits-and-cakes',
'en:biscuits',
'fr:petits-beurres'
]
# better use the file in sample directory
assert prod_oreo == {'categories_tags': [
'en:sugary-snacks',
'en:biscuits-and-cakes',
'en:biscuits',
'en:chocolate-biscuits',
'es:sandwich-cookies'
],
'code': '8410000810004',
'nutrition_grades': 'e',
'product_name': 'Biscuit Oreo',
'url':'https://fr.openfoodfacts.org/product/8410000810004/'}
assert not prod_false
assert not prod_string

View File

@ -0,0 +1,49 @@
# Roboc
_I am pausing the devel here, I have to prioritise another project._
_I'll be back with Pytest!_
## Objective of the exercise
Multiplayer maze game over network
All instructions avaiable in the course
_[Apprenez à programmer en Python](https://openclassrooms.com/courses/apprenez-a-programmer-en-python/exercises/181)_
, from **Open Classrooms**.
## Gameplay / roadmap
1. [x] run server
2. [x] choose a map
3. [x] accept client connection
4. [x] when number of connected client is reached, any clients can start the
game with the command 'PLAY'
5. [x] each robot is randomly placed on the map
6. play turn by turn
7. no new client during the game
## Files
- `server.py`: server script
- `client.py`: client script
- `configuration.py`: constants, variables and function
- `map.py`: object providing a navigable map
- `connectsocket.py`: socket object providing network
- `readme.md`: you are reading it!
- `cartes`: place for map files (ext. `.txt`)
## Commands
The robot is controllable by keyboard commands. The following commands
must exist:
- Q: Quit game
- N: move north (up)
- E: move east (right)
- S: move south (down)
- O: move west (left)
- Each of the above directions followed by a number allows you to
advance several squares (e. g. E3:3 squares to the east)
## Remarques
## Bonus

View File

@ -0,0 +1,11 @@
OOOOOOOOOO
O O O O
O . OO O
O O O O
O OOOO O.O
O O O U
O OOOOOO.O
O O O
O O OOOOOO
O . O O
OOOOOOOOOO

View File

@ -0,0 +1,21 @@
OOOOOOOOOO
O O O O
O . OO O
O O O O
O . OO O
O O O O
O . OO O
O O O O
O . OO O
O O O O
O OOOO O.O
O O O U
O OOOOOO.O
O O O
O OOOOOO.O
O O O
O OOOOOO.O
O O O
O O OOOOOO
O . O O
OOOOOOOOOO

View File

@ -0,0 +1,11 @@
OOOOOOOOOOOOOOOOO
O O O O O
O . O OOO OO O O
O O O . O O O O
O O O O O O OO.O
O O OOOO O O U
O . . O OOO OO.O
O O O O OO OO O
O O OO OO O OO O
O O O O
OOOOOOOOOOOOOOOOO

View File

@ -0,0 +1,13 @@
OOOOOOOOOOOOOOOOOOOOO
O O O O O
O . O OOO OO OO.OO.O
O O O . O O O O
O O O O O O OO.OOOOO
O O OOOO O O U
O . . O OOO OO.OOOOOOOOOO
O O O O OO OO O
O O OO OO O OOOOOO.OOOO O
O O O O
OOO O OOOOOOOOOOOOOOOOOOOO
O O
OOOOO

View File

@ -0,0 +1,3 @@
OOO
O U
OOO

View File

@ -0,0 +1,20 @@
OOOOOOOOOOOOOOOOOOOO
O O . O O . O
O.O O O O O O
O O O O O O O
O.O O . O O O
O O O OOOOOO O O
O O O O O
O O OOOOOOOOOO O
O.O . O O
O O O O O
O O O O O
O O.O O O
O.O . O O
O O O O O
O O O O O
O O O O O
O O O O O
O.O O O O
O O O U
OOOOOOOOOOOOOOOOOOOO

View File

@ -0,0 +1,26 @@
OOOOOOOOOOOOOOOOOOOO
O O . O O . O
O.O O O O O O
O O O O O O O
O.O O . O O O
O O O OOOOOO O O
O O O O O
O O OOOOOOOOOO O
O.O . O O
O O O O O
O O O O O
O O.O O O
O.O . O O
O O O O O
O O O O O
O O O O O
O O O O O
O O O O O
O O O O O
O O O O O
O O O O O
O O O O O
O O O O O
O.O O O O
O O O U
OOOOOOOOOOOOOOOOOOOO

View File

@ -0,0 +1,2 @@
12
34

View File

@ -0,0 +1,154 @@
"""
Author: freezed <freezed@users.noreply.github.com> 2018-02-11
Version: 0.1
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
Ce fichier fait partie du projet `roboc`
"""
# CONFIGURATION
# Commandes
# Le code utilise l'index des listes `COMMANDS` & `COMMANDS_LABEL`
# pour faire le lien entre les 2.
# Ici vous pouvez ajouter de nouvelles commandes de jeu, elle seront
# ajoutees a l'aide automatiquement. Mais il faudra ajouter le code
# leur correspondant dans la condition de traitement du mouvement.
COMMANDS = ['Q', 'H']
# Libelle des commandes d'interuption, conserver l'ordre
COMMANDS_LABEL = ['Quitter', 'Aide']
# Commandes clavier de deplacement
DIRECTIONS = ['N', 'S', 'E', 'O']
# Étiquette des commandes clavier des de deplacements pour l'affichage
# de l'aide. Garder la correspondance
DIRECTIONS_LABEL = ['nord',
'sud',
'est',
'ouest']
# Pepertoire des fichiers carte
MAP_DIRECTORY = 'cartes/'
# Extention des fichiers carte
MAP_EXTENTION = '.txt'
# Elements dispo dans le labyrinthe
MAZE_ELEMENTS = {'wall': 'O',
'door': '.',
'exit': 'U',
'robo': 'X',
'void': ' '}
# Issue possible d'un mouvement, garder le OK toujours en fin de liste
MOVE_STATUS = ['bad', 'wall', 'exit', 'door', 'ok']
MOVE_STATUS_MSG = {
'bad': "Le déplacement «{}» n'est pas autorisé.",
'wall': "Le déplacement est stoppé par un mur.",
'exit': "Vous êtes sortit du labyrinte",
'door': "Vous passez une porte",
'ok': "Jusqu'ici, tout va bien…"
}
# Messages d'erreurs
ERR_ = "#!@?# Oups… "
ERR_MAP_FILE = ERR_ + "carte «{}» inaccessible!"
ERR_MAP_SIZE = ERR_ + "carte «{}», dimensions incorrecte: «{} x {}»"
ERR_MAP_ROBO = ERR_ + "robo est introuvable sur la carte «{}»!"
ERR_PLAGE = ERR_ + "saisir un nombre dans la plage indiquée! "
ERR_SAISIE = ERR_ + "saisir un nombre! "
ERR_UNKNOW = ERR_ + "personne n'est censé arriver ici…"
MIN_MAP_SIDE = 3
MIN_CLIENT_NB = 2
MSG_DISCLAMER = "Bienvenue dans Roboc."
MSG_AVAIBLE_MAP = "Cartes disponible: "
MSG_CHOOSE_MAP = "Choississez un numéro de carte: "
MSG_CHOOSE_MOVE = "Votre deplacement ({}:{}): "
MSG_START_GAME = "Votre partie commence"
MSG_REQUEST_START = "Entrez «PLAY» pour démarrer la partie: "
MSG_END_GAME = "Fin du jeu."
MSG_QUIT_GAME = "Vous quittez la partie"
# Recapitulatif des commandes
MSG_HELP = "Voici les commandes disponibles:\n"
MSG_SELECTED_MAP = "Vous avez fait le choix #{}, la carte «{}»."
MSG_CONNECTED_CLIENT = "Nb client connecté: {}: {}"
MSG_MINIMUM_CLIENT = "Nb client minimum: {}"
MAPS_NAME_LIST = list() # liste des maps proposees a l'utilisateur
# FONCTIONS
def cls():
""" Efface l'historique de la console """
import os
os.system('clear')
return
def choose_maps_menu():
"""
Affiche le menu de selection des cartes
Recupere les cartes dans un repertoire, demande a l'utilisateur,
de choisir et effectue quelques tests sur la carte jouee avant de
creer
:return str: nom de fichier de la carte choisi
"""
# VARIABLES
user_select_map_id = -1 # choix utilisateur: une carte
print(MSG_AVAIBLE_MAP)
i = 0
for maps_name in MAPS_NAME_LIST:
print("\t[{}] - {}".format(i, maps_name))
i += 1
# Choix de la carte par l'utilisateur
while user_select_map_id > len(MAPS_NAME_LIST) or user_select_map_id < 0:
user_select_map_id = input(MSG_CHOOSE_MAP)
try:
user_select_map_id = int(user_select_map_id)
# ? if user_select_map_id is int(): ?
except ValueError:
user_select_map_id = -1
continue
if user_select_map_id > len(MAPS_NAME_LIST) or \
user_select_map_id < 0:
print(ERR_PLAGE)
cls() # vide l'ecran de la console
print(MSG_SELECTED_MAP.format(
user_select_map_id,
MAPS_NAME_LIST[user_select_map_id]
))
# Fichier carte a recuperer
map_file = MAP_DIRECTORY + \
MAPS_NAME_LIST[user_select_map_id] + \
MAP_EXTENTION
return map_file
def get_msg_list(command, label):
"""
Formate une chaine pour afficher les commandes et leurs descriptifs
:type key: lst()
:param key: liste de commande
:type label: lst()
:param label: Texte descriptif des commande associee
:rtype: str()
:return: Chaine formatee assemblant les elements en parametres
"""
# Modele de mise en forme de la liste de chaque element
TEMPLATE = "\t- «{}»: {}\n"
# Variable de setour
result = str()
for key, value in enumerate(command):
result += TEMPLATE.format(value, label[key])
return result

View File

@ -0,0 +1,340 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author: freezed <freezed@users.noreply.github.com> 2018-03-06
Version: 0.1
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
This file is part or roboc project. View `readme.md`
"""
import socket
import select
class ConnectSocket:
"""
ConnectSocket
=======
Provide network connection and management methods
:Example:
>>> c0 = ConnectSocket()
Server is running, listening on port 5555
>>> c0.list_sockets(False, False)
[]
>>> c0.list_sockets()
''
>>> c0.count_clients()
0
>>> c0.close()
Server stop
"""
# default connection parameters
_HOST = 'localhost'
_PORT = 5555
_BUFFER = 1024
_MAIN_CONNECT = "MAIN_CONNECT"
# Template messages
_BROADCAST_MSG = "{}~ {}\n"
_MSG_DISCONNECTED = "<gone away to infinity, and beyond>"
_MSG_SALUTE = "Hi, {}, wait for other players\n"
_MSG_SERVER_STOP = "Server stop"
_MSG_START_SERVER = "Server is running, listening on port {}"
_MSG_USER_IN = "<entered the network>"
_MSG_WELCOME = "Welcome. First do something usefull and type your name: "
_MSG_UNWELCOME = "Sorry, no more place here.\n"
_MSG_UNSUPPORTED = "Unsupported data:«{}»{}"
_SERVER_LOG = "{}:{}|{name}|{msg}"
# Others const
_MAX_CLIENT_NAME_LEN = 8
_MIN_CLIENT_NAME_LEN = 3
_MAX_CLIENT_NB = 5
def __init__(self, host=_HOST, port=_PORT):
"""
Set up the server connection using a socket object
:param str _HOST: domain or IPV4 address
:param int _PORT: port number
:return obj: socket
"""
# Setting up the connection
self._main_sckt = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
self._main_sckt.setsockopt(socket.SOL_SOCKET, socket.SO_REUSEADDR, 1)
self._main_sckt.bind((host, port))
self._main_sckt.listen(5)
# Init connection list
self._inputs = []
self._inputs.append(self._main_sckt)
# Init username list, to keep match between inputs & name lists
self._user_name = []
self._user_name.append(self._MAIN_CONNECT)
# Logging server's activity
self.server_log(self._MSG_START_SERVER.format(port))
def broadcast(self, sender, message):
"""
Send a message to all named-clients but the sender
TODO should replace sckt.send() too
:param obj sender: sender socket (or 'server' str() for server)
:param str message: message to send
"""
# Define senders name
if sender == 'server':
name = 'server'.upper()
else:
idx = self._inputs.index(sender)
name = self._user_name[idx].upper()
message = self._BROADCAST_MSG.format(name, message)
recipients = self.list_sockets(False, False)
for sckt in recipients:
if sckt != sender:
sckt.send(message.encode())
# NOTE I remove a `try/except` here because I do not
# encountered any Error, I cannot choose the correct
# exception type
# sckt.close() \ self._inputs.remove(sckt)
def close(self):
""" Cleanly closes each socket (clients) of the network """
self._main_sckt = self._inputs.pop(0)
i = 1
for sckt in self._inputs:
self.server_log(self._SERVER_LOG.format(
*sckt.getpeername(),
name=self._user_name[i],
msg="closed client socket")
)
sckt.close()
i += 1
self._inputs.clear()
self._main_sckt.close()
self.server_log(self._MSG_SERVER_STOP)
def count_clients(self):
"""
Count connected and named clients
(to avoid playing with a unamed player)
"""
return len(self.list_sockets(False, False))
def data_filter(self, data, s_idx):
"""
Filters the data basically:
- Alphanumeric char only
- non-alphanum char replaced by 'x'
- 'xxx' for string < MIN
- Troncated after the MAX char
- trailed with index number if same name exists
"""
# alphanumeric
if str(data).isalnum() is False:
f_data = ''
for char in data:
if char.isalnum():
f_data += char
else:
f_data += 'x'
data = f_data
# minimum length
if len(data) < self._MIN_CLIENT_NAME_LEN:
data += 'xxx'
# maximum length
data = data[0:self._MAX_CLIENT_NAME_LEN]
# name already used
if data in self._user_name:
data += str(s_idx)
return data
def list_sockets(self, print_string=True, user_name=True):
"""
List connected sockets
:param bool print_string: return txt formated socket list
:param bool user_name: return user_name
"""
if user_name:
client_list = [
name for name in self._user_name
if name != self._MAIN_CONNECT and name is not False
]
else:
client_list = [
sckt for (idx, sckt) in enumerate(self._inputs)
if sckt != self._main_sckt
and self._user_name[idx] is not False
]
# NOTE maybe there is a better way for the next condition: when
# client connects it has not yet his name filled in the
# _user_name attribut, then this method returns only clients
# with a filled name
if print_string and len(client_list) == 0:
client_list = ""
elif print_string:
client_list = ", ".join(client_list)
return client_list
def listen(self):
"""
Listen sockets activity
Get the list of sockets which are ready to be read and apply:
- connect a new client
- return data sended by client
This object only processes data specific to network connections,
other data (username and message sent) are stored in `u_name` &
`message` attributes to be used by parent script
:return str, str: user_name, data
"""
self.u_name = ""
self.message = ""
# listennig…
rlist, [], [] = select.select(self._inputs, [], [], 0.05)
for sckt in rlist:
# logging, broadcasting & sending (LBS) params
logging = True
broadcasting = True
sending = True
# Listen for new client connection
if sckt == self._main_sckt:
sckt_object, sckt_addr = sckt.accept()
# Maximum connection number is not reached: accepting
if len(self._inputs) <= self._MAX_CLIENT_NB:
self._inputs.append(sckt_object)
self._user_name.append(False)
# LBS params override
log_msg = self._SERVER_LOG.format(
*sckt_addr, name="unknown", msg="connected"
)
sckt_object.send(self._MSG_WELCOME.encode())
broadcasting = False
sending = False
# Refusing
else:
sckt_object.send(self._MSG_UNWELCOME.encode())
self.server_log(self._SERVER_LOG.format(
*sckt_addr, name="unknow", msg="rejected"
))
sckt_object.close()
break
else: # receiving data
data = sckt.recv(self._BUFFER).decode().strip()
s_idx = self._inputs.index(sckt)
if self._user_name[s_idx] is False: # setting username
# saving name
self._user_name[s_idx] = self.data_filter(data, s_idx)
# LBS params override
log_msg = self._SERVER_LOG.format(
*sckt.getpeername(),
name=self._user_name[s_idx],
msg="set user name"
)
bdcst_msg = self._MSG_USER_IN
send_msg = self._MSG_SALUTE.format(self._user_name[s_idx])
elif data.upper() == "QUIT": # client quit network
# LBS params override
log_msg = self._SERVER_LOG.format(
*sckt.getpeername(),
name=self._user_name[s_idx],
msg="disconnected"
)
# broadcasting params
bdcst_msg = self._MSG_DISCONNECTED
self.broadcast(sckt, bdcst_msg)
broadcasting = False
sending = False
self._inputs.remove(sckt)
self._user_name.pop(s_idx)
sckt.close()
elif data:
self.u_name, self.message = self._user_name[s_idx], data
# LBS params override
log_msg = self._SERVER_LOG.format(
*sckt.getpeername(),
name=self._user_name[s_idx],
msg=data
)
broadcasting = False
sending = False
else:
# LBS params override
log_msg = self._SERVER_LOG.format(
*sckt.getpeername(),
name=self._user_name[s_idx],
msg=self._MSG_UNSUPPORTED.format(data)
)
send_msg = self._MSG_UNSUPPORTED.format(data, "\n")
broadcasting = False
if logging:
self.server_log(log_msg)
if broadcasting:
self.broadcast(sckt, bdcst_msg)
if sending:
sckt.send(send_msg.encode())
@staticmethod
def server_log(msg):
""" Log activity on server-side"""
print(msg)
# writes in a logfile here TODO19
# adds a timestamp TODO20
if __name__ == "__main__":
""" Starting doctests """
import doctest
doctest.testmod()

View File

@ -0,0 +1,233 @@
"""
Author: freezed <freezed@users.noreply.github.com> 2018-02-06
Version: 0.1
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
Ce fichier fait partie du projet `roboc`
"""
import os
import random
from configuration import DIRECTIONS, ERR_MAP_FILE, ERR_MAP_ROBO, \
MIN_MAP_SIDE, ERR_MAP_SIZE, ERR_UNKNOW, MAZE_ELEMENTS, MSG_START_GAME, MSG_CHOOSE_MOVE, COMMANDS_LABEL, COMMANDS
class Map:
"""
Fourni les moyens necessaire a l'utilisation d'un fichier carte.
Controle de coherance sur la carte choise, deplace le robo en
fonction des commandes du joueur jusqu'en fin de partie.
Cette docstring contient des
[DocTests](http://sametmax.com/les-docstrings/), ça ne fait pas
partie du cours, mais c'est un outils facile de test/debug que
j'utilise et qui reste transparent.
Doctests
========
:Example:
>>> EasyMap = Map("cartes/facile.txt", 3)
>>> print(EmptyMap.status_message)
#!@?# Oups… carte «cartes/vide.txt», dimensions incorrecte: «0 x 0»
>>> print(TooSmallMap.status_message)
#!@?# Oups… carte «cartes/trop_petite.txt», dimensions incorrecte: «3 x 2»
>>> print("_column_nb: {}".format(EasyMap._column_nb))
_column_nb: 11
>>> print("_line_nb: {}".format(EasyMap._line_nb))
_line_nb: 11
>>> EasyMap.move_to("O")
1
"""
def __init__(self, map_file, nb_player):
"""
Initialisation de la carte utilise
Instancie un objet Map avec les attributs suivant:
:var int status: Etat de l'objet apres le deplacement
:var str status_message: Message relatif au deplacement
:var int _column_nb: Nbre de colonne du labyrinte (1ere ligne)
:var str _data_text: Contenu du labyrinte
:var str _element_under_robo: Element sous le robot
:var int _line_nb: Nbre de ligne du labyrinte
:var int _robo_position: position du robo dans _data_text
:param str map_file: fichier «carte» avec chemin relatif
:param int nb_player: nombre de joueurs (max 9)
:rtype map: str()
"""
# Chargement du fichier carte choisi
if os.path.isfile(map_file) is True:
with open(map_file, "r") as map_data:
# contenu de la carte en texte
self._data_text = map_data.read()
# contenu de la carte ligne a ligne
map_data_list = self._data_text.splitlines()
# nbre de colonne de la 1ere ligne de la carte
try:
self._column_nb = len(map_data_list[0]) + 1
except IndexError:
self._column_nb = 0
# nbre de ligne de la carte
try:
self._line_nb = len(map_data_list)
except IndexError:
self._line_nb = 0
self._robo_position = {}
self._element_under_robo = {}
for player in range(1, nb_player + 1):
# placement des n robots
self._robo_position[player] = random.choice([idx for (idx, value) in enumerate(self._data_text) if value == MAZE_ELEMENTS['void']])
# element «sous» le robo, au depart
self._element_under_robo[player] = MAZE_ELEMENTS['void']
# place le robot sur la carte
self.place_element(player, player)
# Quelques controle sur la carte chargee:
# dimensions assez grande pour deplacer un robo?
if (self._line_nb, self._column_nb) < (MIN_MAP_SIDE, MIN_MAP_SIDE):
self.status = False
self.status_message = ERR_MAP_SIZE.format(
map_file, self._column_nb, self._line_nb
)
# on peu ajouter plein d'autres controles ici
# carte consideree utilisable
else:
self.status = True
self.status_message = MSG_START_GAME
# Erreur de chargement du fichier
else:
self.status = False
self.status_message = ERR_MAP_FILE.format(map_file)
def map_print(self, game_network):
""" Affiche la carte avec la position de jeu courante """
game_network.broadcast(
'server',
'\n'.join(['',
self._data_text,
self.status_message,
MSG_CHOOSE_MOVE.format(COMMANDS[1],COMMANDS_LABEL[1])]
)
)
def move_to(self, move):
"""
Deplace le robo sur la carte
:param str move: mouvement souhaite
:return int: une cle de la constante MOVE_STATUS
"""
# decompose le mouvement
try: # on recupere le 1er caractere (la direction)
direction = move[0]
except IndexError:
return 0
except TypeError:
return 0
if len(move[1:]) > 0: # on recupere les caractere suivants (dist)
try:
goal = int(move[1:])
except ValueError:
return 0
else: # si pas de chiffre, on avance d'une seule unite
goal = 1
steps = 0
# direction non conforme
if direction not in DIRECTIONS:
move_status = 0
# supprime le robo de son emplacement actuel et on replace
# l'elements «dessous»
else:
self._data_text = self._data_text.replace(
MAZE_ELEMENTS['robo'],
self._element_under_robo
)
# pour chaque pas on recupere la position suivante
while steps < goal:
steps += 1
if direction == DIRECTIONS[0]: # nord
next_position = self._robo_position - self._column_nb
elif direction == DIRECTIONS[1]: # sud
next_position = self._robo_position + self._column_nb
elif direction == DIRECTIONS[2]: # est
next_position = self._robo_position + 1
elif direction == DIRECTIONS[3]: # ouest
next_position = self._robo_position - 1
else: # juste au cas ou
raise NotImplementedError(ERR_UNKNOW)
self._element_under_robo = MAZE_ELEMENTS['void']
# Traitement en fonction de la case du prochain pas
next_char = self._data_text[next_position]
if next_char == MAZE_ELEMENTS['wall']:
move_status = 1
steps = goal
elif next_char == MAZE_ELEMENTS['exit']:
self._robo_position = next_position
move_status = 2
steps = goal
elif next_char == MAZE_ELEMENTS['door']:
self._robo_position = next_position
self._element_under_robo = MAZE_ELEMENTS['door']
move_status = 3
steps = goal
else:
self._robo_position = next_position
move_status = 4
# place le robo sur sa nouvelle position
self.place_element(MAZE_ELEMENTS['robo'])
return move_status
def place_element(self, element, player):
"""
Place l'element sur la carte.
La position est celle de l'attribut self._robo_position au
moment de l'appel.
Utilise pour place le robot et remettre les portes.
:param str element: element a placer sur la carte
"""
pos = self._robo_position[player]
txt = self._data_text
self._data_text = txt[:pos] + str(element) + txt[pos + 1:]
if __name__ == "__main__":
import doctest
doctest.testmod()

View File

@ -0,0 +1,122 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author: freezed <freezed@users.noreply.github.com> 2018-02-06
Version: 0.1
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
roboc
=====
Jeu permettant de controler un robot dans un labyrinthe.
Voir readme.md
"""
import os
import pickle
from configuration import BACKUP_FILE, choose_maps_menu, cls, COMMANDS, \
COMMANDS_LABEL, DIRECTIONS, DIRECTIONS_LABEL, get_msg_list, \
MAP_DIRECTORY, MAP_EXTENTION, MAPS_NAME_LIST, MOVE_STATUS, \
MOVE_STATUS_MSG, MSG_AVAIBLE_BACKUP, MSG_BACKUP_DONE, MSG_BACKUP_GAME, \
MSG_CHOOSE_MOVE, MSG_DISCLAMER, MSG_END_GAME, MSG_HELP, MSG_NO_YES, \
MSG_START_GAME, USER_SELECT_BACKUP
# DEBUT DU JEU
# Recuperation de la liste des cartes
try:
MAPS_AVAIBLE = os.listdir(MAP_DIRECTORY)
except FileNotFoundError as except_detail:
print("FileNotFoundError: «{}»".format(except_detail))
else:
for map_file in MAPS_AVAIBLE:
filename_len = len(map_file) - len(MAP_EXTENTION)
# garde les fichiers avec la bonne extention
if map_file[filename_len:] == MAP_EXTENTION:
MAPS_NAME_LIST.append(map_file[: filename_len])
# Affichage du debut de partie
cls() # vide l'ecran de la console
print(MSG_DISCLAMER)
# Verif si un fichier de sauvegarde est dispo
if os.path.isfile(BACKUP_FILE) is True:
with open(BACKUP_FILE, 'rb') as backup_file:
BACKUP_MAP = pickle.Unpickler(backup_file).load()
# On demande si l'utilisateur veut charger la sauvegarde
while USER_SELECT_BACKUP not in MSG_NO_YES:
USER_SELECT_BACKUP = input(
MSG_AVAIBLE_BACKUP.format(*MSG_NO_YES)
).lower()
# utilisateur veut la sauvegarde
if USER_SELECT_BACKUP == MSG_NO_YES[1]:
CURRENT_MAP = BACKUP_MAP
else:
CURRENT_MAP = choose_maps_menu()
else:
CURRENT_MAP = choose_maps_menu()
# DEBUT DE BOUCLE DE TOUR DE JEU
# Affichage de la carte tant que status == True
while CURRENT_MAP.status:
# Affiche la carte et le message
CURRENT_MAP.map_print()
print(CURRENT_MAP.status_message)
# Demande a l'utilisateur son choix du deplacement
user_move = input(MSG_CHOOSE_MOVE.format(
COMMANDS[1], COMMANDS_LABEL[1])
).upper()
cls() # vide l'ecran de la console
# Traitement de la commande utilisateur
if user_move == COMMANDS[0]: # quitter
CURRENT_MAP.status = False
# Le premier tour n'a pas ete joue, pas de sauvegarde faite
if CURRENT_MAP.status_message != MSG_START_GAME:
CURRENT_MAP.status_message = MSG_BACKUP_DONE
else:
CURRENT_MAP.status_message = ""
elif user_move == COMMANDS[1]: # Affiche l'aide
CURRENT_MAP.status_message = MSG_HELP
# liste les directions
CURRENT_MAP.status_message += get_msg_list(
DIRECTIONS, DIRECTIONS_LABEL
)
# liste les commandes
CURRENT_MAP.status_message += get_msg_list(COMMANDS, COMMANDS_LABEL)
else: # Traitement du deplacement
status = CURRENT_MAP.move_to(user_move)
message = MOVE_STATUS_MSG[MOVE_STATUS[status]].format(user_move)
# La sortie est atteinte, fin de la boucle
if MOVE_STATUS[status] == 'exit':
CURRENT_MAP.status = False
CURRENT_MAP.status_message = message
else: # sinon on sauvegarde la partie avant de refaire un tour
CURRENT_MAP.status_message = MSG_BACKUP_GAME
with open(BACKUP_FILE, 'wb') as backup_file:
pickle.Pickler(backup_file).dump(CURRENT_MAP)
CURRENT_MAP.status_message = message
# fin de la boucle de tour
if CURRENT_MAP.status is False:
print(CURRENT_MAP.status_message)
# Fin de partie
print(MSG_END_GAME)
CURRENT_MAP.map_print()

View File

@ -0,0 +1,76 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author: freezed <freezed@users.noreply.github.com> 2018-02-06
Version: 0.2
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
roboc
=====
A multiplayer maze game over network
This is the client script, see readme.md for more details
"""
import socket, signal, select, sys
MSG_ARG_ERROR = "Usage: client.py hostname port"
if len(sys.argv) < 3:
print(MSG_ARG_ERROR)
sys.exit(1)
HOST = sys.argv[1]
PORT = int(sys.argv[2])
BUFFER = 1024
MSG_SERVER_CONNECTED = "Serveur connecté @{}:{}"
MSG_CLOSE_CONNECTION = "Connexion vers [{}:{}] fermée"
def prompt():
sys.stdout.write('~')
sys.stdout.flush()
def handler(signum, frame):
""" Catch <ctrl+c> signal for clean stop"""
print()
print(MSG_CLOSE_CONNECTION.format(*(SERVER_CONNECTION.getpeername())))
SERVER_CONNECTION.send(b"QUIT")
SERVER_CONNECTION.close()
sys.exit(0)
signal.signal(signal.SIGINT, handler)
SERVER_CONNECTION = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
try:
SERVER_CONNECTION.connect((HOST, PORT))
except ConnectionRefusedError as except_detail:
print("ConnectionRefusedError: «{}». Unable to connect".format(except_detail))
sys.exit()
print(MSG_SERVER_CONNECTED.format(HOST, PORT))
while 1:
inputs = [sys.stdin, SERVER_CONNECTION]
rlist, wlist, elist = select.select(inputs, [], [])
for socket in rlist:
if socket == SERVER_CONNECTION: # incomming message
data = socket.recv(BUFFER).decode()
if not data:
print(MSG_CLOSE_CONNECTION.format(HOST, PORT))
sys.exit()
else:
#print data
sys.stdout.write(data)
prompt()
else: # sending message
msg = sys.stdin.readline().encode()
SERVER_CONNECTION.send(msg)
prompt()
SERVER_CONNECTION.close()

View File

@ -0,0 +1,135 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author: freezed <freezed@users.noreply.github.com> 2018-02-06
Version: 0.2
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
roboc
=====
A multiplayer maze game over network
This is the server script, see readme.md for more details
"""
import os
from configuration import choose_maps_menu, cls, COMMANDS, \
COMMANDS_LABEL, DIRECTIONS, DIRECTIONS_LABEL, get_msg_list, \
MAP_DIRECTORY, MAP_EXTENTION, MAPS_NAME_LIST, MIN_CLIENT_NB, MOVE_STATUS, \
MOVE_STATUS_MSG, MSG_CHOOSE_MOVE, MSG_CONNECTED_CLIENT, MSG_DISCLAMER, MSG_END_GAME, \
MSG_HELP, MSG_MINIMUM_CLIENT, MSG_QUIT_GAME, MSG_REQUEST_START, MSG_START_GAME
from connectsocket import ConnectSocket
from map import Map
enough_clients = False
old_count_clients = int(0)
# DEBUT DU JEU
# Recuperation de la liste des cartes
try:
MAPS_AVAIBLE = os.listdir(MAP_DIRECTORY)
except FileNotFoundError as except_detail:
print("FileNotFoundError: «{}»".format(except_detail))
else:
for map_file in MAPS_AVAIBLE:
filename_len = len(map_file) - len(MAP_EXTENTION)
# garde les fichiers avec la bonne extention
if map_file[filename_len:] == MAP_EXTENTION:
MAPS_NAME_LIST.append(map_file[: filename_len])
# Affichage du debut de partie
cls() # vide l'ecran de la console
print(MSG_DISCLAMER)
# Affiche le menu de selection de la carte
MAP_FILENAME = choose_maps_menu()
# Démarre le réseau
GAME_NETWORK = ConnectSocket()
# Attend les connections clients et la commande de départ du jeu
while 1:
GAME_NETWORK.listen()
count_clients = GAME_NETWORK.count_clients()
# attend le nombre mini de client
if old_count_clients != count_clients:
if count_clients > MIN_CLIENT_NB:
broadcast_msg = [
MSG_CONNECTED_CLIENT.format(
count_clients,
GAME_NETWORK.list_sockets()
),
MSG_REQUEST_START,
]
enough_clients = True
else:
# envoie le nbre de client aux clients
broadcast_msg = [
MSG_MINIMUM_CLIENT.format(MIN_CLIENT_NB),
MSG_CONNECTED_CLIENT.format(
count_clients,
GAME_NETWORK.list_sockets()
)
]
enough_clients = False
# envoi les messages
for msg in broadcast_msg:
GAME_NETWORK.broadcast("server", msg)
# attend le go d'un des clients
if GAME_NETWORK.message.upper() == "PLAY" and enough_clients:
broadcast_msg = [MSG_START_GAME.format(GAME_NETWORK.u_name)]
break
old_count_clients = count_clients
# Genere la carte
GAME_MAP = Map(MAP_FILENAME, count_clients)
# DEBUT DE BOUCLE DE TOUR DE JEU
# Affichage de la carte tant que status == True
while GAME_MAP.status:
# Affiche la carte et le message
GAME_MAP.map_print(GAME_NETWORK)
# Traitement de la commande utilisateur
if user_move == COMMANDS[0]: # quitter
GAME_MAP.status = False
GAME_MAP.status_message = MSG_QUIT_GAME
elif user_move == COMMANDS[1]: # Affiche l'aide
GAME_MAP.status_message = MSG_HELP
# liste les directions
GAME_MAP.status_message += get_msg_list(
DIRECTIONS, DIRECTIONS_LABEL
)
# liste les commandes
GAME_MAP.status_message += get_msg_list(COMMANDS, COMMANDS_LABEL)
else: # Traitement du deplacement
status = GAME_MAP.move_to(user_move)
message = MOVE_STATUS_MSG[MOVE_STATUS[status]].format(user_move)
GAME_MAP.status_message = message
# La sortie est atteinte, fin de la boucle
if MOVE_STATUS[status] == 'exit':
GAME_MAP.status = False
# fin de la boucle de tour
if GAME_MAP.status is False:
print(GAME_MAP.status_message)
# Fin de partie
print(MSG_END_GAME)
GAME_MAP.map_print()

View File

@ -0,0 +1,30 @@
# TODO list
## Roadmap to v0.2 [exercice 4](https://openclassrooms.com/courses/apprenez-a-programmer-en-python/exercises/181)
- [x] ~~remove the backup feature TODO01~~
- [x] ~~conversion to client/server mode: server creation TODO02~~
- [x] ~~conversion to client/server mode: client creation TODO03~~
- [x] ~~verify if user name is already used TODO17~~
- [x] ~~add max player number TODO19~~
- [x] ~~each player has a differant robot TODO05~~
- [x] ~~starting position has to be random TODO06~~
- [ ] multiplayer turn-by-turn TODO04
- [ ] one movement unit per tour: ex «e3» = 3 turns TODO07
- [ ] add new game command: 'm' (walling door) TODO11
- [ ] add new game command: 'p' (drilling door) TODO12
- [ ] reject (or standby) clients connections when a game is playing TODO13
- [ ] unit tests: map conformity TODO08
- [ ] unit tests: converting map to labyrinthe TODO09
- [ ] unit tests: game functions TODO10
- [ ] unit tests: game functions (client-side) TODO14
- [ ] chat commands: listing players TODO15
- [ ] chat commands: chating with other players TODO16
- [ ] rename ConnectSocket._user_name to ConnectSocket._user_name TODO18
- [ ] writes server logs in a file TODO19
- [ ] adds a timestamp to server logs TODO20
- [ ] … TODO
Ideas after correcting [exercice 3](https://openclassrooms.com/courses/apprenez-a-programmer-en-python/exercises/180):
- [] go further in oriented object logic TODO17

File diff suppressed because it is too large Load Diff

View File

@ -0,0 +1,34 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# donnee.py : donnee du fichier pendu.py
""" Rassemble les donnee du script pendu.py """
# Constantes
SCORES_FILE = ".scores"
WORD_LIST_FILE = "dicolight.txt"
MAX_TURNS = 12
MAX_NAME_LEN = 7
MIN_NAME_LEN = 2
MSG_DISCLAMER = "Bienvenue au zPendu!\nLe but du jeu est de deviner"+\
" un mot de 8 lettres max en moins de {} tours.".format(MAX_TURNS)
ASK_NAME = "Votre nom ({} à {} caratères) : ".format(MIN_NAME_LEN, MAX_NAME_LEN)
ASK_LETTER = "Choisissez une lettre : "
ERR_WORD_LIST_FILE = "\t#!@?# Oups… Le dictionnaire n'est pas accesible! #?@!#"
ERR_LETTER_LEN = "\t#!@?# Oups… Saisie trop courte ou trop longue! #?@!#"
ERR_LETTER_ALPHA = "\t#!@?# Oups… Il faut saisir une lettre! #?@!#"
ERR_LETTER_USED = "\t#!@?# Oups… Cette lettre à déjà été jouée! #?@!#"
MSG_END_GAME = "Partie terminée avec {} point(s).\nLe mot mystère était : \n"
MSG_1ST_GAME = "C'était votre 1ère partie ;-)"
MSG_SCORES = "\n-== Les Scores : ==-"
# Variables
game_continue = True
player_name = str()
letter = str()
turns = 0
alphabet = [
'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',
'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'
]

View File

@ -0,0 +1,50 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# fonction.py : fonctions du fichier pendu.py
""" Rassemble les fonctions du script pendu.py """
def check_letter(letter, target):
"""
Verifie la presence de **letter** dans **target**
Retourne la liste des positions de la letter ou False
@letter str
@target list of letters
"""
if len(letter) != 1 or len(target) < 2 and letter is not str:
return False
else:
return [k for k, v in enumerate(target) if letter == v]
def cls():
""" Efface l'historique de la console """
import os
os.system('clear')
return
def stringalise (letter_list):
"""
Convertit un liste en une chaine
@letter_list list()
@return string()
"""
stringalised = str()
for letter in letter_list:
stringalised = stringalised + ' ' + letter
return stringalised
if __name__ == "__main__":
# Tests de la fonction
print(check_letter('A', ['M', 'A', 'M', 'O', 'U', 'T', 'H']))
print(check_letter('M', ['M', 'A', 'M', 'O', 'U', 'T', 'H']))
print(check_letter('o', ['M', 'A', 'M', 'O', 'U', 'T', 'H']))
print(check_letter('À', ['M', 'A', 'M', 'O', 'U', 'T', 'H']))
print(check_letter(1, ['M', 'A', 'M', 'O', 'U', 'T', 'H']))
print(check_letter(False, ['M', 'A', 'M', 'O', 'U', 'T', 'H']))

View File

@ -0,0 +1,153 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import random
import os
import pickle
from donnees import *
from fonctions import *
#check_letter, cls, stringalise
# 2.7-zPendu.py: Jeu de pendu avec cumul des scores des differant joueurs
# OpenClassrooms - Apprenez a programmer en Python -
# https://openclassrooms.com/courses/apprenez-a-programmer-en-python/tp-un-bon-vieux-pendu
# Le joueur donne son nom au debut (enregistrement du score)
# Le script choisit un mot (8 lettres max) au hasard dans une liste
# Le joueur a chaque tour saisit une lettre
# Si la lettre figure dans le mot, l'ordinateur affiche le mot avec
# les lettres deja trouvees. Celles qui ne le sont pas encore sont
# remplacees par des etoiles (*). Le joueur a autant de chances que
# le nombre de lettre du mot. Au dela, perdu.
# Le score: score courant (0 si aucun score deja enregistre), a
# chaque partie, ajoute le nombre de coups restants (non utilise)
# intégrer la date de 1ere partie dans le score
# intégrer la partie au plus fort score
# zerofill les scores
# Constantes
SCORES_FILE = ".scores"
WORD_LIST_FILE = "dicolight.txt"
MAX_TURNS = 12
MAX_NAME_LEN = 7
MIN_NAME_LEN = 2
MSG_DISCLAMER = "Bienvenue au zPendu!\nLe but du jeu est de deviner" + \
" un mot de 8 lettres max en moins de {} tours.".format(MAX_TURNS)
ASK_NAME = "Votre nom ({} à {} caratères) : "\
.format(MIN_NAME_LEN, MAX_NAME_LEN)
ASK_LETTER = "Choisissez une lettre : "
ERR_WORD_LIST_FILE = "\t#!@?# Oups… Le dictionnaire n'est pas accesible! #?@!#"
ERR_LETTER_LEN = "\t#!@?# Oups… Saisie trop courte ou trop longue! #?@!#"
ERR_LETTER_ALPHA = "\t#!@?# Oups… Il faut saisir une lettre! #?@!#"
ERR_LETTER_USED = "\t#!@?# Oups… Cette lettre à déjà été jouée! #?@!#"
MSG_END_GAME = "Partie terminée avec {} point(s).\nLe mot mystère était : \n"
MSG_1ST_GAME = "C'était votre 1ère partie ;-)"
MSG_SCORES = "\n-== Les Scores : ==-"
# Variables
game_continue = True
player_name = str()
letter = str()
turns = 0
alphabet = [
'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',
'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'
]
cls()
print(MSG_DISCLAMER)
while (
len(player_name) < MIN_NAME_LEN or
len(player_name) > MAX_NAME_LEN or
player_name.isalnum() is False
): # Le joueur donne son nom
player_name = str(input(ASK_NAME)).capitalize()
if len(player_name) < MIN_NAME_LEN or len(player_name) > MAX_NAME_LEN:
print(ERR_LETTER_LEN)
if player_name.isalnum() is False:
print(ERR_LETTER_ALPHA)
if os.path.isfile(WORD_LIST_FILE) is True: # Chargement du dictionnaire
with open(WORD_LIST_FILE, "r") as word_list_file:
word_list = word_list_file.read().splitlines()
else:
raise ValueError(ERR_WORD_LIST_FILE)
# Choix du mot cible
target_word = list(word_list[random.randrange(0, len(word_list))])
player_word = list("*" * len(target_word))
# Debut de partie
while game_continue is True:
while (
len(letter) != 1
or letter.isalpha() is False
or alphabet.count(letter) != 1
): # Le joueur choisi une lettre
letter = str(input(ASK_LETTER)).upper()
if len(letter) != 1:
print(ERR_LETTER_LEN)
elif letter.isalpha() is False:
print(ERR_LETTER_ALPHA)
elif alphabet.count(letter) != 1:
print(ERR_LETTER_USED)
# Presence de la lettre?
if check_letter(letter, target_word) is not False:
positions = check_letter(letter, target_word)
for i in positions:
player_word[i] = letter
alphabet[alphabet.index(letter)] = '_'
turns += 1
if turns == MAX_TURNS or player_word.count("*") == 0: # Fin de partie?
game_continue = False
# Affichage de la fin de tour
cls()
print(stringalise(alphabet))
print("tour : ", turns, "sur ", MAX_TURNS)
print(stringalise(player_word))
# Fin de partie
points = (MAX_TURNS - turns) + 1
cls()
print(MSG_END_GAME.format(points))
print(stringalise(target_word))
# Affichage du score de la partie et des highscores
if os.path.isfile(SCORES_FILE) is True: # Ouverture du fichier
with open(SCORES_FILE, "rb") as scores_file:
scores = pickle.Unpickler(scores_file).load()
else:
scores = {player_name: 0}
print(MSG_1ST_GAME)
# Calcul du score
if scores.get(player_name, False) is False: # Nouveau joueur
scores.update({player_name: 0})
scores[player_name] = scores[player_name] + points
# Enregistrement du score
with open(SCORES_FILE, "wb") as scores_file:
pickle.Pickler(scores_file).dump(scores)
print(MSG_SCORES)
for score in sorted(
{(points, player) for player, points in scores.items()},
reverse=True
):
print("{}\t: {} points".format(score[1], score[0]))

10
stackex-examples/file1.py Normal file
View File

@ -0,0 +1,10 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
from file2 import Message
""" Single variable importation example """
WORD_LIST = ["hello","bonjour","ola"]
Message(1)

35
stackex-examples/file2.py Normal file
View File

@ -0,0 +1,35 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Single variable importation example
:Example:
>>> MyMessage = Message(0)
>>> type(MyMessage)
<class '__main__.Message'>
>>> print(MyMessage)
hello world
>>> repr(MyMessage)
"phrase: hello world|wl: ['hello', 'bonjour', 'ola']"
"""
class Message:
def __init__(self, index):
from file1 import WORD_LIST
self._phrase = WORD_LIST[index] + " world"
self._word_list = WORD_LIST
def __repr__(self):
return "phrase: {}|wl: {}".format(self._phrase, self._word_list)
def __str__(self):
return self._phrase
if __name__ == "__main__":
""" Starting doctests """
import doctest
doctest.testmod()

View File

@ -0,0 +1,45 @@
#!/usr/bin/env python2
# by Daniel Rosengren, modified by e-satis
# https://stackoverflow.com/a/1429145/6709630
import sys, time
stdout = sys.stdout
BAILOUT = 16
MAX_ITERATIONS = 1000
class Iterator(object) :
def __init__(self):
print 'Rendering...'
for y in xrange(-39, 39):
stdout.write('\n')
for x in xrange(-39, 39):
if self.mandelbrot(x/40.0, y/40.0) :
stdout.write(' ')
else:
stdout.write('*')
def mandelbrot(self, x, y):
cr = y - 0.5
ci = x
zi = 0.0
zr = 0.0
for i in xrange(MAX_ITERATIONS) :
temp = zr * zi
zr2 = zr * zr
zi2 = zi * zi
zr = zr2 - zi2 + cr
zi = temp + temp + ci
if zi2 + zr2 > BAILOUT:
return i
return 0
t = time.time()
Iterator()
print '\nPython Elapsed %.02f' % (time.time() - t)

View File

@ -0,0 +1,52 @@
#!/usr/bin/env python2
# by Daniel Rosengren, modified by e-satis
"""
Module doctring
https://stackoverflow.com/a/1429145/6709630
"""
import time
from sys import stdout
BAILOUT = 16
MAX_ITERATIONS = 1000
def mandelbrot(dim_1, dim_2):
"""
function doc string
"""
cr1 = dim_1 - 0.5
ci1 = dim_2
zi1 = 0.0
zr1 = 0.0
for i in xrange(MAX_ITERATIONS) :
temp = zr1 * zi1
zr2 = zr1 * zr1
zi2 = zi1 * zi1
zr1 = zr2 - zi2 + cr1
zi1 = temp + temp + ci1
if zi2 + zr2 > BAILOUT:
return i
return 0
def execute() :
"""
func doc string
"""
print 'Rendering...'
for dim_1 in xrange(-39, 39):
stdout.write('\n')
for dim_2 in xrange(-39, 39):
if mandelbrot(dim_1/40.0, dim_2/40.0) :
stdout.write(' ')
else:
stdout.write('*')
START_TIME = time.time()
execute()
print '\nPython Elapsed %.02f' % (time.time() - START_TIME)

View File

@ -0,0 +1,3 @@
# stackex
Script posté et/ou trouvé sur[Stack Overflow](https://stackoverflow.com)

View File

@ -0,0 +1,23 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
#https://stackoverflow.com/questions/48729156/how-to-share-values-between-functions-in-python
from random import randrange
a = 20
b = 45
def function1():
coin = randrange(0, 100)
a2 = a + coin
return a2
def function2(coin):
b2 = b + coin
return b2
coin = function1() - a
f2 = function2(coin)
print("coin: {}".format(coin))
print("f2: {}".format(f2))

View File

@ -0,0 +1,26 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
testsocketclose.py
https://stackoverflow.com/q/32019274/6709630
"""
import signal, socket, sys, time
def handler(signum, frame):
""" Catch <ctrl+c> signal for clean stop"""
print('\nNice exit')
connection.close()
sys.exit(0)
signal.signal(signal.SIGINT, handler)
# Creation de la connection
connection = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
connection.bind(('localhost', 5555))
connection.listen(5)
while 1:
print("Socket open:\n{}\nExit with <ctrl+c>".format(connection))
time.sleep(2)

View File

@ -0,0 +1,28 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Author: freezed <freezed@users.noreply.github.com> 2018-02-19
Version: 0.1
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
Testing conditions in try/except statement
https://stackoverflow.com/questions/48864496/adding-if-statement-in-a-try-except-bloc
"""
# ? if user_select_map_id is int(): ?
DEBUG_MODE = [False, True]
for status in DEBUG_MODE:
print("DEBUG_MODE: {}".format(status))
number = input("Type a integer: ")
try:
number = int(number)
except ValueError as except_detail:
if status:
print("ValueError: «{}»".format(except_detail))
else:
print("«{}» is not an integer".format(number))
else:
print("Your number {} is an integer".format(number))

View File

@ -0,0 +1,42 @@
#!/usr/bin/env python3
# coding: utf8
"""
Author: freezed <git@freezed.me> 2020-07-16
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
This file is part of [`free_zed/mypsb`](https://gitlab.com/free_zed/mypsb/)
"""
def main(string, n, sep):
"""
This function reorganize `string` by removing spaces & groups by `n`
characters separated by `sep`.
:Tests:
>>> main("ab c de fgh ijk", 2, "|")
'ab|cd|ef|gh|ij|k'
>>> main("ab c de fgh ijk", 3, "_")
'abc_def_ghi_jk'
>>> main("ab c de fgh ijk", 4, "/")
'abcd/efgh/ijk'
"""
strings = list()
stack = "".join(string.split(" "))
steps = round(len(stack) / n)
while steps != 0:
strings.append(stack[:n])
stack = stack[n:]
steps -= 1
return sep.join(strings)
if __name__ == "__main__":
import doctest
doctest.testmod()

View File

@ -0,0 +1,92 @@
#!/usr/bin/env python3
# coding: utf8
"""
Author: freezed <git@freezed.me> 2020-07-16
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
This file is part of [`free_zed/mypsb`](https://gitlab.com/free_zed/mypsb/)
"""
def main(pile, n):
"""
This function returns the situation of a sand `pile` after droping `n`
sand grain on top of it.
1. Sand pile is a square table of uneven size (viewed from up)
1. Sand grain is always dropped on center of pile.
1. When a cell had 4 grains inside, these grains moves on the near 4th cells
1. Grains going out the pile are losts
:Tests:
>>> main([[1,1,1],[1,1,1],[1,1,1]],1)
[[1, 1, 1], [1, 2, 1], [1, 1, 1]]
>>> main([[1,1,1],[1,1,1],[1,1,1]],2)
[[1, 1, 1], [1, 3, 1], [1, 1, 1]]
>>> main([[1,1,1],[1,1,1],[1,1,1]],3)
[[1, 2, 1], [2, 0, 2], [1, 2, 1]]
>>> main([[1,1,1,1,1],[1,1,1,1,1],[1,1,1,1,1],[1,1,1,1,1],[1,1,1,1,1]],1)
[[1, 1, 1, 1, 1], [1, 1, 1, 1, 1], [1, 1, 2, 1, 1], [1, 1, 1, 1, 1], [1, 1, 1, 1, 1]]
>>> main([[1,1,1,1,1],[1,1,1,1,1],[1,1,1,1,1],[1,1,1,1,1],[1,1,1,1,1]],3)
[[1, 1, 1, 1, 1], [1, 1, 2, 1, 1], [1, 2, 0, 2, 1], [1, 1, 2, 1, 1], [1, 1, 1, 1, 1]]
>>> main([[0,0,3,0,0],[0,0,3,0,0],[3,3,3,3,3],[0,0,3,0,0],[0,0,3,0,0]],1)
[[0, 1, 0, 1, 0], [1, 2, 2, 2, 1], [0, 2, 0, 2, 0], [1, 2, 2, 2, 1], [0, 1, 0, 1, 0]]
"""
size = len(pile)
center = int((size - 1) / 2)
while n != 0:
pile[center][center] += 1
do_propagation(pile)
n -= 1
# All sand grain are dropped, let's finish propagations
while True in [4 in row for row in pile]:
do_propagation(pile)
return pile
def do_propagation(pile):
"""
Walk through the pile to propagate sand grains
:tests:
>>> test_case = [[0,0,4,0,0],[0,2,0,2,0],[4,0,4,0,4],[0,2,0,2,0],[0,0,4,0,0]]
>>> do_propagation(test_case)
>>> print(test_case)
[[0, 1, 0, 1, 0], [1, 2, 2, 2, 1], [0, 2, 0, 2, 0], [1, 2, 2, 2, 1], [0, 1, 0, 1, 0]]
"""
size = len(pile)
x_max, y_max = size - 1, size - 1
# find cells > 3
for x in range(size):
for y in range(size):
if pile[x][y] > 3:
pile[x][y] -= 4
# update west neighbor
if x < x_max:
pile[x + 1][y] += 1
# update east neighbor
if x > 0:
pile[x - 1][y] += 1
# update north neighbor
if y < y_max:
pile[x][y + 1] += 1
# update south neighbor
if y > 0:
pile[x][y - 1] += 1
if __name__ == "__main__":
import doctest
doctest.testmod()

18
xkcd-password.py Normal file
View File

@ -0,0 +1,18 @@
#!/usr/bin/env python3
# coding: utf8
"""
Author: freezed <git@freezed.me> 2020-01-16
Licence: `GNU GPL v3` GNU GPL v3: http://www.gnu.org/licenses/
Inspiration:
- https://docs.python.org/3/library/secrets.html#recipes-and-best-practices
- https://xkcd.com/936/
"""
import secrets
with open("/usr/share/dict/words") as f:
words = [word.strip() for word in f if len(word) == 7]
for i in range(10):
password = "-".join(secrets.choice(words) for i in range(5))
print(password)