From a1a2711abfc594f2be1da51df95ddcd7071ddebd Mon Sep 17 00:00:00 2001
From: Ben Longbons <b.r.longbons@gmail.com>
Date: Wed, 2 Mar 2011 13:52:33 -0800
Subject: Recode from SHIFT-JIS to unicode, then undo the conversion of
 backslashs and tildes.

---
 src/common/db.c | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

(limited to 'src/common/db.c')

diff --git a/src/common/db.c b/src/common/db.c
index 7a4fa70..07b08c8 100644
--- a/src/common/db.c
+++ b/src/common/db.c
@@ -211,7 +211,7 @@ static void db_rebalance (struct dbn *p, struct dbn **root)
 {
     p->color = RED;
     while (p != *root && p->parent->color == RED)
-    {                           // rootは必ず黒で親は赤いので親の親は必ず存在する
+    {                           // root縺ｯ蠢�縺夐ｻ偵〒隕ｪ縺ｯ襍､縺�縺ｮ縺ｧ隕ｪ縺ｮ隕ｪ縺ｯ蠢�縺壼ｭ伜惠縺吶ｋ
         if (p->parent == p->parent->parent->left)
         {
             struct dbn *y = p->parent->parent->right;
@@ -276,7 +276,7 @@ static void db_rebalance_erase (struct dbn *z, struct dbn **root)
         x = y->right;
     }
     if (y != z)
-    {                           // 左右が両方埋まっていた時 yをzの位置に持ってきてzを浮かせる
+    {                           // 蟾ｦ蜿ｳ縺御ｸ｡譁ｹ蝓九∪縺｣縺ｦ縺�縺滓凾 y繧築縺ｮ菴咲ｽｮ縺ｫ謖√▲縺ｦ縺阪※z繧呈ｵｮ縺九○繧�
         z->left->parent = y;
         y->left = z->left;
         if (y != z->right)
@@ -305,7 +305,7 @@ static void db_rebalance_erase (struct dbn *z, struct dbn **root)
         y = z;
     }
     else
-    {                           // どちらか空いていた場合 xをzの位置に持ってきてzを浮かせる
+    {                           // 縺ｩ縺｡繧峨°遨ｺ縺�縺ｦ縺�縺溷�ｴ蜷� x繧築縺ｮ菴咲ｽｮ縺ｫ謖√▲縺ｦ縺阪※z繧呈ｵｮ縺九○繧�
         x_parent = y->parent;
         if (x)
             x->parent = y->parent;
@@ -316,9 +316,9 @@ static void db_rebalance_erase (struct dbn *z, struct dbn **root)
         else
             z->parent->right = x;
     }
-    // ここまで色の移動の除いて通常の2分木と同じ
+    // 縺薙％縺ｾ縺ｧ濶ｲ縺ｮ遘ｻ蜍輔�ｮ髯､縺�縺ｦ騾壼ｸｸ縺ｮ2蛻�譛ｨ縺ｨ蜷後§
     if (y->color != RED)
-    {                           // 赤が消える分には影響無し
+    {                           // 襍､縺梧ｶ医∴繧句��縺ｫ縺ｯ蠖ｱ髻ｿ辟｡縺�
         while (x != *root && (x == NULL || x->color == BLACK))
             if (x == x_parent->left)
             {
@@ -498,7 +498,7 @@ void db_foreach (struct dbt *table, int (*func) (void *, void *, va_list),
                  ...)
 {
     int  i, sp;
-    // red-black treeなので64個stackがあれば2^32個ノードまで大丈夫
+    // red-black tree縺ｪ縺ｮ縺ｧ64蛟虐tack縺後≠繧後�ｰ2^32蛟九ヮ繝ｼ繝峨∪縺ｧ螟ｧ荳亥､ｫ
     struct dbn *p, *pn, *stack[64];
     va_list ap;
 
-- 
cgit v1.2.3-70-g09d2