public void Add(GUTag tag, GTagBoxTree obj)
{
if (null == Get(tag))
{
all.Add(tag, obj);
}
}
public override void Layout(ITagDB db, GUTag tag, Size size, TreeLayoutEnv env)
{
oriSize = size;
env.Reset();
tags = new List <TagBox>();
this.db = db;
root = GTagBoxTree.ExpandNode(tag, 0, db, 0, 0, 1, oriSize, env, myLayoutMode);
tags = env.GetAllTagBox();
lines = env.GetAllLines().Cast <UIElement>();
}
public static GTagBoxTree ExpandNode(GUTag tag, int level, ITagDB db, double x, double y, int direct, Size size, TreeLayoutEnv env, LayoutMode mode)
{
Logger.IN(tag.Title);
Logger.D("Expand " + tag + " " + x + " " + y);
//已经展开过，直接返回
if (env.Get(tag) != null)
{
Logger.D("FOUND " + tag);
Logger.OUT();
return(env.Get(tag));
}
//创建子树的根对象
GTagBoxTree root = new GTagBoxTree();
root.GTagBox = new GTagBox(level, tag, x, y, direct);
root.totalRange = root.GTagBox.OutterBox;
root.D("计算自身大小（不包括子节点）" + root.GTagBox.Tag);
env.Add(tag, root);//这个特别需要注意，在递归展开之前，先要将该节点加入DB，否则可能会出现无限递归
List <GUTag> children = db.QueryTagChildren(tag);
List <Size> childrenSize = new List <Size>();
GTagBoxTree pre = null;
GTagBoxTree cur = null;
double childX = x + direct * root.GTagBox.OutterBox.Width;
double childY = y;
int MaxLevel = CalcMaxLevel(mode);
//double h = 0;
//double w = 0;
if (level < MaxLevel)
{
//遍历展开所有子节点
foreach (GUTag ctag in children)
{
if (env.Get(ctag) != null)
{
continue;
}
cur = null;
//GTreeObj child = ExpandNode(ctag, level + 1, db, x + root.box.InnerBox.Width, y + h);
//h += child.OutBox.Height;
//w = Math.Max(w, child.OutBox.Width);
switch (mode)
{
case LayoutMode.TREE_COMPACT_MORE:
case LayoutMode.LRTREE_COMPACT_MORE:
cur = ExpandChildMoreCompact(level, MaxLevel, db, root, pre, ctag, direct, size, env, mode);
break;
case LayoutMode.TREE_COMPACT:
case LayoutMode.LRTREE_COMPACT:
cur = ExpandChildCompact(level, MaxLevel, db, root, pre, ctag, direct, size, env, mode);
break;
case LayoutMode.TREE_NO_COMPACT:
case LayoutMode.LRTREE_NO_COMPACT:
cur = ExpandChildNoCompact(level, MaxLevel, db, root, pre, ctag, direct, size, env, mode);
break;
default:
break;
}
//h += cur.OutBox.Height;
//w = Math.Max(w, cur.OutBox.Width);
root.totalRange.Union(cur.totalRange);
root.Children.Add(cur);
pre = cur;
}
}
//根据所有子节点所占区域的大小，计算自己的位置
//root.OutBox.Width = w + root.box.InnerBox.Width;
//root.OutBox.Height = Math.Max(h, root.box.InnerBox.Height);
//root.GTagBox.InnerBox.Y = (root.TotalRange.Top + root.TotalRange.Bottom) / 2;
root.GTagBox.CenterRootY(root.totalRange);
root.D(null);
Logger.OUT();
return(root);
}
private static GTagBoxTree ExpandChildNoCompact(int level, int MaxLevel, ITagDB db, GTagBoxTree root, GTagBoxTree pre, GUTag ctag, int direct, Size size, TreeLayoutEnv env, LayoutMode mode)
{
GTagBoxTree cur;
Logger.D("ChoosePos:pre:{0}-{1}-{2} cur:{0}-{1},",
pre?.GTagBox.Tag,
pre == null ? 0 : db.QueryTagChildren(pre.GTagBox.Tag).Count,
pre == null ? 0 : pre.totalRange.Right,
ctag, db.QueryTagChildren(ctag).Count);
if (pre == null)
{
Logger.D("Place {0} after {1}:follow", ctag, root.GTagBox.Tag);
cur = ExpandNode(ctag, level + 1, db,
direct == 1 ? root.GTagBox.OutterBox.Right : root.GTagBox.OutterBox.Left,
root.totalRange.Top, direct, size, env, mode);
}
else
{
Logger.D("Place {0} after {1}:newline", ctag, root.GTagBox.Tag);
cur = ExpandNode(ctag, level + 1, db,
direct == 1 ? root.GTagBox.OutterBox.Right : root.GTagBox.OutterBox.Left,
root.totalRange.Bottom, direct, size, env, mode);
}
env.AddLine(root, cur, direct);
return(cur);
}
private static GTagBoxTree ExpandChildCompact(int rootLevel, int MaxLevel, ITagDB db, GTagBoxTree root, GTagBoxTree pre, GUTag ctag, int direct, Size size, TreeLayoutEnv env, LayoutMode mode)
{
GTagBoxTree cur;
Logger.D("ChoosePos:pre:{0}-{1}-{2} cur:{0}-{1},",
pre?.GTagBox.Tag,
pre == null ? 0 : db.QueryTagChildren(pre.GTagBox.Tag).Count,
pre == null ? 0 : pre.totalRange.Right,
ctag, db.QueryTagChildren(ctag).Count);
bool leftOK = true, rightOK = true;
TagBoxSizeInf sizeinf = new TagBoxSizeInf(ctag, rootLevel + 1, StaticCfg.Ins.GFontName);
int OneLineChild = GetTagTreeWidth(ctag, db, rootLevel + 1, MaxLevel);
//右边是否有足够空间(初步预估，用OneLineChild*本节点的宽度预估)
if (pre != null && direct == 1)
{
rightOK = pre.totalRange.Right + sizeinf.OutterBoxSize.Width < size.Width;
}
//左边是否有足够空间
if (pre != null && direct == -1)
{
leftOK = sizeinf.OutterBoxSize.Width < pre.totalRange.Left;
}
//只有满足严格条件的情况下，才放在兄弟节点的后面，否则在父节点后展开
if (pre != null && OneLineChild >= 0 &&
(db.QueryTagChildren(pre.GTagBox.Tag).Count == 0 || rootLevel + 1 == MaxLevel) &&
rightOK && leftOK)
{
Logger.D("Place {0} after {1}:follow", ctag, pre.GTagBox.Tag);
cur = ExpandNode(ctag, rootLevel + 1, db,
direct == 1 ? pre.totalRange.Right : pre.totalRange.Left, //X
pre.totalRange.Top, //Y
direct, size, env, mode);
}
//第一个节点，没有兄弟节点，放在父节点后面 ==== > 放在父节点的同一行
//非叶子节点，也直接放在父节点后面 or ==== > 放在父节点的下一行
//前一个兄弟已经把这一行占完了 ==== > 放在父节点的下一行
else
{
if (pre == null)
{
Logger.D("Place {0} after {1}:follow", ctag, root.GTagBox.Tag);
cur = ExpandNode(ctag, rootLevel + 1, db,
direct == 1 ? root.GTagBox.OutterBox.Right : root.GTagBox.OutterBox.Left,
root.totalRange.Top, direct, size, env, mode);
}
else
{
Logger.D("Place {0} after {1}:newline", ctag, root.GTagBox.Tag);
cur = ExpandNode(ctag, rootLevel + 1, db,
direct == 1 ? root.GTagBox.OutterBox.Right : root.GTagBox.OutterBox.Left,
root.totalRange.Bottom, direct, size, env, mode);
}
env.AddLine(root, cur, direct);
}
return(cur);
}
public void AddLine(GTagBoxTree parent, GTagBoxTree child, int direct)
{
Lines.Add(new Tuple <GTagBoxTree, GTagBoxTree, int>(parent, child, direct));
}