![]() All changes reflect immediately in the relying database. This is not the only benefit of KADaoDBTreeView – it can sort data, move nodes up and down on same level or level-up and level-down in the tree. ![]() KADaoDBTreeView is very fast and does not rely on database specific calls to display the data.Ĭompared with some other DBTreeView systems KADaoDBTreeView is sometimes 1000% faster. ![]() It can display hierarchical data stored in any database, which is TDataset compliant. KADaoDBTreeView is a Database equivalent of the standard TTreeView.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |