自动打开Tree节点并定位(Opening nodes in a Flex Tree)

Flex Tree 中有可以用程序打开根节点并定位到字节点的操作,那么有expandItem & scrollToIndex 两个方法就很有用。

1.expandItem 是Tree 和 AdvancedDatagrid特有的属性,就是打开或关闭导航树的分支节点。

2.scrollToIndex是listClasses 和 AdvancedListBase 类特有的属性,确保给定索引处的数据提供程序项目可见。

3.isItemOpen 是listClasses 和 AdvancedListBase 类特有的属性,如果指定的分支节点处于打开状态,则返回 true

<?xml version="1.0" encoding="utf-8"?>
<s:VGroup xmlns:fx="http://ns.adobe.com/mxml/2009" 
		  xmlns:s="library://ns.adobe.com/flex/spark" 
		  xmlns:mx="library://ns.adobe.com/flex/mx" width="100%" height="100%">
	<fx:Declarations>
		<fx:XMLList id="treeData">
			<node label="Mail Box">
				<node label="Inbox">
					<node label="Marketing"/>
					<node label="Product Management"/>
					<node label="Personal"/>
				</node>
				<node label="Outbox">
					<node label="Professional"/>
					<node label="Personal"/>
				</node>
				<node label="Spam"/>
				<node label="Sent"/>
			</node>
		</fx:XMLList>
	</fx:Declarations>
	<fx:Script>
		<![CDATA[
			 import mx.events.ListEvent;
			private function comboBox_change(evt:ListEvent):void 
			{
				var team:String = ComboBox(evt.currentTarget).selectedItem.@label;
				var node:XMLList = treeData.node.node.(@label == team);
				expandParents(node[0]);
				tree.selectedItem = node[0];
				var idx:int = tree.getItemIndex(node[0]);
				tree.scrollToIndex(idx);
			}
			
			private function expandParents(node:XML):void 
			{
				if (node && !tree.isItemOpen(node)) {
					tree.expandItem(node, true);
					expandParents(node.parent());
				}
			}
		]]>
	</fx:Script>
	<mx:ComboBox id="comboBox"
				 prompt="Please select a team..."
				 dataProvider="{treeData.node.node}"
				 labelField="@label"
				 change="comboBox_change(event);"/>
	<mx:Tree id="tree"
			 dataProvider="{treeData}"
			 labelField="@label"
			 showRoot="false"
			 width="300"
			 rowCount="8" />
</s:VGroup>
 
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
As an AI language model, I cannot provide you with the exact solution you need without further details. However, here is a general approach to find the longest distance in a binary tree using Python: 1. Define a class for a binary tree node with attributes for the node value, left child, and right child. 2. Define a function that recursively traverses the binary tree and returns the height of the tree starting from a given node. 3. Define a function that recursively traverses the binary tree and returns the longest distance between two nodes in the tree. 4. In the function defined in step 3, for each node, calculate the longest distance that passes through that node and update the maximum distance seen so far. 5. Call the function defined in step 3 starting from the root node of the binary tree. Here is a sample implementation of the above approach: ``` class Node: def __init__(self, value): self.value = value self.left = None self.right = None def height(root): if root is None: return 0 return 1 + max(height(root.left), height(root.right)) def longest_distance(root): if root is None: return 0 left_height = height(root.left) right_height = height(root.right) left_distance = longest_distance(root.left) right_distance = longest_distance(root.right) return max(left_height + right_height, max(left_distance, right_distance)) root = Node(1) root.left = Node(2) root.right = Node(3) root.left.left = Node(4) root.left.right = Node(5) root.right.left = Node(6) root.right.right = Node(7) print(longest_distance(root)) ``` This code will output the longest distance between any two nodes in the binary tree.
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值