The Dojo Tree component

The Dojo Tree component is a powerful tool for visual presentation of hierarchical data. In this tutorial we will look at how to connect the tree to a store for quick and efficient data drill-down into nested data.

Introduction

The Dojo Tree component providesa comprehensive, familiar, intuitive drill-down presentation of hierarchical data.It also separates the data model concerns from the presentation.This tutorial will examine various ways to provide the data to drive a tree.

The first example uses a static tree with the data sourced from a single JSON file.This can be used to provide navigation through data.The second example expands on this design to add powerful features like drag and drop, and dynamic tree manipulation.The final example shows how data can be lazy-loaded.

Tree with a Static Store

A static store is well-suited for a tree with limited size.In this example, clicking on the tree nodes displays a related image.

The first step is to create the data. We will use the Memory store, which means thatthe store data is JSON-encoded, and can contain supporting information.In this case, the name is used to label each node of the tree.This tree has four items, and each has a name and an id.

{
    "name": "US Government",
    "id": "root",
    "children": [
        {
            "name": "Congress",
            "id": "congress"
        },
        {
            "name": "Executive",
            "id": "exec"
        },
        {
            "name": "Judicial",
            "id": "judicial"
        }
    ]
}

A tree is served data from an object implementing the dijit/tree/model interface.Usually, that object is an instance ofdijit/tree/ObjectStoreModel,and it is fed by a dojo/store.That's how this example will work.

require([
    "dojo/dom", "dojo/json", "dojo/store/Memory",
    "dijit/tree/ObjectStoreModel", "dijit/Tree", "dojo/text!./data/static", "dojo/domReady!"
], function(dom, json, Memory, ObjectStoreModel, Tree, data){
    // set up the store to get the tree data
    var governmentStore = new Memory({
        data: [ json.parse(data) ],
        getChildren: function(object){
            return object.children || [];
        }
    });

    // set up the model, assigning governmentStore, and assigning method to identify leaf nodes of tree
    var governmentModel = new ObjectStoreModel({
        store: governmentStore,
        query: {id: 'root'},
        mayHaveChildren: function(item){
            return "children" in item;
        }
    });

    // set up the tree, assigning governmentModel;
    var governmentTree = new Tree({
        model: governmentModel,
        onOpenClick: true,
        onLoad: function(){
            dom.byId('image').src = '../resources/images/root.jpg';
        },
        onClick: function(item){
            dom.byId('image').src = '../resources/images/'+item.id+'.jpg';

        }
    }, "divTree");
    governmentTree.startup();
});

<!doctype html>
<html lang="en" dir="ltr">
	<head>
	    <title>Demo: Dijit Tree</title>
		<link rel="stylesheet" href="dijit/themes/claro/claro.css" />
		<style type="text/css">
			body, html { font-family:helvetica,arial,sans-serif; font-size:90%; }
		</style>
				<script src="dojo/dojo.js" ></script>
		
	</head>
	<body class="claro">
		<h1>Demo: Dijit Tree</h1>
		<div class="column" id="tree">
			<h1>Tree</h1>
			<div id="divTree"></div>
		</div>
		<div class="column">
			<h1>Image</h1>
			<img id="image" />
		</div>
		<script>
			require([
		"dojo/dom",
		"dojo/json",
		"dojo/store/Memory",
		"dijit/tree/ObjectStoreModel",
		"dijit/Tree",
		"dojo/text!./data/small.json",
		"dojo/domReady!"
	], function(dom, json, Memory, ObjectStoreModel, Tree, data){
		
		// set up the store to get the tree data
		var governmentStore = new Memory({
			data: [ json.parse(data) ],
			getChildren: function(object){
				return object.children || [];
			}
		});

		// set up the model, assigning governmentStore, and assigning method to identify leaf nodes of tree
		var governmentModel = new ObjectStoreModel({
			store: governmentStore,
			query: {id: 'root'},
			mayHaveChildren: function(item){
				return "children" in item;
			}
		});

		// set up the tree, assigning governmentModel;
		var governmentTree = new Tree({
			model: governmentModel,
			onOpenClick: true,
			onLoad: function(){
				dom.byId('image').src = '../resources/images/root.jpg';
			},
			onClick: function(item){
				dom.byId('image').src = '../resources/images/'+item.id+'.jpg';

			},
			persist: false
		}, "divTree");
		governmentTree.startup();
	});
		</script>
	</body>
</html>


The code below creates a Memory store, feeding into an ObjectStoreModel, which then feeds a tree.Finally, the onLoad and onClick events are used to display the associated image.

Note how we had to implemented two methods ourselves:

  1. getChildren() - to return a list of children for a given item
  2. mayHaveChildren() - in its simplest form this always returns true, but itcan return false if you can tell just by looking at an item that it couldn't possibly have any children,currently or in the future (due to drag and drop or other data store updates).


Dynamic Updates and Drag & Drop

Here we will learn how to use the Tree with drag-n-drop, and real-time response to data changes.

For a Tree to work with dynamic data updates, including DnD,the store needs to be able to understand and track parent-child relationships,and to notify the tree when items change, especially when an item's list of children changes.With that in mind, we will create our data in a relational format where each object points to its parent:

[
    {
        "name": "US Government",
        "id": "root"
    },
        {
            "name": "Congress",
            "id": "congress",
            "parent": "root"
        },
            {
                "name": "House of Representatives",
                "id": "house",
                "parent": "congress"
            },
            {
                "name": "Senate",
                "id": "senate",
                "parent": "congress"
            },
        {
            "name": "Executive",
            "id": "exec",
            "parent": "root"
        },
            {
                "name": "President",
                "id": "pres",
                "parent": "exec"
            },
            {
                "name": "Vice President",
                "id": "vice-pres",
                "parent": "exec"
            },
            {
                "name": "Secretary of State",
                "id": "state",
                "parent": "exec"
            },
            {
                "name": "Cabinet",
                "id": "cabinet",
                "parent": "exec"
            },
                {
                    "name": "National Security Council",
                    "id": "security",
                    "parent": "cabinet"
                },
                {
                    "name": "Council of Economic Advisers",
                    "id": "economic",
                    "parent": "cabinet"
                },
                {
                    "name": "Office of Management and Budget",
                    "id": "budget",
                    "parent": "cabinet"
                },
        {
            "name": "Judicial",
            "id": "judicial",
            "parent": "root"
        }
]

Despite the indenting, this is actually a flat list of objects where each object (except the root object)points to its parent.

Next, we make the store.The store needs to have the following capabilities to be used with ObjectStoreModel and the Tree,and to reflect dynamic data updates:

  1. Support to get the tree root node via a query (store.query()), rather than a store.get() call,and return a list with one item and an observe() method. ObjectStoreModel will use the observe() methodto detect changes to the root node such as modifications to the label.
  2. A getChildren() method that returns a list of children with an observe() method.The observe() method is used to detect when any of the children change (such as modification of their label),and also when new children are added or old children are removed.
  3. A put() method than can attach an item as a child of another item.

Capabilities #1 and #2 are simplified by wrapping the store in anObservable.After that, getRoot() and getChildren() can be implemented as simple queries against the store.

For #3, since dojo/store/Memory doesn't support this option, we will add it ourselves.The code becomes:

require([
    "dojo/aspect", "dojo/json", "dojo/query", "dojo/store/Memory", "dojo/store/Observable",
    "dijit/Tree", "dijit/tree/ObjectStoreModel", "dijit/tree/dndSource", "dojo/text!./data/all.json", "dojo/domReady!"
], function(aspect, json, query, Memory, Observable,
    Tree, ObjectStoreModel, dndSource, data){

    // set up the store to get the tree data, plus define the method
    // to query the children of a node
    var governmentStore = new Memory({
        data: json.parse(data),
        getChildren: function(object){
            return this.query({parent: object.id});
        }
    });

    // To support dynamic data changes, including DnD,
    // the store must support put(child, {parent: parent}).
    // But dojo/store/Memory doesn't, so we have to implement it.
    // Since our store is relational, that just amounts to setting child.parent
    // to the parent's id.
    aspect.around(governmentStore, "put", function(originalPut){
        return function(obj, options){
            if(options && options.parent){
                obj.parent = options.parent.id;
            }
            return originalPut.call(governmentStore, obj, options);
        }
    });

    // give store Observable interface so Tree can track updates
    governmentStore = new Observable(governmentStore);
};
Finally, to get DnD support, we need to define the drag-n-drop controller:We will use the standard dijit/tree/dndSource as the controller:

require(["dijit/Tree", "dijit/tree/dndSource", "dojo/domReady!"], function(Tree, dndSource){
    tree = new Tree({
        model: usGov,
        // define the drag-n-drop controller
        dndController: dndSource
    }, "tree");
    tree.startup();
});
Now drag-n-drop operations should trigger calls to model.pasteItem() which will update the data storevia put().


深度学习是机器学习的一个子领域,它基于人工神经网络的研究,特别是利用多层次的神经网络来进行学习和模式识别。深度学习模型能够学习数据的高层次特征,这些特征对于图像和语音识别、自然语言处理、医学图像分析等应用至关重要。以下是深度学习的一些关键概念和组成部分: 1. **神经网络(Neural Networks)**:深度学习的基础是人工神经网络,它是由多个层组成的网络结构,包括输入层、隐藏层和输出层。每个层由多个神经元组成,神经元之间通过权重连接。 2. **前馈神经网络(Feedforward Neural Networks)**:这是最常见的神经网络类型,信息从输入层流向隐藏层,最终到达输出层。 3. **卷积神经网络(Convolutional Neural Networks, CNNs)**:这种网络特别适合处理具有网格结构的数据,如图像。它们使用卷积层来提取图像的特征。 4. **循环神经网络(Recurrent Neural Networks, RNNs)**:这种网络能够处理序列数据,如时间序列或自然语言,因为它们具有记忆功能,能够捕捉数据中的时间依赖性。 5. **长短期记忆网络(Long Short-Term Memory, LSTM)**:LSTM 是一种特殊的 RNN,它能够学习长期依赖关系,非常适合复杂的序列预测任务。 6. **生成对抗网络(Generative Adversarial Networks, GANs)**:由两个网络组成,一个生成器和一个判别器,它们相互竞争,生成器生成数据,判别器评估数据的真实性。 7. **深度学习框架**:如 TensorFlow、Keras、PyTorch 等,这些框架提供了构建、训练和部署深度学习模型的工具和库。 8. **激活函数(Activation Functions)**:如 ReLU、Sigmoid、Tanh 等,它们在神经网络中用于添加非线性,使得网络能够学习复杂的函数。 9. **损失函数(Loss Functions)**:用于评估模型的预测与真实值之间的差异,常见的损失函数包括均方误差(MSE)、交叉熵(Cross-Entropy)等。 10. **优化算法(Optimization Algorithms)**:如梯度下降(Gradient Descent)、随机梯度下降(SGD)、Adam 等,用于更新网络权重,以最小化损失函数。 11. **正则化(Regularization)**:技术如 Dropout、L1/L2 正则化等,用于防止模型过拟合。 12. **迁移学习(Transfer Learning)**:利用在一个任务上训练好的模型来提高另一个相关任务的性能。 深度学习在许多领域都取得了显著的成就,但它也面临着一些挑战,如对大量数据的依赖、模型的解释性差、计算资源消耗大等。研究人员正在不断探索新的方法来解决这些问题。
【6层】4837.9平米六层框架综合办公楼(含计算书、建筑、结构图纸) 1、资源项目源码均已通过严格测试验证,保证能够正常运行; 2、项目问题、技术讨论,可以给博主私信或留言,博主看到后会第一时间与您进行沟通; 3、本项目比较适合计算机领域相关的毕业设计课题、课程作业等使用,尤其对于人工智能、计算机科学与技术等相关专业,更为适合; 4、下载使用后,可先查看README.md或论文文件(如有),本项目仅用作交流学习参考,请切勿用于商业用途。 5、资源来自互联网采集,如有侵权,私聊博主删除。 6、可私信博主看论文后选择购买源代码。 1、资源项目源码均已通过严格测试验证,保证能够正常运行; 2、项目问题、技术讨论,可以给博主私信或留言,博主看到后会第一时间与您进行沟通; 3、本项目比较适合计算机领域相关的毕业设计课题、课程作业等使用,尤其对于人工智能、计算机科学与技术等相关专业,更为适合; 4、下载使用后,可先查看README.md或论文文件(如有),本项目仅用作交流学习参考,请切勿用于商业用途。 5、资源来自互联网采集,如有侵权,私聊博主删除。 6、可私信博主看论文后选择购买源代码。 1、资源项目源码均已通过严格测试验证,保证能够正常运行; 2、项目问题、技术讨论,可以给博主私信或留言,博主看到后会第一时间与您进行沟通; 3、本项目比较适合计算机领域相关的毕业设计课题、课程作业等使用,尤其对于人工智能、计算机科学与技术等相关专业,更为适合; 4、下载使用后,可先查看README.md或论文文件(如有),本项目仅用作交流学习参考,请切勿用于商业用途。 5、资源来自互联网采集,如有侵权,私聊博主删除。 6、可私信博主看论文后选择购买源代码。
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值