From fc70dcdc860796a543b6add79de97f87825acca0 Mon Sep 17 00:00:00 2001 From: komutan Date: Sat, 11 Jul 2015 12:11:17 +0900 Subject: [PATCH] --- src/LibNMeCab/Core/PriorityQueue.cs | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/src/LibNMeCab/Core/PriorityQueue.cs b/src/LibNMeCab/Core/PriorityQueue.cs index 7a13547..9f8a489 100644 --- a/src/LibNMeCab/Core/PriorityQueue.cs +++ b/src/LibNMeCab/Core/PriorityQueue.cs @@ -81,7 +81,7 @@ namespace NMeCab.Core public void Push(T item) { this.Count++; - this.rootNode = this.MergeNodes(this.rootNode, new HeapNode(item)); + this.rootNode = this.Merge(this.rootNode, new HeapNode(item)); } public T Peek() @@ -102,7 +102,7 @@ namespace NMeCab.Core this.rootNode = this.UnifyChilds(this.rootNode); } - private HeapNode MergeNodes(HeapNode l, HeapNode r) + private HeapNode Merge(HeapNode l, HeapNode r) { if (l == null) return r; if (r == null) return l; @@ -127,7 +127,7 @@ namespace NMeCab.Core { HeapNode x = node.PollFirstChild(); HeapNode y = node.PollFirstChild(); - tmp[i] = this.MergeNodes(x, y); + tmp[i] = this.Merge(x, y); } HeapNode z; @@ -138,7 +138,7 @@ namespace NMeCab.Core for (int i = tmp.Length - 1; i >= 0; i--) //逆順ループで配列をStackのように振る舞わせる { - z = this.MergeNodes(tmp[i], z); + z = this.Merge(tmp[i], z); } return z; -- 2.11.0