{"id":54389,"date":"2019-12-25T00:00:00","date_gmt":"2019-12-24T21:00:00","guid":{"rendered":"https:\/\/prohoster.info\/blog\/blog_prohoster\/indeksiruemoe-binarnoe-derevo"},"modified":"2020-02-18T14:02:23","modified_gmt":"2020-02-18T11:02:23","slug":"indeksiruemoe-binarnoe-derevo","status":"publish","type":"post","link":"https:\/\/prohoster.info\/hr\/blog\/administrirovanie\/indeksiruemoe-binarnoe-derevo","title":{"rendered":"Indeksirano binarno stablo","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"<p><img decoding=\"async\" alt=\"Indeksirano binarno stablo\" src=\"\/wp-content\/uploads\/2019\/12\/8ceb987e007db02de04d29f33185e8ec.jpg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p>Nai\u0161la sam na zadatak sljede\u0107e vrste. Potrebno je implementirati kontejner za pohranu podataka koji omogu\u0107ava sljede\u0107u funkcionalnost: <\/p>\n<p><\/p>\n<ul>\n<li>dodati novi element<\/li>\n<li>ukloniti element prema rednom broju<\/li>\n<li>dobiti element prema rednom broju<\/li>\n<li>podaci se pohranjuju u sortiranom obliku<\/li>\n<\/ul>\n<p><noindex><a rel=\"nofollow\" name=\"habracut\"><\/a><\/noindex><\/p>\n<p>Podaci se stalno dodaju i uklanjaju, struktura mora osigurati brzo vrijeme obrade. Najprije sam poku\u0161ala implementirati ne\u0161to koriste\u0107i standardne kontejnere iz <strong>std<\/strong>. Ovaj put nije bio uspje\u0161an, a spoznaja je do\u0161la da moram implementirati ne\u0161to sama. Jedina ideja koja mi je pala na pamet bila je kori\u0161tenje binarnog stabla pretra\u017eivanja. Budu\u0107i da zadovoljava zahtjev za brzim dodavanjem, uklanjanjem i pohranjivanjem podataka u sortiranom obliku. Ostalo je samo smisliti kako indeksirati sve elemente i recalculirati indekse kada se stablo mijenja.<\/p>\n<p><\/p>\n<pre><code class=\"cpp\">struct node_s {    \n    data_t data;\n\n    uint64_t weight; \/\/ te\u017eina \u010dvora\n\n    node_t *left;\n    node_t *right;\n\n    node_t *parent;\n};<\/code><\/pre>\n<p><\/p>\n<p>U \u010dlanku \u0107e biti vi\u0161e slika i teorije nego koda. Kod mo\u017eete pogledati na linku ispod.<\/p>\n<p><\/p>\n<h2 id=\"ves\">Te\u017eina<\/h2>\n<p><\/p>\n<p>U tu svrhu stablo je podvrgnuto maloj modifikaciji, dodane su dodatne informacije o <strong>te\u017eini<\/strong> \u010dvora. Te\u017eina \u010dvora je <strong>broj potomaka ovog \u010dvora<\/strong> + <strong>1<\/strong> (te\u017eina jedini\u010dnog elementa).<\/p>\n<p><\/p>\n<p>Funkcija za dobivanje te\u017eine \u010dvora:<\/p>\n<p><\/p>\n<pre><code class=\"cpp\">uint64_t bntree::get_child_weight(node_t *node) {\n    if (node) {\n        return node-&gt;weight;\n    }\n\n    return 0;\n}<\/code><\/pre>\n<p><\/p>\n<p>Za list odgovaraju\u0107e te\u017eina iznosi <strong>0<\/strong>.<\/p>\n<p><\/p>\n<p>Nakon toga prelazimo na vizualno predstavljanje primjera takvog stabla. <strong>Crnom<\/strong> bojom bit \u0107e prikazan klju\u010d \u010dvora (vrijednost ne\u0107e biti prikazana, jer za to nema potrebe), <strong>crvenom<\/strong> \u2014 te\u017eina \u010dvora, <strong>zelenom<\/strong> \u2014 indeks \u010dvora.<\/p>\n<p><\/p>\n<p>Kada je stablo prazno, njegova te\u017eina iznosi 0. Dodajmo mu korijenski element:<\/p>\n<p>\n<img decoding=\"async\" alt=\"Indeksirano binarno stablo\" src=\"\/wp-content\/uploads\/2019\/12\/2d4145039daee26582910556a40d2a5c.jpg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p>Te\u017eina stabla postaje 1, te\u017eina korijenskog elementa 1. Te\u017eina korijenskog elementa je te\u017eina stabla.<\/p>\n<p><\/p>\n<p>Dodajmo jo\u0161 nekoliko elemenata:<\/p>\n<p>\n<img decoding=\"async\" alt=\"Indeksirano binarno stablo\" src=\"\/wp-content\/uploads\/2019\/12\/803cc4a65aa3d8a2fcb20fe325351cfa.jpg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<img decoding=\"async\" alt=\"Indeksirano binarno stablo\" src=\"\/wp-content\/uploads\/2019\/12\/0aa12f41b822b4bb1e9fadb7564dc461.jpg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<img decoding=\"async\" alt=\"Indeksirano binarno stablo\" src=\"\/wp-content\/uploads\/2019\/12\/8566df9404037e92f53b315bc3304016.jpg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<img decoding=\"async\" alt=\"Indeksirano binarno stablo\" src=\"\/wp-content\/uploads\/2019\/12\/1847e6ddffdb28d0a6d9a4949ebb5f80.jpg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p>Svaki put kada se dodaje novi element, silazimo niz \u010dvorove i pove\u0107avamo broja\u010d te\u017eine svakog \u010dvora kroz koji prolazimo. Kada se stvori novi \u010dvor, dodjeljuje mu se te\u017eina <strong>1<\/strong>. Ako \u010dvor s tim klju\u010dem ve\u0107 postoji, prepisujemo vrijednost i vra\u0107amo se prema korijenu poni\u0161tavaju\u0107i promjene te\u017eina svih \u010dvorova kroz koje smo pro\u0161li.<br \/>\nAko se vr\u0161i brisanje \u010dvora, silazimo dolje i smanjujemo te\u017eine proku\u0161anih \u010dvorova. <\/p>\n<p><\/p>\n<h2 id=\"indeksy\">Indeksi<\/h2>\n<p><\/p>\n<p>Sada pre\u0111imo na to kako indeksirati \u010dvorove. \u010cvorovi o\u010digledno ne \u010duvaju svoj indeks, on se izra\u010dunava na osnovu te\u017eine \u010dvorova. Da \u010duvaju svoj indeks, bilo bi potrebno <strong>O(n)<\/strong> vremena da se a\u017euriraju indeksi svih \u010dvorova nakon svake promene drveta.<br \/>\nPre\u0111imo na vizualni prikaz. Na\u0161e drvo je prazno, dodajmo mu prvi \u010dvor:<\/p>\n<p>\n<img decoding=\"async\" alt=\"Indeksirano binarno stablo\" src=\"\/wp-content\/uploads\/2019\/12\/8a3b176f318cd077b1cf50ddf232e0da.jpg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p>Prvi \u010dvor ima indeks <strong>0<\/strong>, a sada su mogu\u0107a dva slu\u010daja. U prvom se indeks korenskog elementa menja, u drugom ne menja.<\/p>\n<p>\n<img decoding=\"async\" alt=\"Indeksirano binarno stablo\" src=\"\/wp-content\/uploads\/2019\/12\/cb863be8f42385d3bbb2f46700a8cff3.jpg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p>Kod korena levi podstablo ima te\u017einu 1.<\/p>\n<p><\/p>\n<p>Drugi slu\u010daj:<\/p>\n<p>\n<img decoding=\"async\" alt=\"Indeksirano binarno stablo\" src=\"\/wp-content\/uploads\/2019\/12\/35eec59a81fc8b056c7e91daa3ee508e.jpg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p>Indeks korena se nije promenio, jer je te\u017eina njegovog levog podstabla ostala 0.<\/p>\n<p><\/p>\n<p>Kako se ra\u010duna indeks \u010dvora, to je te\u017eina njegovog levog podstabla + broj prenet od roditelja. \u0160ta je to za broj? To je broja\u010d indeksa, u po\u010detku je jednak <strong>0<\/strong>, jer koren nema roditelja. Sve dalje zavisi od toga da li se spu\u0161tamo levom detetu ili desnom. Ako se spu\u0161tamo levom, broja\u010du se ni\u0161ta ne dodaje. Ako se spu\u0161tamo desnom, onda dodajemo indeks trenutnog \u010dvora.<\/p>\n<p>\n<img decoding=\"async\" alt=\"Indeksirano binarno stablo\" src=\"\/wp-content\/uploads\/2019\/12\/d328174370ef52c646d8689cce977302.jpg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p>Na primjer, kako se izra\u010dunava indeks elementa s klju\u010dem 8 (desno dijete korijena). To je \"Indeks korijena\" + \"te\u017eina lijevog podstabla \u010dvora s klju\u010dem 8\" + \"1\" == 3 + 2 + 1 == <strong>6<\/strong><br \/>\nIndeks elementa s klju\u010dem 6 bit \u0107e \"Indeks korijena\" + 1 == 3 + 1 == <strong>4<\/strong><\/p>\n<p><\/p>\n<p>Shodno tome, da bismo dobili, obrisali element po indeksu potrebno je vreme <strong>O(log n)<\/strong>, budu\u0107i da da bismo dobili potrebni element prvo moramo da ga prona\u0111emo (da se spustimo od korena do tog elementa).<\/p>\n<p><\/p>\n<h2 id=\"glubina\">Dubina<\/h2>\n<p><\/p>\n<p>Na osnovu te\u017eine tako\u0111e se mo\u017ee izra\u010dunati i dubina drveta. Potrebna za balansiranje.<br \/>\nZa to treba zaokru\u017eiti te\u017einu trenutnog \u010dvora na prvo broj u stepeni 2 koje je ve\u0107e ili jednako datoj te\u017eini i uzeti od njega binarni logaritam. Tako \u0107emo dobiti dubinu drveta, pod uslovom da je izbalansirano. Drvo se balansira nakon umetanja novog elementa. Teoriju o tome kako balansirati drve\u0107e ne\u0107u navoditi. U izvoru koda predstavljena je funkcija balansiranja.<\/p>\n<p><\/p>\n<p>Kod za prevo\u0111enje te\u017eine u dubinu.<\/p>\n<p><\/p>\n<pre><code class=\"cpp\">\/*\n * \u0412\u043e\u0437\u0432\u0440\u0430\u0449\u0430\u0435\u0442 \u043f\u0435\u0440\u0432\u043e\u0435 \u0447\u0438\u0441\u043b\u043e \u0432 \u0441\u0442\u0435\u043f\u0435\u043d\u0438 2, \u043a\u043e\u0442\u043e\u0440\u043e\u0435 \u0431\u043e\u043b\u044c\u0448\u0435 \u0438\u043b\u0438 \u0440\u043e\u0432\u043d\u043e x\n *\/\nuint64_t bntree::cpl2(uint64_t x) {\n    x = x - 1;\n    x = x | (x &gt;&gt; 1);\n    x = x | (x &gt;&gt; 2);\n    x = x | (x &gt;&gt; 4);\n    x = x | (x &gt;&gt; 8);\n    x = x | (x &gt;&gt; 16);\n    x = x | (x &gt;&gt; 32);\n\n    return x + 1;\n}\n\n\/*\n * \u0414\u0432\u043e\u0438\u0447\u043d\u044b\u0439 \u043b\u043e\u0433\u0430\u0440\u0438\u0444\u043c \u043e\u0442 \u0447\u0438\u0441\u043b\u0430\n *\/\nlong bntree::ilog2(long d) {\n    int result;\n    std::frexp(d, &amp;result);\n    return result - 1;\n}\n\n\/*\n * \u0412\u0435\u0441 \u043a \u0433\u043b\u0443\u0431\u0438\u043d\u0435\n *\/\nuint64_t bntree::weight_to_depth(node_t *p) {\n    if (p == NULL) {\n        return 0;\n    }\n\n    if (p-&gt;weight == 1) {\n        return 1;\n    } else if (p-&gt;weight == 2) {\n        return 2;\n    }\n\n    return this-&gt;ilog2(this-&gt;cpl2(p-&gt;weight));\n}<\/code><\/pre>\n<p><\/p>\n<h2 id=\"itogi\">Zaklju\u010dci<\/h2>\n<p><\/p>\n<ul>\n<li>Umetanje novog elementa de\u0161ava se za <strong>O(log n)<\/strong><\/li>\n<li>Brisanje elementa po redoslednom broju de\u0161ava se za <strong>O(log n)<\/strong><\/li>\n<li>Dobijanje elementa po redoslednom broju de\u0161ava se za <strong>O(log n)<\/strong><\/li>\n<\/ul>\n<p><\/p>\n<p>Brzina <strong>O(log n)<\/strong> pla\u0107amo za to \u0161to su svi podaci pohranjeni u sortiranom obliku. <\/p>\n<p><\/p>\n<p>Gdje bi takva struktura mogla biti korisna \u2014 ne znam. Samo zadatak da se jo\u0161 jednom razjasni kako rade stabla. Hvala na pa\u017enji.<\/p>\n<p><\/p>\n<h2 id=\"ssylki\">Linkovi<\/h2>\n<p><\/p>\n<ul>\n<li><noindex><a rel=\"nofollow\" href=\"https:\/\/github.com\/dvjdjvu\/bntree\">Izvorni kod stabla<\/a><\/noindex><\/li>\n<\/ul>\n<p><\/p>\n<p>U projektu se nalaze testni podaci za provjeru brzine rada. Stablo se popunjava <strong>1000000<\/strong> elemenata. Dogodila se sekvencijalna brisanja, umetanja i dohva\u0107anja elemenata <strong>1000000<\/strong> puta. Dakle, <strong>3000000<\/strong> operacija. Rezultat je bio prili\u010dno dobar ~ 8 sekundi.<\/p>\n<p>Izvor: <a content=\"nofollow\" rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/post\/481372\/\">habr.com<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"<p>\u041f\u043e\u043f\u0430\u043b\u0430\u0441\u044c \u043c\u043d\u0435 \u0437\u0430\u0434\u0430\u0447\u0430 \u0441\u043b\u0435\u0434\u0443\u044e\u0449\u0435\u0433\u043e \u0432\u0438\u0434\u0430. \u041d\u0435\u043e\u0431\u0445\u043e\u0434\u0438\u043c\u043e \u0440\u0435\u0430\u043b\u0438\u0437\u043e\u0432\u0430\u0442\u044c \u043a\u043e\u043d\u0442\u0435\u0439\u043d\u0435\u0440 \u0445\u0440\u0430\u043d\u0435\u043d\u0438\u044f \u0434\u0430\u043d\u043d\u044b\u0445 \u043e\u0431\u0435\u0441\u043f\u0435\u0447\u0438\u0432\u0430\u044e\u0449\u0438\u0439 \u0441\u043b\u0435\u0434\u0443\u044e\u0449\u0438\u0439 \u0444\u0443\u043d\u043a\u0446\u0438\u043e\u043d\u0430\u043b: \u0432\u0441\u0442\u0430\u0432\u0438\u0442\u044c \u043d\u043e\u0432\u044b\u0439 \u044d\u043b\u0435\u043c\u0435\u043d\u0442 \u0443\u0434\u0430\u043b\u0438\u0442\u044c \u044d\u043b\u0435\u043c\u0435\u043d\u0442 \u043f\u043e \u043f\u043e\u0440\u044f\u0434\u043a\u043e\u0432\u043e\u043c\u0443 \u043d\u043e\u043c\u0435\u0440\u0443 \u043f\u043e\u043b\u0443\u0447\u0438\u0442\u044c \u044d\u043b\u0435\u043c\u0435\u043d\u0442 \u043f\u043e \u043f\u043e\u0440\u044f\u0434\u043a\u043e\u0432\u043e\u043c\u0443 \u043d\u043e\u043c\u0435\u0440\u0443 \u0434\u0430\u043d\u043d\u044b\u0435 \u0445\u0440\u0430\u043d\u044f\u0442\u0441\u044f \u0432 \u0441\u043e\u0440\u0442\u0438\u0440\u043e\u0432\u0430\u043d\u043d\u043e\u043c \u0432\u0438\u0434\u0435 \u0414\u0430\u043d\u043d\u044b\u0435 \u043f\u043e\u0441\u0442\u043e\u044f\u043d\u043d\u043e \u0434\u043e\u0431\u0430\u0432\u043b\u044f\u044e\u0442\u0441\u044f \u0438 \u0443\u0434\u0430\u043b\u044f\u044e\u0442\u0441\u044f, \u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u0430 \u0434\u043e\u043b\u0436\u043d\u0430 \u043e\u0431\u0435\u0441\u043f\u0435\u0447\u0438\u0432\u0430\u0442\u044c \u0431\u044b\u0441\u0442\u0440\u0443\u044e \u0441\u043a\u043e\u0440\u043e\u0441\u0442\u044c \u0440\u0430\u0431\u043e\u0442\u044b. \u0421\u043d\u0430\u0447\u0430\u043b\u0430 \u043f\u044b\u0442\u0430\u043b\u0441\u044f \u0440\u0435\u0430\u043b\u0438\u0437\u043e\u0432\u0430\u0442\u044c \u0442\u0430\u043a\u0443\u044e \u0432\u0435\u0449\u044c \u0438\u0441\u043f\u043e\u043b\u044c\u0437\u0443\u044f \u0441\u0442\u0430\u043d\u0434\u0430\u0440\u0442\u043d\u044b\u0435 \u043a\u043e\u043d\u0442\u0435\u0439\u043d\u0435\u0440\u044b \u0438\u0437 std. \u042d\u0442\u043e\u0442 \u043f\u0443\u0442\u044c \u043d\u0435 [&hellip;]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[688],"tags":[],"class_list":["post-54389","post","type-post","status-publish","format-standard","hentry","category-administrirovanie"],"aioseo_notices":[],"aioseo_head":"\n\t\t<!-- All in One SEO 5.0.5.1 - aioseo.com -->\n\t<meta name=\"description\" content=\"\u041f\u043e\u043f\u0430\u043b\u0430\u0441\u044c \u043c\u043d\u0435 \u0437\u0430\u0434\u0430\u0447\u0430 \u0441\u043b\u0435\u0434\u0443\u044e\u0449\u0435\u0433\u043e \u0432\u0438\u0434\u0430.\" \/>\n\t<meta name=\"robots\" content=\"max-image-preview:large\" \/>\n\t<meta name=\"author\" content=\"Yuri Gagarin\"\/>\n\t<link rel=\"canonical\" href=\"https:\/\/prohoster.info\/hr\/blog\/administrirovanie\/indeksiruemoe-binarnoe-derevo\" \/>\n\t\t<meta name=\"generator\" content=\"All in One SEO (AIOSEO) 5.0.5.1\" \/>\n\t\t<meta property=\"og:locale\" content=\"hr_HR\" \/>\n\t\t<meta property=\"og:site_name\" content=\"ProHoster | \u041a\u0443\u043f\u0438\u0442\u044c \u043d\u0430\u0434\u0435\u0436\u043d\u044b\u0439 \u0445\u043e\u0441\u0442\u0438\u043d\u0433 \u0434\u043b\u044f \u0441\u0430\u0439\u0442\u043e\u0432 \u0441 \u0437\u0430\u0449\u0438\u0442\u043e\u0439 \u043e\u0442 DDoS, VPS VDS \u0441\u0435\u0440\u0432\u0435\u0440\u044b\" \/>\n\t\t<meta property=\"og:type\" content=\"article\" \/>\n\t\t<meta property=\"og:title\" content=\"\ud83e\udd47\u0418\u043d\u0434\u0435\u043a\u0441\u0438\u0440\u0443\u0435\u043c\u043e\u0435 \u0431\u0438\u043d\u0430\u0440\u043d\u043e\u0435 \u0434\u0435\u0440\u0435\u0432\u043e | ProHoster\" \/>\n\t\t<meta property=\"og:description\" content=\"\u041f\u043e\u043f\u0430\u043b\u0430\u0441\u044c \u043c\u043d\u0435 \u0437\u0430\u0434\u0430\u0447\u0430 \u0441\u043b\u0435\u0434\u0443\u044e\u0449\u0435\u0433\u043e \u0432\u0438\u0434\u0430.\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/prohoster.info\/hr\/blog\/administrirovanie\/indeksiruemoe-binarnoe-derevo\" \/>\n\t\t<meta property=\"og:image\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:secure_url\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:width\" content=\"350\" \/>\n\t\t<meta property=\"og:image:height\" content=\"350\" \/>\n\t\t<meta property=\"article:published_time\" content=\"2019-12-24T21:00:00+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2020-02-18T11:02:23+00:00\" \/>\n\t\t<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<meta property=\"article:author\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<!-- All in One SEO -->\n\n","aioseo_head_json":{"title":"\ud83e\udd47Indeksirano binarno stablo | ProHoster","description":"Naleteo sam na zadatak sljede\u0107eg tipa.","canonical_url":"https:\/\/prohoster.info\/hr\/blog\/administrirovanie\/indeksiruemoe-binarnoe-derevo","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"hr_HR","og:site_name":"ProHoster | \u041a\u0443\u043f\u0438\u0442\u044c \u043d\u0430\u0434\u0435\u0436\u043d\u044b\u0439 \u0445\u043e\u0441\u0442\u0438\u043d\u0433 \u0434\u043b\u044f \u0441\u0430\u0439\u0442\u043e\u0432 \u0441 \u0437\u0430\u0449\u0438\u0442\u043e\u0439 \u043e\u0442 DDoS, VPS VDS \u0441\u0435\u0440\u0432\u0435\u0440\u044b","og:type":"article","og:title":"\ud83e\udd47\u0418\u043d\u0434\u0435\u043a\u0441\u0438\u0440\u0443\u0435\u043c\u043e\u0435 \u0431\u0438\u043d\u0430\u0440\u043d\u043e\u0435 \u0434\u0435\u0440\u0435\u0432\u043e | ProHoster","og:description":"\u041f\u043e\u043f\u0430\u043b\u0430\u0441\u044c \u043c\u043d\u0435 \u0437\u0430\u0434\u0430\u0447\u0430 \u0441\u043b\u0435\u0434\u0443\u044e\u0449\u0435\u0433\u043e \u0432\u0438\u0434\u0430.","og:url":"https:\/\/prohoster.info\/hr\/blog\/administrirovanie\/indeksiruemoe-binarnoe-derevo","og:image":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:secure_url":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:width":350,"og:image:height":350,"article:published_time":"2019-12-24T21:00:00+00:00","article:modified_time":"2020-02-18T11:02:23+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"54389","title":null,"description":null,"keywords":null,"keyphrases":null,"primary_term":null,"canonical_url":null,"og_title":null,"og_description":null,"og_object_type":"default","og_image_type":"default","og_image_url":null,"og_image_width":null,"og_image_height":null,"og_image_custom_url":null,"og_image_custom_fields":null,"og_video":null,"og_custom_url":null,"og_article_section":null,"og_article_tags":null,"twitter_use_og":false,"twitter_card":"default","twitter_image_type":"default","twitter_image_url":null,"twitter_image_custom_url":null,"twitter_image_custom_fields":null,"twitter_title":null,"twitter_description":null,"schema":{"blockGraphs":[],"customGraphs":[],"default":{"data":{"Article":[],"Course":[],"Dataset":[],"FAQPage":[],"Movie":[],"Person":[],"Product":[],"ProductReview":[],"Car":[],"Recipe":[],"Service":[],"SoftwareApplication":[],"WebPage":[]},"graphName":"","isEnabled":true},"graphs":[]},"schema_type":null,"schema_type_options":null,"pillar_content":false,"robots_default":true,"robots_noindex":false,"robots_noarchive":false,"robots_nosnippet":false,"robots_nofollow":false,"robots_noimageindex":false,"robots_noodp":false,"robots_notranslate":false,"robots_max_snippet":null,"robots_max_videopreview":null,"robots_max_imagepreview":"large","priority":null,"frequency":null,"local_seo":null,"seo_analyzer_scan_date":"2026-01-24 11:11:41","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-02-28 20:07:24","updated":"2026-01-24 11:11:41","focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"gt_translate_keys":[{"key":"link","format":"url"}],"_links":{"self":[{"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/posts\/54389","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/comments?post=54389"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/posts\/54389\/revisions"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/media?parent=54389"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/categories?post=54389"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/tags?post=54389"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}