aboutsummaryrefslogtreecommitdiffstats
path: root/Software/Visual_Studio/SideChains/RealTimeGraphEx/FastGraphs/RealTimeGraphExShapeErase.cs
blob: 0268b08c161f1ab2895a1ce0758b94a8ee229df1 (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
pre { line-height: 125%; }
td.linenos .normal { color: inherit; background-color: transparent; padding-left: 5px; padding-right: 5px; }
span.linenos { color: inherit; background-color: transparent; padding-left: 5px; padding-right: 5px; }
td.linenos .special { color: #000000; background-color: #ffffc0; padding-left: 5px; padding-right: 5px; }
span.linenos.special { color: #000000; background-color: #ffffc0; padding-left: 5px; padding-right: 5px; }
.highlight .hll { background-color: #ffffcc }
.highlight .c { color: #888888 } /* Comment */
.highlight .err { color: #a61717; background-color: #e3d2d2 } /* Error */
.highlight .k { color: #008800; font-weight: bold } /* Keyword */
.highlight .ch { color: #888888 } /* Comment.Hashbang */
.highlight .cm { color: #888888 } /* Comment.Multiline */
.highlight .cp { color: #cc0000; font-weight: bold } /* Comment.Preproc */
.highlight .cpf { color: #888888 } /* Comment.PreprocFile */
.highlight .c1 { color: #888888 } /* Comment.Single */
.highlight .cs { color: #cc0000; font-weight: bold; background-color: #fff0f0 } /* Comment.Special */
.highlight .gd { color: #000000; background-color: #ffdddd } /* Generic.Deleted */
.highlight .ge { font-style: italic } /* Generic.Emph */
.highlight .ges { font-weight: bold; font-style: italic } /* Generic.EmphStrong */
.highlight .gr { color: #aa0000 } /* Generic.Error */
.highlight .gh { color: #333333 } /* Generic.Heading */
.highlight .gi { color: #000000; background-color: #ddffdd } /* Generic.Inserted */
.highlight .go { color: #888888 } /* Generic.Output */
.highlight .gp { color: #555555 } /* Generic.Prompt */
.highlight .gs { font-weight: bold } /* Generic.Strong */
.highlight .gu { color: #666666 } /* Generic.Subheading */
.highlight .gt { color: #aa0000 } /* Generic.Traceback */
.highlight .kc { color: #008800; font-weight: bold } /* Keyword.Constant */
.highlight .kd { color: #008800; font-weight: bold } /* Keyword.Declaration */
.highlight .kn { color: #008800; font-weight: bold } /* Keyword.Namespace */
.highlight .kp { color: #008800 } /* Keyword.Pseudo */
.highlight .kr { color: #008800; font-weight: bold } /* Keyword.Reserved */
.highlight .kt { color: #888888; font-weight: bold } /* Keyword.Type */
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows;
using System.Windows.Media;
using System.Windows.Media.Imaging;
using RealTimeGraphEx.Models;
using RealTimeGraphEx.Enums;

namespace RealTimeGraphEx.FastGraphs
{
    public class RealTimeGraphExShapeErase : RealTimeGraphExShapeScroll
    {
        #region Cross Thread Fields

        protected Color _markerColor;
        protected bool _showMarker;
        protected bool _endReached;
        protected int _currentReplaceIndex;

        #endregion

        #region Properties

        /// <summary>
        /// Gets or sets the graph marker color.
        /// </summary>
        public Color MarkerColor
        {
            get { return (Color)GetValue(MarkerColorProperty); }
            set { SetValue(MarkerColorProperty, value); }
        }
        public static readonly DependencyProperty MarkerColorProperty =
            DependencyProperty.Register("MarkerBrush", typeof(Color), typeof(RealTimeGraphExShapeErase), new PropertyMetadata(Colors.Red, new PropertyChangedCallback(CrossModelChanged)));

        /// <summary>
        /// Gets or sets whether to display the marker on the graph.
        /// </summary>
        public bool ShowMarker
        {
            get { return (bool)GetValue(ShowMarkerProperty); }
            set { SetValue(ShowMarkerProperty, value); }
        }
        public static readonly DependencyProperty ShowMarkerProperty =
            DependencyProperty.Register("ShowMarker", typeof(bool), typeof(RealTimeGraphExShapeErase), new PropertyMetadata(true, new PropertyChangedCallback(CrossModelChanged)));

        #endregion

        #region Constructors

        public RealTimeGraphExShapeErase()
            : base()
        {
           
        }

        #endregion

        #region Override Method

        protected override void OnSetCrossThreadFields()
        {
            base.OnSetCrossThreadFields();

            this.Dispatcher.Invoke(() =>
            {
                _markerColor = MarkerColor;
                _showMarker = ShowMarker;

            }, System.Windows.Threading.DispatcherPriority.Send);
        }

        protected override void OnClearGraph()
        {
            base.OnClearGraph();

            _currentReplaceIndex = 0;
            _endReached = false;
        }

        protected internal override void OnRenderGraph()
        {
            if (_graphController != null && _graphController.dataSeries.Points != null && _graphController.dataSeries.Points.Count > 0  && _width > 1 && _height > 1)
            {
                for (int i = 0; i < _graphController.dataSeries.Points.Count; i++)
                {
                    double value = _graphController.dataSeries.Points[i];
                    NormalizeValue(ref value);
                    double valuePrecentage = ConvertYToImageYFliped(value);

                    if (xValueCounter <= _width)
                    {
                        if (!_endReached)
                        {
                            graphColumns.Add((int)xValueCounter, (int)valuePrecentage, (int)xValueCounter + _shapeWidth, (int)(_maximum - valuePrecentage), (int)value);
                            xValueCounter += (_shapeWidth + _shapeGap + 1);
                            currentColumnIndex = graphColumns.TotalColumns - 1;
                        }
                        else
                        {
                            currentColumnIndex = _currentReplaceIndex;
                            graphColumns.Replace((int)xValueCounter, (int)valuePrecentage, (int)xValueCounter + _shapeWidth, (int)(_maximum - valuePrecentage), (int)value, _currentReplaceIndex++);
                            xValueCounter += (_shapeWidth + _shapeGap + 1);

                            if (xValueCounter > _width)
                            {
                                xValueCounter = 0;
                                _currentReplaceIndex = 0;
                            }
                        }
                    }
                    else
                    {
                        _endReached = true;
                        xValueCounter = 0;
                        currentColumnIndex = 0;
                        currentColumnIndex = currentColumnIndex = graphColumns.TotalColumns - 1;
                        graphColumns.Replace((int)xValueCounter, (int)valuePrecentage, (int)xValueCounter + _shapeWidth, (int)(_maximum - valuePrecentage), (int)value, _currentReplaceIndex++);
                        xValueCounter += (_shapeWidth + _shapeGap + 1);
                    }
                }

                updateCounter++;

                if (updateCounter >= 1 && !_isPaused)
                {
                    updateCounter = 0;

                    if (!_disableRendering)
                    {
                        WriteableBitmap bmp = BitmapFactory.New((int)_width, (int)_height);
                        bmp.Clear(Colors.Transparent);

                        Color lineColor = _graphController.dataSeries.GetStrokeColor() != null ? _graphController.dataSeries.GetStrokeColor().Value : _stroke;
                        Color fillColor = _graphController.dataSeries.GetFillColor() != null ? _graphController.dataSeries.GetFillColor().Value : _fill;

                        int right = graphColumns.TotalColumns - currentColumnIndex;
                        double r_opacity = right > 0 ? 255 / right : 255;
                        double l_opacity = currentColumnIndex > 0 ? 255 / currentColumnIndex : 255;

                        for (int i = 0; i < graphColumns.TotalColumns; i++)
                        {
                            var rec = graphColumns.Columns[i];
                            Color processedLineColor = lineColor;
                            Color processedFillColor = fillColor;

                            switch (_shapeType)
                            {
                                case ShapeTypeEnum.Column:
                                    #region Column

                                    int calculatedOpacity = 255;
                                    if (_opacityAnimationType == OpacityTypeEnum.FadeOut)
                                    {
                                        byte opacity = (byte)((((rec.X) * 100 / _width) * 255) / 100);
                                        processedLineColor.A = opacity;
                                        processedFillColor.A = opacity;
                                    }
                                    else if (_opacityAnimationType == OpacityTypeEnum.CrossFade)
                                    {
                                        if (i < currentColumnIndex && currentColumnIndex > 0)
                                        {
                                            calculatedOpacity = (int)((i + 1) * l_opacity);
                                        }
                                        else
                                        {
                                            calculatedOpacity = (int)(((right) - Math.Abs(currentColumnIndex - (i))) * r_opacity);
                                        }

                                        byte opacity = (byte)(calculatedOpacity);

                                        processedLineColor.A = opacity;
                                        processedFillColor.A = opacity;
                                    }

                                    if (_fillGraph)
                                    {
                                        bmp.FillRectangle(rec.X, rec.Y, rec.Right, rec.Bottom, processedFillColor);
                                        bmp.DrawRectangle(rec.X, rec.Y, rec.Right, rec.Bottom, processedLineColor);
                                    }
                                    else
                                    {
                                        bmp.DrawRectangle(rec.X, rec.Y, rec.Right, rec.Bottom, processedLineColor);
                                    }
                                    #endregion
                                    break;
                                case ShapeTypeEnum.Circle:
                                    #region Circle
                                    calculatedOpacity = 255;

                                    if (_opacityAnimationType == OpacityTypeEnum.FadeOut)
                                    {
                                        byte opacity = (byte)((((rec.X) * 100 / _width) * 255) / 100);
                                        processedLineColor.A = opacity;
                                        processedFillColor.A = opacity;
                                    }
                                    else if (_opacityAnimationType == OpacityTypeEnum.CrossFade)
                                    {
                                        if (i < currentColumnIndex && currentColumnIndex > 0)
                                        {
                                            calculatedOpacity = (int)((i + 1) * l_opacity);
                                        }
                                        else
                                        {
                                            calculatedOpacity = (int)(((right) - Math.Abs(currentColumnIndex - (i))) * r_opacity);
                                        }

                                        byte opacity = (byte)(calculatedOpacity);

                                        processedLineColor.A = opacity;
                                        processedFillColor.A = opacity;
                                    }

                                    if (_fillGraph)
                                    {
                                        bmp.FillEllipseCentered(rec.X, rec.Y, _shapeWidth, _shapeWidth, processedFillColor);
                                        bmp.DrawEllipseCentered(rec.X, rec.Y, _shapeWidth, _shapeWidth, processedLineColor);
                                    }
                                    else
                                    {
                                        bmp.DrawEllipseCentered(rec.X, rec.Y, _shapeWidth, _shapeWidth, processedLineColor);
                                    }
                                    #endregion
                                    break;
                                case ShapeTypeEnum.Rectangle:
                                    #region Rectangle
                                    calculatedOpacity = 255;

                                    if (_opacityAnimationType == OpacityTypeEnum.FadeOut)
                                    {
                                        byte opacity = (byte)((((rec.X) * 100 / _width) * 255) / 100);
                                        processedLineColor.A = opacity;
                                        processedFillColor.A = opacity;
                                    }
                                    else if (_opacityAnimationType == OpacityTypeEnum.CrossFade)
                                    {
                                        if (i < currentColumnIndex && currentColumnIndex > 0)
                                        {
                                            calculatedOpacity = (int)((i + 1) * l_opacity);
                                        }
                                        else
                                        {
                                            calculatedOpacity = (int)(((right) - Math.Abs(currentColumnIndex - (i))) * r_opacity);
                                        }

                                        byte opacity = (byte)(calculatedOpacity);

                                        processedLineColor.A = opacity;
                                        processedFillColor.A = opacity;
                                    }

                                    if (_fillGraph)
                                    {
                                        bmp.FillRectangle(rec.X, rec.Y, rec.X + _shapeWidth, rec.Y + _shapeWidth, processedFillColor);
                                        bmp.DrawRectangle(rec.X, rec.Y, rec.X + _shapeWidth, rec.Y + _shapeWidth, processedLineColor);
                                    }
                                    else
                                    {
                                        bmp.DrawRectangle(rec.X, rec.Y, rec.X + _shapeWidth, rec.Y + _shapeWidth, processedLineColor);
                                    }
                                    #endregion
                                    break;
                            }

                        }

                        if (_showMarker)
                        {
                            bmp.DrawLine((int)(xValueCounter), 0, (int)(xValueCounter), (int)_height, _markerColor);
                        }

                        bmp.Freeze();

                        img.Dispatcher.BeginInvoke(new Action(() =>
                        {
                            img.Source = bmp;
                        }), System.Windows.Threading.DispatcherPriority.Send);
                    }
                }
            }
        }

        #endregion
    }
}
// that do not start at node. foreach (CollapsedLineSection cs in node.lineNode.collapsedSections) { if (cs.Start != node.documentLine) newNode.AddDirectlyCollapsed(cs); } } InsertAsLeft(node, newNode); } return newNode; } #endregion #region Rotation callbacks enum UpdateAfterChildrenChangeRecursionMode { None, IfRequired, WholeBranch } static void UpdateAfterChildrenChange(HeightTreeNode node) { UpdateAugmentedData(node, UpdateAfterChildrenChangeRecursionMode.IfRequired); } static void UpdateAugmentedData(HeightTreeNode node, UpdateAfterChildrenChangeRecursionMode mode) { int totalCount = 1; double totalHeight = node.lineNode.TotalHeight; if (node.left != null) { totalCount += node.left.totalCount; totalHeight += node.left.totalHeight; } if (node.right != null) { totalCount += node.right.totalCount; totalHeight += node.right.totalHeight; } if (node.IsDirectlyCollapsed) totalHeight = 0; if (totalCount != node.totalCount || !totalHeight.IsClose(node.totalHeight) || mode == UpdateAfterChildrenChangeRecursionMode.WholeBranch) { node.totalCount = totalCount; node.totalHeight = totalHeight; if (node.parent != null && mode != UpdateAfterChildrenChangeRecursionMode.None) UpdateAugmentedData(node.parent, mode); } } void UpdateAfterRotateLeft(HeightTreeNode node) { // node = old parent // node.parent = pivot, new parent var collapsedP = node.parent.collapsedSections; var collapsedQ = node.collapsedSections; // move collapsedSections from old parent to new parent node.parent.collapsedSections = collapsedQ; node.collapsedSections = null; // split the collapsedSections from the new parent into its old children: if (collapsedP != null) { foreach (CollapsedLineSection cs in collapsedP) { if (node.parent.right != null) node.parent.right.AddDirectlyCollapsed(cs); node.parent.lineNode.AddDirectlyCollapsed(cs); if (node.right != null) node.right.AddDirectlyCollapsed(cs); } } MergeCollapsedSectionsIfPossible(node); UpdateAfterChildrenChange(node); // not required: rotations only happen on insertions/deletions // -> totalCount changes -> the parent is always updated //UpdateAfterChildrenChange(node.parent); } void UpdateAfterRotateRight(HeightTreeNode node) { // node = old parent // node.parent = pivot, new parent var collapsedP = node.parent.collapsedSections; var collapsedQ = node.collapsedSections; // move collapsedSections from old parent to new parent node.parent.collapsedSections = collapsedQ; node.collapsedSections = null; // split the collapsedSections from the new parent into its old children: if (collapsedP != null) { foreach (CollapsedLineSection cs in collapsedP) { if (node.parent.left != null) node.parent.left.AddDirectlyCollapsed(cs); node.parent.lineNode.AddDirectlyCollapsed(cs); if (node.left != null) node.left.AddDirectlyCollapsed(cs); } } MergeCollapsedSectionsIfPossible(node); UpdateAfterChildrenChange(node); // not required: rotations only happen on insertions/deletions // -> totalCount changes -> the parent is always updated //UpdateAfterChildrenChange(node.parent); } // node removal: // a node in the middle of the tree is removed as following: // its successor is removed // it is replaced with its successor void BeforeNodeRemove(HeightTreeNode removedNode) { Debug.Assert(removedNode.left == null || removedNode.right == null); var collapsed = removedNode.collapsedSections; if (collapsed != null) { HeightTreeNode childNode = removedNode.left ?? removedNode.right; if (childNode != null) { foreach (CollapsedLineSection cs in collapsed) childNode.AddDirectlyCollapsed(cs); } } if (removedNode.parent != null) MergeCollapsedSectionsIfPossible(removedNode.parent); } void BeforeNodeReplace(HeightTreeNode removedNode, HeightTreeNode newNode, HeightTreeNode newNodeOldParent) { Debug.Assert(removedNode != null); Debug.Assert(newNode != null); while (newNodeOldParent != removedNode) { if (newNodeOldParent.collapsedSections != null) { foreach (CollapsedLineSection cs in newNodeOldParent.collapsedSections) { newNode.lineNode.AddDirectlyCollapsed(cs); } } newNodeOldParent = newNodeOldParent.parent; } if (newNode.collapsedSections != null) { foreach (CollapsedLineSection cs in newNode.collapsedSections) { newNode.lineNode.AddDirectlyCollapsed(cs); } } newNode.collapsedSections = removedNode.collapsedSections; MergeCollapsedSectionsIfPossible(newNode); } bool inRemoval; List<HeightTreeNode> nodesToCheckForMerging; void BeginRemoval() { Debug.Assert(!inRemoval); if (nodesToCheckForMerging == null) { nodesToCheckForMerging = new List<HeightTreeNode>(); } inRemoval = true; } void EndRemoval() { Debug.Assert(inRemoval); inRemoval = false; foreach (HeightTreeNode node in nodesToCheckForMerging) { MergeCollapsedSectionsIfPossible(node); } nodesToCheckForMerging.Clear(); } void MergeCollapsedSectionsIfPossible(HeightTreeNode node) { Debug.Assert(node != null); if (inRemoval) { nodesToCheckForMerging.Add(node); return; } // now check if we need to merge collapsedSections together bool merged = false; var collapsedL = node.lineNode.collapsedSections; if (collapsedL != null) { for (int i = collapsedL.Count - 1; i >= 0; i--) { CollapsedLineSection cs = collapsedL[i]; if (cs.Start == node.documentLine || cs.End == node.documentLine) continue; if (node.left == null || (node.left.collapsedSections != null && node.left.collapsedSections.Contains(cs))) { if (node.right == null || (node.right.collapsedSections != null && node.right.collapsedSections.Contains(cs))) { // all children of node contain cs: -> merge! if (node.left != null) node.left.RemoveDirectlyCollapsed(cs); if (node.right != null) node.right.RemoveDirectlyCollapsed(cs); collapsedL.RemoveAt(i); node.AddDirectlyCollapsed(cs); merged = true; } } } if (collapsedL.Count == 0) node.lineNode.collapsedSections = null; } if (merged && node.parent != null) { MergeCollapsedSectionsIfPossible(node.parent); } } #endregion #region GetNodeBy... / Get...FromNode HeightTreeNode GetNodeByIndex(int index) { Debug.Assert(index >= 0); Debug.Assert(index < root.totalCount); HeightTreeNode node = root; while (true) { if (node.left != null && index < node.left.totalCount) { node = node.left; } else { if (node.left != null) { index -= node.left.totalCount; } if (index == 0) return node; index--; node = node.right; } } } HeightTreeNode GetNodeByVisualPosition(double position) { HeightTreeNode node = root; while (true) { double positionAfterLeft = position; if (node.left != null) { positionAfterLeft -= node.left.totalHeight; if (positionAfterLeft < 0) { // Descend into left node = node.left; continue; } } double positionBeforeRight = positionAfterLeft - node.lineNode.TotalHeight; if (positionBeforeRight < 0) { // Found the correct node return node; } if (node.right == null || node.right.totalHeight == 0) { // Can happen when position>node.totalHeight, // i.e. at the end of the document, or due to rounding errors in previous loop iterations. // If node.lineNode isn't collapsed, return that. // Also return node.lineNode if there is no previous node that we could return instead. if (node.lineNode.TotalHeight > 0 || node.left == null) return node; // Otherwise, descend into left (find the last non-collapsed node) node = node.left; } else { // Descend into right position = positionBeforeRight; node = node.right; } } } static double GetVisualPositionFromNode(HeightTreeNode node) { double position = (node.left != null) ? node.left.totalHeight : 0; while (node.parent != null) { if (node.IsDirectlyCollapsed) position = 0; if (node == node.parent.right) { if (node.parent.left != null) position += node.parent.left.totalHeight; position += node.parent.lineNode.TotalHeight; } node = node.parent; } return position; } #endregion #region Public methods public DocumentLine GetLineByNumber(int number) { return GetNodeByIndex(number - 1).documentLine; } public DocumentLine GetLineByVisualPosition(double position) { return GetNodeByVisualPosition(position).documentLine; } public double GetVisualPosition(DocumentLine line) { return GetVisualPositionFromNode(GetNode(line)); } public double GetHeight(DocumentLine line) { return GetNode(line).lineNode.height; } public void SetHeight(DocumentLine line, double val) { var node = GetNode(line); node.lineNode.height = val; UpdateAfterChildrenChange(node); } public bool GetIsCollapsed(int lineNumber) { var node = GetNodeByIndex(lineNumber - 1); return node.lineNode.IsDirectlyCollapsed || GetIsCollapedFromNode(node); } /// <summary> /// Collapses the specified text section. /// Runtime: O(log n) /// </summary> public CollapsedLineSection CollapseText(DocumentLine start, DocumentLine end) { if (!document.Lines.Contains(start)) throw new ArgumentException("Line is not part of this document", "start"); if (!document.Lines.Contains(end)) throw new ArgumentException("Line is not part of this document", "end"); int length = end.LineNumber - start.LineNumber + 1; if (length < 0) throw new ArgumentException("start must be a line before end"); CollapsedLineSection section = new CollapsedLineSection(this, start, end); AddCollapsedSection(section, length); #if DEBUG CheckProperties(); #endif return section; } #endregion #region LineCount & TotalHeight public int LineCount { get { return root.totalCount; } } public double TotalHeight { get { return root.totalHeight; } } #endregion #region GetAllCollapsedSections IEnumerable<HeightTreeNode> AllNodes { get { if (root != null) { HeightTreeNode node = root.LeftMost; while (node != null) { yield return node; node = node.Successor; } } } } internal IEnumerable<CollapsedLineSection> GetAllCollapsedSections() { List<CollapsedLineSection> emptyCSList = new List<CollapsedLineSection>(); return System.Linq.Enumerable.Distinct( System.Linq.Enumerable.SelectMany( AllNodes, node => System.Linq.Enumerable.Concat(node.lineNode.collapsedSections ?? emptyCSList, node.collapsedSections ?? emptyCSList) )); } #endregion #region CheckProperties #if DEBUG [Conditional("DATACONSISTENCYTEST")] internal void CheckProperties() { CheckProperties(root); foreach (CollapsedLineSection cs in GetAllCollapsedSections()) { Debug.Assert(GetNode(cs.Start).lineNode.collapsedSections.Contains(cs)); Debug.Assert(GetNode(cs.End).lineNode.collapsedSections.Contains(cs)); int endLine = cs.End.LineNumber; for (int i = cs.Start.LineNumber; i <= endLine; i++) { CheckIsInSection(cs, GetLineByNumber(i)); } } // check red-black property: int blackCount = -1; CheckNodeProperties(root, null, RED, 0, ref blackCount); } void CheckIsInSection(CollapsedLineSection cs, DocumentLine line) { HeightTreeNode node = GetNode(line); if (node.lineNode.collapsedSections != null && node.lineNode.collapsedSections.Contains(cs)) return; while (node != null) { if (node.collapsedSections != null && node.collapsedSections.Contains(cs)) return; node = node.parent; } throw new InvalidOperationException(cs + " not found for line " + line); } void CheckProperties(HeightTreeNode node) { int totalCount = 1; double totalHeight = node.lineNode.TotalHeight; if (node.lineNode.IsDirectlyCollapsed) Debug.Assert(node.lineNode.collapsedSections.Count > 0); if (node.left != null) { CheckProperties(node.left); totalCount += node.left.totalCount; totalHeight += node.left.totalHeight; CheckAllContainedIn(node.left.collapsedSections, node.lineNode.collapsedSections); } if (node.right != null) { CheckProperties(node.right); totalCount += node.right.totalCount; totalHeight += node.right.totalHeight; CheckAllContainedIn(node.right.collapsedSections, node.lineNode.collapsedSections); } if (node.left != null && node.right != null) { if (node.left.collapsedSections != null && node.right.collapsedSections != null) { var intersection = System.Linq.Enumerable.Intersect(node.left.collapsedSections, node.right.collapsedSections); Debug.Assert(System.Linq.Enumerable.Count(intersection) == 0); } } if (node.IsDirectlyCollapsed) { Debug.Assert(node.collapsedSections.Count > 0); totalHeight = 0; } Debug.Assert(node.totalCount == totalCount); Debug.Assert(node.totalHeight.IsClose(totalHeight)); } /// <summary> /// Checks that all elements in list1 are contained in list2. /// </summary> static void CheckAllContainedIn(IEnumerable<CollapsedLineSection> list1, ICollection<CollapsedLineSection> list2) { if (list1 == null) list1 = new List<CollapsedLineSection>(); if (list2 == null) list2 = new List<CollapsedLineSection>(); foreach (CollapsedLineSection cs in list1) { Debug.Assert(list2.Contains(cs)); } } /* 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(HeightTreeNode node, HeightTreeNode 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(HeightTreeNode 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 Red/Black Tree const bool RED = true; const bool BLACK = false; void InsertAsLeft(HeightTreeNode parentNode, HeightTreeNode newNode) { Debug.Assert(parentNode.left == null); parentNode.left = newNode; newNode.parent = parentNode; newNode.color = RED; UpdateAfterChildrenChange(parentNode); FixTreeOnInsert(newNode); } void InsertAsRight(HeightTreeNode parentNode, HeightTreeNode newNode) { Debug.Assert(parentNode.right == null); parentNode.right = newNode; newNode.parent = parentNode; newNode.color = RED; UpdateAfterChildrenChange(parentNode); FixTreeOnInsert(newNode); } void FixTreeOnInsert(HeightTreeNode 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); HeightTreeNode 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 HeightTreeNode grandparentNode = parentNode.parent; HeightTreeNode 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(HeightTreeNode removedNode) { if (removedNode.left != null && removedNode.right != null) { // replace removedNode with it's in-order successor HeightTreeNode leftMost = removedNode.right.LeftMost; HeightTreeNode parentOfLeftMost = leftMost.parent; RemoveNode(leftMost); // remove leftMost from its current location BeforeNodeReplace(removedNode, leftMost, parentOfLeftMost); // 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 HeightTreeNode parentNode = removedNode.parent; HeightTreeNode childNode = removedNode.left ?? removedNode.right; BeforeNodeRemove(removedNode); 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(HeightTreeNode node, HeightTreeNode parentNode) { Debug.Assert(node == null || node.parent == parentNode); if (parentNode == null) return; // warning: node may be null HeightTreeNode 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(HeightTreeNode replacedNode, HeightTreeNode 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(HeightTreeNode p) { // let q be p's right child HeightTreeNode 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(HeightTreeNode p) { // let q be p's left child HeightTreeNode 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 HeightTreeNode Sibling(HeightTreeNode node) { if (node == node.parent.left) return node.parent.right; else return node.parent.left; } static HeightTreeNode Sibling(HeightTreeNode node, HeightTreeNode parentNode) { Debug.Assert(node == null || node.parent == parentNode); if (node == parentNode.left) return parentNode.right; else return parentNode.left; } static bool GetColor(HeightTreeNode node) { return node != null ? node.color : BLACK; } #endregion #region Collapsing support static bool GetIsCollapedFromNode(HeightTreeNode node) { while (node != null) { if (node.IsDirectlyCollapsed) return true; node = node.parent; } return false; } internal void AddCollapsedSection(CollapsedLineSection section, int sectionLength) { AddRemoveCollapsedSection(section, sectionLength, true); } void AddRemoveCollapsedSection(CollapsedLineSection section, int sectionLength, bool add) { Debug.Assert(sectionLength > 0); HeightTreeNode node = GetNode(section.Start); // Go up in the tree. while (true) { // Mark all middle nodes as collapsed if (add) node.lineNode.AddDirectlyCollapsed(section); else node.lineNode.RemoveDirectlyCollapsed(section); sectionLength -= 1; if (sectionLength == 0) { // we are done! Debug.Assert(node.documentLine == section.End); break; } // Mark all right subtrees as collapsed. if (node.right != null) { if (node.right.totalCount < sectionLength) { if (add) node.right.AddDirectlyCollapsed(section); else node.right.RemoveDirectlyCollapsed(section); sectionLength -= node.right.totalCount; } else { // mark partially into the right subtree: go down the right subtree. AddRemoveCollapsedSectionDown(section, node.right, sectionLength, add); break; } } // go up to the next node HeightTreeNode parentNode = node.parent; Debug.Assert(parentNode != null); while (parentNode.right == node) { node = parentNode; parentNode = node.parent; Debug.Assert(parentNode != null); } node = parentNode; } UpdateAugmentedData(GetNode(section.Start), UpdateAfterChildrenChangeRecursionMode.WholeBranch); UpdateAugmentedData(GetNode(section.End), UpdateAfterChildrenChangeRecursionMode.WholeBranch); } static void AddRemoveCollapsedSectionDown(CollapsedLineSection section, HeightTreeNode node, int sectionLength, bool add) { while (true) { if (node.left != null) { if (node.left.totalCount < sectionLength) { // mark left subtree if (add) node.left.AddDirectlyCollapsed(section); else node.left.RemoveDirectlyCollapsed(section); sectionLength -= node.left.totalCount; } else { // mark only inside the left subtree node = node.left; Debug.Assert(node != null); continue; } } if (add) node.lineNode.AddDirectlyCollapsed(section); else node.lineNode.RemoveDirectlyCollapsed(section); sectionLength -= 1; if (sectionLength == 0) { // done! Debug.Assert(node.documentLine == section.End); break; } // mark inside right subtree: node = node.right; Debug.Assert(node != null); } } public void Uncollapse(CollapsedLineSection section) { int sectionLength = section.End.LineNumber - section.Start.LineNumber + 1; AddRemoveCollapsedSection(section, sectionLength, false); // do not call CheckProperties() in here - Uncollapse is also called during line removals } #endregion } }