示例#1
0
        /// <summary>
        /// Performans a "stab" query with a single value. All items with overlapping ranges are returned.
        /// </summary>
        /// <param name="value">The value.</param>
        /// <returns>The resulting <see cref="List{T}"/></returns>
        public List <T> Query(TKey value)
        {
            var results = new List <T>();

            // If the node has items, check their ranges.
            if (items != null)
            {
                foreach (var o in items)
                {
                    if (o.Range.From.CompareTo(value) > 0)
                    {
                        break;
                    }
                    else if (o.Range.Contains(value))
                    {
                        results.Add(o);
                    }
                }
            }

            // go to the left or go to the right of the tree, depending
            // where the query value lies compared to the center
            if (value.CompareTo(center) < 0 && leftNode != null)
            {
                results.AddRange(leftNode.Query(value));
            }
            else if (value.CompareTo(center) > 0 && rightNode != null)
            {
                results.AddRange(rightNode.Query(value));
            }

            return(results);
        }
示例#2
0
        /// <summary>
        /// Performs a point query with a single value.
        /// All items with overlapping ranges are returned.
        /// </summary>
        public IEnumerable <TValue> Query(TKey value)
        {
            var results = new List <TValue>();

            // If the node has items, check for leaves containing the value.
            if (items != null)
            {
                foreach (var o in items)
                {
                    if (comparer.Compare(o.From, value) > 0)
                    {
                        break;
                    }
                    else if (comparer.Compare(value, o.From) >= 0 && comparer.Compare(value, o.To) <= 0)
                    {
                        results.Add(o.Value);
                    }
                }
            }

            // go to the left or go to the right of the tree, depending
            // where the query value lies compared to the center
            var centerComp = comparer.Compare(value, center);

            if (leftNode != null && centerComp < 0)
            {
                results.AddRange(leftNode.Query(value));
            }
            else if (rightNode != null && centerComp > 0)
            {
                results.AddRange(rightNode.Query(value));
            }

            return(results);
        }
示例#3
0
        public IEnumerable <TValue> Query(TKey value)
        {
            if (!isInSync)
            {
                Rebuild();
            }

            return(root.Query(value));
        }
示例#4
0
        /// <summary>
        /// Performans a "stab" query with a single value. All items with overlapping ranges are returned.
        /// </summary>
        /// <param name="value">The value.</param>
        /// <returns>The resulting <see cref="List{T}"/></returns>
        public List <T> Query(TKey value)
        {
            if (!isInSync && autoRebuild)
            {
                Rebuild();
            }

            return(root.Query(value));
        }