Searches a range of elements in the sorted List for an element using the specified comparer and returns the zero-based index of the element. : List « Collections Data Structure « C# / C Sharp






Searches a range of elements in the sorted List for an element using the specified comparer and returns the zero-based index of the element.

   

using System;
using System.Collections.Generic;

public class MyComparer : IComparer<string>
{
    public int Compare(string x, string y)
    {
        if (x == null)
        {
            if (y == null)
            {
                return 0;
            }
            else
            {
                return -1;
            }
        }
        else
        {
            if (y == null)
            {
                return 1;
            }
            else
            {
                int retval = x.Length.CompareTo(y.Length);
                if (retval != 0)
                {
                    return retval;
                }
                else
                {
                    return x.CompareTo(y);
                }
            }
        }
    }
}

public class Example
{
    public static void Main()
    {
        List<string> myList = new List<string>();

        myList.Add("A");
        myList.Add("BC");
        myList.Add("DEF");

        int herbivores = 5;
        Display(myList);

        MyComparer dc = new MyComparer();

        myList.Sort(0, herbivores, dc);
        Display(myList);

        int index = myList.BinarySearch(0, herbivores, "BC", dc);

        if (index < 0)
        {
            myList.Insert(~index, "BC");
            herbivores++;
        }

        Display(myList);
    }

    private static void Display(List<string> list)
    {
        Console.WriteLine();
        foreach (string s in list)
        {
            Console.WriteLine(s);
        }
    }
}

   
    
    
  








Related examples in the same category

1.new List() Add(assembly1) Indexer
2.Get the size of a list
3.Add Item to a list object
4.Search Test
5.Remove Item from a List
6.Change Contents
7.Reverse Contents
8.Hash List to Hash Array
9.Load elements into a generic list from an array
10.Lazy List
11.Slice list
12.Chunked List
13.Flatten a List
14.Keyed List
15.Convert a collection of strings to a comma separated list.
16.Convert List To Array
17.Compare two Lists
18.Name Value Pair List
19.Get Distinct value from a List
20.Adds the elements of the specified collection to the specified generic IList.
21.List(T) Class represents a strongly typed list of objects that can be accessed by index.
22.IList Interface represents a non-generic collection of objects that can be individually accessed by index.
23.Determines whether an element is in the List.
24.Converts the elements in the current List to another type, and returns a list containing the converted elements.
25.Copies a range of elements from the List to a compatible one-dimensional array, starting at the specified index of the target array.
26.Determines whether the List contains elements that match the conditions defined by the specified predicate.
27.Performs the specified action on each element of the List.
28.Searches for object and returns the zero-based index
29.Searches for object and returns the zero-based index of the last occurrence
30.Reverses the order of the elements in the specified range.
31.Weak Collection
32.Sorted Collection
33.Paged List
34.Get Search List
35.Find All Index
36.Evented List
37.SortedList
38.Reverse a List
39.Shuffles the specified list
40.Sequence is an abstraction of a data reseqeuncer
41.Generic Paged List
42.A list implementation that is loaded the first the contents are examined
43.Creates a list by combining two other lists into one.
44.Creates a list by repeating another list.
45.Compare two arrays and two lists