This method searches for an element that matches the conditions defined by the specified predicate and returns the zero-based index of the last occurrence within the entire List<T>.
public int FindLastIndex (Predicate <T> match);
Here, the match is the Predicate <T> delegate that defines the conditions of the element to search for.
Return Value: If the element is found then it returns the zero-based index of type int or Int32 of the last element that matches a specified condition by the parameter “match”. And if not found then it returns “-1”.
Exception: This method will throw ArgumentNullException if the
match is null.
Example 1: In this example, creating a List named “PC” that contains some element. Our task is to find an element named “Computer” and prints its index.
Example 2: This example is the extended form of the previous example. In this example, we use an XML file and search an item and prints the index of that item. If the item is not found then prints “-1” and if found then prints the index. The item is\ “GeeksForGeeks”.
- The List<T> is searched backward starting at the last element and ending at the first element.
- The Predicate<T> is a delegate to a method that returns true if the object passed to it matches the conditions defined in the delegate. The elements of the current List<T> are individually passed to the Predicate<T> delegate.
- This method performs a linear search; therefore, this method is an O(n) operation, where n is Count.
- Method within method in java
- C# | CopyTo() Method
- C# | Math.Min() Method
- C# | StartsWith() Method
- C# | Math.Max() Method
- C# | IsNullOrWhiteSpace() Method
- C# | ToCharArray() Method
- C# | Remove() Method
- C# | IsNullOrEmpty() Method
- C# | Math.Abs() Method | Set - 2
- C# | Insert() Method
- C# | Replace() Method
- C# | Math.Tan() Method
- C# | Math.Cos() Method
- C# | Math.Sin() Method
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.