Home/ Questions/Q 48649
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-10T16:18:47+00:00

I got a Function that returns a Collection<string> , and that calls itself recursively

  • 0

I got a Function that returns a Collection<string>, and that calls itself recursively to eventually return one big Collection<string>.

Now, i just wonder what the best approach to merge the lists? Collection.CopyTo() only copies to string[], and using a foreach() loop feels like being inefficient. However, since I also want to filter out duplicates, I feel like i’ll end up with a foreach that calls Contains() on the Collection.

I wonder, is there a more efficient way to have a recursive function that returns a list of strings without duplicates? I don’t have to use a Collection, it can be pretty much any suitable data type.

Only exclusion, I’m bound to Visual Studio 2005 and .net 3.0, so no LINQ.

Edit: To clarify: The Function takes a user out of Active Directory, looks at the Direct Reports of the user, and then recursively looks at the direct reports of every user. So the end result is a List of all users that are in the ‘command chain’ of a given user.Since this is executed quite often and at the moment takes 20 Seconds for some users, i’m looking for ways to improve it. Caching the result for 24 Hours is also on my list btw., but I want to see how to improve it before applying caching.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. If you’re using List<> you can use .AddRange to add one list to the other list.

    Or you can use yield return to combine lists on the fly like this:

    public IEnumerable<string> Combine(IEnumerable<string> col1, IEnumerable<string> col2) {     foreach(string item in col1)         yield return item;      foreach(string item in col2)         yield return item; }
    • 0