Hello!

I have a collection of List<Player> and I want to find the index where the
passed name match the player name in the collection.
Is the only solution to this to loop through the collection and check each
object.

I assume there is a better way

//Tony

"Tony Johansson" <(E-Mail Removed)> wrote in message
news:ilto87$64k$(E-Mail Removed)...

> I have a collection of List<Player> and I want to find the index where the
> passed name match the player name in the collection.
> Is the only solution to this to loop through the collection and check each
> object.
>
> I assume there is a better way

Then you make the same incorrect assumption that a lot of people do, because
ultimately a loop will be involved. Now, if you mean there must be a better
way than explicitly writing loop code, you could take advantage of extension
methods like Find(), assuming you're using .NET 3.x or higher. But there
WILL be a loop....

On 17-03-2011 15:43, Tony Johansson wrote:
> I have a collection of List<Player> and I want to find the index where the
> passed name match the player name in the collection.
> Is the only solution to this to loop through the collection and check each
> object.
>
> I assume there is a better way

The operation will always be a O(n) operation, where at runtime
a loop will be executed.

You can avoid a loop in the source code by using something
builtin.

The List IndexOf methods seems an obvious choice.

For that to work properly you should override Equals
and GetHashCode in the Player class.

But that is probably a good idea anyway.

Arne

"Arne Vajhøj" <(E-Mail Removed)> skrev i meddelandet
news:4d82746a$0$23763$(E-Mail Removed)...
> On 17-03-2011 15:43, Tony Johansson wrote:
>> I have a collection of List<Player> and I want to find the index where
>> the
>> passed name match the player name in the collection.
>> Is the only solution to this to loop through the collection and check
>> each
>> object.
>>
>> I assume there is a better way
>
> The operation will always be a O(n) operation, where at runtime
> a loop will be executed.
>
> You can avoid a loop in the source code by using something
> builtin.
>
> The List IndexOf methods seems an obvious choice.
>
> For that to work properly you should override Equals
> and GetHashCode in the Player class.
>
> But that is probably a good idea anyway.
>
> Arne
>

I have a generic collection List<Players> with several Players in the list.
Each player has several fields but one field is called name.
Now I want to find the index to the player in the list with name "putte" for
example
I now I can use a simple loop but I want to use some extension feature that
hide the looping.
So how to a write that ?

//Tony

"Tony Johansson" <(E-Mail Removed)> wrote in message
news:ilva64$i42$(E-Mail Removed)...

> I have a generic collection List<Players> with several Players in the
> list.
> Each player has several fields but one field is called name.
> Now I want to find the index to the player in the list with name "putte"
> for example
> I now I can use a simple loop but I want to use some extension feature
> that hide the looping.
> So how to a write that ?

I'm sure there's a lambda-expression way, but I'm no expert so here's the
delegate way:

string nameToFind = "Tony";
int index = myPlayerList.FindIndex(delegate(Player p)
{
return p.Name == nameToFind; // Or use some other comparison if you want
case-insensitivity
});

I hope I did that right; I don't use extension methods and anonymous
delegates very often.

On Mar 17, 3:43*pm, "Tony Johansson" <johansson.anders...@telia.com>
wrote:
> Hello!
>
> I have a collection of List<Player> and I want to find the index where the
> passed name match the player name in the collection.
> Is the only solution to this to loop through the collection and check each
> object.
>
> I assume there is a better way
>
> //Tony


If the better way is to use something more efficient. Instead of
using a List<> which implies a list that will most likely always be
read end-end. Instead use a Dictionary<Key,Value> which expects a
more key based lookup.