C# (CSharp) System.ServiceModel.Dispatcher IntervalTreeTraverser Examples

Example #1

File: QueryIntervalOp.cs Project: dox0/DotNet471RS3

        void Match(int valIndex, double point, QueryBranchResultSet results)
        {
            IntervalTreeTraverser traverser = new IntervalTreeTraverser(point, this.intervalTree.Root);

            while (traverser.MoveNext())
            {
                IntervalCollection matches = traverser.Slot;
                for (int i = 0, count = matches.Count; i < count; ++i)
                {
                    QueryBranch branch = matches[i].Branch;
                    if (null != branch)
                    {
                        results.Add(branch, valIndex);
                    }
                }
            }
        }

Example #2

File: IntervalBranchIndex.cs Project: pritesh-mandowara-sp/DecompliedDotNetLibraries

 private void Match(int valIndex, double point, QueryBranchResultSet results)
 {
     IntervalTreeTraverser traverser = new IntervalTreeTraverser(point, this.intervalTree.Root);
     while (traverser.MoveNext())
     {
         IntervalCollection slot = traverser.Slot;
         int num = 0;
         int count = slot.Count;
         while (num < count)
         {
             QueryBranch branch = slot[num].Branch;
             if (branch != null)
             {
                 results.Add(branch, valIndex);
             }
             num++;
         }
     }
 }

Example #3

        private void Match(int valIndex, double point, QueryBranchResultSet results)
        {
            IntervalTreeTraverser traverser = new IntervalTreeTraverser(point, this.intervalTree.Root);

            while (traverser.MoveNext())
            {
                IntervalCollection slot = traverser.Slot;
                int num   = 0;
                int count = slot.Count;
                while (num < count)
                {
                    QueryBranch branch = slot[num].Branch;
                    if (branch != null)
                    {
                        results.Add(branch, valIndex);
                    }
                    num++;
                }
            }
        }

Example #4

File: QueryIntervalOp.cs Project: iskiselev/JSIL.NetFramework

 void Match(int valIndex, double point, QueryBranchResultSet results)
 {
     IntervalTreeTraverser traverser = new IntervalTreeTraverser(point, this.intervalTree.Root);
     while (traverser.MoveNext())
     {
         IntervalCollection matches = traverser.Slot;
         for (int i = 0, count = matches.Count; i < count; ++i)
         {
             QueryBranch branch = matches[i].Branch;
             if (null != branch)
             {
                 results.Add(branch, valIndex);
             }
         }
     }
 }