CODEWITHSUNDEEP
c#.netlinqarrayscomparison
codymanix
codymanix

Reputation: 29468

Array.BinarySearch where a certain condition is met

I have an array of a certain type. Now I want to find an entry where a certain condition is met.

What is the preferred way to do this with the restriction that I don't want to create a temporary object to find, but instead I only want to give a search condition. 

MyClass[] myArray;
// fill and sort array..
MyClass item = Array.BinarySearch(myArray, x=>x.Name=="Joe"); // is this possible?

Maybe is it possible to use LINQ to solve it?

EDIT: I know that it works on normal collections, but I need it to work for BinarySearch.

Upvotes: 2

Views: 2359

Answers (3)

EgorBo
EgorBo

Reputation: 6142

No, BinarySearch does not contains overload with Comparision<> parameter. You can use LINQ method instead:

MyClass item = myArray.FirstOrDefault(x => x.Name == "Joe");

Upvotes: -1

tvanfosson
tvanfosson

Reputation: 532435

Just use FirstOrDefault (or SingleOrDefault, if unique).

 var myItem =  myArray.FirstOrDefault( x => x.Name == "Joe" );

Or if you want to force a BinarySearch and you know that the array is sorted

 var myItem = Array.BinarySearch( myArray,
                                  new MyClass { Name = "Joe" },
                                  new MyClassNameComparer() );

where MyClassNameComparer is IComparer<MyClass> and compares based on the name property.

If you don't want any temporary object -- I assume that a constant string is ok, otherwise you're lost -- then you can use.

 var myItem = Array.BinarySearch( myArray,
                                  "Joe",
                                  MyClassOrStringComparer() );

Where MyClassOrStringComparer is able to compare a string to a MyClass object (and vice versa).

public class MyClassOrStringComparer
{
     public int Compare( object a, object b )
     {
         if (object.Equals(a,b))
         {
             return 0;
         }
         else if (a == null)
         {
             return -1;
         }
         else if (b == null)
         {
             return 1;
         }

         string aName = null;
         string bName = null;

         if (a is string)
         {
             aName = a;
         }
         else
         {
             aName = ((MyClass)a).Name;
         }

         if (b is string)
         {
             bName = b;
         }
         else
         {
             bName = ((MyClass)b).Name;
         }

         return aName.CompareTo( b.Name );
   }

Upvotes: 3

Ben Voigt
Ben Voigt

Reputation: 283634

BinarySearch can only be used when the array is sorted, and only when searching for a particular value of the sort key. So this rules out use of an arbitrary predicate.

Upvotes: 2

Related Questions