Home/ Questions/Q 6374731
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-25T01:31:29+00:00

I have an architecture where we are passing our data nodes as IEnumerable<BaseNode> .

  • 0

I have an architecture where we are passing our data nodes as IEnumerable<BaseNode>. It all works great, but in each subclass we want to store these as List<AnotherNode> as everything in that class creates and uses AnotherNode objects (we have about 15 different subclasses).

The one place using the more strongly typed list doesn’t work is the root classes method that returns a type IEnumerable<BaseNode> and with the covariance limitations in .net 3.5, that can’t be returned. (We have to stay on .net 3.5 for now.)

But if I have List<AnotherNode> data; and return data.OfType<BaseNode>(); – that works fine. So here’s my question.

As all of data is of type BaseNode – what’s the performance hit of this call? Because the alternative is I have to cast in places which has a small performance hit – but it’s also a situation where we give up everything knowing it’s type.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Two minor things:

    1. There is a small, but measurable overhead associated with yielding each item in the enumerator. If you need to care about this because you’re in a very tight inner loop, you’re actually better off iterating with a for loop on the list directly. Most likely this doesn’t matter.

    2. Because the result is IEnumerable<BaseNode> and has already been filtered through a yielding enumeration function, subsequent calls to methods like Count() or ElementAt() will not take advantage of optimizations in the LINQ implementation for Lists. This is also unlikely to be a problem unless you make frequent use of these extension methods and have a very large number of elements.

    • 0