Double Arrayã®ã³ã¼ããªãã¦1年以ä¸ããã£ã¦ãªãããã«ãªã«ãè¨ã£ã¦ããã ãã®å£ã¯ã¨è¨ãæãã§ãããDouble Arrayãä½ãã®ã§ããã°ãåçæ´æ°ã«å¯¾å¿ãããã¹ãã§ããã¨ãããæãããã§ãã Double Arrayã®ã¡ãªãã㯠Trieã§ãã éã (Ternary Search Treeã¨ãã¨æ¯ã¹ãã¨)ãµã¤ãºãå°ãã ã¨ããæãã ã£ã訳ã§ãããé度ã¯ã¨ãããããµã¤ãºã§ã¯Txã使ã£ã¦ãããããªLOUDSãLOUDS++ãªã©ã®å§ç¸®ãã¡ããæ¹å¼ã«åã¦ãªãã®ã§ãéçãªè¾æ¸ã¨ãã¦ã¯ãé度ãè¶ éè¦ãªã¨ãã以å¤ã§ã¯LOUDSãLOUDS++ã使ã£ãè¾æ¸ã使ãã®ãããã®ããªã¨æã訳ã§ããè¾æ¸å¼ã以å¤ã®é¨åãããã«ããã¯ã§ãããã¨ãå¤ãã ããããã ã¨è¨ãããã§ãç°¡æ½ãã¼ã¿æ§é ã«æ¯è¼ãã¦Double Arrayã§ãªã«ã便å©ãªäºãã§ããªãããªã¨ããã¨ãå§ç¸®ããããæ¹å¼ã§ã¯ãã¯ããåçãªæ´æ°ãé£
{{#tags}}- {{label}}
{{/tags}}