{"id":7887,"date":"2023-02-13T06:00:18","date_gmt":"2023-02-13T04:00:18","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=7887"},"modified":"2023-01-24T09:45:16","modified_gmt":"2023-01-24T07:45:16","slug":"13-feb-23","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/13-feb-23\/","title":{"rendered":"TAD de las colas: Todos los elementos verifican una propiedad"},"content":{"rendered":"<p>Utilizando el <a href=\"https:\/\/bit.ly\/3QWTsRL\">tipo abstracto de datos de las colas<\/a>, definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   todosVerifican :: (a -> Bool) -> Cola a -> Bool\n<\/pre>\n<p>tal que <code>todosVerifican p c<\/code> se verifica si todos los elementos de la cola <code>c<\/code> cumplen la propiedad <code>p<\/code>. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   todosVerifican (>0) (inserta 3 (inserta 2 vacia))    == True\n   todosVerifican (>0) (inserta 3 (inserta (-2) vacia)) == False\n<\/pre>\n<p><b>Soluciones<\/b><\/p>\n<p>A continuaci\u00f3n se muestran las <a href=\"#haskell\">soluciones en Haskell<\/a> y las <a href=\"#python\">soluciones en Python<\/a>.<\/p>\n<p><a name=\"haskell\"><\/a><br \/>\n<b>Soluciones en Haskell<\/b><\/p>\n<pre lang=\"haskell\">\nimport TAD.Cola (Cola, vacia, inserta, primero, resto, esVacia)\nimport Transformaciones_colas_listas (colaAlista, listaAcola)\nimport Test.QuickCheck.HigherOrder\n\n-- 1\u00aa soluci\u00f3n\n-- ===========\n\ntodosVerifican1 :: (a -> Bool) -> Cola a -> Bool\ntodosVerifican1 p c\n  | esVacia c = True\n  | otherwise = p pc && todosVerifican1 p rc\n  where pc = primero c\n        rc = resto c\n\n-- 2\u00aa soluci\u00f3n\n-- ===========\n\ntodosVerifican2 :: (a -> Bool) -> Cola a -> Bool\ntodosVerifican2 p c =\n  all p (colaAlista c)\n\n-- La funci\u00f3n colaAlista est\u00e1 definida en el ejercicio\n-- \"Transformaciones entre colas y listas\" que se encuentra en\n-- https:\/\/bit.ly\/3Xv0oIt\n\n-- Comprobaci\u00f3n de equivalencia\n-- ============================\n\n-- La propiedad es\nprop_todosVerifican :: (Int -> Bool) -> [Int] -> Bool\nprop_todosVerifican p xs =\n  todosVerifican1 p c == todosVerifican2 p c\n  where c = listaAcola xs\n\n-- La comprobaci\u00f3n es\n--    \u03bb> quickCheck' prop_todosVerifican\n--    +++ OK, passed 100 tests.\n<\/pre>\n<p><a name=\"python\"><\/a><br \/>\n<b>Soluciones en Python<\/b><\/p>\n<pre lang=\"python\">\nfrom copy import deepcopy\nfrom typing import Callable, TypeVar\n\nfrom hypothesis import given\n\nfrom src.TAD.cola import (Cola, colaAleatoria, esVacia, inserta, primero,\n                          resto, vacia)\nfrom src.transformaciones_colas_listas import colaAlista\n\nA = TypeVar('A')\n\n# 1\u00aa soluci\u00f3n\n# ===========\n\ndef todosVerifican1(p: Callable[[A], bool], c: Cola[A]) -> bool:\n    if esVacia(c):\n        return True\n    pc = primero(c)\n    rc = resto(c)\n    return p(pc) and todosVerifican1(p, rc)\n\n# 2\u00aa soluci\u00f3n\n# ===========\n\ndef todosVerifican2(p: Callable[[A], bool], c: Cola[A]) -> bool:\n    return all(p(x) for x in colaAlista(c))\n\n# La funci\u00f3n colaAlista est\u00e1 definida en el ejercicio\n# \"Transformaciones entre colas y listas\" que se encuentra en\n# https:\/\/bit.ly\/3Xv0oIt\n\n# 3\u00aa soluci\u00f3n\n# ===========\n\ndef todosVerifican3Aux(p: Callable[[A], bool], c: Cola[A]) -> bool:\n    if c.esVacia():\n        return True\n    pc = c.primero()\n    c.resto()\n    return p(pc) and todosVerifican3Aux(p, c)\n\ndef todosVerifican3(p: Callable[[A], bool], c: Cola[A]) -> bool:\n    _c = deepcopy(c)\n    return todosVerifican3Aux(p, _c)\n\n# 4\u00aa soluci\u00f3n\n# ===========\n\ndef todosVerifican4Aux(p: Callable[[A], bool], c: Cola[A]) -> bool:\n    if c.esVacia():\n        return True\n    pc = c.primero()\n    c.resto()\n    return p(pc) and todosVerifican4Aux(p, c)\n\ndef todosVerifican4(p: Callable[[A], bool], c: Cola[A]) -> bool:\n    _c = deepcopy(c)\n    return todosVerifican4Aux(p, _c)\n\n# 5\u00aa soluci\u00f3n\n# ===========\n\ndef todosVerifican5Aux(p: Callable[[A], bool], c: Cola[A]) -> bool:\n    while not c.esVacia():\n        if not p(c.primero()):\n            return False\n        c.resto()\n    return True\n\ndef todosVerifican5(p: Callable[[A], bool], c: Cola[A]) -> bool:\n    _c = deepcopy(c)\n    return todosVerifican5Aux(p, _c)\n\n# Comprobaci\u00f3n de equivalencia\n# ============================\n\n# La propiedad es\n@given(c=colaAleatoria())\ndef test_filtraPila(c: Cola[int]) -> None:\n    r = todosVerifican1(lambda x: x > 0, c)\n    assert todosVerifican2(lambda x: x > 0, c) == r\n    assert todosVerifican3(lambda x: x > 0, c) == r\n    assert todosVerifican4(lambda x: x > 0, c) == r\n    assert todosVerifican5(lambda x: x > 0, c) == r\n\n# La comprobaci\u00f3n es\n#    src> poetry run pytest -q todosVerifican.py\n#    1 passed in 0.25s\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Utilizando el tipo abstracto de datos de las colas, definir la funci\u00f3n todosVerifican :: (a -> Bool) -> Cola a -> Bool tal que todosVerifican p c se verifica si todos los elementos de la cola c cumplen la propiedad p. Por ejemplo, todosVerifican (>0) (inserta 3 (inserta 2 vacia)) == True todosVerifican (>0) (inserta&#8230;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[581],"tags":[515,585],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7887"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/comments?post=7887"}],"version-history":[{"count":1,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7887\/revisions"}],"predecessor-version":[{"id":7888,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7887\/revisions\/7888"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=7887"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=7887"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=7887"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}