{"id":7907,"date":"2023-02-21T06:00:28","date_gmt":"2023-02-21T04:00:28","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=7907"},"modified":"2023-01-27T13:04:23","modified_gmt":"2023-01-27T11:04:23","slug":"21-feb-23","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/21-feb-23\/","title":{"rendered":"TAD de las colas: Inclusi\u00f3n de colas"},"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   contenidaCola :: Eq a => Cola a -> Cola a -> Bool\n<\/pre>\n<p>tal que <code>contenidaCola c1 c2<\/code> se verifica si todos los elementos de la cola <code>c1<\/code> son elementos de la cola <code>c2<\/code>. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   \u03bb> ej1 = inserta 3 (inserta 2 vacia)\n   \u03bb> ej2 = inserta 3 (inserta 4 vacia)\n   \u03bb> ej3 = inserta 5 (inserta 2 (inserta 3 vacia))\n   \u03bb> contenidaCola ej1 ej3\n   True\n   \u03bb> contenidaCola ej2 ej3\n   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, esVacia, primero, resto)\nimport PerteneceCola (perteneceCola)\nimport Transformaciones_colas_listas (colaAlista)\nimport Test.QuickCheck\n\n-- 1\u00aa soluci\u00f3n\n-- ===========\n\ncontenidaCola1 :: Eq a => Cola a -> Cola a -> Bool\ncontenidaCola1 c1 c2\n  | esVacia c1 = True\n  | otherwise  = perteneceCola (primero c1) c2 &&\n                 contenidaCola1 (resto c1) c2\n\n-- La funci\u00f3n perteneceCola est\u00e1 definida en el ejercicio\n-- \"TAD de las colas: Pertenencia a una cola\" que se encuentra en\n-- https:\/\/bit.ly\/3RcVgqb\n\n-- 2\u00aa soluci\u00f3n\n-- ===========\n\ncontenidaCola2 :: Eq a => Cola a -> Cola a -> Bool\ncontenidaCola2 c1 c2 =\n  contenidaLista (colaAlista c1) (colaAlista c2)\n\n-- La funci\u00f3n colaAlista est\u00e1 definida en el ejercicio\n-- \"TAD de las colas: Transformaciones entre colas y listas\" que se\n-- encuentra en https:\/\/bit.ly\/3Xv0oIt\n\ncontenidaLista :: Eq a => [a] -> [a] -> Bool\ncontenidaLista xs ys =\n  all (`elem` ys) xs\n\n-- Comprobaci\u00f3n de equivalencia\n-- ============================\n\n-- La propiedad es\nprop_contenidaCola :: Cola Int -> Cola Int -> Bool\nprop_contenidaCola c1 c2 =\n  contenidaCola1 c1 c2 == contenidaCola2 c1 c2\n\n-- La comprobaci\u00f3n es\n--    \u03bb> quickCheck prop_contenidaCola\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 TypeVar\n\nfrom hypothesis import given\n\nfrom src.perteneceCola import perteneceCola\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 contenidaCola1(c1: Cola[A], c2: Cola[A]) -> bool:\n    if esVacia(c1):\n        return True\n    return perteneceCola(primero(c1), c2) and contenidaCola1(resto(c1), c2)\n\n# L funci\u00f3n perteneceCola est\u00e1 definida en el ejercicio\n# \"Pertenencia a una cola\" que se encuentra en\n# https:\/\/bit.ly\/3RcVgqb\n\n# 2\u00aa soluci\u00f3n\n# ===========\n\ndef contenidaCola2(c1: Cola[A], c2: Cola[A]) -> bool:\n    return set(colaAlista(c1)) <= set(colaAlista(c2))\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 contenidaCola3Aux(c1: Cola[A], c2: Cola[A]) -> bool:\n    if c1.esVacia():\n        return True\n    pc1 = c1.primero()\n    c1.resto()\n    return perteneceCola(pc1, c2) and contenidaCola1(c1, c2)\n\ndef contenidaCola3(c1: Cola[A], c2: Cola[A]) -> bool:\n    _c1 = deepcopy(c1)\n    return contenidaCola3Aux(_c1, c2)\n\n# 4\u00aa soluci\u00f3n\n# ===========\n\ndef contenidaCola4Aux(c1: Cola[A], c2: Cola[A]) -> bool:\n    while not c1.esVacia():\n        pc1 = c1.primero()\n        c1.resto()\n        if not perteneceCola(pc1, c2):\n            return False\n    return True\n\ndef contenidaCola4(c1: Cola[A], c2: Cola[A]) -> bool:\n    _c1 = deepcopy(c1)\n    return contenidaCola4Aux(_c1, c2)\n\n# Comprobaci\u00f3n de equivalencia de las definiciones\n# ================================================\n\n# La propiedad es\n@given(c1=colaAleatoria(), c2=colaAleatoria())\ndef test_contenidaCola(c1: Cola[int], c2: Cola[int]) -> None:\n    r = contenidaCola1(c1, c2)\n    assert contenidaCola2(c1, c2) == r\n    assert contenidaCola3(c1, c2) == r\n    assert contenidaCola4(c1, c2) == r\n\n# La comprobaci\u00f3n es\n#    src> poetry run pytest -q contenidaCola.py\n#    1 passed in 0.44s\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Utilizando el tipo abstracto de datos de las colas, definir la funci\u00f3n contenidaCola :: Eq a => Cola a -> Cola a -> Bool tal que contenidaCola c1 c2 se verifica si todos los elementos de la cola c1 son elementos de la cola c2. Por ejemplo, \u03bb> ej1 = inserta 3 (inserta 2 vacia)&#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\/7907"}],"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=7907"}],"version-history":[{"count":2,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7907\/revisions"}],"predecessor-version":[{"id":7909,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7907\/revisions\/7909"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=7907"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=7907"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=7907"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}