{"id":5788,"date":"2015-02-28T10:00:46","date_gmt":"2015-02-28T01:00:46","guid":{"rendered":"http:\/\/www.techscore.com\/blog\/?p=5788"},"modified":"2018-11-14T16:33:49","modified_gmt":"2018-11-14T07:33:49","slug":"concurrent-java-scala-go","status":"publish","type":"post","link":"https:\/\/www.techscore.com\/blog\/2015\/02\/28\/concurrent-java-scala-go\/","title":{"rendered":"\u6bd4\u8f03\uff1a\u4e26\u884c\u51e6\u7406\u3000- Java \u3068Scala \u3068Go -"},"content":{"rendered":"

\u3053\u3093\u306b\u3061\u306f\u3001\u99ac\u5834\u3067\u3059\u3002<\/p>\n

\u5b8c\u5168\u306b\u51fa\u9045\u308c\u3066\u3044\u307e\u3059\u304c\u3001\u500b\u4eba\u7684\u306b\u89e6\u3063\u3066\u307f\u305f\u304b\u3063\u305fGo\u8a00\u8a9e\u3068\u622f\u308c\u3066\u307f\u305f\u3044\u3068\u601d\u3044\u307e\u3059\u3002Go \u8a00\u8a9e\u3068\u3044\u3048\u3070\u4e26\u884c\u51e6\u7406\u3067\u3059\u3088\u306d\u3002\u305b\u3063\u304b\u304f\u3067\u3059\u306e\u3067\u3001\u4ed6\u306e\u8a00\u8a9eJava 8 \/ Scala 2.11 \u3068\u6bd4\u8f03\u3057\u306a\u304c\u3089\u898b\u3066\u3044\u304d\u305f\u3044\u3068\u601d\u3044\u307e\u3059\u3002<\/p>\n

\u304a\u984c\uff1a\u4e8c\u5206\u63a2\u7d22\u6728\u3092\u6bd4\u8f03\u3059\u308b\u3002 <\/h2>\n

\u4e26\u884c\u51e6\u7406\u306e\u304a\u984c\u306f\u3001\u8d85\u5145\u5b9f\u3057\u3066\u3044\u308bGo \u8a00\u8a9e\u306e\u30c1\u30e5\u30fc\u30c8\u30ea\u30a2\u30ebTour of Go<\/a>\u306e\u30a8\u30af\u30b5\u30b5\u30a4\u30ba\u3001Equivalent Binary Tree<\/a> \u3067\u3059\u3002<\/p>\n

\u4e8c\u5206\u63a2\u7d22\u6728\u3068\u306f\u3001\u5b50\u306e\u6570\u304c\u6700\u5927\uff12\u3067\u3042\u308b\u4e8c\u5206\u6728\u3067\u3001\u300c\u3042\u308b\u30ce\u30fc\u30c9\u306e\u5de6\u306e\u5b50\u304a\u3088\u3073\u305d\u306e\u5168\u3066\u306e\u5b50\u5b6b\u30ce\u30fc\u30c9\u306e\u6301\u3064\u5024\u306f\u305d\u306e\u30ce\u30fc\u30c9\u306e\u5024\u3088\u308a\u5c0f\u3055\u304f\u3001\u53f3\u306e\u5b50\u53ca\u3073\u305d\u306e\u5168\u3066\u306e\u5b50\u5b6b\u30ce\u30fc\u30c9\u306e\u6301\u3064\u5024\u306f\u305d\u306e\u30ce\u30fc\u30c9\u306e\u5024\u3088\u308a\u5927\u304d\u304f\u306a\u308b\u3088\u3046\u306b\u69cb\u6210\u3057\u305f\u300d\u3082\u306e(Wikipedia<\/a>)\u3067\u3059\u3002<\/p>\n

\uff12\u3064\u306e\u4e8c\u5206\u6728\u304c\u3001\u5f62\u306f\u3061\u304c\u3048\u3069\u540c\u3058\u5024\u3092\u4fdd\u6301\u3057\u3066\u3044\u308b\u5834\u5408\u304c\u3042\u308a\u307e\u3059\u3002\u305d\u306e\u305f\u3081\u306b\u3001<\/p>\n

1. \u4e8c\u5206\u63a2\u7d22\u6728\u3092\u751f\u6210\u3057\u3001
\n2. 2\u3064\u306e\u4e8c\u5206\u6728\u306e\u89e3\u6790\uff08\uff1d\u3069\u306e\u3088\u3046\u306a\u5024\u3092\u4fdd\u6301\u3057\u3066\u3044\u308b\u306e\u304b\uff09\u3092\u4e26\u884c\u3057\u3066\u884c\u3044\u3001
\n3. \u305d\u306e\u5f8c\u89e3\u6790\u7d50\u679c\u3092\u6bd4\u8f03\u3059\u308b<\/p>\n

\u51e6\u7406\u3092\uff13\u3064\u306e\u8a00\u8a9e\u3067\u5b9f\u88c5\u3057\u307e\u3059\u3002<\/p>\n

1. Java 8<\/h2>\n

\u307e\u305a\u306f\u3001\u4e8c\u5206\u63a2\u7d22\u6728\u3092\u751f\u6210\u3059\u308b\u30af\u30e9\u30b9\u3067\u3059\u3002<\/p>\n

\r\npackage tree;\r\n\r\nimport java.util.Arrays;\r\nimport java.util.Collections;\r\nimport java.util.List;\r\n\r\n\/**\r\n * \u6574\u6570\u306e\u5024\u3092\u3082\u3064\u4e8c\u5206\u63a2\u7d22\u6728\u3002 left Tree\u306b\u542b\u307e\u308c\u308b\u5024\u306f\u3059\u3079\u3066value \u3088\u308a\u5c0f\u3055\u304f right Tree\u306b\u542b\u307e\u308c\u308b\u5024\u306f\u3059\u3079\u3066value\u4ee5\u4e0a\u3002\r\n * \r\n *\r\n *\/\r\npublic class Tree {\r\n\r\n\tprivate Tree left;\r\n\tprivate Integer value;\r\n\tprivate Tree right;\r\n\r\n\t\/**\r\n\t * \u5024\u304cvalue \u3001\u5b50\u3069\u3082\u3092\u6301\u305f\u306a\u3044Tree\u3092\u4f5c\u6210\u3059\u308b\r\n\t * \r\n\t * @param value \u30ce\u30fc\u30c9\u306e\u5024\r\n\t *\/\r\n\tpublic Tree(int value) {\r\n\t\tthis.value = value;\r\n\t}\r\n\r\n\tpublic Tree getLeft() {\r\n\t\treturn left;\r\n\t}\r\n\r\n\tpublic Tree getRight() {\r\n\t\treturn right;\r\n\t}\r\n\r\n\tpublic Integer getValue() {\r\n\t\treturn value;\r\n\t}\r\n\r\n\t\/**\r\n\t * \u30e9\u30f3\u30c0\u30e0\u306bTree\u3092\u751f\u6210\u3059\u308b\u3002 \u751f\u6210\u3055\u308c\u308bTree\u306f\u3000coef,2coef,3coef,... ,10coef\u306e10\u306e\u5024\u3092\u4fdd\u6301\u3059\u308b\u3002\r\n\t * \r\n\t * @param coef Tree\u306b\u542b\u307e\u308c\u308b\u6570\u3092\u751f\u6210\u3059\u308b\u305f\u3081\u306e\u4fc2\u6570\r\n\t * @return coef, 2coef, ... 10coef \u306e10\u500b\u306e\u6570\u5b57\u3092\u4fdd\u6301\u3059\u308bTree\u3002\u5f62\u306f\u30d0\u30e9\u30d0\u30e9\r\n\t *\/\r\n\tpublic static Tree createTree(int coef) {\r\n\t\t\r\n\t\t\/\/\u30e9\u30f3\u30c0\u30e0\u306bTree \u3092\u751f\u6210\u3067\u304d\u308b\u3088\u3046\u3001seeds \u306e\u9806\u756a\u3092\u30d0\u30e9\u30d0\u30e9\u306b\u3059\u308b\r\n\t\tInteger[] seeds = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };\r\n\t\tList seedList = Arrays.asList(seeds);\r\n\t\tCollections.shuffle(seedList);\r\n\r\n\t\tTree tree = null;\r\n\t\tfor (int seed : seedList) {\r\n\t\t\ttree = insert(tree, (1 + seed) * coef);\r\n\t\t}\r\n\r\n\t\treturn tree;\r\n\t}\r\n\r\n\t\/**\r\n\t * \u4e8c\u5206\u63a2\u7d22\u6728\u306e\u69cb\u9020\u3092\u4fdd\u3064\u3088\u3046\u306b\u3001Tree tree \u306b\u5024value \u3092\u8ffd\u52a0\u3059\u308b\u3002\r\n\t * \r\n\t * @param tree Tree\r\n\t * @param value \u8ffd\u52a0\u3059\u308b\u5024 \r\n\t * @return value\u3092\u8ffd\u52a0\u3057\u305f\u65b0\u3057\u3044Tree\r\n\t *\/\r\n\tprivate static Tree insert(Tree tree, int value) {\r\n\t\tif (tree == null) {\r\n\t\t\treturn new Tree(value);\r\n\t\t}\r\n\t\tif (value < tree.value) {\r\n\t\t\ttree.left = insert(tree.left, value);\r\n\t\t} else {\r\n\t\t\ttree.right = insert(tree.right, value);\r\n\t\t}\r\n\t\treturn tree;\r\n\r\n\t}\r\n\r\n\tpublic String toString() {\r\n\t\tString string = \"\";\r\n\t\tif (left != null) {\r\n\t\t\tstring += left.toString() + \" \";\r\n\t\t}\r\n\t\tstring += value;\r\n\t\tif (right != null) {\r\n\t\t\tstring += \" \" + right.toString();\r\n\t\t}\r\n\t\treturn \"(\" + string + \")\";\r\n\t}\r\n\r\n\tpublic static void main(String[] args) {\r\n\t\tSystem.out.println(Tree.createTree(1));\r\n\t\tSystem.out.println(Tree.createTree(1));\r\n\t\tSystem.out.println(Tree.createTree(1));\r\n\r\n\t}\r\n\r\n}\r\n<\/pre>\n
\u3053\u306eTree \u306e\u89e3\u6790\u3092\u3059\u308b\u30e1\u30bd\u30c3\u30c9\u3092\u5b9f\u88c5\u3057\u307e\u3059\u3002<\/p>\n
\r\nimport java.util.ArrayList;\r\nimport java.util.List;\r\n\r\n\t\/**\r\n\t * Tree tree\u3092\u89e3\u6790\u3057\u3001Tree\u306b\u542b\u307e\u308c\u308b\u6570\u306eList \u3092\u8fd4\u3059\r\n\t * \r\n\t * @param tree \u89e3\u6790\u5bfe\u8c61\u306eTree\r\n\t * @return\u3000Tree\u306b\u542b\u307e\u308c\u308b\u6570\u306e\u30ea\u30b9\u30c8\uff08\u5c0f\u3055\u3044\u9806\uff09\r\n\t *\/\r\n\tpublic static List walk(Tree tree) {\r\n\t\tList result = new ArrayList<>();\r\n\t\tif (tree.getLeft() != null) {\r\n\t\t\tresult.addAll(walk(tree.getLeft()));\r\n\t\t}\r\n\t\tresult.add(tree.getValue());\r\n\t\tif (tree.getRight() != null) {\r\n\t\t\tresult.addAll(walk(tree.getRight()));\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n<\/pre>\n
\u304a\u6c17\u3065\u304d\u306e\u901a\u308a\u3001\u3053\u3053\u307e\u3067\u4e26\u884c\u51e6\u7406\u5168\u304f\u95a2\u4fc2\u3042\u308a\u307e\u305b\u3093\u3002\u305d\u308c\u3067\u306f\u30012\u3064\u306eTree\u3092\u89e3\u6790\u3057\u3001\u4fdd\u6301\u3059\u308b\u5024\u304c\u540c\u3058\u304b\u3069\u3046\u304b\u78ba\u304b\u3081\u3066\u307f\u307e\u3057\u3087\u3046\u30022\u3064\u306eTree\u306e\u89e3\u6790\u306f\u4e26\u884c\u306b\u884c\u3044\u307e\u3059\u3002<\/p>\n
\r\nimport java.util.List;\r\nimport java.util.concurrent.CompletableFuture;\r\nimport java.util.concurrent.ExecutionException;\r\n\r\n\t\/**\r\n\t * 2\u3064\u306eTree\u304c\u540c\u3058\u6570\u306e\u30ea\u30b9\u30c8\u3092\u542b\u3080Tree\u304b\u3069\u3046\u304b\u691c\u8a3c\u3059\u308b\u3002\r\n\t * @param treeA \u6bd4\u8f03\u5bfe\u8c61\u306eTree\r\n\t * @param treeB \u6bd4\u8f03\u5bfe\u8c61\u306eTree\r\n\t * @return \u540c\u3058\u306a\u3089true\/\u9055\u3046\u5834\u5408\u306ffalse\r\n\t * @throws InterruptedException \r\n\t * @throws ExecutionException\r\n\t *\/\r\n\tpublic static boolean isSame(Tree treeA, Tree treeB)\r\n\t\t\tthrows InterruptedException, ExecutionException {\r\n\t\t\r\n\t\t\/\/ CompletableFuture#supplyAsync \u30e1\u30bd\u30c3\u30c9\u5185\u3067\u8a18\u8ff0\u3057\u305f\u30e9\u30e0\u30c0\u5f0f\u306e\u51e6\u7406\u306f\u975e\u540c\u671f\u306b\u5b9f\u884c\r\n\t\tCompletableFuture> futureA = CompletableFuture\r\n\t\t\t\t.supplyAsync(() -> walk(treeA));\r\n\t\tCompletableFuture> futureB = CompletableFuture\r\n\t\t\t\t.supplyAsync(() -> walk(treeB));\r\n\r\n\t\t\/\/CompletableFuture#get \u30e1\u30bd\u30c3\u30c9\u306f\u51e6\u7406\u304c\u5b8c\u4e86\u3057\u305f\u6642\u70b9\u3067\u7d50\u679c\u3092\u8fd4\u3059\r\n\t\tList resultA = futureA.get();\r\n\t\tList resultB = futureB.get();\r\n\t\tfor (int i = 0; i < resultA.size(); i++) {\r\n\t\t\tif (resultA.get(i) != resultB.get(i)) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn true;\r\n\t}\r\n<\/pre>\n
Java8 \u3067\u8ffd\u52a0\u3055\u308c\u305f CompletableFuture\u3092\u5229\u7528\u3057\u3066\u3001\uff12\u3064\u306eTree\u306e\u89e3\u6790\u3092\u4e26\u884c\u3067\u5b9f\u884c\u3057\u3066\u3044\u307e\u3059\u3002CompletableFuture.supplyAsync \u306f\u3000\u5f15\u6570\u306b\u6307\u5b9a\u3057\u305f\u51e6\u7406\u3092\u975e\u540c\u671f\u3067\u5b9f\u884c\u3057\u307e\u3059\u3002Future\u306eget\u30e1\u30bd\u30c3\u30c9\u306f\u3001\u51e6\u7406\u304c\u7d42\u308f\u3063\u305f\u6bb5\u968e\u3067\u5024\u3092\u8fd4\u3057\u3066\u304f\u308c\u307e\u3059\u3002\u30e9\u30e0\u30c0\u5f0f\u3082\u3046\u307e\u304f\u4f7f\u308f\u308c\u3066\u3044\u3066\u3001\u30b3\u30fc\u30c9\u3082\u975e\u5e38\u306b\u7c21\u5358\u3002Thread \u3060\u3001synchronized \u3060\u3068\u8a00\u3063\u3066\u3044\u305f\u4e00\u6614\u524d\u306eJava\u30a8\u30f3\u30b8\u30cb\u30a2\uff08\u79c1\u3067\u3059\uff09\u304b\u3089\u307f\u308b\u3068\u9694\u4e16\u306e\u611f\u304c\u3042\u308a\u307e\u3059\u3002<\/p>\n
2. Scala 2.11<\/h2>\n
\u6b21\u306fScala\u3067\u3059\u3002\u4e8c\u5206\u63a2\u7d22\u6728\u3092\u751f\u6210\u3059\u308b\u30af\u30e9\u30b9\u306f\u4ee5\u4e0b\u306e\u3088\u3046\u306b\u306a\u308a\u307e\u3057\u305f\u3002Scala\u3089\u3057\u304fOption\u3092\u4f7f\u3044\u307e\u3059\u3002<\/p>\n
\r\n\/**\r\n * \u6574\u6570\u306e\u5024\u3092\u3082\u3064\u4e8c\u5206\u63a2\u7d22\u6728\u3002 left Tree\u306b\u542b\u307e\u308c\u308b\u5024\u306f\u3059\u3079\u3066value \u3088\u308a\u5c0f\u3055\u304f right Tree\u306b\u542b\u307e\u308c\u308b\u5024\u306f\u3059\u3079\u3066value\u4ee5\u4e0a\u3002\r\n * \u5b50\u30ce\u30fc\u30c9left\/right\u3092\u6301\u305f\u306a\u3044\u5834\u5408\u306fNone\r\n *\/\r\ncase class Tree( value:Int, left:Option[Tree] = None, right:Option[Tree] = None){\r\n\r\n\r\n  override def toString() : String = {\r\n    var string = \"(\"\r\n     string += left.map( _.toString() + \" \").getOrElse(\"\")\r\n     string += value\r\n     string += right.map( \" \" +  _.toString()).getOrElse(\"\")\r\n     string += \")\"\r\n    string\r\n  }\r\n\r\n}\r\n\r\nobject Tree {\r\n\r\n  \/**\r\n   * \u30e9\u30f3\u30c0\u30e0\u306bTree\u3092\u751f\u6210\u3059\u308b\u3002 \u751f\u6210\u3055\u308c\u308bTree\u306f\u3000coef,2coef,3coef,... ,10coef\u306e10\u306e\u5024\u3092\u4fdd\u6301\u3059\u308b\u3002\r\n   *\r\n   * @param coef Tree\u306b\u542b\u307e\u308c\u308b\u6570\u3092\u751f\u6210\u3059\u308b\u305f\u3081\u306e\u4fc2\u6570\r\n   * @return coef, 2coef, ... 10coef \u306e10\u500b\u306e\u6570\u5b57\u3092\u4fdd\u6301\u3059\u308bTree\u3002\u5f62\u306f\u30d0\u30e9\u30d0\u30e9\r\n   *\/\r\n  def createTree( coef : Int ) : Tree ={\r\n    val seeds = scala.util.Random.shuffle(0 to 9)\r\n    val defaultTree: Option[Tree] = None\r\n\r\n    \/\/ tree\u306b\u9806\u756a\u306b\u5024\u3092\u8ffd\u52a0\u3057\u3066\u3044\u304f\u3002\r\n    seeds.foldLeft(defaultTree){\r\n      (tree , seed) =>  insert(tree, (1 + seed) * coef)\r\n    }.get\r\n  }\r\n\r\n  \/**\r\n   * \u4e8c\u5206\u63a2\u7d22\u6728\u306e\u69cb\u9020\u3092\u4fdd\u3064\u3088\u3046\u306b\u3001Option[Tree] treeOption \u306b\u5024value \u3092\u8ffd\u52a0\u3059\u308b\u3002\r\n   * treeOption \u304cNone\u3067\u3042\u3063\u305f\u5834\u5408\u3001\u5024value \u306e\u307f\u3092\u3082\u3064Tree \u3092\u751f\u6210\u3057\u8fd4\u3059\u3002\r\n   *\r\n   * @param treeOption Option[Tree]\r\n   * @param value \u8ffd\u52a0\u3059\u308b\u5024\r\n   * @return value\u3092\u8ffd\u52a0\u3057\u305f\u65b0\u3057\u3044Option[Tree]\r\n   *\/\r\n  def insert( treeOption : Option[Tree] , value : Int): Option[Tree] = {\r\n    treeOption match{\r\n      case None => Some(Tree(value))\r\n      case Some(tree) =>\r\n        if( value < tree.value ){\r\n          Some( tree.copy( left = insert(tree.left, value)))\r\n        } else {\r\n          Some( tree.copy( right = insert(tree.right, value)))\r\n        }\r\n    }\r\n  }\r\n\r\n}\r\n<\/pre>\n
\u3053\u306eTree \u306e\u89e3\u6790\u3092\u3059\u308b\u30e1\u30bd\u30c3\u30c9\u3092\u5b9f\u88c5\u3057\u307e\u3059\u3002<\/p>\n
\r\n\/**\r\n * Tree tree\u3092\u89e3\u6790\u3057\u3001Tree\u306b\u542b\u307e\u308c\u308b\u6570\u306eListBuffer \u3092\u8fd4\u3059\r\n *\r\n * @param tree \u89e3\u6790\u5bfe\u8c61\u306eTree\r\n * @return\u3000Tree\u306b\u542b\u307e\u308c\u308b\u6570\u306e\u30ea\u30b9\u30c8\uff08\u5c0f\u3055\u3044\u9806\uff09\r\n *\/\r\ndef walk( tree : Tree ) : ListBuffer[Int]= {\r\n  val result = ListBuffer[Int]()\r\n  tree.left.foreach( t => result ++= walk(t))\r\n  result += tree.value\r\n  tree.right.foreach( t => result ++= walk(t))\r\n  result\r\n}\r\n<\/pre>\n
\u305d\u308c\u3067\u306f\u30012\u3064\u306eTree\u3092\u89e3\u6790\u3057\u3001\u4fdd\u6301\u3059\u308b\u5024\u304c\u540c\u3058\u304b\u3069\u3046\u304b\u78ba\u304b\u3081\u3066\u307f\u307e\u3057\u3087\u3046\u30022\u3064\u306eTree\u306e\u89e3\u6790\u306f\u4e26\u884c\u306b\u884c\u3044\u307e\u3059\u3002<\/p>\n
\r\n\/**\r\n * 2\u3064\u306eTree\u304c\u540c\u3058\u6570\u306e\u30ea\u30b9\u30c8\u3092\u542b\u3080Tree\u304b\u3069\u3046\u304b\u691c\u8a3c\u3059\u308b\u3002\r\n * \u540c\u3058\u306a\u3089\"true\" \u9055\u3063\u305f\u3089\"false\"\u3068\u6a19\u6e96\u51fa\u529b\u3059\u308b\u3002\r\n * @param treeA \u6bd4\u8f03\u5bfe\u8c61\u306eTree\r\n * @param treeB \u6bd4\u8f03\u5bfe\u8c61\u306eTree\r\n * @throws InterruptedException\r\n * @throws ExecutionException\r\n *\/\r\ndef isSame(treeA:Tree , treeB: Tree) : Unit = {\r\n  import scala.concurrent._\r\n  import ExecutionContext.Implicits.global\r\n\r\n  \/\/ Future\u30d6\u30ed\u30c3\u30af\u306e\u51e6\u7406\u306f\u975e\u540c\u671f\u3067\u5b9f\u884c\u3055\u308c\u308b\r\n  val futureA:Future[ListBuffer[Int]] = Future {\r\n    walk(treeA)\r\n  }\r\n\r\n\r\n  val futureB: Future[ListBuffer[Int]] = Future {\r\n    walk(treeB)\r\n  }\r\n\r\n  \/\/ for \u6587\u30672\u3064\u306e\u51e6\u7406\u3092\u540c\u671f\u3055\u305b\u3001\r\n  \/\/ \u89e3\u6790\u7d50\u679c\u3092\u6bd4\u8f03\u3057\u3066\u3044\u308b\r\n  val result : Future[Boolean] = for {\r\n    resultA <- futureA\r\n    resultB <- futureB\r\n  } yield {\r\n    resultA == resultB\r\n  }\r\n\r\n  \/\/ Scala \u306eFuture \u306fget \u76f8\u5f53\u306e\u30e1\u30bd\u30c3\u30c9\u3092\u6301\u305f\u306a\u3044\u3002callback\u95a2\u6570\u3092\u6307\u5b9a\u3059\u308b\u4ed5\u7d44\u307f\u3002\r\n  result onSuccess { case r => println(r)}\r\n\r\n\r\n}\r\n<\/pre>\n
Scala \u306eFuture \u306f\u300c\u51e6\u7406\u304c\u7d42\u308f\u3063\u305f\u3089\u305d\u306e\u5024\u3092\u53d6\u5f97\u3059\u308b\u300d\u3068\u3044\u3046\u3053\u3068\u304c\u3067\u304d\u307e\u305b\u3093\u3002\u5b8c\u4e86\u6642\u306ecallback\u95a2\u6570\u3092\u8a2d\u5b9a\u3059\u308b\u65b9\u5f0f\uff08onSuccess\u3067\u6307\u5b9a\u3057\u3066\u3044\u308b\u30d6\u30ed\u30c3\u30af\uff09\u3067\u3059\u3002\u3068\u306f\u3044\u3048\u3001\u4e0a\u8a18\u306e\u3088\u3046\u306afor\u6587\u3092\u66f8\u304f\u3053\u3068\u306b\u3088\u308a\u3001\u8907\u6570\u306e\u51e6\u7406\u3092\u6700\u5f8c\u306b\u540c\u671f\u3055\u305b\u3066\u7d50\u679c\u3092\u6bd4\u8f03\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u307e\u3059\u3002<\/p>\n
3. Go<\/h2>\n
\u3055\u3066\u3001\u3053\u308c\u3092Go \u3067\u5b9f\u88c5\u3059\u308b\u3068\u3069\u3046\u306a\u308b\u306e\u3067\u3057\u3087\u3046\uff1f\u4e8c\u5206\u63a2\u7d22\u6728\u3092\u751f\u6210\u3059\u308b\u30af\u30e9\u30b9\u3002\u3053\u308c\u306f\u3001Go \u306e\u30c1\u30e5\u30fc\u30c8\u30ea\u30a2\u30eb<\/a>\u3092\u53c2\u7167\u3057\u3066\u304f\u3060\u3055\u3044\uff08\u3068\u3044\u3046\u304b\u3001\u3053\u3053\u307e\u3067\u306e\u30d7\u30ed\u30b0\u30e9\u30e0\u306f\u3053\u306eGo \u306e\u30d7\u30ed\u30b0\u30e9\u30e0\u3092Java \u3084 Scala \u3067\u66f8\u304d\u76f4\u3057\u305f\u3082\u306e\u3067\u3059\uff09\u3002
\nTree \u3092\u89e3\u6790\u3059\u308b\u30e1\u30bd\u30c3\u30c9\u3001\u540c\u3058\u304b\u3069\u3046\u304b\u5224\u5b9a\u3059\u308b\u30e1\u30bd\u30c3\u30c9\u306f\u4ee5\u4e0b\u306e\u3088\u3046\u306b\u306a\u308a\u307e\u3059\u3002<\/p>\n
\r\npackage main\r\n\r\nimport \"code.google.com\/p\/go-tour\/tree\"\r\nimport (\"fmt\")\r\n\r\n\/\/ Walk \u95a2\u6570\u3067\u306f\u3001Tree\u3092\u63a2\u7d22\u3057\u306a\u304c\u3089\u3001Tree\u306b\u542b\u307e\u308c\u308b\u5168\u3066\u306e\r\n\/\/ \u5024\u3092\u3001\u5024\u304c\u5c0f\u3055\u3044\u7269\u304b\u3089\u9806\u306b\u30c1\u30e3\u30cd\u30eb ch\u306b\u9001\u4fe1\u3059\u308b\r\nfunc Walk(t *tree.Tree, ch chan int){\r\n    WalkSub(t, ch)\r\n    close(ch) \r\n  \r\n}\r\n\r\n\/\/ \u518d\u8d77\u547c\u3073\u51fa\u3057\u7528\u306e\u95a2\u6570\r\nfunc WalkSub(t *tree.Tree, ch chan int){\r\n    if t.Left !=nil {\r\n      WalkSub(t.Left, ch)\r\n    }\r\n    ch <- t.Value\r\n    if t.Right !=nil {\r\n      WalkSub(t.Right, ch)\r\n    }\r\n   \r\n}\r\n\r\n\/\/ Same \u95a2\u6570\u306f\u30012\u3064\u306eTree t1 \u3068t2\u304c\u5168\u304f\u540c\u3058\u5024\u3092\u542b\u3093\u3067\u3044\u308b\u3082\u306e\u304b\u3069\u3046\u304b\r\n\/\/ \u78ba\u8a8d\u3059\u308b\r\nfunc Same(t1, t2 *tree.Tree) bool{\r\n    c1 := make(chan int)\r\n    c2 := make(chan int)\r\n    \/\/ goroutine \u306b\u3088\u308aWalk\u95a2\u6570\u3092\u4e26\u884c\u5b9f\u884c\r\n    go Walk(t1, c1)\r\n    go Walk(t2, c2)\r\n    \r\n    \/\/ \u305d\u308c\u305e\u308c\u306e\u30c1\u30e3\u30cd\u30eb\u304c\u53d7\u4fe1\u3057\u305f\u5024\u3092\u53d6\u308a\u51fa\u3057\r\n    \/\/ \u4e00\u81f4\u3059\u308b\u304b\u8a55\u4fa1\r\n    for i := range c1 {\r\n        j  := <- c2\r\n        if  i != j  { \r\n            return false\r\n        }\r\n    }\r\n    return true\r\n\r\n}\r\n\r\nfunc main() {\r\n    fmt.Println(Same(tree.New(1),tree.New(1)))\r\n    fmt.Println(Same(tree.New(1),tree.New(2)))\r\n    \r\n}\r\n<\/pre>\n
Future \u3092\u5229\u7528\u3057\u3066\u3044\u305fJava \u3084Scala \u3068\u3060\u3044\u3076\u8da3\u304c\u9055\u3044\u307e\u3059\u306d\u3002Go \u306b\u306f\u3000\u30c1\u30e3\u30cd\u30eb(Channel)\u3068\u547c\u3070\u308c\u308b\u3082\u306e\u304c\u3042\u308a\u3001\u3053\u306e\u30c1\u30e3\u30cd\u30eb\u3092\u901a\u3057\u3066\u5024\u306e\u9001\u53d7\u4fe1\u304c\u53ef\u80fd\u3067\u3059\u3002\u305d\u3053\u3067\u3001\u3053\u306e\u30c1\u30e3\u30cd\u30eb\u3092\u3064\u304b\u3063\u3066Tree\u306e\u89e3\u6790\u3068\u4e26\u884c\u3057\u3066\u884c\u3044\u3001\u7d50\u679c\u3092\u6bd4\u8f03\u3057\u3066\u3044\u307e\u3059\u3002
\nWalk \u95a2\u6570\u5185\u3067\u306f\u3001Tree\u306b\u542b\u307e\u308c\u308b\u5024\u3092\u5c0f\u3055\u3044\u9806\u306b\u3069\u3093\u3069\u3093\u30c1\u30e3\u30cd\u30eb\u306b\u9001\u308a\u307e\u3059\u3002goroutine\u3092\u5229\u7528\u3057\u3066Walk\u95a2\u6570\u306f\u4e26\u884c\u3057\u3066\u5b9f\u884c\u3057\u307e\u3059\u3002Same\u95a2\u6570\u3067\u306f\u3001\u30c1\u30e3\u30cd\u30eb\u306e\u5024\u3092\u9806\u756a\u306b\u53d6\u308a\u51fa\u3057\u3066\u6bd4\u8f03\u3059\u308b\u3053\u3068\u306b\u3088\u3063\u3066\u3001\uff12\u3064\u306eTree\u304c\u540c\u3058\u5024\u3092\u6301\u3063\u3066\u3044\u308b\u304b\u3001\u8a55\u4fa1\u3057\u307e\u3059\u3002<\/p>\n
Go \u306e\u4f55\u304c\u3046\u308c\u3057\u3044\u306e\u304b\uff1f<\/h2>\n
\u4e26\u884c\u51e6\u7406\u3068\u8a00\u3048\u3070Go\u3068\u3044\u3046\u8a55\u5224\u3067\u3059\u304c\u3001\u305d\u308c\u306f\u3084\u306f\u308a\u3053\u306e goroutine\u3068\u30c1\u30e3\u30cd\u30eb\u306e\u4ed5\u7d44\u307f\u304c\u3042\u308b\u304b\u3089\u3053\u305d\u306a\u306e\u3067\u3057\u3087\u3046\u3002\u7279\u306b\u30c1\u30e3\u30cd\u30eb\u3002Java \u3084 Scala \u304c\u5229\u7528\u3057\u3066\u3044\u308bFuture\u306fTree\u306e\u89e3\u6790\u3092\u5168\u90e8\u3057\u7d42\u308f\u3063\u3066\u304b\u3089\u540c\u3058\u304b\u3069\u3046\u304b\u8a55\u4fa1\u3057\u3066\u3044\u307e\u3059\u3002Go\u306e\u30c1\u30e3\u30cd\u30eb\u306f\u3001\u5024\u3092\u53d7\u3051\u53d6\u3063\u305f\u3089\u305d\u306e\u90fd\u5ea6\u5024\u3092\u53d6\u308a\u51fa\u3057\u3066\u51e6\u7406\u3092\u884c\u3063\u3066\u3044\u307e\u3059\u3002\u4e8c\u5206\u6728\u304c\u5927\u304d\u304f\u63a2\u7d22\u306b\u6642\u9593\u304c\u304b\u304b\u308b\u5834\u5408\u3001\u5c11\u3057\u3067\u3082\u9055\u3044\u304c\u3042\u308c\u3070\u51e6\u7406\u304c\u7d42\u4e86\u3057\u65e9\u304f\u7d42\u308f\u308a\u307e\u3059\u3002\u30b5\u30fc\u30d3\u30b9\u7684\u30d7\u30ed\u30b0\u30e9\u30e0\u3092\u66f8\u304f\u306e\u306b\u3082\u3088\u3055\u305d\u3046\u3067\u3059\u306d\u3002<\/p>\n
\u3084\u3063\u3066\u307f\u3066\u308f\u304b\u3063\u305f\u3053\u3068<\/h2>\n
Go\u3068\u672c\u5f53\u306b\u8efd\u304f\u622f\u308c\u3066\u307f\u3066\u308f\u304b\u3063\u305f\u3053\u3068\u306f\u3001\u30c1\u30e5\u30fc\u30c8\u30ea\u30a2\u30eb<\/a>\u306e\u5145\u5b9f\u3067\u3059\u3002\u500b\u4eba\u7684\u306b\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0\u8a00\u8a9e\u3092\u5b66\u3076\u3068\u304d\u306e\u6700\u521d\u306e\u969c\u5bb3\u306f\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0\u74b0\u5883\u3092\u3064\u304f\u308b\u3068\u3053\u308d\u3060\u3068\u601d\u3063\u3066\u3044\u308b\u306e\u3067\u3059\u304c\u3001\u305d\u306e\u70b9\u3053\u306e\u30c1\u30e5\u30fc\u30c8\u30ea\u30a2\u30eb\u306b\u306f\u30d6\u30e9\u30a6\u30b6\u4e0a\u304b\u3089\u30d7\u30ed\u30b0\u30e9\u30e0\u3092\u8a66\u3059\u74b0\u5883\u304c\u3064\u3044\u3066\u3044\u3066\u3001\u975e\u5e38\u306b\u697d\u3067\u3057\u305f\u3002\u4ed6\u306e\u8a00\u8a9e\u3082\u3053\u308c\u304f\u3089\u3044\u308f\u304b\u308a\u3084\u3059\u304f\u300c\u3068\u306b\u304b\u304f\u307e\u305a\u306f\u3084\u3063\u3066\u307f\u3088\u3046\u300d\u3068\u601d\u3063\u305f\u4eba\u30d5\u30ec\u30f3\u30c9\u30ea\u30fc\u306a\u30c1\u30e5\u30fc\u30c8\u30ea\u30a2\u30eb\u304c\u3042\u308c\u3070\u3044\u3044\u306a\u3001\u3068\u611f\u3058\u307e\u3057\u305f\u3002\uff08Java \u306e\u30c1\u30e5\u30fc\u30c8\u30ea\u30a2\u30eb\u306f\u3001JVM\u306e\u8aac\u660e\u304b\u3089\u5165\u308b\u6765\u308b\u3082\u306e\u3092\u62d2\u3080\u4ed5\u69d8...)<\/p>\n
\u307e\u305f\u3001\u4e45\u3057\u3076\u308a\u306bJava \u3092\u8abf\u3079\u3066\u307f\u3066\u3001Java 8 \u306b\u306a\u3063\u3066\u66f8\u304d\u3084\u3059\u304f\u306a\u3063\u305f\u3068\u611f\u3058\u307e\u3057\u305f\u3002\u91cd\u3044\u51e6\u7406\u3092\u8907\u6570\u306e\u30b9\u30ec\u30c3\u30c9\u306b\u308f\u3051\u3066\u5b9f\u884c\u3057\u3001\u3042\u3068\u3067\u7d50\u679c\u3092\u30de\u30fc\u30b8\u3059\u308b\u3088\u3046\u306a\u4f7f\u3044\u65b9\u3067\u3042\u308c\u3070\u3001Java8 \u306e\u66f8\u304d\u65b9\u304c\u4e00\u756a\u308f\u304b\u308a\u3084\u3059\u3044\u3067\u3057\u3087\u3046\u3002<\/p>\n
\u305d\u308c\u3067\u3082\u4e00\u756a\u597d\u304d\u306a\u306e\u306fScala\u3067\u3059\u3002<\/p>\n
\u307f\u306a\u3055\u3093\u306e\u958b\u767a\u306e\u5834\u3067\u3069\u308c\u307b\u3069\u8a00\u8a9e\u9078\u629e\u306e\u81ea\u7531\u304c\u3042\u308b\u306e\u304b\u308f\u304b\u308a\u307e\u305b\u3093\u304c\u3001\u4f55\u304b\u306e\u53c2\u8003\u306b\u306a\u308c\u3070\u3046\u308c\u3057\u3044\u3067\u3059\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"
\u3053\u3093\u306b\u3061\u306f\u3001\u99ac\u5834\u3067\u3059\u3002<\/p>\n
\u5b8c\u5168\u306b\u51fa\u9045\u308c\u3066\u3044\u307e\u3059\u304c\u3001\u500b\u4eba\u7684\u306b\u89e6\u3063\u3066\u307f\u305f\u304b\u3063\u305fGo\u8a00\u8a9e\u3068\u622f\u308c\u3066\u307f\u305f\u3044\u3068\u601d\u3044\u307e\u3059\u3002Go \u8a00\u8a9e\u3068\u3044\u3048\u3070\u4e26\u884c\u51e6\u7406\u3067\u3059\u3088\u306d\u3002\u305b\u3063\u304b\u304f\u3067\u3059\u306e\u3067\u3001\u4ed6\u306e\u8a00\u8a9eJava 8 \/ Scala 2.11 \u3068\u6bd4\u8f03\u3057\u306a\u304c\u3089\u898b\u3066\u3044\u304d\u305f\u3044\u3068\u601d\u3044\u307e\u3059\u3002
\u7d9a\u304d\u3092\u8aad\u3080...<\/a><\/p>\n","protected":false},"author":23,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[18],"tags":[156,57,55],"_links":{"self":[{"href":"https:\/\/www.techscore.com\/blog\/wp-json\/wp\/v2\/posts\/5788"}],"collection":[{"href":"https:\/\/www.techscore.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.techscore.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.techscore.com\/blog\/wp-json\/wp\/v2\/users\/23"}],"replies":[{"embeddable":true,"href":"https:\/\/www.techscore.com\/blog\/wp-json\/wp\/v2\/comments?post=5788"}],"version-history":[{"count":36,"href":"https:\/\/www.techscore.com\/blog\/wp-json\/wp\/v2\/posts\/5788\/revisions"}],"predecessor-version":[{"id":11753,"href":"https:\/\/www.techscore.com\/blog\/wp-json\/wp\/v2\/posts\/5788\/revisions\/11753"}],"wp:attachment":[{"href":"https:\/\/www.techscore.com\/blog\/wp-json\/wp\/v2\/media?parent=5788"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.techscore.com\/blog\/wp-json\/wp\/v2\/categories?post=5788"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.techscore.com\/blog\/wp-json\/wp\/v2\/tags?post=5788"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}