Circ.Lib/Common/AutocompletationAlgorithm.cs

   1
   2 using System;
   3 using System.Collections.Generic;
   4 using System.Text;
   5
   6 namespace Circ.Lib
   7 {
   8         class StringsTree
   9         {
  10                 Dictionary<char, TreeNode> root = new Dictionary<char, TreeNode>();
  11                 StringBuilder sb = new StringBuilder(25);
  12
  13                 public StringsTree(string[] nicks)
  14                 {
  15                         BuildTree(nicks);
  16                 }
  17
  18                 public string FindApproximately(string partialNick)
  19                 {
  20                         TreeNode temp;
  21                         if (!root.TryGetValue(partialNick[0], out temp))
  22                                 return null;
  23
  24                         // Clean the buffer
  25                         sb.Remove(0, sb.Length);
  26                         // Add first character
  27                         sb.Append(partialNick[0]);
  28
  29                         for (int i = 1; i < partialNick.Length; i++) {
  30
  31                         }
  32                 }
  33
  34                 void
  35
  36                 void BuildTree(string[] nicks)
  37                 {
  38
  39                 }
  40
  41                 private class TreeNode
  42                 {
  43                         TreeNode                   father;
  44                         Dictionary<char, List<TreeNode>> childNodes = new Dictionary<char, List<TreeNode>>();
  45                         char                       value;
  46
  47                         public TreeNode(TreeNode father, char value)
  48                         {
  49                                 this.father = father;
  50                                 this.value  = value;
  51                         }
  52
  53                         public void AddChild(TreeNode child)
  54                         {
  55                                 if (!childNodes.ContainsKey(child.Value)) {
  56                                         List<TreeNode> temp = new List<TreeNode>();
  57                                         temp.Add(child);
  58                                         this.childNodes.Add(child.Value, temp);
  59                                 } else {
  60                                         this.childNodes[child.Value].Add(child);
  61                                 }
  62                         }
  63
  64                         public char Value {
  65                                 get {
  66                                         return value;
  67                                 }
  68                         }
  69
  70                         public TreeNode Father {
  71                                 get {
  72                                         return father;
  73                                 }
  74                         }
  75                 }
  76         }
  77 }