{"id":7912,"date":"2023-02-23T06:00:07","date_gmt":"2023-02-23T04:00:07","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=7912"},"modified":"2023-01-27T18:39:19","modified_gmt":"2023-01-27T16:39:19","slug":"23-feb-23","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/23-feb-23\/","title":{"rendered":"TAD de las colas: Reconocimiento de subcolas"},"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   subCola :: Eq a => Cola a -> Cola a -> Bool\n<\/pre>\n<p>tal que <code>subCola c1 c2<\/code> se verifica si <code>c1<\/code> es una subcola de <code>c2<\/code>. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   \u03bb> ej1 = inserta 2 (inserta 3 vacia)\n   \u03bb> ej2 = inserta 7 (inserta 2 (inserta 3 (inserta 5 vacia)))\n   \u03bb> ej3 = inserta 2 (inserta 7 (inserta 3 (inserta 5 vacia)))\n   \u03bb> subCola ej1 ej2\n   True\n   \u03bb> subCola ej1 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 Transformaciones_colas_listas (colaAlista)\nimport PrefijoCola (prefijoCola)\nimport Data.List (isPrefixOf, tails)\nimport Test.QuickCheck\n\n-- 1\u00aa soluci\u00f3n\n-- ===========\n\nsubCola1 :: Eq a => Cola a -> Cola a -> Bool\nsubCola1 c1 c2\n    | esVacia c1 = True\n    | esVacia c2 = False\n    | pc1 == pc2 = prefijoCola rc1 rc2 || subCola1 c1 rc2\n    | otherwise  = subCola1 c1 rc2\n    where pc1 = primero c1\n          rc1 = resto c1\n          pc2 = primero c2\n          rc2 = resto c2\n\n-- La funci\u00f3n PrefijoCola est\u00e1 definida en el ejercicio\n-- \"Reconocimiento de prefijos de colas\" que se encuentra en\n-- https:\/\/bit.ly\/3HaK20x\n\n-- 2\u00aa soluci\u00f3n\n-- ===========\n\nsubCola2 :: Eq a => Cola a -> Cola a -> Bool\nsubCola2 c1 c2 =\n  sublista (colaAlista c1) (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-- (sublista xs ys) se verifica si xs es una sublista de ys. Por\n-- ejemplo,\n--    sublista [3,2] [5,3,2,7]  ==  True\n--    sublista [3,2] [5,3,7,2]  ==  False\nsublista :: Eq a => [a] -> [a] -> Bool\nsublista xs ys =\n  any (xs `isPrefixOf`) (tails ys)\n\n-- Comprobaci\u00f3n de equivalencia\n-- ============================\n\n-- La propiedad es\nprop_subCola :: Cola Int -> Cola Int -> Bool\nprop_subCola c1 c2 =\n  subCola1 c1 c2 == subCola2 c1 c2\n\n-- La comprobaci\u00f3n es\n--    \u03bb> quickCheck prop_subCola\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.prefijoCola import prefijoCola\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 subCola1(c1: Cola[A], c2: Cola[A]) -> bool:\n    if esVacia(c1):\n        return True\n    if esVacia(c2):\n        return False\n    pc1 = primero(c1)\n    rc1 = resto(c1)\n    pc2 = primero(c2)\n    rc2 = resto(c2)\n    if pc1 == pc2:\n        return prefijoCola(rc1, rc2) or subCola1(c1, rc2)\n    return subCola1(c1, rc2)\n\n# La funci\u00f3n prefijoCola est\u00e1 definida en el ejercicio\n# \"Reconocimiento de prefijos de colas\" que se encuentra en\n# https:\/\/bit.ly\/3HaK20x\n\n# 2\u00aa soluci\u00f3n\n# ===========\n\n# sublista(xs, ys) se verifica si xs es una sublista de ys. Por\n# ejemplo,\n#    >>> sublista([3,2], [5,3,2,7])\n#    True\n#    >>> sublista([3,2], [5,3,7,2])\n#    False\ndef sublista(xs: list[A], ys: list[A]) -> bool:\n    return any(xs == ys[i:i+len(xs)] for i in range(len(ys) - len(xs) + 1))\n\ndef subCola2(c1: Cola[A], c2: Cola[A]) -> bool:\n    return sublista(colaAlista(c1), 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 subCola3Aux(c1: Cola[A], c2: Cola[A]) -> bool:\n    if c1.esVacia():\n        return True\n    if c2.esVacia():\n        return False\n    if c1.primero() != c2.primero():\n        c2.resto()\n        return subCola3Aux(c1, c2)\n    q1 = deepcopy(c1)\n    c1.resto()\n    c2.resto()\n    return prefijoCola(c1, c2) or subCola3Aux(q1, c2)\n\ndef subCola3(c1: Cola[A], c2: Cola[A]) -> bool:\n    q1 = deepcopy(c1)\n    q2 = deepcopy(c2)\n    return subCola3Aux(q1, q2)\n\n# Comprobaci\u00f3n de equivalencia de las definiciones\n# ================================================\n\n# La propiedad es\n@given(c1=colaAleatoria(), c2=colaAleatoria())\ndef test_subCola(c1: Cola[int], c2: Cola[int]) -> None:\n    r = subCola1(c1, c2)\n    assert subCola2(c1, c2) == r\n    assert subCola3(c1, c2) == r\n\n# La comprobaci\u00f3n es\n#    src> poetry run pytest -q subCola.py\n#    1 passed in 0.31s\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Utilizando el tipo abstracto de datos de las colas, definir la funci\u00f3n subCola :: Eq a => Cola a -> Cola a -> Bool tal que subCola c1 c2 se verifica si c1 es una subcola de c2. Por ejemplo, \u03bb> ej1 = inserta 2 (inserta 3 vacia) \u03bb> ej2 = inserta 7 (inserta 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":[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\/7912"}],"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=7912"}],"version-history":[{"count":2,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7912\/revisions"}],"predecessor-version":[{"id":7914,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7912\/revisions\/7914"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=7912"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=7912"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=7912"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}