aboutsummaryrefslogtreecommitdiffstats
path: root/Software/Visual_Studio/MachineStudio/Modules/Tango.MachineStudio.Logging/Controls/TimeRuler.cs
blob: 552f8f416a1f9f15540edfacc511e0b8db9c054f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
using System;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows;
using System.Windows.Controls;
using System.Windows.Media;

namespace Tango.MachineStudio.Logging.Controls
{
    public class TimeRuler : Control
    {
        private double _smallStep;
        private double _bigStep;

        #region Private Methods

        private static T FindVisualParent<T>(DependencyObject child) where T : DependencyObject
        {
            // get parent item
            DependencyObject parentObject = VisualTreeHelper.GetParent(child);

            // we’ve reached the end of the tree
            if (parentObject == null) return null;

            // check if the parent matches the type we’re looking for
            T parent = parentObject as T;
            if (parent != null)
            {
                return parent;
            }
            else
            {
                // use recursion to proceed with next level
                return FindVisualParent<T>(parentObject);
            }
        }

        #endregion

        #region Properties

        public double RenderWidth
        {
            get { return (double)GetValue(RenderWidthProperty); }
            set { SetValue(RenderWidthProperty, value); }
        }
        public static readonly DependencyProperty RenderWidthProperty =
            DependencyProperty.Register("RenderWidth", typeof(double), typeof(TimeRuler), new FrameworkPropertyMetadata(400.0, FrameworkPropertyMetadataOptions.AffectsRender));

        public double HorizontalOffset
        {
            get { return (double)GetValue(HorizontalOffsetProperty); }
            set { SetValue(HorizontalOffsetProperty, value); }
        }
        public static readonly DependencyProperty HorizontalOffsetProperty =
            DependencyProperty.Register("HorizontalOffset", typeof(double), typeof(TimeRuler), new PropertyMetadata(0.0, HorizontalOffsetChanged));

        private static void HorizontalOffsetChanged(DependencyObject d, DependencyPropertyChangedEventArgs e)
        {
            var control = d as TimeRuler;
            control.Margin = new Thickness(-control.HorizontalOffset, 0, 0, 0);
            control.InvalidateVisual();
        }



        #region Zoom
        /// <summary>
        /// Gets or sets the zoom factor for the ruler. The default value is 1.0. 
        /// </summary>
        public double Zoom
        {
            get
            {
                return (double)GetValue(ZoomProperty);
            }
            set
            {
                SetValue(ZoomProperty, value);
                this.InvalidateVisual();
            }
        }

        private void SetSteps(double value)
        {
            if (value >= 50)
            {
                _smallStep = 0.25;
                _bigStep = 1;
            }
            else if (value >= 40)
            {
                _smallStep = 0.25;
                _bigStep = 2;
            }
            else if (value >= 30)
            {
                _smallStep = 0.5;
                _bigStep = 2;
            }
            else if (value >= 20)
            {
                _smallStep = 1;
                _bigStep = 5;
            }
            else if (value >= 10)
            {
                _smallStep = 1;
                _bigStep = 10;
            }
            else if (value >= 5)
            {
                _smallStep = 2;
                _bigStep = 20;
            }
            else if (value >= 3)
            {
                _smallStep = 5;
                _bigStep = 30;
            }
            else if (value >= 1)
            {
                _smallStep = 30;
                _bigStep = 300;
            }
            else if (value >= 0.5)
            {
                _smallStep = 60;
                _bigStep = 600;
            }
        }

        /// <summary>
        /// Identifies the Zoom dependency property.
        /// </summary>
        public static readonly DependencyProperty ZoomProperty =
            DependencyProperty.Register("Zoom", typeof(double), typeof(TimeRuler), new FrameworkPropertyMetadata((double)1.0, FrameworkPropertyMetadataOptions.AffectsRender, new PropertyChangedCallback(ZoomChanged)));

        private static void ZoomChanged(DependencyObject d, DependencyPropertyChangedEventArgs e)
        {
            (d as TimeRuler).SetSteps((double)e.NewValue);
        }


        #endregion

        #endregion

        #region Constructor

        public TimeRuler()
        {
            _smallStep = 1;
            _bigStep = 10;
            FontSize = 10;
            this.Loaded += TimeRuler_Loaded;
        }

        private void TimeRuler_Loaded(object sender, RoutedEventArgs e)
        {
            this.InvalidateVisual();
        }

        #endregion

        #region Methods

        /// <summary>
        /// Participates in rendering operations.
        /// </summary>
        /// <param name="drawingContext">The drawing instructions for a specific element. This context is provided to the layout system.</param>
        protected override void OnRender(DrawingContext drawingContext)
        {
            base.OnRender(drawingContext);

            double xDest = RenderWidth;
            int start = (int)(HorizontalOffset / Zoom);

            drawingContext.DrawRectangle(Background, new Pen(BorderBrush, 0), new Rect(new Point(start * Zoom, 0.0), new Point(xDest + (start * Zoom) + 100, Height)));
            drawingContext.DrawLine(new Pen(BorderBrush, 1), new Point(start * Zoom, Height - 1), new Point(xDest + (start * Zoom) + 100, Height));


            double l = (start % _smallStep);
            while (l != 0) //I don't know why, but this is needed in order to prevent ruler from flickering on some lower scale factors :/
            {
                start += 1;
                l = (start % _smallStep);
            }

            for (double dUnit = start; dUnit < (RenderWidth / Zoom) + (start) + 10; dUnit += _smallStep)
            {
                double d = dUnit * (this.Zoom);

                double startHeight;
                double endHeight;

                startHeight = Height;
                endHeight = ((dUnit % _bigStep == 0) ? (this.ActualHeight / 5) * 1.5 : this.ActualHeight / 5);

                drawingContext.DrawLine(new Pen(Foreground, 1), new Point(d, startHeight), new Point(d, (startHeight - endHeight)));

                double uu = (dUnit % _bigStep);

                if ((dUnit != 0.0) && (uu == 0) && (dUnit < (RenderWidth / Zoom) + start + 10))
                {
                    double u = dUnit;
                    TimeSpan t = TimeSpan.FromSeconds((u));

                    FormattedText ft = new FormattedText(t.ToString("g"),
                            CultureInfo.CurrentCulture,
                            FlowDirection.LeftToRight,
                            new Typeface(FontFamily.ToString()),
                            FontSize,
                            Foreground);
                    ft.SetFontWeight(FontWeight);
                    ft.TextAlignment = TextAlignment.Center;
                    drawingContext.DrawText(ft, new Point(d, (Height / 2) - (ft.Height / 2) - 2));
                }
            }
        }

        #endregion
    }
}
pan class="w"> } if (index == 0) return node; index--; node = node.right; } } } internal static int GetIndexFromNode(LineNode node) { int index = (node.left != null) ? node.left.nodeTotalCount : 0; while (node.parent != null) { if (node == node.parent.right) { if (node.parent.left != null) index += node.parent.left.nodeTotalCount; index++; } node = node.parent; } return index; } LineNode GetNodeByOffset(int offset) { Debug.Assert(offset >= 0); Debug.Assert(offset <= root.nodeTotalLength); if (offset == root.nodeTotalLength) { return root.RightMost; } LineNode node = root; while (true) { if (node.left != null && offset < node.left.nodeTotalLength) { node = node.left; } else { if (node.left != null) { offset -= node.left.nodeTotalLength; } offset -= node.TotalLength; if (offset < 0) return node; node = node.right; } } } internal static int GetOffsetFromNode(LineNode node) { int offset = (node.left != null) ? node.left.nodeTotalLength : 0; while (node.parent != null) { if (node == node.parent.right) { if (node.parent.left != null) offset += node.parent.left.nodeTotalLength; offset += node.parent.TotalLength; } node = node.parent; } return offset; } #endregion #region GetLineBy public DocumentLine GetByNumber(int number) { return GetNodeByIndex(number - 1); } public DocumentLine GetByOffset(int offset) { return GetNodeByOffset(offset); } #endregion #region LineCount public int LineCount { get { return root.nodeTotalCount; } } #endregion #region CheckProperties #if DEBUG [Conditional("DATACONSISTENCYTEST")] internal void CheckProperties() { Debug.Assert(root.nodeTotalLength == document.TextLength); CheckProperties(root); // check red-black property: int blackCount = -1; CheckNodeProperties(root, null, RED, 0, ref blackCount); } void CheckProperties(LineNode node) { int totalCount = 1; int totalLength = node.TotalLength; if (node.left != null) { CheckProperties(node.left); totalCount += node.left.nodeTotalCount; totalLength += node.left.nodeTotalLength; } if (node.right != null) { CheckProperties(node.right); totalCount += node.right.nodeTotalCount; totalLength += node.right.nodeTotalLength; } Debug.Assert(node.nodeTotalCount == totalCount); Debug.Assert(node.nodeTotalLength == totalLength); } /* 1. A node is either red or black. 2. The root is black. 3. All leaves are black. (The leaves are the NIL children.) 4. Both children of every red node are black. (So every red node must have a black parent.) 5. Every simple path from a node to a descendant leaf contains the same number of black nodes. (Not counting the leaf node.) */ void CheckNodeProperties(LineNode node, LineNode parentNode, bool parentColor, int blackCount, ref int expectedBlackCount) { if (node == null) return; Debug.Assert(node.parent == parentNode); if (parentColor == RED) { Debug.Assert(node.color == BLACK); } if (node.color == BLACK) { blackCount++; } if (node.left == null && node.right == null) { // node is a leaf node: if (expectedBlackCount == -1) expectedBlackCount = blackCount; else Debug.Assert(expectedBlackCount == blackCount); } CheckNodeProperties(node.left, node, node.color, blackCount, ref expectedBlackCount); CheckNodeProperties(node.right, node, node.color, blackCount, ref expectedBlackCount); } [System.Diagnostics.CodeAnalysis.SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")] public string GetTreeAsString() { StringBuilder b = new StringBuilder(); AppendTreeToString(root, b, 0); return b.ToString(); } static void AppendTreeToString(LineNode node, StringBuilder b, int indent) { if (node.color == RED) b.Append("RED "); else b.Append("BLACK "); b.AppendLine(node.ToString()); indent += 2; if (node.left != null) { b.Append(' ', indent); b.Append("L: "); AppendTreeToString(node.left, b, indent); } if (node.right != null) { b.Append(' ', indent); b.Append("R: "); AppendTreeToString(node.right, b, indent); } } #endif #endregion #region Insert/Remove lines public void RemoveLine(DocumentLine line) { RemoveNode(line); line.isDeleted = true; } public DocumentLine InsertLineAfter(DocumentLine line, int totalLength) { DocumentLine newLine = new DocumentLine(document); newLine.TotalLength = totalLength; InsertAfter(line, newLine); return newLine; } void InsertAfter(LineNode node, DocumentLine newLine) { LineNode newNode = newLine.InitLineNode(); if (node.right == null) { InsertAsRight(node, newNode); } else { InsertAsLeft(node.right.LeftMost, newNode); } } #endregion #region Red/Black Tree internal const bool RED = true; internal const bool BLACK = false; void InsertAsLeft(LineNode parentNode, LineNode newNode) { Debug.Assert(parentNode.left == null); parentNode.left = newNode; newNode.parent = parentNode; newNode.color = RED; UpdateAfterChildrenChange(parentNode); FixTreeOnInsert(newNode); } void InsertAsRight(LineNode parentNode, LineNode newNode) { Debug.Assert(parentNode.right == null); parentNode.right = newNode; newNode.parent = parentNode; newNode.color = RED; UpdateAfterChildrenChange(parentNode); FixTreeOnInsert(newNode); } void FixTreeOnInsert(LineNode node) { Debug.Assert(node != null); Debug.Assert(node.color == RED); Debug.Assert(node.left == null || node.left.color == BLACK); Debug.Assert(node.right == null || node.right.color == BLACK); LineNode parentNode = node.parent; if (parentNode == null) { // we inserted in the root -> the node must be black // since this is a root node, making the node black increments the number of black nodes // on all paths by one, so it is still the same for all paths. node.color = BLACK; return; } if (parentNode.color == BLACK) { // if the parent node where we inserted was black, our red node is placed correctly. // since we inserted a red node, the number of black nodes on each path is unchanged // -> the tree is still balanced return; } // parentNode is red, so there is a conflict here! // because the root is black, parentNode is not the root -> there is a grandparent node LineNode grandparentNode = parentNode.parent; LineNode uncleNode = Sibling(parentNode); if (uncleNode != null && uncleNode.color == RED) { parentNode.color = BLACK; uncleNode.color = BLACK; grandparentNode.color = RED; FixTreeOnInsert(grandparentNode); return; } // now we know: parent is red but uncle is black // First rotation: if (node == parentNode.right && parentNode == grandparentNode.left) { RotateLeft(parentNode); node = node.left; } else if (node == parentNode.left && parentNode == grandparentNode.right) { RotateRight(parentNode); node = node.right; } // because node might have changed, reassign variables: parentNode = node.parent; grandparentNode = parentNode.parent; // Now recolor a bit: parentNode.color = BLACK; grandparentNode.color = RED; // Second rotation: if (node == parentNode.left && parentNode == grandparentNode.left) { RotateRight(grandparentNode); } else { // because of the first rotation, this is guaranteed: Debug.Assert(node == parentNode.right && parentNode == grandparentNode.right); RotateLeft(grandparentNode); } } void RemoveNode(LineNode removedNode) { if (removedNode.left != null && removedNode.right != null) { // replace removedNode with it's in-order successor LineNode leftMost = removedNode.right.LeftMost; RemoveNode(leftMost); // remove leftMost from its current location // and overwrite the removedNode with it ReplaceNode(removedNode, leftMost); leftMost.left = removedNode.left; if (leftMost.left != null) leftMost.left.parent = leftMost; leftMost.right = removedNode.right; if (leftMost.right != null) leftMost.right.parent = leftMost; leftMost.color = removedNode.color; UpdateAfterChildrenChange(leftMost); if (leftMost.parent != null) UpdateAfterChildrenChange(leftMost.parent); return; } // now either removedNode.left or removedNode.right is null // get the remaining child LineNode parentNode = removedNode.parent; LineNode childNode = removedNode.left ?? removedNode.right; ReplaceNode(removedNode, childNode); if (parentNode != null) UpdateAfterChildrenChange(parentNode); if (removedNode.color == BLACK) { if (childNode != null && childNode.color == RED) { childNode.color = BLACK; } else { FixTreeOnDelete(childNode, parentNode); } } } void FixTreeOnDelete(LineNode node, LineNode parentNode) { Debug.Assert(node == null || node.parent == parentNode); if (parentNode == null) return; // warning: node may be null LineNode sibling = Sibling(node, parentNode); if (sibling.color == RED) { parentNode.color = RED; sibling.color = BLACK; if (node == parentNode.left) { RotateLeft(parentNode); } else { RotateRight(parentNode); } sibling = Sibling(node, parentNode); // update value of sibling after rotation } if (parentNode.color == BLACK && sibling.color == BLACK && GetColor(sibling.left) == BLACK && GetColor(sibling.right) == BLACK) { sibling.color = RED; FixTreeOnDelete(parentNode, parentNode.parent); return; } if (parentNode.color == RED && sibling.color == BLACK && GetColor(sibling.left) == BLACK && GetColor(sibling.right) == BLACK) { sibling.color = RED; parentNode.color = BLACK; return; } if (node == parentNode.left && sibling.color == BLACK && GetColor(sibling.left) == RED && GetColor(sibling.right) == BLACK) { sibling.color = RED; sibling.left.color = BLACK; RotateRight(sibling); } else if (node == parentNode.right && sibling.color == BLACK && GetColor(sibling.right) == RED && GetColor(sibling.left) == BLACK) { sibling.color = RED; sibling.right.color = BLACK; RotateLeft(sibling); } sibling = Sibling(node, parentNode); // update value of sibling after rotation sibling.color = parentNode.color; parentNode.color = BLACK; if (node == parentNode.left) { if (sibling.right != null) { Debug.Assert(sibling.right.color == RED); sibling.right.color = BLACK; } RotateLeft(parentNode); } else { if (sibling.left != null) { Debug.Assert(sibling.left.color == RED); sibling.left.color = BLACK; } RotateRight(parentNode); } } void ReplaceNode(LineNode replacedNode, LineNode newNode) { if (replacedNode.parent == null) { Debug.Assert(replacedNode == root); root = newNode; } else { if (replacedNode.parent.left == replacedNode) replacedNode.parent.left = newNode; else replacedNode.parent.right = newNode; } if (newNode != null) { newNode.parent = replacedNode.parent; } replacedNode.parent = null; } void RotateLeft(LineNode p) { // let q be p's right child LineNode q = p.right; Debug.Assert(q != null); Debug.Assert(q.parent == p); // set q to be the new root ReplaceNode(p, q); // set p's right child to be q's left child p.right = q.left; if (p.right != null) p.right.parent = p; // set q's left child to be p q.left = p; p.parent = q; UpdateAfterRotateLeft(p); } void RotateRight(LineNode p) { // let q be p's left child LineNode q = p.left; Debug.Assert(q != null); Debug.Assert(q.parent == p); // set q to be the new root ReplaceNode(p, q); // set p's left child to be q's right child p.left = q.right; if (p.left != null) p.left.parent = p; // set q's right child to be p q.right = p; p.parent = q; UpdateAfterRotateRight(p); } static LineNode Sibling(LineNode node) { if (node == node.parent.left) return node.parent.right; else return node.parent.left; } static LineNode Sibling(LineNode node, LineNode parentNode) { Debug.Assert(node == null || node.parent == parentNode); if (node == parentNode.left) return parentNode.right; else return parentNode.left; } static bool GetColor(LineNode node) { return node != null ? node.color : BLACK; } #endregion #region IList implementation DocumentLine IList<DocumentLine>.this[int index] { get { document.VerifyAccess(); return GetByNumber(1 + index); } set { throw new NotSupportedException(); } } int ICollection<DocumentLine>.Count { get { document.VerifyAccess(); return LineCount; } } bool ICollection<DocumentLine>.IsReadOnly { get { return true; } } int IList<DocumentLine>.IndexOf(DocumentLine item) { document.VerifyAccess(); if (item == null || item.IsDeleted) return -1; int index = item.LineNumber - 1; if (index < LineCount && GetNodeByIndex(index) == item) return index; else return -1; } void IList<DocumentLine>.Insert(int index, DocumentLine item) { throw new NotSupportedException(); } void IList<DocumentLine>.RemoveAt(int index) { throw new NotSupportedException(); } void ICollection<DocumentLine>.Add(DocumentLine item) { throw new NotSupportedException(); } void ICollection<DocumentLine>.Clear() { throw new NotSupportedException(); } bool ICollection<DocumentLine>.Contains(DocumentLine item) { IList<DocumentLine> self = this; return self.IndexOf(item) >= 0; } void ICollection<DocumentLine>.CopyTo(DocumentLine[] array, int arrayIndex) { if (array == null) throw new ArgumentNullException("array"); if (array.Length < LineCount) throw new ArgumentException("The array is too small", "array"); if (arrayIndex < 0 || arrayIndex + LineCount > array.Length) throw new ArgumentOutOfRangeException("arrayIndex", arrayIndex, "Value must be between 0 and " + (array.Length - LineCount)); foreach (DocumentLine ls in this) { array[arrayIndex++] = ls; } } bool ICollection<DocumentLine>.Remove(DocumentLine item) { throw new NotSupportedException(); } public IEnumerator<DocumentLine> GetEnumerator() { document.VerifyAccess(); return Enumerate(); } IEnumerator<DocumentLine> Enumerate() { document.VerifyAccess(); DocumentLine line = root.LeftMost; while (line != null) { yield return line; line = line.NextLine; } } System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator() { return this.GetEnumerator(); } #endregion } }