/Java/Java circular buffer implementation on array

Java circular buffer implementation on array

// Java program to implement a
// Circular Buffer using an array
 
import java.io.*;
import java.lang.*;
class CircularBuffer {
 
    // Initial Capacity of Buffer
    private int capacity = 0;
    // Initial Size of Buffer
    private int size = 0;
    // Head pointer
    private int head = 0;
    // Tail pointer
    private int tail = -1;
    private Object[] array;
 
    // Constructor
    CircularBuffer(int capacity)
    {
        // Initializing the capacity of the array
        this.capacity = capacity;
 
        // Initializing the array
        array = new Object[capacity];
    }
 
    // Addition of elements
    public void add(Object element) throws Exception
    {
 
        // Calculating the index to add the element
        int index = (tail + 1) % capacity;
 
        // Size of the array increases as elements are added
        size++;
 
        // Checking if the array is full
        if (size == capacity) {
            throw new Exception("Buffer Overflow");
        }
 
        // Storing the element in the array
        array[index] = element;
 
        // Incrementing the tail pointer to point
        // to the element added currently
        tail++;
    }
 
    // Deletion of elements
    public Object get() throws Exception
    {
 
        // Checking if the array is empty
        if (size == 0) {
            throw new Exception("Empty Buffer");
        }
 
        // Calculating the index of the element to be
        // deleted
        int index = head % capacity;
 
        // Getting the element
        Object element = array[index];
 
        // Incrementing the head pointer to point
        // to the next element
        head++;
 
        // Decrementing the size of the array as the
        // elements are deleted
        size--;
 
        // Returning the first element
        return element;
    }
 
    // Retrieving the first element without deleting it
    public Object peek() throws Exception
    {
 
        // Checking if the array is empty
        if (size == 0) {
            throw new Exception("Empty Buffer");
        }
 
        // Calculating the index of the
        // element to be deleted
        int index = head % capacity;
 
        // Getting the element
        Object element = array[index];
 
        // Returning the element
        return element;
    }
 
    // Checking if the array is empty
    public boolean isEmpty() { return size == 0; }
 
    // Size of the array
    public int size() { return size; }
}
 
class Main {
    public static void main(String[] args) throws Exception
    {
 
        // Creating the Circular Buffer
        CircularBuffer cb = new CircularBuffer(10);
 
        // Adding elements to the circular Buffer
        cb.add(5);
        cb.add(6);
        cb.add(7);
        cb.add(1);
        cb.add(4);
 
        // Printing the elements
        System.out.println(
            "The elements are printed in the order :-");
        System.out.println(cb.get());
        System.out.println(cb.get());
        System.out.println(cb.get());
        System.out.println(cb.get());
        System.out.println(cb.get());
    }
}

Source: geeksforgeeks.org

Similar codes

0 vote176 views1 answer
Mergesort parallelization using Spark
Java
1 vote176 views1 answer
Convert date to calendar java
Java
0 vote180 views1 answer
Webmvctest vs springboottest
Java
0 vote224 views1 answer
Session-less control using java
Java
0 vote162 views1 answer
Add a value to a list java in java hashmap
Java
1 vote163 views1 answer
Difference between abstract class and final
Java
4 votes176 views3 answers
Javafx button color
Java
4 votes163 views2 answers
Dfhgodjfgiojdfiojgjkdhjbsdv JKNJZXcnmvmcvbpdfh
Java
14 votes161 views3 answers
Java arraylist add
Java
0 vote182 views1 answer
Start async task android
Java