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
|
//
// LayoutingQueue.cs
//
// Author:
// Jean-Philippe Bruyère <jp.bruyere@hotmail.com>
//
// Copyright (c) 2015 jp
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
using System;
using System.Collections.Generic;
using System.Linq;
using System.Diagnostics;
namespace Crow
{
public class LayoutingQueue : LinkedList<LayoutingQueueItem>
{
public LayoutingQueue ()
{
}
public void Enqueue(LayoutingType _lt, ILayoutable _object)
{
_object.RegisteredLQINodes.Add(this.AddLast (new LayoutingQueueItem (_lt, _object)));
}
LinkedListNode<LayoutingQueueItem> searchLqi(ILayoutable go, LayoutingType lt){
for (int i = 0; i < go.RegisteredLQINodes.Count; i++) {
if (go.RegisteredLQINodes [i].Value.LayoutType == lt)
return go.RegisteredLQINodes [i];
}
return null;
}
public void EnqueueAfterParentSizing (LayoutingType _lt, ILayoutable _object)
{
LayoutingQueueItem lqi = new LayoutingQueueItem (_lt, _object);
LinkedListNode<LayoutingQueueItem> parentLqi = searchLqi (_object.Parent, _lt);
if (parentLqi == null)
_object.RegisteredLQINodes.Add(this.AddFirst (lqi));
else
_object.RegisteredLQINodes.Add(this.AddAfter (parentLqi, lqi));
}
public void EnqueueBeforeParentSizing (LayoutingType _lt, ILayoutable _object)
{
LayoutingQueueItem lqi = new LayoutingQueueItem (_lt, _object);
LinkedListNode<LayoutingQueueItem> parentLqi = searchLqi (_object.Parent, _lt);
if (parentLqi == null)
_object.RegisteredLQINodes.Add(this.AddLast (lqi));
else
_object.RegisteredLQINodes.Add(this.AddBefore (parentLqi, lqi));
}
public void EnqueueAfterThisAndParentSizing (LayoutingType _lt, ILayoutable _object)
{
LayoutingQueueItem lqi = new LayoutingQueueItem (_lt, _object);
LayoutingType sizing = LayoutingType.Width;
if (_lt == LayoutingType.Y)
sizing = LayoutingType.Height;
LinkedListNode<LayoutingQueueItem> parentLqi = searchLqi (_object.Parent, sizing);
LinkedListNode<LayoutingQueueItem> thisLqi = searchLqi (_object, sizing);
if (parentLqi == null) {
if (thisLqi != null)
_object.RegisteredLQINodes.Add(this.AddAfter (thisLqi, lqi));
else
_object.RegisteredLQINodes.Add(this.AddLast (lqi));
} else {
if (thisLqi == null)
_object.RegisteredLQINodes.Add(this.AddAfter (parentLqi, lqi));
else {
switch (sizing) {
case LayoutingType.Width:
if (_object.Parent.getBounds().Width<0)
_object.RegisteredLQINodes.Add(this.AddAfter (parentLqi, lqi));
else
_object.RegisteredLQINodes.Add(this.AddAfter (thisLqi, lqi));
break;
case LayoutingType.Height:
if (_object.Parent.getBounds().Height<0)
_object.RegisteredLQINodes.Add(this.AddAfter (parentLqi, lqi));
else
_object.RegisteredLQINodes.Add(this.AddAfter (thisLqi, lqi));
break;
}
}
}
}
public LayoutingQueueItem Dequeue()
{
LayoutingQueueItem tmp = this.First.Value;
tmp.GraphicObject.RegisteredLQINodes.Remove(this.First);
this.RemoveFirst ();
return tmp;
}
}
}
|
