vb.net - How efficient is it to access DataRows in DataTable by index -


i want know happens when reference datarow in .net datatable index. i.e:

dim mytable = get_me_a_big_table() dim myval object = mytable.rows(50000)(0) 

when writing c++ got moderately addicted storing data in array-type containers support random access speed. bugs me can't find explanation of how row retrieved when requesting index.

i've seen 1 post mentions rows laid out in tree structure , therefore retrieving index perform sort of branching search. unlike basic list functionality every record prior index desired has iterated through count them.

the msdn has absolutely no comments in documentation of datatable or datarowcollection (afaik). can tell me kind of search used?


Comments

Popular posts from this blog

shopping cart - Page redirect not working PHP -

php - How to modify a menu to show sub-menus -

python - Installing PyDev in eclipse is failed -