AvsAnLib.Internals.WordQuery.Query C# (CSharp) Метод

        public static AvsAn.Result Query(Node node, string word)
        {
            var depth = 0;
            Ratio result = node.ratio;
            int length = word.Length;
            while (true) {
                if (depth >= length) {
                    return new AvsAn.Result(result, word, depth);
                } else {
                    char c = word[depth];
                    if (c == '"' || c == '‘' || c == '’' || c == '“' || c == '”' || c == '$' || c == '\'') {
                        //ignore these characters at the start of a word.
                        depth++;
                    } else {
                        break;
                    }
                }
            }
            while (true) {
                if (node.SortedKids == null) {
                    break;
                }
                char c = depth == length ? ' ' : word[depth];
                int candidateIdx = node.SortedKids.Length - 1;
                int start = 0;
                //invariant: only LT nodes before start
                //invariant: only GTE nodes at or past candidateIdx *OR* needle doesn't exist.

                while (candidateIdx != start) {
                    int midpoint = candidateIdx + start >> 1;
                    if (node.SortedKids[midpoint].c < c) {
                        start = midpoint + 1;
                    } else {
                        candidateIdx = midpoint;
                    }
                }

                if (node.SortedKids[candidateIdx].c == c) {
                    node = node.SortedKids[candidateIdx];
                    depth++;
                    if (node.ratio.isSet) {
                        result = node.ratio;
                    }
                } else {
                    break;
                }

                if (depth > length) {
                    break;
                }
            }
            return new AvsAn.Result(result, word, depth);
        }