• 菜单树


    菜单树

    // add by cxg 2017-4-18

    unit uTree;

    interface

    uses
    SysUtils, Classes, ComCtrls, DB, DBClient;

    type
    PNodeRec = ^TNodeRec;

    TNodeRec = record // 树节点记录
    id: string;
    name: string;
    pid: string;
    formname: string; // add by cxg 2017-2-14
    bplname: string; // add by cxg 2017-4-18
    end;

    procedure CreateTree(dataset: TClientDataSet; treeview: TTreeView; id, aname, parentid: string);

    procedure FreeTree(treeview: TTreeView);

    implementation

    procedure CreateTree(dataset: TClientDataSet; treeview: TTreeView; id, aname, parentid: string);
    // table struct example: id,name,pid
    var
    List: TStringList;
    Node: TTreeNode;
    Index: Integer;
    PNode: PNodeRec;
    begin
    if not dataset.Active or dataset.IsEmpty then
    Exit;
    treeview.Items.Clear;
    List := TStringList.Create;
    try
    List.Sorted := True;
    dataset.First;
    while not dataset.Eof do
    begin
    PNode := new(PNodeRec);
    PNode^.id := dataset.FieldByName(id).Text;
    PNode^.name := dataset.FieldByName(aname).Text;
    PNode^.pid := dataset.FieldByName(parentid).Text;
    // add by cxg 2017-2-14
    if dataset.FindField('formname') <> nil then
    PNode.formname := dataset.FindField('formname').Text;
    // add by cxg 2017-4-18
    if dataset.FindField('bplname') <> nil then
    PNode.bplname := dataset.FindField('bplname').Text;
    if (dataset.FieldByName(parentid).Text = '') or (dataset.FieldByName(id).Text = dataset.FieldByName(parentid).Text) then
    // add root node
    Node := treeview.Items.AddChild(nil, dataset.FieldByName(aname).Text)
    else
    begin
    // add child node
    Index := List.IndexOf(dataset.FieldByName(parentid).Text);
    Node := treeview.Items.AddChild(TTreeNode(List.Objects[Index]), dataset.FieldByName(aname).Text);
    end;
    Node.Data := PNode;
    List.AddObject(dataset.FieldByName(id).Text, Node);
    dataset.Next;
    end;
    finally
    List.Free;
    end;
    end;

    procedure FreeTree(treeview: TTreeView);
    var
    i: Integer;
    Node: TTreeNode;
    begin
    for i := treeview.Items.Count - 1 downto 0 do
    begin
    Node := treeview.Items[i];
    Dispose(PNodeRec(Node.Data));
    end;
    end;

    end.

  • 相关阅读:
    C++的精度控制
    N*N矩阵的旋转 不开辟新空间
    关于内存对齐的探索
    最大公约数,最小公倍数
    冒泡排序,直接选择排序,插入排序实现
    vector function trmplate
    function template
    dijit/_WidgetBase
    DOJO之gridx
    [b0008] Windows 7 下 hadoop 2.6.4 eclipse 本地开发调试配置
  • 原文地址:https://www.cnblogs.com/hnxxcxg/p/6726558.html
Copyright © 2020-2023  润新知