reactjs - React/Typescript: How to compose custom components for use with library (rc-tree)? -


i'm using looks 1 of more popular tree components rc-tree react, along it's typescript typedef.

versions:

"typescript": "2.3.4" "react": "15.5.4" "rc-tree": "1.7.3" "@types/rc-tree": "1.4.5"

i can't figure out how compose custom treenode.

eventually, custom treenode render potentially multiple nodes under single parent - depending on props. want "extend" treenode in few different components define bunch of different "sub-trees" - each of these "sub-trees" specific structures of treenodes (plus defining custom props classes define inputs required generate given type of component).

here simple code show i've tried:

import * react "react"; import {props} "react"; import tree, {treenode} 'rc-tree';   export class treetestscreen extends react.component<any, any> {    constructor(props: any, context: any){     super(props, context);   }    rendersimplenodes(){     return <tree key="tree-root">       {mytreenode.rendercustomnodes({specialtitle: "blah"})}     </tree>;   }    rendercustomnodes(){      return <tree key="tree-root">       <mytreenode specialtitle={"blah"}/>     </tree>;    }     render(){     return this.rendersimplenodes()      // uncaught typeerror:      // return this.rendercustomnodes()   } }  export interface mytreenodeprops extends props<treenode> {   specialtitle: string }   export class mytreenode extends react.component<mytreenodeprops, any> {   static rendercustomnodes(props: mytreenodeprops){     return <treenode        key={`mytreenodekey`}       isleaf={true}       title={props.specialtitle}      />   }   constructor(props: any, context: any){     super(props, context);   }   render(){     return mytreenode.rendercustomnodes(this.props)   } }

the code in rendersimplenodes() works fine. if try use code in rendercustomnodes(), fail with

domlazytree.js:69 uncaught typeerror: cannot read property 'replacechild' of null

i thought how i'm supposed make custom components react/typescript. problem here tree/treenode classes of rc-tree (or possibly typedefs)?
or there obvious way i'm trying can't see?


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more