{"id":767,"date":"2007-05-14T22:02:34","date_gmt":"2007-05-15T01:02:34","guid":{"rendered":"https:\/\/live.lleox.org\/?p=767"},"modified":"2022-02-15T20:07:10","modified_gmt":"2022-02-15T23:07:10","slug":"what-is-feed-mix","status":"publish","type":"post","link":"https:\/\/live.lleox.org\/2007\/what-is-feed-mix\/","title":{"rendered":"What is \u00abFeed Mix\u00bb?"},"content":{"rendered":"<div>\n<div>\n<div>\n<p>Even when generally I have good memory, one of toughtest thing for me is find a link, news or article that previously read. Mainly because I have a million of bookmarks.<\/p>\n<p>The first step to try to solve this situation was put all my frequently visited websites in my RSS reader, that&#8217;s Google Reader.<\/p>\n<p>My Google Reader&#8217;s favorite feature is the &#8230;. este lector de Feeds es que cada usuario puede compartir lo que va leyendo en un nuevo feed (atom en este caso).<\/p>\n<p>Pues mi \u00abFeed Mix\u00bb es todo aquello que voy leyendo y si tuviere un comentario lo agrego al pie, en vez de generar una nueva entrada a un blog que hace referencia a otra noticia.<\/p>\n<p>Lo que van a encontrar en mi Feed Mix es variedad de informaci\u00f3n, desde noticias de Argentina, astronomia, open source, linux, java, .net, juegos, tecnologia en general, microsoft y wireless.<\/p>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p class=\"post-excerpt\">Even when generally I have good memory, one of toughtest thing for me is find a link, news or article&#8230;<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[],"class_list":["post-767","post","type-post","status-publish","format-standard","hentry","category-blog"],"featured_image_urls_v2":{"full":"","thumbnail":"","medium":"","medium_large":"","large":"","1536x1536":"","2048x2048":"","post-thumbnail":""},"post_excerpt_stackable_v2":"<p class=\"post-excerpt\">Even when generally I have good memory, one of toughtest thing for me is find a link, news or article that previously read. Mainly because I have a million of bookmarks. The first step to try to solve this situation was put all my frequently visited websites in my RSS reader, that&#8217;s Google Reader. My Google Reader&#8217;s favorite feature is the &#8230;. este lector de Feeds es que cada usuario puede compartir lo que va leyendo en un nuevo feed (atom en este caso). Pues mi \u00abFeed Mix\u00bb es todo aquello que voy leyendo y si tuviere un comentario lo&hellip;<\/p>\n","category_list_v2":"<a href=\"https:\/\/live.lleox.org\/category\/blog\/\" rel=\"category tag\">Blog<\/a>","author_info_v2":{"name":"lleox","url":"https:\/\/live.lleox.org\/author\/lleox\/"},"comments_num_v2":"0 comentarios","_links":{"self":[{"href":"https:\/\/live.lleox.org\/wp-json\/wp\/v2\/posts\/767","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/live.lleox.org\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/live.lleox.org\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/live.lleox.org\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/live.lleox.org\/wp-json\/wp\/v2\/comments?post=767"}],"version-history":[{"count":0,"href":"https:\/\/live.lleox.org\/wp-json\/wp\/v2\/posts\/767\/revisions"}],"wp:attachment":[{"href":"https:\/\/live.lleox.org\/wp-json\/wp\/v2\/media?parent=767"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/live.lleox.org\/wp-json\/wp\/v2\/categories?post=767"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/live.lleox.org\/wp-json\/wp\/v2\/tags?post=767"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}