duheng
2025-03-24 6e1dd6f75cd7265f549a8b9e4d77ff5d88da9651
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
namespace Yw.WinFrmUI.HydroL2d
{
    /// <summary>
    /// 
    /// </summary>
    public partial class Network
    {
 
        /// <summary>
        /// 判断是否存在
        /// </summary>
        public bool IsExist(string id)
        {
            return _parters.Exists(x => x.Id == id);
        }
 
        /// <summary>
        /// 获取边界
        /// </summary>
        public RectangleF GetBounds()
        {
            var result = RectangleF.Empty;
 
            bool firstPass = true;
            foreach (var node in this.Nodes)
            {
                var rectf = new RectangleF(node.Position, SizeF.Empty);
                if (firstPass)
                {
                    result = rectf;
                    firstPass = false;
                }
                else
                {
                    result = RectangleF.Union(result, rectf);
                }
            }
 
            foreach (var link in this.Links)
            {
                foreach (var position in link.Positions)
                {
                    var rectf = new RectangleF(link.StartPosition, SizeF.Empty);
                    if (firstPass)
                    {
                        result = rectf;
                        firstPass = false;
                    }
                    else
                    {
                        result = RectangleF.Union(result, rectf);
                    }
                }
            }
 
            return result;
        }
 
        /// <summary>
        /// 绘制
        /// </summary>
        public void Draw(Graphics g)
        {
            foreach (var link in this.Links)
            {
                link.Draw(g);
            }
            foreach (var node in this.Nodes)
            {
                node.Draw(g);
            }
        }
 
        /// <summary>
        /// 绘制
        /// </summary>
        /// <param name="g"></param>
        /// <param name="dispRectf">显示区域</param>
        public void Draw(Graphics g, RectangleF dispRectf)
        {
            foreach (var link in this.Links)
            {
                if (link.Intersect(dispRectf))
                {
                    link.Draw(g);
                }
 
            }
            foreach (var node in this.Nodes)
            {
                if (node.Intersect(dispRectf))
                {
                    node.Draw(g);
                }
 
            }
        }
 
        /// <summary>
        /// 选择
        /// </summary>
        public List<Parter> Select(PointF pt)
        {
            int i = 0;
            foreach (var node in this.Nodes)
            {
                node.Selected = node.Contains(pt);
                if (node.Selected)
                {
                    i++;
                }
            }
 
            if (i > 0)
            {
                this.Links.ForEach(x => x.Selected = false);
                return this.Nodes.Where(x => x.Selected).Select(x => x as Parter).ToList();
            }
 
            foreach (var link in this.Links)
            {
                link.Selected = link.Contains(pt);
            }
            return this.Links.Where(x => x.Selected).Select(x => x as Parter).ToList();
        }
 
        /// <summary>
        /// 悬停
        /// </summary>
        public List<Parter> Hover(PointF pt)
        {
            int i = 0;
            foreach (var node in this.Nodes)
            {
                node.Hovered = node.Contains(pt);
                if (node.Hovered)
                {
                    i++;
                }
            }
 
            if (i > 0)
            {
                this.Links.ForEach(x => x.Hovered = false);
                return this.Nodes.Where(x => x.Hovered).Select(x => x as Parter).ToList();
            }
 
            foreach (var link in this.Links)
            {
                link.Hovered = link.Contains(pt);
            }
            return this.Links.Where(x => x.Hovered).Select(x => x as Parter).ToList();
        }
 
 
    }
}