ShortBuffer isDirect() Method in Java with Examples

The isDirect() method of java.nio.ShortBuffer is used to check whether or not this short buffer is direct.

Syntax:

public abstract boolean isDirect()

Return Value: The method returns true if and only if, this buffer is direct

Below programs illustrate the use of isDirect() method:

Program 1:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program to demonstrate
// isDirect() method
  
import java.nio.*;
import java.util.*;
  
public class GFG {
    public static void main(String[] args)
    {
  
        short[] array = { 10000, 10640, 10189, -2000, -16780 };
  
        // creating short array
        ShortBuffer shortBuf1 = ShortBuffer.wrap(array);
  
        // checking if the array is Direct or not
        if (shortBuf1.isDirect()) {
            System.out.println("Short buffer is direct.");
        }
        else {
            System.out.println("Short buffer is not direct.");
        }
    }
}

chevron_right


Output:

Short buffer is not direct.

Program 2:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program to demonstrate
// isDirect() method
  
import java.nio.*;
import java.util.*;
  
public class GFG {
    public static void main(String[] args)
    {
  
        ByteBuffer b = ByteBuffer.allocateDirect(512);
  
        ShortBuffer shortBuf = b.asShortBuffer();
  
        // checking if the array is Direct or not
        if (shortBuf.isDirect()) {
            System.out.println("Short buffer is direct.");
        }
        else {
            System.out.println("Short buffer is not direct.");
        }
    }
}

chevron_right


Output:

Short buffer is direct.

Reference: https://docs.oracle.com/javase/9/docs/api/java/nio/ShortBuffer.html#isDirect–



My Personal Notes arrow_drop_up

Budding Web DeveloperKeen learnerAverage CoderDancer&Social Activist

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.