HI.
I need help plz.
Create a table with following fields:
ID | CODE | NAME
Where
ID - id, CODE - item number, NAME - the name of range.
CODE should have the followinf format:
xx.yy.zz
where, xx - activites, yy - contract, yy - task.
In the DB will be store as follows:
1 | 01 | Basic activites
2 | 01.01 | Contract about 1
3 | 01.02 | Contract about Bank
4 | 02 | Hoz activites
5 | 02.02 | Contract el
6 | 02.02.01 | Electric
7 | 02.02.02 | Hot
Just have to take into account the fact that the levels of the hierarchy can be expended. So they con not 3. Be even so xx.yy.zz.hh.ee
I add data the the database (yet without additions of new ones). How to create a universal algorithm to treeView filled exactly hierarchy?
The result of which must be obtained:
I need help plz.
Create a table with following fields:
ID | CODE | NAME
Where
ID - id, CODE - item number, NAME - the name of range.
CODE should have the followinf format:
xx.yy.zz
where, xx - activites, yy - contract, yy - task.
In the DB will be store as follows:
1 | 01 | Basic activites
2 | 01.01 | Contract about 1
3 | 01.02 | Contract about Bank
4 | 02 | Hoz activites
5 | 02.02 | Contract el
6 | 02.02.01 | Electric
7 | 02.02.02 | Hot
Just have to take into account the fact that the levels of the hierarchy can be expended. So they con not 3. Be even so xx.yy.zz.hh.ee
I add data the the database (yet without additions of new ones). How to create a universal algorithm to treeView filled exactly hierarchy?
The result of which must be obtained: