FixedSOMLineRanges.cs source code in C# .NET

Source code for the .NET framework in C#

                        
Code:

                         / Dotnetfx_Vista_SP2 / Dotnetfx_Vista_SP2 / 8.0.50727.4016 / DEVDIV / depot / DevDiv / releases / Orcas / QFE / wpf / src / Framework / System / Windows / Documents / FixedSOMLineRanges.cs / 1 / FixedSOMLineRanges.cs
                        

                        
                            /*++ 

    File: FixedSOMLineRanges.cs

    Copyright (C) 2005 Microsoft Corporation. All rights reserved. 

    Description: 
        Internal helper class that can store a set of sorted lines by their start and end indices 

    History: 
       05/17/2005: eleese - Created

--*/
 
namespace System.Windows.Documents
{ 
    using System.Collections; 
    using System.Collections.Generic;
    using System.Windows.Shapes; 
    using System.Windows.Controls;
    using System.Diagnostics;
    using System.Windows.Media;
 
    internal class FixedSOMLineRanges
    { 
        public void AddRange(double start, double end) 
        {
            for (int i = 0; i < Start.Count; ) 
            {
                if (start > End[i] + _minLineSeparation)
                {
                    i++; 
                }
                else if (end + _minLineSeparation < Start[i]) 
                { 
                    Start.Insert(i, start);
                    End.Insert(i, end); 
                    return;
                }
                else
                { 
                    // overlap !!
                    if (Start[i] < start) 
                    { 
                        start = Start[i];
                    } 
                    if (End[i] > end)
                    {
                        end = End[i];
                    } 
                    Start.RemoveAt(i);
                    End.RemoveAt(i); 
                } 
            }
            Start.Add(start); 
            End.Add(end);
        }

        public int GetLineAt(double line) 
        {
            //use binary search 
            int startIndex = 0; 
            int endIndex = Start.Count - 1;
            while (endIndex > startIndex) 
            {
                int i = (startIndex + endIndex) >> 1;
                // Invariant: i < endIndex
                if (line > End[i]) 
                {
                    startIndex = i + 1; 
                } 
                else
                { 
                    endIndex = i;
                }
            }
 
            if (startIndex == endIndex && line <= End[startIndex] && line >= Start[startIndex])
            { 
                return startIndex; 
            }
            else 
            {
                return -1;
            }
        } 

        public double Line 
        { 
            set { _line = value; }
            get { return _line; } 
        }

        public List Start
        { 
            get
            { 
                if (_start == null) 
                {
                    _start = new List(); 
                }
                return _start;
            }
        } 

        public List End 
        { 
            get
            { 
                if (_end == null)
                {
                    _end = new List();
                } 
                return _end;
            } 
        } 

        public int Count 
        {
            get { return Start.Count; }
        }
 
        static public double MinLineSeparation
        { 
            get { return _minLineSeparation; } 
        }
 
        private double _line; // X or Y value for set of lines
        private List _start; // where lines start.  Invariant: _start[i] < _end[i]
        private List _end; // where lines end.  Invariant: _end[i] < _start[i+1]
 
        private const double _minLineSeparation = 3; // lines closer than this are considered one line
    } 
 

} 



// File provided for Reference Use Only by Microsoft Corporation (c) 2007.
// Copyright (c) Microsoft Corporation. All rights reserved.
/*++ 

    File: FixedSOMLineRanges.cs

    Copyright (C) 2005 Microsoft Corporation. All rights reserved. 

    Description: 
        Internal helper class that can store a set of sorted lines by their start and end indices 

    History: 
       05/17/2005: eleese - Created

--*/
 
namespace System.Windows.Documents
{ 
    using System.Collections; 
    using System.Collections.Generic;
    using System.Windows.Shapes; 
    using System.Windows.Controls;
    using System.Diagnostics;
    using System.Windows.Media;
 
    internal class FixedSOMLineRanges
    { 
        public void AddRange(double start, double end) 
        {
            for (int i = 0; i < Start.Count; ) 
            {
                if (start > End[i] + _minLineSeparation)
                {
                    i++; 
                }
                else if (end + _minLineSeparation < Start[i]) 
                { 
                    Start.Insert(i, start);
                    End.Insert(i, end); 
                    return;
                }
                else
                { 
                    // overlap !!
                    if (Start[i] < start) 
                    { 
                        start = Start[i];
                    } 
                    if (End[i] > end)
                    {
                        end = End[i];
                    } 
                    Start.RemoveAt(i);
                    End.RemoveAt(i); 
                } 
            }
            Start.Add(start); 
            End.Add(end);
        }

        public int GetLineAt(double line) 
        {
            //use binary search 
            int startIndex = 0; 
            int endIndex = Start.Count - 1;
            while (endIndex > startIndex) 
            {
                int i = (startIndex + endIndex) >> 1;
                // Invariant: i < endIndex
                if (line > End[i]) 
                {
                    startIndex = i + 1; 
                } 
                else
                { 
                    endIndex = i;
                }
            }
 
            if (startIndex == endIndex && line <= End[startIndex] && line >= Start[startIndex])
            { 
                return startIndex; 
            }
            else 
            {
                return -1;
            }
        } 

        public double Line 
        { 
            set { _line = value; }
            get { return _line; } 
        }

        public List Start
        { 
            get
            { 
                if (_start == null) 
                {
                    _start = new List(); 
                }
                return _start;
            }
        } 

        public List End 
        { 
            get
            { 
                if (_end == null)
                {
                    _end = new List();
                } 
                return _end;
            } 
        } 

        public int Count 
        {
            get { return Start.Count; }
        }
 
        static public double MinLineSeparation
        { 
            get { return _minLineSeparation; } 
        }
 
        private double _line; // X or Y value for set of lines
        private List _start; // where lines start.  Invariant: _start[i] < _end[i]
        private List _end; // where lines end.  Invariant: _end[i] < _start[i+1]
 
        private const double _minLineSeparation = 3; // lines closer than this are considered one line
    } 
 

} 



// File provided for Reference Use Only by Microsoft Corporation (c) 2007.
// Copyright (c) Microsoft Corporation. All rights reserved.

Link Menu

Network programming in C#, Network Programming in VB.NET, Network Programming in .NET
This book is available now!
Buy at Amazon US or
Buy at Amazon UK