{"id":44746,"date":"2023-09-15T00:45:49","date_gmt":"2022-12-22T01:56:08","guid":{"rendered":"https:\/\/www.silicloud.com\/zh\/blog\/44746-2\/"},"modified":"2024-05-03T23:46:56","modified_gmt":"2024-05-03T15:46:56","slug":"44746-2","status":"publish","type":"post","link":"https:\/\/www.silicloud.com\/zh\/blog\/44746-2\/","title":{"rendered":""},"content":{"rendered":"

\u4f55\u304c\u66f8\u3044\u3066\u3042\u308b\u304b<\/h1>\n

Btree\u306eGo\u3067\u306e\u5b9f\u88c5\u4f8b\u3002\u5099\u5fd8\u9332\u3002<\/p>\n

\/\/ \u7bc0\u30fb\u8449\u306b\u6301\u305f\u305b\u308b\u6a5f\u80fd\u306e\u30a4\u30f3\u30bf\u30fc\u30d5\u30a7\u30fc\u30b9<\/span>\r\ntype<\/span> Item<\/span> interface<\/span> {<\/span>\r\n    Eq<\/span>(<\/span>Item<\/span>)<\/span>   bool<\/span>\r\n    Less<\/span>(<\/span>Item<\/span>)<\/span> bool<\/span>\r\n}<\/span>\r\n\/\/ \u30a4\u30f3\u30bf\u30fc\u30d5\u30a7\u30fc\u30b9\u306e\u5b9f\u88c5<\/span>\r\ntype<\/span> Int<\/span> int<\/span>\r\nfunc<\/span> (<\/span>n<\/span> Int<\/span>)<\/span> Eq<\/span>(<\/span>m<\/span> Item<\/span>)<\/span> bool<\/span> {<\/span>\r\n    return<\/span> n<\/span> ==<\/span> m<\/span>.<\/span>(<\/span>Int<\/span>)<\/span>\r\n}<\/span>\r\nfunc<\/span> (<\/span>n<\/span> Int<\/span>)<\/span> Less<\/span>(<\/span>m<\/span> Item<\/span>)<\/span> bool<\/span> {<\/span>\r\n    return<\/span> n<\/span> <<\/span> m<\/span>.<\/span>(<\/span>Int<\/span>)<\/span>\r\n}<\/span>\r\n\/\/ \u7bc0\u30fb\u8449\u306e\u69cb\u9020<\/span>\r\ntype<\/span> Node<\/span> struct<\/span> {<\/span>\r\n    item<\/span> Item<\/span>\r\n    left<\/span>,<\/span> right<\/span> *<\/span>Node<\/span>\r\n}<\/span>\r\n\/\/ \u7bc0\u30fb\u8449\u306e\u4f5c\u6210<\/span>\r\nfunc<\/span> newNode<\/span>(<\/span>x<\/span> Item<\/span>)<\/span> *<\/span>Node<\/span> {<\/span>\r\n    p<\/span> :=<\/span> new<\/span>(<\/span>Node<\/span>)<\/span>\r\n    p<\/span>.<\/span>item<\/span> =<\/span> x<\/span>\r\n    return<\/span> p<\/span>\r\n}<\/span>\r\n\/\/ \u4e8c\u5206\u6728<\/span>\r\ntype<\/span> Tree<\/span> struct<\/span> {<\/span>\r\n    root<\/span> *<\/span>Node<\/span>\r\n}<\/span>\r\n\/\/ \u4e8c\u5206\u6728\u306e\u751f\u6210<\/span>\r\nfunc<\/span> newTree<\/span>()<\/span> *<\/span>Tree<\/span> {<\/span>\r\n    return<\/span> new<\/span>(<\/span>Tree<\/span>)<\/span>\r\n}<\/span>\r\n\/\/ \u30c7\u30fc\u30bf\u306e\u63a2\u7d22<\/span>\r\nfunc<\/span> (<\/span>t<\/span> *<\/span>Tree<\/span>)<\/span> searchTree<\/span>(<\/span>x<\/span> Item<\/span>)<\/span> bool<\/span> {<\/span>\r\n    return<\/span> searchNode<\/span>(<\/span>t<\/span>.<\/span>root<\/span>,<\/span> x<\/span>)<\/span>\r\n}<\/span>\r\n\/\/ \u6728\u3078\u306e\u633f\u5165<\/span>\r\nfunc<\/span> (<\/span>t<\/span> *<\/span>Tree<\/span>)<\/span> insertTree<\/span>(<\/span>x<\/span> Item<\/span>)<\/span> {<\/span>\r\n    t<\/span>.<\/span>root<\/span> =<\/span> insertNode<\/span>(<\/span>t<\/span>.<\/span>root<\/span>,<\/span> x<\/span>)<\/span>\r\n}<\/span>\r\n\/\/ \u7bc0\u30fb\u8449\u306e\u633f\u5165<\/span>\r\nfunc<\/span> insertNode<\/span>(<\/span>node<\/span> *<\/span>Node<\/span>,<\/span> x<\/span> Item<\/span>)<\/span> *<\/span>Node<\/span> {<\/span>\r\n    switch<\/span> {<\/span>\r\n    case<\/span> node<\/span> ==<\/span> nil<\/span>:<\/span> return<\/span> newNode<\/span>(<\/span>x<\/span>)<\/span>\r\n    case<\/span> x<\/span>.<\/span>Eq<\/span>(<\/span>node<\/span>.<\/span>item<\/span>)<\/span>:<\/span> return<\/span> node<\/span>\r\n    case<\/span> x<\/span>.<\/span>Less<\/span>(<\/span>node<\/span>.<\/span>item<\/span>)<\/span>:<\/span>\r\n        node<\/span>.<\/span>left<\/span> =<\/span> insertNode<\/span>(<\/span>node<\/span>.<\/span>left<\/span>,<\/span> x<\/span>)<\/span>\r\n    default<\/span>:<\/span>\r\n        node<\/span>.<\/span>right<\/span> =<\/span> insertNode<\/span>(<\/span>node<\/span>.<\/span>right<\/span>,<\/span> x<\/span>)<\/span>\r\n    }<\/span>\r\n    return<\/span> node<\/span>\r\n}<\/span>\r\n\/\/ \u7bc0\u30fb\u8449\u306e\u63a2\u7d22<\/span>\r\nfunc<\/span> searchNode<\/span>(<\/span>node<\/span> *<\/span>Node<\/span>,<\/span> x<\/span> Item<\/span>)<\/span> bool<\/span> {<\/span>\r\n    for<\/span> node<\/span> !=<\/span> nil<\/span> {<\/span>\r\n        switch<\/span> {<\/span>\r\n        case<\/span> x<\/span>.<\/span>Eq<\/span>(<\/span>node<\/span>.<\/span>item<\/span>)<\/span>:<\/span> return<\/span> true<\/span>\r\n        case<\/span> x<\/span>.<\/span>Less<\/span>(<\/span>node<\/span>.<\/span>item<\/span>)<\/span>:<\/span> node<\/span> =<\/span> node<\/span>.<\/span>left<\/span>\r\n        default<\/span>:<\/span> node<\/span> =<\/span> node<\/span>.<\/span>right<\/span>\r\n        }<\/span>\r\n    }<\/span>\r\n    return<\/span> false<\/span>\r\n}<\/span>\r\n\/\/ \u6728\u306e\u30c0\u30f3\u30d7<\/span>\r\nfunc<\/span> (<\/span>t<\/span> *<\/span>Tree<\/span>)<\/span> printTree<\/span>()<\/span> {<\/span>\r\n    t<\/span>.<\/span>foreachTree<\/span>(<\/span>func<\/span>(<\/span>x<\/span> Item<\/span>)<\/span> {<\/span> fmt<\/span>.<\/span>Print<\/span>(<\/span>x<\/span>,<\/span> \" \"<\/span>)<\/span> })<\/span>\r\n    fmt<\/span>.<\/span>Println<\/span>(<\/span>\"\"<\/span>)<\/span>\r\n}<\/span>\r\n\/\/ \u6728\u304b\u3089\u306e\u524a\u9664<\/span>\r\nfunc<\/span> (<\/span>t<\/span> *<\/span>Tree<\/span>)<\/span> deleteTree<\/span>(<\/span>x<\/span> Item<\/span>)<\/span> {<\/span>\r\n    t<\/span>.<\/span>root<\/span> =<\/span> deleteNode<\/span>(<\/span>t<\/span>.<\/span>root<\/span>,<\/span> x<\/span>)<\/span>\r\n}<\/span>\r\n\/\/ \u7bc0\u30fb\u8449\u306e\u524a\u9664<\/span>\r\nfunc<\/span> deleteNode<\/span>(<\/span>node<\/span> *<\/span>Node<\/span>,<\/span> x<\/span> Item<\/span>)<\/span> *<\/span>Node<\/span> {<\/span>\r\n    if<\/span> node<\/span> !=<\/span> nil<\/span> {<\/span>\r\n        if<\/span> x<\/span>.<\/span>Eq<\/span>(<\/span>node<\/span>.<\/span>item<\/span>)<\/span> {<\/span>\r\n            if<\/span> node<\/span>.<\/span>left<\/span> ==<\/span> nil<\/span> {<\/span>\r\n                return<\/span> node<\/span>.<\/span>right<\/span>\r\n            }<\/span> else<\/span> if<\/span> node<\/span>.<\/span>right<\/span> ==<\/span> nil<\/span> {<\/span>\r\n                return<\/span> node<\/span>.<\/span>left<\/span>\r\n            }<\/span> else<\/span> {<\/span>\r\n                node<\/span>.<\/span>item<\/span> =<\/span> searchMin<\/span>(<\/span>node<\/span>.<\/span>right<\/span>)<\/span>\r\n                node<\/span>.<\/span>right<\/span> =<\/span> deleteMin<\/span>(<\/span>node<\/span>.<\/span>right<\/span>)<\/span>\r\n            }<\/span>\r\n        }<\/span> else<\/span> if<\/span> x<\/span>.<\/span>Less<\/span>(<\/span>node<\/span>.<\/span>item<\/span>)<\/span> {<\/span>\r\n            node<\/span>.<\/span>left<\/span> =<\/span> deleteNode<\/span>(<\/span>node<\/span>.<\/span>left<\/span>,<\/span> x<\/span>)<\/span>\r\n        }<\/span> else<\/span> {<\/span>\r\n            node<\/span>.<\/span>right<\/span> =<\/span> deleteNode<\/span>(<\/span>node<\/span>.<\/span>right<\/span>,<\/span> x<\/span>)<\/span>\r\n        }<\/span>\r\n    }<\/span>\r\n    return<\/span> node<\/span>\r\n}<\/span>\r\n\/\/ \u6700\u5c0f\u5024\u3092\u6c42\u3081\u308b<\/span>\r\nfunc<\/span> searchMin<\/span>(<\/span>node<\/span> *<\/span>Node<\/span>)<\/span> Item<\/span> {<\/span>\r\n    if<\/span> node<\/span>.<\/span>left<\/span> ==<\/span> nil<\/span> {<\/span>\r\n        return<\/span> node<\/span>.<\/span>item<\/span>\r\n    }<\/span>\r\n    return<\/span> searchMin<\/span>(<\/span>node<\/span>.<\/span>left<\/span>)<\/span>\r\n}<\/span>\r\n\/\/ \u6700\u5c0f\u5024\u3092\u524a\u9664\u3059\u308b<\/span>\r\nfunc<\/span> deleteMin<\/span>(<\/span>node<\/span> *<\/span>Node<\/span>)<\/span> *<\/span>Node<\/span> {<\/span>\r\n    if<\/span> node<\/span>.<\/span>left<\/span> ==<\/span> nil<\/span> {<\/span>\r\n        return<\/span> node<\/span>.<\/span>right<\/span>\r\n    }<\/span>\r\n    node<\/span>.<\/span>left<\/span> =<\/span> deleteMin<\/span>(<\/span>node<\/span>.<\/span>left<\/span>)<\/span>\r\n    return<\/span> node<\/span>\r\n}<\/span>\r\n\/\/ \u5de1\u56de<\/span>\r\nfunc<\/span> foreachNode<\/span>(<\/span>f<\/span> func<\/span>(<\/span>Item<\/span>),<\/span> node<\/span> *<\/span>Node<\/span>)<\/span> {<\/span>\r\n    if<\/span> node<\/span> !=<\/span> nil<\/span> {<\/span>\r\n        foreachNode<\/span>(<\/span>f<\/span>,<\/span> node<\/span>.<\/span>left<\/span>)<\/span>\r\n        f<\/span>(<\/span>node<\/span>.<\/span>item<\/span>)<\/span>\r\n        foreachNode<\/span>(<\/span>f<\/span>,<\/span> node<\/span>.<\/span>right<\/span>)<\/span>\r\n    }<\/span>\r\n}<\/span>\r\nfunc<\/span> (<\/span>t<\/span> *<\/span>Tree<\/span>)<\/span> foreachTree<\/span>(<\/span>f<\/span> func<\/span>(<\/span>Item<\/span>))<\/span> {<\/span>\r\n    foreachNode<\/span>(<\/span>f<\/span>,<\/span> t<\/span>.<\/span>root<\/span>)<\/span>\r\n}<\/span>\r\n\r\nfunc<\/span> main<\/span>(){<\/span>\r\n    a<\/span> :=<\/span> newTree<\/span>()<\/span>\r\n    for<\/span> _<\/span>,<\/span> v<\/span> :=<\/span> range<\/span> []<\/span>int<\/span>{<\/span>5<\/span>,<\/span>6<\/span>,<\/span>4<\/span>,<\/span>7<\/span>,<\/span>3<\/span>,<\/span>8<\/span>,<\/span>2<\/span>,<\/span>9<\/span>,<\/span>1<\/span>,<\/span>0<\/span>}<\/span> {<\/span>\r\n        a<\/span>.<\/span>insertTree<\/span>(<\/span>Int<\/span>(<\/span>v<\/span>))<\/span>\r\n    }<\/span>\r\n    a<\/span>.<\/span>printTree<\/span>()<\/span>\r\n    for<\/span> i<\/span> :=<\/span> 0<\/span>;<\/span> i<\/span> <<\/span> 10<\/span>;<\/span> i<\/span>++<\/span> {<\/span>\r\n        fmt<\/span>.<\/span>Println<\/span>(<\/span>a<\/span>.<\/span>searchTree<\/span>(<\/span>Int<\/span>(<\/span>i<\/span>)))<\/span>\r\n    }<\/span>\r\n    for<\/span> i<\/span> :=<\/span> 0<\/span>;<\/span> i<\/span> <<\/span> 10<\/span>;<\/span> i<\/span>++<\/span> {<\/span>\r\n        a<\/span>.<\/span>deleteTree<\/span>(<\/span>Int<\/span>(<\/span>i<\/span>))<\/span>\r\n        a<\/span>.<\/span>printTree<\/span>()<\/span>\r\n    }<\/span>\r\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
\u4f55\u304c\u66f8\u3044\u3066\u3042\u308b\u304b Btree\u306eGo\u3067\u306e\u5b9f\u88c5\u4f8b\u3002\u5099\u5fd8\u9332\u3002 \/\/ \u7bc0\u30fb\u8449\u306b\u6301\u305f\u305b\u308b\u6a5f\u80fd\u306e\u30a4\u30f3\u30bf\u30fc\u30d5\u30a7\u30fc\u30b9 type […]<\/p>\n","protected":false},"author":4,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-44746","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"yoast_head":"\n- Blog - Silicon Cloud<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.silicloud.com\/zh\/blog\/44746-2\/\" \/>\n<meta property=\"og:locale\" content=\"zh_CN\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:description\" content=\"\u4f55\u304c\u66f8\u3044\u3066\u3042\u308b\u304b Btree\u306eGo\u3067\u306e\u5b9f\u88c5\u4f8b\u3002\u5099\u5fd8\u9332\u3002 \/\/ \u7bc0\u30fb\u8449\u306b\u6301\u305f\u305b\u308b\u6a5f\u80fd\u306e\u30a4\u30f3\u30bf\u30fc\u30d5\u30a7\u30fc\u30b9 type […]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.silicloud.com\/zh\/blog\/44746-2\/\" \/>\n<meta property=\"og:site_name\" content=\"Blog - Silicon Cloud\" \/>\n<meta property=\"article:published_time\" content=\"2022-12-22T01:56:08+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-05-03T15:46:56+00:00\" \/>\n<meta name=\"author\" content=\"\u79d1, \u96c5\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u4f5c\u8005\" \/>\n\t<meta name=\"twitter:data1\" content=\"\u79d1, \u96c5\" \/>\n\t<meta name=\"twitter:label2\" content=\"\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 \u5206\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.silicloud.com\/zh\/blog\/44746-2\/\",\"url\":\"https:\/\/www.silicloud.com\/zh\/blog\/44746-2\/\",\"name\":\"- Blog - Silicon Cloud\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/zh\/blog\/#website\"},\"datePublished\":\"2022-12-22T01:56:08+00:00\",\"dateModified\":\"2024-05-03T15:46:56+00:00\",\"author\":{\"@id\":\"https:\/\/www.silicloud.com\/zh\/blog\/#\/schema\/person\/41e222757cdd2a3365361328bd79970a\"},\"inLanguage\":\"zh-Hans\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.silicloud.com\/zh\/blog\/44746-2\/\"]}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.silicloud.com\/zh\/blog\/#website\",\"url\":\"https:\/\/www.silicloud.com\/zh\/blog\/\",\"name\":\"Blog - Silicon Cloud\",\"description\":\"\",\"inLanguage\":\"zh-Hans\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.silicloud.com\/zh\/blog\/#\/schema\/person\/41e222757cdd2a3365361328bd79970a\",\"name\":\"\u79d1, \u96c5\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"zh-Hans\",\"@id\":\"https:\/\/www.silicloud.com\/zh\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/1b2d3e00a7df03689797ebd4af8c5827ba5af936849a71050ec331f4cf902c5d?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/1b2d3e00a7df03689797ebd4af8c5827ba5af936849a71050ec331f4cf902c5d?s=96&d=mm&r=g\",\"caption\":\"\u79d1, \u96c5\"},\"url\":\"https:\/\/www.silicloud.com\/zh\/blog\/author\/keya\/\"},{\"@type\":\"ImageObject\",\"inLanguage\":\"zh-Hans\",\"@id\":\"https:\/\/www.silicloud.com\/zh\/blog\/44746-2\/#local-main-organization-logo\",\"url\":\"\",\"contentUrl\":\"\",\"caption\":\"Blog - Silicon Cloud\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"- Blog - Silicon Cloud","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.silicloud.com\/zh\/blog\/44746-2\/","og_locale":"zh_CN","og_type":"article","og_description":"\u4f55\u304c\u66f8\u3044\u3066\u3042\u308b\u304b Btree\u306eGo\u3067\u306e\u5b9f\u88c5\u4f8b\u3002\u5099\u5fd8\u9332\u3002 \/\/ \u7bc0\u30fb\u8449\u306b\u6301\u305f\u305b\u308b\u6a5f\u80fd\u306e\u30a4\u30f3\u30bf\u30fc\u30d5\u30a7\u30fc\u30b9 type […]","og_url":"https:\/\/www.silicloud.com\/zh\/blog\/44746-2\/","og_site_name":"Blog - Silicon Cloud","article_published_time":"2022-12-22T01:56:08+00:00","article_modified_time":"2024-05-03T15:46:56+00:00","author":"\u79d1, \u96c5","twitter_card":"summary_large_image","twitter_misc":{"\u4f5c\u8005":"\u79d1, \u96c5","\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4":"2 \u5206"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.silicloud.com\/zh\/blog\/44746-2\/","url":"https:\/\/www.silicloud.com\/zh\/blog\/44746-2\/","name":"- Blog - Silicon Cloud","isPartOf":{"@id":"https:\/\/www.silicloud.com\/zh\/blog\/#website"},"datePublished":"2022-12-22T01:56:08+00:00","dateModified":"2024-05-03T15:46:56+00:00","author":{"@id":"https:\/\/www.silicloud.com\/zh\/blog\/#\/schema\/person\/41e222757cdd2a3365361328bd79970a"},"inLanguage":"zh-Hans","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.silicloud.com\/zh\/blog\/44746-2\/"]}]},{"@type":"WebSite","@id":"https:\/\/www.silicloud.com\/zh\/blog\/#website","url":"https:\/\/www.silicloud.com\/zh\/blog\/","name":"Blog - Silicon Cloud","description":"","inLanguage":"zh-Hans"},{"@type":"Person","@id":"https:\/\/www.silicloud.com\/zh\/blog\/#\/schema\/person\/41e222757cdd2a3365361328bd79970a","name":"\u79d1, \u96c5","image":{"@type":"ImageObject","inLanguage":"zh-Hans","@id":"https:\/\/www.silicloud.com\/zh\/blog\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/1b2d3e00a7df03689797ebd4af8c5827ba5af936849a71050ec331f4cf902c5d?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/1b2d3e00a7df03689797ebd4af8c5827ba5af936849a71050ec331f4cf902c5d?s=96&d=mm&r=g","caption":"\u79d1, \u96c5"},"url":"https:\/\/www.silicloud.com\/zh\/blog\/author\/keya\/"},{"@type":"ImageObject","inLanguage":"zh-Hans","@id":"https:\/\/www.silicloud.com\/zh\/blog\/44746-2\/#local-main-organization-logo","url":"","contentUrl":"","caption":"Blog - Silicon Cloud"}]}},"_links":{"self":[{"href":"https:\/\/www.silicloud.com\/zh\/blog\/wp-json\/wp\/v2\/posts\/44746","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.silicloud.com\/zh\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.silicloud.com\/zh\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.silicloud.com\/zh\/blog\/wp-json\/wp\/v2\/users\/4"}],"replies":[{"embeddable":true,"href":"https:\/\/www.silicloud.com\/zh\/blog\/wp-json\/wp\/v2\/comments?post=44746"}],"version-history":[{"count":2,"href":"https:\/\/www.silicloud.com\/zh\/blog\/wp-json\/wp\/v2\/posts\/44746\/revisions"}],"predecessor-version":[{"id":94830,"href":"https:\/\/www.silicloud.com\/zh\/blog\/wp-json\/wp\/v2\/posts\/44746\/revisions\/94830"}],"wp:attachment":[{"href":"https:\/\/www.silicloud.com\/zh\/blog\/wp-json\/wp\/v2\/media?parent=44746"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.silicloud.com\/zh\/blog\/wp-json\/wp\/v2\/categories?post=44746"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.silicloud.com\/zh\/blog\/wp-json\/wp\/v2\/tags?post=44746"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}