B
Brian Link
I've been using typed arraylists inherited from collectionbase to hold
my in-memory lists of data. Sometimes they can be relatively large
(200 bytes X 10000 records). I've either iterated through the list and
added to listviews or treeviews, and occasionally bound them to
datagrids.
Lately I've been experimenting with datatables & dataviews for the
same purpose. I was wondering what people's experiences have been with
either approach, in respect to performance. The .NET data objects have
a lot of appealing built-in features such as sorting and filtering,
but at what cost to performance?
Thanks for any ideas.
Brian Link, Minnesota Countertenor
----------------------------------
"There are things that we know, and then there are known
unknowns. That is to say, there are things that we now
know that we don't know. But there are also unknown unknowns.
There are things we do not know we don't know."
- U.S. War Secretary, 2003
my in-memory lists of data. Sometimes they can be relatively large
(200 bytes X 10000 records). I've either iterated through the list and
added to listviews or treeviews, and occasionally bound them to
datagrids.
Lately I've been experimenting with datatables & dataviews for the
same purpose. I was wondering what people's experiences have been with
either approach, in respect to performance. The .NET data objects have
a lot of appealing built-in features such as sorting and filtering,
but at what cost to performance?
Thanks for any ideas.
Brian Link, Minnesota Countertenor
----------------------------------
"There are things that we know, and then there are known
unknowns. That is to say, there are things that we now
know that we don't know. But there are also unknown unknowns.
There are things we do not know we don't know."
- U.S. War Secretary, 2003