iTextSharp.text.pdf.hyphenation.TernaryTree.Find C# (CSharp) Method

        public int Find(char[] key, int start) {
            int d;
            char p = root;
            int i = start;
            char c;

            while (p != 0) {
                if (sc[p] == 0xFFFF) {
                    if (Strcmp(key, i, kv.Arr, lo[p]) == 0)
                        return eq[p];
                    else
                        return -1;
                }
                c = key[i];
                d = c - sc[p];
                if (d == 0) {
                    if (c == 0)
                        return eq[p];
                    i++;
                    p = eq[p];
                } else if (d < 0)
                    p = lo[p];
                else
                    p = hi[p];
            }
            return -1;
        }

        private void Compact(CharVector kx, TernaryTree map, char p)
        {
            int k;

            if (p == 0)
            {
                return;
            }
            if (sc[p] == 0xFFFF)
            {
                k = map.Find(kv.Arr, lo[p]);
                if (k < 0)
                {
                    k = kx.Alloc(Strlen(kv.Arr, lo[p]) + 1);
                    Strcpy(kx.Arr, k, kv.Arr, lo[p]);
                    map.Insert(kx.Arr, k, (char)k);
                }
                lo[p] = (char)k;
            }
            else
            {
                Compact(kx, map, lo[p]);
                if (sc[p] != 0)
                {
                    Compact(kx, map, eq[p]);
                }
                Compact(kx, map, hi[p]);
            }
        }