Java Guava | Chars.indexOf(char[] array, char target) method with Examples

Chars.indexOf(char[] array, char target) method of Guava’s Chars Class accepts two parameters array and target. If the target exists within the array, the method returns the position of its first occurrence. If the target does not exist within the array, the method returns -1.

Syntax:

public static int indexOf(char[] array, char target)



Parameters: The method accepts two parameters:

  • array: which is the integer array in which the target array is to checked for index.
  • target: which is the value to be searched for as an element in the spcified array.

Return Value: The method returns an integer value as follows:

  • It returns the position of first occurence of the target if the target exists in the array.
  • Else it returns -1 if the target does not exist in the array.

Exceptions: The method does not throw any exception.

Below examples illustrate the implementation of above method:

Example 1:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java code to show implementation of
// Guava's Chars.indexOf(char[] array,
// char target) method
  
import com.google.common.primitives.Chars;
import java.util.Arrays;
  
class GFG {
  
    // Driver's code
    public static void main(String[] args)
    {
  
        // Creating an char array
        char[] arr = { 'G', 'F', 'G', 'E', 'E' };
  
        char target = 'E';
  
        System.out.println("Array: "
                           + Arrays.toString(arr));
  
        System.out.println("Target: " + target);
  
        // Using Chars.indexOf(char[] array, char target)
        // method to get the position of the first
        // occurrence of the specified target within array,
        // or -1 if there is no such occurrence.
        int index = Chars.indexOf(arr, target);
  
        if (index != -1) {
            System.out.println("Target is present at index "
                               + index);
        }
        else {
            System.out.println("Target is not present "
                               + "in the array");
        }
    }
}

chevron_right


Output:

Array: [G, F, G, E, E]
Target: E
Target is present at index 3

Example 2:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java code to show implementation of
// Guava's Chars.indexOf(char[] array,
// char target) method
  
import com.google.common.primitives.Chars;
import java.util.Arrays;
  
class GFG {
  
    // Driver's code
    public static void main(String[] args)
    {
  
        // Creating an char array
        char[] arr = { 'H', 'E', 'L', 'L', 'O' };
  
        char target = 'G';
  
        System.out.println("Array: "
                           + Arrays.toString(arr));
  
        System.out.println("Target: " + target);
  
        // Using Chars.indexOf(char[] array, char target)
        // method to get the start position of the first
        // occurrence of the specified target within array,
        // or -1 if there is no such occurrence.
        int index = Chars.indexOf(arr, target);
  
        if (index != -1) {
            System.out.println("Target is present at index "
                               + index);
        }
        else {
            System.out.println("Target is not present"
                               + " in the array");
        }
    }
}

chevron_right


Output:

Array: [H, E, L, L, O]
Target: G
Target is not present in the array

Reference: https://google.github.io/guava/releases/18.0/api/docs/com/google/common/primitives/Chars.html#indexOf(char[], %20char)



My Personal Notes arrow_drop_up

In love with a semicolon because sometimes i miss it so badly)

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.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.




Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.