{"id":232909,"date":"2023-01-31T13:28:00","date_gmt":"2023-01-31T10:28:00","guid":{"rendered":"https:\/\/wordpress.mediadoma.com\/?p=232909"},"modified":"2023-02-07T13:08:36","modified_gmt":"2023-02-07T10:08:36","slug":"como-listar-os-posts-mais-votados-em-um-ano-usando-sql","status":"publish","type":"post","link":"https:\/\/wordpress.mediadoma.com\/pt-pt\/como-listar-os-posts-mais-votados-em-um-ano-usando-sql\/","title":{"rendered":"Como listar os posts mais votados em um ano usando SQL?"},"content":{"rendered":"\n<p><a href=\"https:\/\/helloacm.com\/how-to-get-popular-posts-of-the-year-using-sql-2015\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Neste post<\/a>, aprendemos como usar o SQL para listar as postagens mais populares (de acordo com o n\u00famero de coment\u00e1rios de cada postagem). Nesta postagem, obteremos algumas estat\u00edsticas b\u00e1sicas para as postagens em 2016 e tamb\u00e9m aprenderemos as 10 principais postagens classificadas pelas vota\u00e7\u00f5es.<\/p>\n<h2>N\u00famero total de postagens<\/h2>\n<p>Com base neste <a href=\"https:\/\/wordpress.mediadoma.com\/pt-pt\/como-imprimir-o-resumo-da-tabela-mysql-usando-php\/\" title=\"SQL\">SQL<\/a> :<\/p>\n<pre><code>SELECT \n\u00a0 count(1) \nFROM \n\u00a0 wp_posts\nWHERE \n\u00a0 post_type = \"post\" and \n\u00a0 post_status = \"publish\" and \n\u00a0 date_format(post_date_gmt, \"%Y\") = \"2016\"<\/code><\/pre>\n<p>Sabemos que h\u00e1 245 posts publicados em 2016.<\/p>\n<pre><code>+----------+\n| count(1) |\n+----------+\n| \u00a0 \u00a0 \u00a0245 |\n+----------+\n1 row in set (0.01 sec)<\/code><\/pre>\n<h2>Principais postagens mais discutidas<\/h2>\n<p><a href=\"https:\/\/helloacm.com\/how-to-get-popular-posts-of-the-year-using-sql-2015\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">E com base no SQL<\/a>, temos os posts mais comentados deste ano, ou seja, 2016.<\/p>\n<pre><code>SELECT \n\u00a0 post_name, post_title \nFROM \n\u00a0 wp_posts \nWHERE \n\u00a0 post_type = 'post' and \n\u00a0 post_status = 'publish' and\n\u00a0 date_format(post_date_gmt, \"%Y\") = '2016' \nORDER BY\n\u00a0comment_count DESC \nLIMIT 10<\/code><\/pre>\n<p>Conhecemos as 10 postagens mais discutidas (como as mais populares) em 2016. Altere o <strong>limite de 10<\/strong> para permitir que mais postagens sejam exibidas, por exemplo, limite de 20.<\/p>\n<pre><code>+--------------------------------------------------------------------------------+------------------------------------------------------------------------+\n| post_name \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0| post_title \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 |\n+--------------------------------------------------------------------------------+------------------------------------------------------------------------+\n| cc-coding-exercise-convert-a-number-to-hexadecimal \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 | C\/C++ Coding Exercise - Convert a Number to Hexadecimal? \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 |\n| dynamic-programming-how-many-ways-to-connect-the-pipes \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 | Dynamic Programming - How many ways to connect the pipes? \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0|\n| when-xx-evaluates-to-false-in-cc \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 | When x==x Evaluates to FALSE in C\/C++? \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 |\n| how-to-compute-sum-of-two-integers-without-plus-and-minus-operators \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0| How to Compute Sum of Two Integers without Plus+ and Minus- Operators? |\n| how-to-find-intersection-of-two-arrays-in-c \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0| How to Find Intersection of Two Arrays in C++? \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 |\n| bit-manipulation-how-to-set-all-bits-between-i-and-j-in-n-equal-to-m-cplusplus | Bit Manipulation: How to Set All Bits Between i and j in N equal to M? |\n| how-to-check-valid-anagram-in-cc \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 | How to Check Valid Anagram in C\/C++? \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 |\n| c-coding-exercise-number-of-1-bits-revisited \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 | C++ Coding Exercise - Number of 1 Bits (Revisited) \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 |\n| dynamic-programming-integer-break \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0| Dynamic Programming - Integer Break \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0|\n| cc-coding-exercise-find-the-duplicate-number \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 | C\/C++ Coding Exercise - Find the Duplicate Number \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0|\n+--------------------------------------------------------------------------------+------------------------------------------------------------------------+\n10 rows in set (0.01 sec)<\/code><\/pre>\n<p>Estes s\u00e3o (no momento da reda\u00e7\u00e3o):<\/p>\n<ol>\n<li><a href=\"https:\/\/helloacm.com\/cc-coding-exercise-convert-a-number-to-hexadecimal\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Exerc\u00edcio de codifica\u00e7\u00e3o C\/C++ \u2013 Converter um n\u00famero para hexadecimal?<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/dynamic-programming-how-many-ways-to-connect-the-pipes\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Programa\u00e7\u00e3o Din\u00e2mica \u2013 Quantas maneiras de conectar os tubos?<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/when-xx-evaluates-to-false-in-cc\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Quando x==x \u00e9 avaliado como FALSE em C\/C++?<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/how-to-compute-sum-of-two-integers-without-plus-and-minus-operators\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Como calcular a soma de dois inteiros sem operadores Plus+ e Minus-?<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/how-to-find-intersection-of-two-arrays-in-c\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Como encontrar a interse\u00e7\u00e3o de dois arrays em C++?<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/bit-manipulation-how-to-set-all-bits-between-i-and-j-in-n-equal-to-m-cplusplus\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Manipula\u00e7\u00e3o de bits: como definir todos os bits entre i e j em N igual a M?<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/how-to-check-valid-anagram-in-cc\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Como verificar o anagrama v\u00e1lido em C\/C++?<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/c-coding-exercise-number-of-1-bits-revisited\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Exerc\u00edcio de codifica\u00e7\u00e3o C++ &#8211; N\u00famero de 1 bits (revisitado)<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/dynamic-programming-integer-break\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Programa\u00e7\u00e3o Din\u00e2mica &#8211; Interrup\u00e7\u00e3o de inteiros<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/cc-coding-exercise-find-the-duplicate-number\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Exerc\u00edcio de codifica\u00e7\u00e3o C\/C++ \u2013 Encontre o n\u00famero duplicado<\/a><\/li>\n<\/ol>\n<h2>Postagens mais votadas via SQL<\/h2>\n<p>Agora, podemos combinar as estat\u00edsticas de vota\u00e7\u00e3o do <a href=\"https:\/\/wordpress.mediadoma.com\/pt-pt\/plugin-gd-star-rating-nao-esta-funcionando-corretamente-se-cloudflare-estiver-ativado\/\" title=\"GD Star Rating\">GD Star Rating<\/a> Plugin e obter outras classifica\u00e7\u00f5es interessantes.<\/p>\n<pre><code>SELECT \n\u00a0 \u00a0`p`.`ID`, \n\u00a0 \u00a0`p`.`post_title` as `title`, \n\u00a0 \u00a0`visitor_votes` + `user_votes` as `total_votes`, \n\u00a0 \u00a0`visitor_votes`, \n\u00a0 \u00a0`user_votes` \u00a0\nFROM \u00a0\n\u00a0 `wp_gdsr_data_article` as `da` \nINNER JOIN \n\u00a0 `wp_posts` as `p` ON `da`.`post_id` = `p`.`ID` \nWHERE\n\u00a0 `p`.post_type = 'post' and \n\u00a0 `p`.post_status = 'publish' and \u00a0\n\u00a0 date_format(`p`.`post_date_gmt`, \"%Y\") = '2016'\nHAVING\n\u00a0 `total_votes` &gt; 0\nORDER BY\n\u00a0 `total_votes` desc \nLIMIT 10<\/code><\/pre>\n<p>Isso d\u00e1 os seguintes 10 posts mais votados do ano:<\/p>\n<pre><code>+------+----------------------------------------------------------------------------+-------------+---------------+------------+\n| ID \u00a0 | title \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0| total_votes | visitor_votes | user_votes |\n+------+----------------------------------------------------------------------------+-------------+---------------+------------+\n| 4793 | When x==x Evaluates to FALSE in C\/C++? \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 | \u00a0 \u00a0 \u00a0 105.0 | \u00a0 \u00a0 \u00a0 \u00a0 \u00a095.0 | \u00a0 \u00a0 \u00a0 10.0 |\n| 4679 | How to Find the Maximum of Two Integers without Using Comparison Operator? | \u00a0 \u00a0 \u00a0 \u00a081.0 | \u00a0 \u00a0 \u00a0 \u00a0 \u00a081.0 | \u00a0 \u00a0 \u00a0 \u00a00.0 |\n| 4191 | How to Delete a Node from a Binary Search Tree? \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0| \u00a0 \u00a0 \u00a0 \u00a068.0 | \u00a0 \u00a0 \u00a0 \u00a0 \u00a058.0 | \u00a0 \u00a0 \u00a0 10.0 |\n| 4380 | C++ Coding Exercise: How to Check if a Large Integer is divisible by 11? \u00a0 | \u00a0 \u00a0 \u00a0 \u00a067.0 | \u00a0 \u00a0 \u00a0 \u00a0 \u00a057.0 | \u00a0 \u00a0 \u00a0 10.0 |\n| 4329 | Microsoft Interview Question - Get the Area of the Triangle \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0| \u00a0 \u00a0 \u00a0 \u00a066.0 | \u00a0 \u00a0 \u00a0 \u00a0 \u00a066.0 | \u00a0 \u00a0 \u00a0 \u00a00.0 |\n| 4740 | PPAP in C++ and Javascript for Beginner \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0| \u00a0 \u00a0 \u00a0 \u00a062.0 | \u00a0 \u00a0 \u00a0 \u00a0 \u00a052.0 | \u00a0 \u00a0 \u00a0 10.0 |\n| 4166 | How to Invert a Binary Tree in C\/C++? \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0| \u00a0 \u00a0 \u00a0 \u00a048.0 | \u00a0 \u00a0 \u00a0 \u00a0 \u00a048.0 | \u00a0 \u00a0 \u00a0 \u00a00.0 |\n| 4176 | How to Reverse Bits for 32-bit Unsigned Integer in C\/C++? \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0| \u00a0 \u00a0 \u00a0 \u00a046.0 | \u00a0 \u00a0 \u00a0 \u00a0 \u00a046.0 | \u00a0 \u00a0 \u00a0 \u00a00.0 |\n| 4178 | C++ Coding Exercise - How to Find First Missing Number? \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0| \u00a0 \u00a0 \u00a0 \u00a040.0 | \u00a0 \u00a0 \u00a0 \u00a0 \u00a040.0 | \u00a0 \u00a0 \u00a0 \u00a00.0 |\n| 4227 | Dynamic Programming - Integer Break \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0| \u00a0 \u00a0 \u00a0 \u00a031.0 | \u00a0 \u00a0 \u00a0 \u00a0 \u00a031.0 | \u00a0 \u00a0 \u00a0 \u00a00.0 |\n+------+----------------------------------------------------------------------------+-------------+---------------+------------+\n10 rows in set (0.01 sec)<\/code><\/pre>\n<ol>\n<li><a href=\"https:\/\/helloacm.com\/when-xx-evaluates-to-false-in-cc\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Quando x==x \u00e9 avaliado como FALSE em C\/C++?<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/how-to-find-the-maximum-of-two-integers-without-using-comparison-operator\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Como encontrar o m\u00e1ximo de dois inteiros sem usar o operador de compara\u00e7\u00e3o?<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/how-to-delete-a-node-from-a-binary-search-tree\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Como excluir um n\u00f3 de uma \u00e1rvore de pesquisa bin\u00e1ria?<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/c-coding-exercise-how-to-check-if-a-large-integer-is-divisible-by-11\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Exerc\u00edcio de codifica\u00e7\u00e3o C++: como verificar se um n\u00famero inteiro grande \u00e9 divis\u00edvel por 11?<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/microsoft-interview-question-get-the-area-of-the-triangle\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Pergunta da entrevista da Microsoft \u2013 Obtenha a \u00e1rea do tri\u00e2ngulo<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/ppap-in-cpp-and-javascript-for-beginner\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">PPAP em C++ e Javascript para Iniciantes<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/how-to-invert-a-binary-tree-in-cc\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Como inverter uma \u00e1rvore bin\u00e1ria em C\/C++?<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/how-to-reverse-bits-for-32-bit-unsigned-integer-in-cc\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Como reverter bits para inteiro n\u00e3o assinado de 32 bits em C\/C++?<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/c-coding-exercise-how-to-find-first-missing-number\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Exerc\u00edcio de codifica\u00e7\u00e3o C++ \u2013 Como encontrar o primeiro n\u00famero ausente?<\/a><\/li>\n<li><a href=\"https:\/\/helloacm.com\/dynamic-programming-integer-break\/\" target=\"_blank\" rel=\"noopener nofollow\" class=\"external external_icon\">Programa\u00e7\u00e3o Din\u00e2mica &#8211; Interrup\u00e7\u00e3o de inteiros<\/a><\/li>\n<\/ol>\n<p>Claro, voc\u00ea pode modificar as duas <a href=\"https:\/\/wordpress.mediadoma.com\/pt-pt\/como-armazenar-em-cache-operacoes-pesadas-como-consultas-de-banco-de-dados-em-php\/\" title=\"consultas SQL\">consultas SQL<\/a> acima para que d\u00ea 12 posts, ou seja, um melhor para cada m\u00eas. Voc\u00ea s\u00f3 precisa agrupar por m\u00eas assim:<\/p>\n<pre><code>GROUP BY date_format(`p`.post_date_gmt, \"%M\")<\/code><\/pre>\n<p>E, tamb\u00e9m, voc\u00ea pode criar uma <a href=\"https:\/\/wordpress.mediadoma.com\/pt-pt\/como-criar-uma-pagina-de-arquivos-resumo-para-todas-as-postagens-paginas-do-wordpress-usando-php\/\" title=\"p\u00e1gina PHP\">p\u00e1gina PHP<\/a> que forne\u00e7a as tabelas de classifica\u00e7\u00e3o mais atualizadas para os posts, mas o que foi mostrado aqui \u00e9 est\u00e1tico, ou seja, a tabela de classifica\u00e7\u00e3o \u00e9 gerada como \u00e9 hoje.<\/p>\n<p>SQL<\/p>\n<p><div id=\"PostUnique_PostSource\" style=\"padding-top: 50px\">Fonte de grava\u00e7\u00e3o:  <a target=\"_blank\" rel=\"noopener nofollow\" href=\"\/\/helloacm.com\" class=\"external external_icon\">helloacm.com<\/a><\/div><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Como listar os posts mais votados em um ano usando SQL?<\/p>\n","protected":false},"author":1,"featured_media":224083,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":"","_wp_rev_ctl_limit":""},"categories":[898,837,998,920,806,846,867],"tags":[1170],"class_list":["post-232909","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-codigo-2","category-guia-para-iniciantes","category-marketing-de-conteudo","category-outro","category-php-8","category-tutoriais","category-wordpress-8","tag-affiai-pt-pt"],"_links":{"self":[{"href":"https:\/\/wordpress.mediadoma.com\/pt-pt\/wp-json\/wp\/v2\/posts\/232909","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wordpress.mediadoma.com\/pt-pt\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/wordpress.mediadoma.com\/pt-pt\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/wordpress.mediadoma.com\/pt-pt\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/wordpress.mediadoma.com\/pt-pt\/wp-json\/wp\/v2\/comments?post=232909"}],"version-history":[{"count":0,"href":"https:\/\/wordpress.mediadoma.com\/pt-pt\/wp-json\/wp\/v2\/posts\/232909\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/wordpress.mediadoma.com\/pt-pt\/wp-json\/wp\/v2\/media\/224083"}],"wp:attachment":[{"href":"https:\/\/wordpress.mediadoma.com\/pt-pt\/wp-json\/wp\/v2\/media?parent=232909"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/wordpress.mediadoma.com\/pt-pt\/wp-json\/wp\/v2\/categories?post=232909"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/wordpress.mediadoma.com\/pt-pt\/wp-json\/wp\/v2\/tags?post=232909"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}