84 lines
2.0 KiB
JavaScript

// tree benchmark in React
import {getIntParameter, bindAction} from 'angular2/src/test_lib/benchmark_util';
import React from './react.min';
var TreeComponent = React.createClass({
displayName: 'TreeComponent',
render: function() {
var treeNode = this.props.treeNode;
var left = null;
if (treeNode.left) {
left = React.createElement(
"span",
{},
[React.createElement(TreeComponent, {treeNode: treeNode.left}, "")]
)
}
var right = null;
if (treeNode.right) {
right = React.createElement(
"span",
{},
[React.createElement(TreeComponent, {treeNode: treeNode.right}, "")]
)
}
var span = React.createElement("span", {}, [
" " + treeNode.value,
left,
right
]);
return (
React.createElement("tree", {}, [span])
);
}
});
export function main() {
var count = 0;
var maxDepth = getIntParameter('depth');
bindAction('#destroyDom', destroyDom);
bindAction('#createDom', createDom);
var empty = new TreeNode(0, null, null);
var rootComponent = React.render(
React.createElement(TreeComponent, {treeNode: empty}, ""),
document.getElementById('rootTree')
);
function destroyDom() {
rootComponent.setProps({treeNode: empty});
}
function createDom() {
var values = count++ % 2 == 0 ?
['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '*'] :
['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', '-'];
rootComponent.setProps({treeNode: buildTree(maxDepth, values, 0)});
}
}
class TreeNode {
value:string;
left:TreeNode;
right:TreeNode;
constructor(value, left, right) {
this.value = value;
this.left = left;
this.right = right;
}
}
function buildTree(maxDepth, values, curDepth) {
if (maxDepth === curDepth) return new TreeNode('', null, null);
return new TreeNode(
values[curDepth],
buildTree(maxDepth, values, curDepth + 1),
buildTree(maxDepth, values, curDepth + 1));
}