{"id":477839,"date":"2023-08-09T09:21:11","date_gmt":"2023-08-09T09:21:11","guid":{"rendered":""},"modified":"2023-09-05T11:15:33","modified_gmt":"2023-09-05T11:15:33","slug":"linked-list","status":"publish","type":"wiki","link":"https:\/\/oneproxy.pro\/vn\/wiki\/linked-list\/","title":{"rendered":"Danh s\u00e1ch li\u00ean k\u1ebft"},"content":{"rendered":"<p>Danh s\u00e1ch li\u00ean k\u1ebft l\u00e0 m\u1ed9t c\u1ea5u tr\u00fac d\u1eef li\u1ec7u c\u01a1 b\u1ea3n \u0111\u01b0\u1ee3c s\u1eed d\u1ee5ng trong khoa h\u1ecdc m\u00e1y t\u00ednh v\u00e0 l\u1eadp tr\u00ecnh. N\u00f3 bao g\u1ed3m c\u00e1c n\u00fat, trong \u0111\u00f3 m\u1ed7i n\u00fat ch\u1ee9a m\u1ed9t tr\u01b0\u1eddng d\u1eef li\u1ec7u v\u00e0 m\u1ed9t tham chi\u1ebfu (li\u00ean k\u1ebft) \u0111\u1ebfn n\u00fat ti\u1ebfp theo trong chu\u1ed7i. \u0110i\u1ec1u n\u00e0y cho ph\u00e9p t\u1ed5 ch\u1ee9c v\u00e0 qu\u1ea3n l\u00fd d\u1eef li\u1ec7u m\u1ed9t c\u00e1ch n\u0103ng \u0111\u1ed9ng v\u00e0 hi\u1ec7u qu\u1ea3.<\/p>\n<h2>L\u1ecbch s\u1eed ngu\u1ed3n g\u1ed1c c\u1ee7a danh s\u00e1ch li\u00ean k\u1ebft v\u00e0 l\u1ea7n \u0111\u1ea7u ti\u00ean nh\u1eafc \u0111\u1ebfn n\u00f3<\/h2>\n<p>Kh\u00e1i ni\u1ec7m danh s\u00e1ch li\u00ean k\u1ebft c\u00f3 t\u1eeb nh\u1eefng n\u0103m 1950, khi ch\u00fang l\u1ea7n \u0111\u1ea7u ti\u00ean \u0111\u01b0\u1ee3c h\u00ecnh th\u00e0nh v\u00e0 tri\u1ec3n khai. Ban \u0111\u1ea7u ch\u00fang \u0111\u01b0\u1ee3c s\u1eed d\u1ee5ng trong vi\u1ec7c l\u1eadp tr\u00ecnh c\u00e1c m\u00e1y t\u00ednh \u0111\u1eddi \u0111\u1ea7u, cho ph\u00e9p qu\u1ea3n l\u00fd d\u1eef li\u1ec7u linh ho\u1ea1t v\u00e0 hi\u1ec7u qu\u1ea3 h\u01a1n. Vi\u1ec7c \u0111\u1ec1 c\u1eadp \u0111\u1ebfn danh s\u00e1ch li\u00ean k\u1ebft l\u1ea7n \u0111\u1ea7u ti\u00ean c\u00f3 th\u1ec3 b\u1eaft ngu\u1ed3n t\u1eeb m\u1ed9t b\u00e1o c\u00e1o c\u1ee7a Allen Newell, Cliff Shaw v\u00e0 Herbert A. Simon v\u00e0o n\u0103m 1955. Nh\u1eefng c\u1ea5u tr\u00fac d\u1eef li\u1ec7u n\u00e0y \u0111\u01b0\u1ee3c s\u1eed d\u1ee5ng nh\u01b0 m\u1ed9t ph\u1ea7n c\u1ee7a IPL (Ng\u00f4n ng\u1eef x\u1eed l\u00fd th\u00f4ng tin) v\u00e0 t\u1eeb \u0111\u00f3 \u0111\u00e3 tr\u1edf th\u00e0nh m\u1ed9t kh\u00e1i ni\u1ec7m n\u1ec1n t\u1ea3ng trong khoa h\u1ecdc m\u00e1y t\u00ednh.<\/p>\n<h2>Th\u00f4ng tin chi ti\u1ebft v\u1ec1 Danh s\u00e1ch li\u00ean k\u1ebft: M\u1edf r\u1ed9ng ch\u1ee7 \u0111\u1ec1 Danh s\u00e1ch li\u00ean k\u1ebft<\/h2>\n<p>Danh s\u00e1ch li\u00ean k\u1ebft \u0111\u00f3ng vai tr\u00f2 thay th\u1ebf cho m\u1ea3ng, cung c\u1ea5p kh\u1ea3 n\u0103ng ph\u00e2n b\u1ed5 d\u1eef li\u1ec7u \u0111\u1ed9ng. Kh\u00f4ng gi\u1ed1ng nh\u01b0 m\u1ea3ng, danh s\u00e1ch li\u00ean k\u1ebft c\u00f3 th\u1ec3 t\u0103ng ho\u1eb7c gi\u1ea3m k\u00edch th\u01b0\u1edbc m\u00e0 kh\u00f4ng c\u1ea7n ph\u00e2n b\u1ed5 l\u1ea1i b\u1ed9 nh\u1edb. C\u00f3 hai lo\u1ea1i danh s\u00e1ch li\u00ean k\u1ebft ch\u00ednh:<\/p>\n<ol>\n<li><strong>Danh s\u00e1ch li\u00ean k\u1ebft \u0111\u01a1n<\/strong>: M\u1ed7i n\u00fat tr\u1ecf \u0111\u1ebfn n\u00fat ti\u1ebfp theo trong chu\u1ed7i, v\u1edbi n\u00fat cu\u1ed1i c\u00f9ng tr\u1ecf \u0111\u1ebfn NULL.<\/li>\n<li><strong>Danh s\u00e1ch li\u00ean k\u1ebft \u0111\u00f4i<\/strong>: M\u1ed7i n\u00fat c\u00f3 c\u00e1c con tr\u1ecf t\u1edbi c\u1ea3 n\u00fat ti\u1ebfp theo v\u00e0 n\u00fat tr\u01b0\u1edbc \u0111\u00f3, cho ph\u00e9p truy\u1ec1n t\u1ea3i hai chi\u1ec1u.<\/li>\n<\/ol>\n<p>Danh s\u00e1ch li\u00ean k\u1ebft \u0111\u01b0\u1ee3c s\u1eed d\u1ee5ng trong nhi\u1ec1u \u1ee9ng d\u1ee5ng kh\u00e1c nhau, bao g\u1ed3m h\u1ec7 \u0111i\u1ec1u h\u00e0nh, h\u1ec7 th\u1ed1ng t\u1ec7p v\u00e0 vi\u1ec7c tri\u1ec3n khai c\u00e1c c\u1ea5u tr\u00fac d\u1eef li\u1ec7u kh\u00e1c nh\u01b0 ng\u0103n x\u1ebfp v\u00e0 h\u00e0ng \u0111\u1ee3i.<\/p>\n<h2>C\u1ea5u tr\u00fac b\u00ean trong c\u1ee7a danh s\u00e1ch li\u00ean k\u1ebft: Danh s\u00e1ch li\u00ean k\u1ebft ho\u1ea1t \u0111\u1ed9ng nh\u01b0 th\u1ebf n\u00e0o<\/h2>\n<p>C\u1ea5u tr\u00fac b\u00ean trong c\u1ee7a danh s\u00e1ch li\u00ean k\u1ebft bao g\u1ed3m c\u00e1c n\u00fat ri\u00eang l\u1ebb, m\u1ed7i n\u00fat ch\u1ee9a hai ph\u1ea7n:<\/p>\n<ol>\n<li><strong>D\u1eef li\u1ec7u<\/strong>: Th\u00f4ng tin \u0111\u01b0\u1ee3c l\u01b0u tr\u1eef trong n\u00fat.<\/li>\n<li><strong>Con tr\u1ecf ti\u1ebfp theo (ho\u1eb7c tr\u01b0\u1edbc \u0111\u00f3)<\/strong>: Tham chi\u1ebfu \u0111\u1ebfn n\u00fat ti\u1ebfp theo (ho\u1eb7c tr\u01b0\u1edbc \u0111\u00f3) trong chu\u1ed7i.<\/li>\n<\/ol>\n<p>Danh s\u00e1ch li\u00ean k\u1ebft b\u1eaft \u0111\u1ea7u b\u1eb1ng n\u00fat \u0111\u1ea7u, tr\u1ecf \u0111\u1ebfn ph\u1ea7n t\u1eed \u0111\u1ea7u ti\u00ean trong danh s\u00e1ch v\u00e0 k\u1ebft th\u00fac b\u1eb1ng n\u00fat \u0111u\u00f4i, tr\u1ecf \u0111\u1ebfn NULL. C\u00e1c thao t\u00e1c nh\u01b0 ch\u00e8n, x\u00f3a v\u00e0 truy\u1ec1n t\u1ea3i c\u00f3 th\u1ec3 \u0111\u01b0\u1ee3c th\u1ef1c hi\u1ec7n b\u1eb1ng c\u00e1ch thao t\u00e1c con tr\u1ecf th\u00edch h\u1ee3p.<\/p>\n<h2>Ph\u00e2n t\u00edch c\u00e1c t\u00ednh n\u0103ng ch\u00ednh c\u1ee7a danh s\u00e1ch li\u00ean k\u1ebft<\/h2>\n<p>C\u00e1c t\u00ednh n\u0103ng ch\u00ednh c\u1ee7a danh s\u00e1ch li\u00ean k\u1ebft bao g\u1ed3m:<\/p>\n<ul>\n<li><strong>K\u00edch th\u01b0\u1edbc \u0111\u1ed9ng<\/strong>: Ch\u00fang c\u00f3 th\u1ec3 ph\u00e1t tri\u1ec3n ho\u1eb7c thu nh\u1ecf m\u1ed9t c\u00e1ch linh ho\u1ea1t m\u00e0 kh\u00f4ng c\u1ea7n thay \u0111\u1ed5i k\u00edch th\u01b0\u1edbc.<\/li>\n<li><strong>Hi\u1ec7u qu\u1ea3 b\u1ed9 nh\u1edb<\/strong>: Ch\u1ec9 s\u1eed d\u1ee5ng b\u1ed9 nh\u1edb c\u1ea7n thi\u1ebft cho c\u00e1c th\u00e0nh ph\u1ea7n trong danh s\u00e1ch.<\/li>\n<li><strong>D\u1ec5 d\u00e0ng ch\u00e8n v\u00e0 x\u00f3a<\/strong>: T\u1ea1o \u0111i\u1ec1u ki\u1ec7n cho vi\u1ec7c th\u00eam v\u00e0 lo\u1ea1i b\u1ecf c\u00e1c ph\u1ea7n t\u1eed m\u1ed9t c\u00e1ch nhanh ch\u00f3ng.<\/li>\n<li><strong>Truy c\u1eadp tu\u1ea7n t\u1ef1<\/strong>: C\u00e1c ph\u1ea7n t\u1eed \u0111\u01b0\u1ee3c truy c\u1eadp tu\u1ea7n t\u1ef1 ch\u1ee9 kh\u00f4ng ph\u1ea3i ng\u1eabu nhi\u00ean nh\u01b0 trong m\u1ea3ng.<\/li>\n<\/ul>\n<h2>C\u00e1c lo\u1ea1i danh s\u00e1ch li\u00ean k\u1ebft: S\u1eed d\u1ee5ng b\u1ea3ng v\u00e0 danh s\u00e1ch \u0111\u1ec3 vi\u1ebft<\/h2>\n<table>\n<thead>\n<tr>\n<th>Ki\u1ec3u<\/th>\n<th>S\u1ef1 mi\u00eau t\u1ea3<\/th>\n<\/tr>\n<\/thead>\n<tbody>\n<tr>\n<td>Danh s\u00e1ch li\u00ean k\u1ebft \u0111\u01a1n<\/td>\n<td>C\u00e1c n\u00fat ch\u1ee9a d\u1eef li\u1ec7u v\u00e0 m\u1ed9t con tr\u1ecf t\u1edbi n\u00fat ti\u1ebfp theo.<\/td>\n<\/tr>\n<tr>\n<td>Danh s\u00e1ch li\u00ean k\u1ebft \u0111\u00f4i<\/td>\n<td>C\u00e1c n\u00fat ch\u1ee9a d\u1eef li\u1ec7u v\u00e0 con tr\u1ecf t\u1edbi c\u1ea3 n\u00fat ti\u1ebfp theo v\u00e0 n\u00fat tr\u01b0\u1edbc \u0111\u00f3.<\/td>\n<\/tr>\n<tr>\n<td>Danh s\u00e1ch li\u00ean k\u1ebft v\u00f2ng<\/td>\n<td>N\u00fat cu\u1ed1i c\u00f9ng quay l\u1ea1i n\u00fat \u0111\u1ea7u ti\u00ean, t\u1ea1o th\u00e0nh m\u1ed9t v\u00f2ng l\u1eb7p.<\/td>\n<\/tr>\n<tr>\n<td>Danh s\u00e1ch li\u00ean k\u1ebft \u0111a c\u1ea5p<\/td>\n<td>M\u1ed9t lo\u1ea1i danh s\u00e1ch li\u00ean k\u1ebft ph\u1ee9c t\u1ea1p trong \u0111\u00f3 c\u00e1c n\u00fat c\u00f3 th\u1ec3 c\u00f3 danh s\u00e1ch li\u00ean k\u1ebft con.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h2>C\u00e1ch s\u1eed d\u1ee5ng danh s\u00e1ch li\u00ean k\u1ebft, v\u1ea5n \u0111\u1ec1 v\u00e0 gi\u1ea3i ph\u00e1p li\u00ean quan \u0111\u1ebfn vi\u1ec7c s\u1eed d\u1ee5ng<\/h2>\n<p>Danh s\u00e1ch li\u00ean k\u1ebft r\u1ea5t linh ho\u1ea1t v\u00e0 c\u00f3 th\u1ec3 t\u00ecm th\u1ea5y c\u00e1c \u1ee9ng d\u1ee5ng trong nhi\u1ec1u l\u0129nh v\u1ef1c kh\u00e1c nhau nh\u01b0:<\/p>\n<ul>\n<li><strong>C\u00e1c h\u1ec7 \u0111i\u1ec1u h\u00e0nh<\/strong>: Qu\u1ea3n l\u00fd t\u00e0i nguy\u00ean v\u00e0 l\u1eadp k\u1ebf ho\u1ea1ch.<\/li>\n<li><strong>Qu\u1ea3n l\u00fd c\u01a1 s\u1edf d\u1eef li\u1ec7u<\/strong>: L\u01b0u tr\u1eef v\u00e0 truy xu\u1ea5t hi\u1ec7u qu\u1ea3.<\/li>\n<li><strong>Bi\u1ec3u di\u1ec5n \u0111\u1ed3 th\u1ecb<\/strong>: L\u01b0u tr\u1eef danh s\u00e1ch k\u1ec1.<\/li>\n<\/ul>\n<h3>V\u1ea5n \u0111\u1ec1 v\u00e0 gi\u1ea3i ph\u00e1p<\/h3>\n<ul>\n<li><strong>Chi ph\u00ed b\u1ed9 nh\u1edb<\/strong>: M\u1ed7i n\u00fat y\u00eau c\u1ea7u th\u00eam b\u1ed9 nh\u1edb cho con tr\u1ecf. S\u1eed d\u1ee5ng b\u1ed9 nh\u1edb hi\u1ec7u qu\u1ea3 c\u00f3 th\u1ec3 gi\u1ea3m thi\u1ec3u \u0111i\u1ec1u n\u00e0y.<\/li>\n<li><strong>Th\u1eddi gian truy c\u1eadp ch\u1eadm<\/strong>: Truy c\u1eadp tu\u1ea7n t\u1ef1 c\u00f3 th\u1ec3 d\u1eabn \u0111\u1ebfn th\u1eddi gian truy xu\u1ea5t ch\u1eadm h\u01a1n. \u0110i\u1ec1u n\u00e0y c\u00f3 th\u1ec3 \u0111\u01b0\u1ee3c t\u1ed1i \u01b0u h\u00f3a b\u1eb1ng c\u00e1ch s\u1eed d\u1ee5ng c\u00e1c bi\u1ebfn th\u1ec3 kh\u00e1c nhau c\u1ee7a danh s\u00e1ch li\u00ean k\u1ebft.<\/li>\n<\/ul>\n<h2>C\u00e1c \u0111\u1eb7c \u0111i\u1ec3m ch\u00ednh v\u00e0 nh\u1eefng so s\u00e1nh kh\u00e1c v\u1edbi c\u00e1c thu\u1eadt ng\u1eef t\u01b0\u01a1ng t\u1ef1 \u1edf d\u1ea1ng b\u1ea3ng v\u00e0 danh s\u00e1ch<\/h2>\n<table>\n<thead>\n<tr>\n<th>\u0111\u1eb7c tr\u01b0ng<\/th>\n<th>Danh s\u00e1ch li\u00ean k\u1ebft<\/th>\n<th>M\u1ea3ng<\/th>\n<\/tr>\n<\/thead>\n<tbody>\n<tr>\n<td>Th\u1eddi gian truy c\u1eadp<\/td>\n<td>TR\u00caN)<\/td>\n<td>O(1)<\/td>\n<\/tr>\n<tr>\n<td>Th\u1eddi gian ch\u00e8n<\/td>\n<td>O(1)<\/td>\n<td>TR\u00caN)<\/td>\n<\/tr>\n<tr>\n<td>Th\u1eddi gian x\u00f3a<\/td>\n<td>O(1)<\/td>\n<td>TR\u00caN)<\/td>\n<\/tr>\n<tr>\n<td>S\u1eed d\u1ee5ng b\u1ed9 nh\u1edb<\/td>\n<td>N\u0103ng \u0111\u1ed9ng<\/td>\n<td>T\u0129nh<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h2>Quan \u0111i\u1ec3m v\u00e0 c\u00f4ng ngh\u1ec7 c\u1ee7a t\u01b0\u01a1ng lai li\u00ean quan \u0111\u1ebfn danh s\u00e1ch li\u00ean k\u1ebft<\/h2>\n<p>Nh\u1eefng ti\u1ebfn b\u1ed9 trong t\u01b0\u01a1ng lai c\u00f3 th\u1ec3 cho th\u1ea5y danh s\u00e1ch li\u00ean k\u1ebft s\u1ebd ph\u00e1t tri\u1ec3n c\u00f9ng v\u1edbi c\u00e1c c\u00f4ng ngh\u1ec7 m\u1edbi nh\u01b0 x\u1eed l\u00fd song song, thu\u1eadt to\u00e1n t\u1ed1i \u01b0u h\u00f3a v\u00e0 t\u00edch h\u1ee3p v\u1edbi AI v\u00e0 h\u1ecdc m\u00e1y.<\/p>\n<h2>C\u00e1ch s\u1eed d\u1ee5ng ho\u1eb7c li\u00ean k\u1ebft m\u00e1y ch\u1ee7 proxy v\u1edbi danh s\u00e1ch li\u00ean k\u1ebft<\/h2>\n<p>Trong b\u1ed1i c\u1ea3nh m\u00e1y ch\u1ee7 proxy nh\u01b0 OneProxy, danh s\u00e1ch \u0111\u01b0\u1ee3c li\u00ean k\u1ebft c\u00f3 th\u1ec3 \u0111\u01b0\u1ee3c s\u1eed d\u1ee5ng \u0111\u1ec3 qu\u1ea3n l\u00fd k\u1ebft n\u1ed1i, l\u01b0u tr\u1eef d\u1eef li\u1ec7u v\u00e0 s\u1eafp x\u1ebfp h\u00e0ng \u0111\u1ee3i y\u00eau c\u1ea7u. Ch\u00fang cho ph\u00e9p x\u1eed l\u00fd hi\u1ec7u qu\u1ea3 c\u00e1c y\u00eau c\u1ea7u c\u1ee7a kh\u00e1ch h\u00e0ng v\u00e0 \u0111\u1ea3m b\u1ea3o giao ti\u1ebfp m\u1ea1ng m\u01b0\u1ee3t m\u00e0 h\u01a1n.<\/p>\n<h2>Li\u00ean k\u1ebft li\u00ean quan<\/h2>\n<ul>\n<li><a href=\"https:\/\/en.wikipedia.org\/wiki\/Linked_list\" target=\"_new\" rel=\"noopener nofollow\">Wikipedia: Danh s\u00e1ch li\u00ean k\u1ebft<\/a><\/li>\n<li><a href=\"https:\/\/www.geeksforgeeks.org\/data-structures\/linked-list\/\" target=\"_new\" rel=\"noopener nofollow\">GeeksforGeeks: Gi\u1edbi thi\u1ec7u v\u1ec1 Danh s\u00e1ch Li\u00ean k\u1ebft<\/a><\/li>\n<li><a href=\"http:\/\/cslibrary.stanford.edu\/103\/LinkedListBasics.pdf\" target=\"_new\" rel=\"noopener nofollow\">\u0110\u1ea1i h\u1ecdc Stanford: Kh\u00e1i ni\u1ec7m c\u01a1 b\u1ea3n v\u1ec1 danh s\u00e1ch li\u00ean k\u1ebft<\/a><\/li>\n<\/ul>\n<p>Th\u00f4ng tin \u0111\u01b0\u1ee3c cung c\u1ea5p \u1edf tr\u00ean cung c\u1ea5p c\u00e1i nh\u00ecn s\u00e2u s\u1eafc to\u00e0n di\u1ec7n v\u1ec1 danh s\u00e1ch \u0111\u01b0\u1ee3c li\u00ean k\u1ebft, t\u1eeb l\u1ecbch s\u1eed v\u00e0 kh\u00e1i ni\u1ec7m c\u1ed1t l\u00f5i \u0111\u1ebfn \u1ee9ng d\u1ee5ng c\u1ee7a ch\u00fang trong c\u00f4ng ngh\u1ec7 hi\u1ec7n \u0111\u1ea1i, bao g\u1ed3m c\u1ea3 m\u00e1y ch\u1ee7 proxy nh\u01b0 OneProxy.<\/p>","protected":false},"featured_media":0,"menu_order":0,"template":"","meta":{"_acf_changed":false,"content-type":"","inline_featured_image":false,"footnotes":""},"class_list":["post-477839","wiki","type-wiki","status-publish","hentry"],"acf":{"faq_title":"Frequently Asked Questions about <mark>Linked List<\/mark>","faq_items":[{"question":"What is a Linked List?","answer":"<p>A linked list is a data structure used in computer science that consists of nodes, where each node contains a data field and a reference to the next node in the sequence. This allows for dynamic and efficient organization and management of data.<\/p>"},{"question":"What are the Different Types of Linked Lists?","answer":"<p>There are several types of linked lists, including Singly Linked List, Doubly Linked List, Circular Linked List, and Multilevel Linked List. Each type has specific characteristics and use-cases.<\/p>"},{"question":"How Does a Linked List Work?","answer":"<p>The linked list works by connecting nodes through pointers. Each node consists of data and a pointer to the next node. Operations such as insertion, deletion, and traversal are performed through manipulation of these pointers.<\/p>"},{"question":"What Are the Key Features of Linked Lists?","answer":"<p>The key features of linked lists include dynamic size, memory efficiency, ease of insertion and deletion, and sequential access.<\/p>"},{"question":"What Are the Advantages and Disadvantages of Using Linked Lists?","answer":"<p>The advantages of linked lists include dynamic size, memory efficiency, and ease of insertion and deletion. Disadvantages may include memory overhead for storing pointers and slower access times compared to arrays.<\/p>"},{"question":"How Are Linked Lists Used in Proxy Servers like OneProxy?","answer":"<p>In proxy servers like OneProxy, linked lists can be used to manage connections, cache data, and organize request queues. They help in efficient handling of client requests and smoother network communication.<\/p>"},{"question":"What Are the Future Perspectives of Linked Lists?","answer":"<p>Future perspectives of linked lists may include their evolution with new technologies like parallel processing, optimization algorithms, and integration with AI and machine learning.<\/p>"},{"question":"How Do Linked Lists Compare to Arrays?","answer":"<p>Linked lists allow for dynamic memory allocation and ease of insertion and deletion, but they have slower access times compared to arrays, which allow for constant-time access but have a static size.<\/p>"},{"question":"Where Can I Find More Information About Linked Lists?","answer":"<p>More information about linked lists can be found at resources like Wikipedia's Linked List page, GeeksforGeeks' Introduction to Linked List, and Stanford University's Linked List Basics.<\/p>"}]},"_links":{"self":[{"href":"https:\/\/oneproxy.pro\/vn\/wp-json\/wp\/v2\/wiki\/477839","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/oneproxy.pro\/vn\/wp-json\/wp\/v2\/wiki"}],"about":[{"href":"https:\/\/oneproxy.pro\/vn\/wp-json\/wp\/v2\/types\/wiki"}],"version-history":[{"count":0,"href":"https:\/\/oneproxy.pro\/vn\/wp-json\/wp\/v2\/wiki\/477839\/revisions"}],"wp:attachment":[{"href":"https:\/\/oneproxy.pro\/vn\/wp-json\/wp\/v2\/media?parent=477839"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}