A
AAA
Hello,
I'm considering keeping in memory a not-that-big DataTable, with a "classic"
single-column-primary-key, which is 'Stringish'.
Obviously, I will lookup rows based on this key.
My question is simple: is that an indexed operation ? Same as using a
Hashtable ?
Is it O(1), or O(n) ? worst ? better ?
I was trying to use ILDASM, but it just show a call to FindByPrimaryKey :
IL_0007: callvirt instance class System.Data.DataRow
System.Data.DataTable::FindByPrimaryKey(object)
Can anyone help here, pls ?
Thanks
Meir
I'm considering keeping in memory a not-that-big DataTable, with a "classic"
single-column-primary-key, which is 'Stringish'.
Obviously, I will lookup rows based on this key.
My question is simple: is that an indexed operation ? Same as using a
Hashtable ?
Is it O(1), or O(n) ? worst ? better ?
I was trying to use ILDASM, but it just show a call to FindByPrimaryKey :
IL_0007: callvirt instance class System.Data.DataRow
System.Data.DataTable::FindByPrimaryKey(object)
Can anyone help here, pls ?
Thanks
Meir