{"id":7823,"date":"2023-01-27T06:00:08","date_gmt":"2023-01-27T04:00:08","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=7823"},"modified":"2023-01-22T17:29:58","modified_gmt":"2023-01-22T15:29:58","slug":"27-ene-23","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/27-ene-23\/","title":{"rendered":"TAD de las pilas: Inclusi\u00f3n de pilas"},"content":{"rendered":"<p>Utilizando el <a href=\"https:\/\/bit.ly\/3GTToyK\">tipo abstracto de datos de las pilas<\/a>, definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   contenidaPila :: Eq a => Pila a -> Pila a -> Bool\n<\/pre>\n<p>tal que <code>contenidaPila p1 p2<\/code> se verifica si todos los elementos de de la pila <code>p1<\/code> son elementos de la pila <code>p2<\/code>. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   \u03bb> ej1 = apila 3 (apila 2 vacia)\n   \u03bb> ej2 = apila 3 (apila 4 vacia)\n   \u03bb> ej3 = apila 5 (apila 2 (apila 3 vacia))\n   \u03bb> contenidaPila ej1 ej3\n   True\n   \u03bb> contenidaPila 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.Pila (Pila, vacia, apila, esVacia, cima, desapila)\nimport PertenecePila (pertenecePila)\nimport Test.QuickCheck\n\n-- 1\u00aa soluci\u00f3n\n-- ===========\n\n-- Se usar\u00e1 la funci\u00f3n pertenecePila del ejercicio\n-- \"Pertenencia a una pila\" que se encuentra en\n-- https:\/\/bit.ly\/3WdM9GC\n\ncontenidaPila1 :: Eq a => Pila a -> Pila a -> Bool\ncontenidaPila1 p1 p2\n  | esVacia p1 = True\n  | otherwise  = pertenecePila cp1 p2 && contenidaPila1 dp1 p2\n  where cp1 = cima p1\n        dp1 = desapila p1\n\n-- 2\u00aa soluci\u00f3n\n-- ===========\n\ncontenidaPila2 :: Eq a => Pila a -> Pila a -> Bool\ncontenidaPila2 p1 p2 =\n  contenidaLista (pilaAlista p1) (pilaAlista p2)\n\ncontenidaLista :: Eq a => [a] -> [a] -> Bool\ncontenidaLista xs ys =\n  all (`elem` ys) xs\n\n-- (pilaALista p) es la lista formada por los elementos de la\n-- lista p. Por ejemplo,\n--    \u03bb> pilaAlista (apila 5 (apila 2 (apila 3 vacia)))\n--    [3, 2, 5]\npilaAlista :: Pila a -> [a]\npilaAlista = reverse . aux\n  where aux p | esVacia p = []\n              | otherwise = cp : aux dp\n          where cp = cima p\n                dp = desapila p\n\n-- Comprobaci\u00f3n de equivalencia\n-- ============================\n\n-- La propiedad es\nprop_contenidaPila :: Pila Int -> Pila Int -> Bool\nprop_contenidaPila p1 p2 =\n  contenidaPila1 p1 p2 == contenidaPila2 p1 p2\n\n-- La comprobaci\u00f3n es\n--    \u03bb> quickCheck prop_contenidaPila\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.pertenecePila import pertenecePila\nfrom src.TAD.pila import (Pila, apila, cima, desapila, esVacia, pilaAleatoria,\n                          vacia)\nfrom src.transformaciones_pilas_listas import pilaAlista\n\nA = TypeVar('A')\n\n# 1\u00aa soluci\u00f3n\n# ===========\n\n# Se usar\u00e1 la funci\u00f3n pertenecePila del ejercicio\n# \"Pertenencia a una pila\" que se encuentra en\n# https:\/\/bit.ly\/3WdM9GC\n\ndef contenidaPila1(p1: Pila[A], p2: Pila[A]) -> bool:\n    if esVacia(p1):\n        return True\n    cp1 = cima(p1)\n    dp1 = desapila(p1)\n    return pertenecePila(cp1, p2) and contenidaPila1(dp1, p2)\n\n# 2\u00aa soluci\u00f3n\n# ===========\n\n# Se usar\u00e1 la funci\u00f3n pilaAlista del ejercicio\n# \"Transformaciones entre pilas y listas\" que se encuentra en\n# https:\/\/bit.ly\/3ZHewQ8\n\ndef contenidaPila2(p1: Pila[A], p2: Pila[A]) -> bool:\n    return set(pilaAlista(p1)) <= set(pilaAlista(p2))\n\n# 3\u00aa soluci\u00f3n\n# ===========\n\ndef contenidaPila3Aux(p1: Pila[A], p2: Pila[A]) -> bool:\n    if p1.esVacia():\n        return True\n    cp1 = p1.cima()\n    p1.desapila()\n    return pertenecePila(cp1, p2) and contenidaPila1(p1, p2)\n\ndef contenidaPila3(p1: Pila[A], p2: Pila[A]) -> bool:\n    q = deepcopy(p1)\n    return contenidaPila3Aux(q, p2)\n\n# 4\u00aa soluci\u00f3n\n# ===========\n\ndef contenidaPila4Aux(p1: Pila[A], p2: Pila[A]) -> bool:\n    while not p1.esVacia():\n        cp1 = p1.cima()\n        p1.desapila()\n        if not pertenecePila(cp1, p2):\n            return False\n    return True\n\ndef contenidaPila4(p1: Pila[A], p2: Pila[A]) -> bool:\n    q = deepcopy(p1)\n    return contenidaPila4Aux(q, p2)\n\n# Comprobaci\u00f3n de equivalencia de las definiciones\n# ================================================\n\n# La propiedad es\n@given(p1=pilaAleatoria(), p2=pilaAleatoria())\ndef test_contenidaPila(p1: Pila[int], p2: Pila[int]) -> None:\n    r = contenidaPila1(p1, p2)\n    assert contenidaPila2(p1, p2) == r\n    assert contenidaPila3(p1, p2) == r\n    assert contenidaPila4(p1, p2) == r\n\n# La comprobaci\u00f3n es\n#    src> poetry run pytest -q contenidaPila.py\n#    1 passed in 0.40s\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Utilizando el tipo abstracto de datos de las pilas, definir la funci\u00f3n contenidaPila :: Eq a => Pila a -> Pila a -> Bool tal que contenidaPila p1 p2 se verifica si todos los elementos de de la pila p1 son elementos de la pila p2. Por ejemplo, \u03bb> ej1 = apila 3 (apila 2&#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":[586,585],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7823"}],"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=7823"}],"version-history":[{"count":3,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7823\/revisions"}],"predecessor-version":[{"id":7870,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7823\/revisions\/7870"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=7823"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=7823"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=7823"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}