def test_start_with(self):
B = Baraja()
B.revolver()
start_lst = [Naipe((1, 2)), Naipe((3, 0)), Naipe((6, 1))]
B.start_with(start_lst)
self.assertEqual(B.sacar_lista_naipes(3), start_lst)
start_lst = [
Naipe((1, 2)),
]
B.start_with(start_lst)
self.assertEqual(B.sacar_lista_naipes(1, start_at_0=True), start_lst)
def test_random_1(self):
'''
Probamos la distribucion uniforme de la funcion revolver.
'''
n = 10e3
p = 1 / 52.0
# z_{\alpha/2} donde \alpha = 95%
z = 1.95996398454
stdev = sqrt(p * (1 - p) / n)
B = Baraja()
X = 0.0
for _ in range(int(n)):
B.revolver()
if Naipe((1, 0)) == B.sacar_lista_naipes(1)[0]:
X += 1.0
#print('lo que se esta probando %s < %s < %s'%(p - z*stdev, X/n, p + z*stdev))
self.assertTrue(p - z * stdev < X / n < p + z * stdev)
def test_sacar_lista_naipes(self):
B = Baraja()
self.assertEqual(len(B.sacar_lista_naipes(26)), 26)
self.assertEqual(len(B.sacar_lista_naipes(26)), 26)
self.assertEqual(len(B.sacar_lista_naipes(26)), 0)
print(suma)
print(Mano(i))
int(10e5)
Naipe((1,0)) == Naipe((1,0))
b.sacar_mano(5) == b.sacar_mano(5)
# %%time
X = 0
for i in range(int(10e5)):
b.revolver()
if Naipe((1,0)) == b.sacar_lista_naipes(1)[0]:
X += 1
X
b.sacar_lista_naipes(1)[0]
# %timeit b.revolver()
# %timeit Naipe((1,0)) == b.sacar_lista_naipes(1)[0]
82.9e-9*10e5
# %timeit Naipe((1,0))
import re
