Java ConcurrentLinkedQueue spliterator() Method

The spliterator() method of ConcurrentLinkedQueue class returns a weakly uniform Spliterator across the elements of this queue.

Syntax:

Parameters:

Specified By:

The spliterator() method of ConcurrentLinkedQueue class is specified by:

Spliterator() method in interface Collection<E>.
Spliterator() method in interface Iterable<E>.

Return Value:

The spliterator() method returns a Spliterator across the elements of this queue.

Example 1

import java.util.Spliterator;
import java.util.concurrent.ConcurrentLinkedQueue;
public class ConcurrentLinkedQueueSpliteratorMethodExample1 {
    static int i=1;
    public static void main(String[] args) {
        ConcurrentLinkedQueue<Character> queue = new ConcurrentLinkedQueue();
        for (char ch='A';ch<='Z';ch++) {
            queue.add(ch);
        }
        System.out.print("Alphabets : ");
        //spliterator  split and iterate the split parts in parallel
        Spliterator<Character> str = queue.spliterator();
        // if element exists tryAdvance() will perform action
        while(str.tryAdvance((n)->System.out.print(n+" ")));
    }
}

Test it Now

Output:

Alphabets : A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Example 2

import java.util.Spliterator;
import java.util.concurrent.ConcurrentLinkedQueue;
public class ConcurrentLinkedQueueSpliteratorMethodExample2 {
    static int i =0;
    public static void main(String[] args) {
        ConcurrentLinkedQueue<String> queue = new ConcurrentLinkedQueue();
        queue.add("aman");
        queue.add("bhavika");
        queue.add("chavi");
        queue.add("chandan");
        //spliterator  split and iterate the split parts in parallel
        Spliterator<String> str = queue.spliterator();
     // performs the action for each remaining element
        str.forEachRemaining(
                (n)-> {
                    String lc = n.toUpperCase();
                    System.out.println(++i +" Lower case = "+n);
                    System.out.println(i +" Upper case = "+lc);
                    System.out.println();
                }
        );
    }
}

Test it Now

Output:

1 Lower case = aman
1 Upper case = AMAN

2 Lower case = bhavika
2 Upper case = BHAVIKA

3 Lower case = chavi
3 Upper case = CHAVI

4 Lower case = chandan
4 Upper case = CHANDAN

Example 3

import java.util.Spliterator;
import java.util.concurrent.ConcurrentLinkedQueue;
class Information {
    String rollNo, name;
    int age;
    public Information(String rollNo, String name, int age) {
        this.rollNo = rollNo;
        this.name = name;
        this.age = age;
    }
}
   public class ConcurrentLinkedQueueSpliteratorMethodExample3{
    static int i=1;
        public static void main(String[] args) {
            ConcurrentLinkedQueue<Information> queue = new ConcurrentLinkedQueue();
            Information val1 = new Information("15cs1029","Reema panda",21);
            Information val2 = new Information("15cs1012","Geetanjali Sharma",21);
            Information val3 = new Information("15cs1011","Himanshu Bhardwaj",21);
            queue.add(val1);
            queue.add(val2);
            queue.add(val3);
            Spliterator<Information> str = queue.spliterator();
             while(str.tryAdvance((n)->System.out.println(i++ +" Roll No = "+n.rollNo +"\n Name = "+n.name +"\n Age = "+n.age+"\n")));
        }
    }

Test it Now

Output:

1 Roll No = 15cs1029
 Name = Reema panda
 Age = 21

2 Roll No = 15cs1012
 Name = Geetanjali Sharma
 Age = 21

3 Roll No = 15cs1011
 Name = Himanshu Bhardwaj
 Age = 21

Example 4

import java.util.Collections;
import java.util.Spliterator;
import java.util.concurrent.ConcurrentLinkedQueue;
public class ConcurrentLinkedQueueSpliteratorMethodExample4 {
    public static void main(String[] args) {
         Integer[] val = {0,1};
        ConcurrentLinkedQueue<Integer> queue = new ConcurrentLinkedQueue();
        queue.add(7118);
        queue.add(800);
        queue.add(1178);
        queue.add(1190);
        //spliterator  split and iterate the split parts in parallel
        Spliterator<Integer> str = queue.spliterator();
        str.forEachRemaining(
                (Integer n) -> {
                    System.out.println(n);
                     val[0] = Collections.max(queue);
                     val[1]=Collections.min(queue);
                 }
        );
        System.out.println("Max number = "+ val[0]);
        System.out.println("Min number = "+ val[1]);
    }
}

Test it Now

Output:

7118
800
1178
1190
Max number = 7118
Min number = 800

Next TopicJava ConcurrentLinkedQueue

← prev next →

For Videos Join Our Youtube Channel: Join Now

Feedback

Send your Feedback to [email protected]

Help Others, Please Share

Learn Latest Tutorials

Splunk

SPSS

Swagger

Transact-SQL

Tumblr

ReactJS

Regex

Reinforcement Learning

R Programming

RxJS

React Native

Python Design Patterns

Python Pillow

Python Turtle

Keras

Preparation

Aptitude

Reasoning

Verbal Ability

Interview Questions

Company Questions

Trending Technologies

Artificial Intelligence

AWS

Selenium

Cloud Computing

Hadoop

ReactJS

Data Science

Angular 7

Blockchain

Git

Machine Learning

DevOps

B.Tech / MCA

DBMS

Data Structures

DAA

Operating System

Computer Network

Compiler Design

Computer Organization

Discrete Mathematics

Ethical Hacking

Computer Graphics

Software Engineering

Web Technology

Cyber Security

Automata

C Programming

C++

Java

.Net

Python

Programs

Control System

Data Mining

Data Warehouse

^{Like/Subscribe us for latest updates or newsletter}