Skip to content
geeksforgeeks
  • Tutorials
    • Python
    • Java
    • Data Structures & Algorithms
    • ML & Data Science
    • Interview Corner
    • Programming Languages
    • Web Development
    • CS Subjects
    • DevOps And Linux
    • School Learning
    • Practice Coding Problems
  • Courses
    • DSA to Development
    • Get IBM Certification
    • Newly Launched!
      • Master Django Framework
      • Become AWS Certified
    • For Working Professionals
      • Interview 101: DSA & System Design
      • Data Science Training Program
      • JAVA Backend Development (Live)
      • DevOps Engineering (LIVE)
      • Data Structures & Algorithms in Python
    • For Students
      • Placement Preparation Course
      • Data Science (Live)
      • Data Structure & Algorithm-Self Paced (C++/JAVA)
      • Master Competitive Programming (Live)
      • Full Stack Development with React & Node JS (Live)
    • Full Stack Development
    • Data Science Program
    • All Courses
  • Java Arrays
  • Java Strings
  • Java OOPs
  • Java Collection
  • Java 8 Tutorial
  • Java Multithreading
  • Java Exception Handling
  • Java Programs
  • Java Project
  • Java Collections Interview
  • Java Interview Questions
  • Java MCQs
  • Spring
  • Spring MVC
  • Spring Boot
  • Hibernate
Open In App
Next Article:
PriorityBlockingQueue peek() method in Java
Next article icon

PriorityBlockingQueue peek() method in Java

Last Updated : 26 Nov, 2018
Comments
Improve
Suggest changes
Like Article
Like
Report
The peek() method of PriorityBlockingQueue returns the element at head of the PriorityBlockingQueue. It retrieves the value of the head of LinkedBlockingQueue but does not remove it. If the PriorityBlockingQueue does not contains any element, then this method returns null. A PriorityBlockingQueue queue uses the same ordering rules as class PriorityQueue. Syntax:
public E peek()
Parameter: This method does not take any parameter. Returns: This method returns the head of the PriorityBlockingQueue. Below program illustrate peek() method of PriorityBlockingQueue. Example 1: Java
// Java Program Demonstrate peek() // method of PriorityBlockingQueue  import java.util.concurrent.PriorityBlockingQueue;  public class GFG {     public static void main(String[] args)     {         // define capacity of PriorityBlockingQueue         int capacityOfQueue = 5;          // create object of PriorityBlockingQueue         PriorityBlockingQueue<Integer> PrioQueue             = new PriorityBlockingQueue<Integer>(capacityOfQueue);          // Add elements to PriorityBlockingQueue         PrioQueue.add(464161);         PrioQueue.add(416165);          // print PrioQueue         System.out.println("PrioQueue: " + PrioQueue);          // get head of PriorityBlockingQueue         int head = PrioQueue.peek();          // print head of PriorityBlockingQueue         System.out.println("Head of Queue: " + head);     } } 
Output:
  PrioQueue: [416165, 464161]  Head of Queue: 416165  
Example 2: To illustrate peek() method of PriorityBlockingQueue which contains list of names. Java
// Java Program Demonstrate peek() // method of PriorityBlockingQueue  import java.util.concurrent.PriorityBlockingQueue;  public class GFG {     public static void main(String[] args)     {          // define capacity of PriorityBlockingQueue         int capacityOfQueue = 5;          // create object of PriorityBlockingQueue          PriorityBlockingQueue<String> names             = new PriorityBlockingQueue<String>(capacityOfQueue);          // Add names of students of girls college         names.add("Geeks");         names.add("forGeeks");         names.add("A");         names.add("Computer");         names.add("Portal");          // print PrioQueue         System.out.println("List of Names: " + names.toString());          // get head of PriorityBlockingQueue         String head = names.peek();          // print head of PriorityBlockingQueue         System.out.println("Head of Queue: " + head);          // remove one name from head         names.poll();         System.out.println("First Name from head is removed");          // print PrioQueue         System.out.println("List of Names: " + names.toString());          // get head of PriorityBlockingQueue         head = names.peek();          // print head of PriorityBlockingQueue         System.out.println("Head of Queue: " + head);     } } 
Output:
  List of Names: [A, Computer, Geeks, forGeeks, Portal]  Head of Queue: A  First Name from head is removed  List of Names: [Computer, Portal, Geeks, forGeeks]  Head of Queue: Computer  
Reference: https://docs.oracle.com/javase/8/docs/api/java/util/concurrent/PriorityBlockingQueue.html#peek--

Next Article
PriorityBlockingQueue peek() method in Java

A

AmanSingh2210
Improve
Article Tags :
  • Misc
  • Java
  • Java-Collections
  • Java - util package
  • Java-Functions
  • Java-PriorityBlockingQueue
Practice Tags :
  • Java
  • Java-Collections
  • Misc

Similar Reads

    PriorityBlockingQueue poll() method in Java
    1. poll() Method The poll() method of PriorityBlockingQueue retrieves and removes element from head of this PriorityBlockingQueue. This method returns the element it removes from PriorityBlockingQueue but when the queue is empty then method will return null. Syntax: public E poll() Returns: This met
    4 min read
    PriorityBlockingQueue offer() method in Java
    1. offer(E e) Method The offer(E e) method of PriorityBlockingQueue inserts the element e, passed as parameter, in this PriorityBlockingQueue.This method inserts the element into this PriorityBlockingQueue. Since the PriorityBlockingQueue is unbounded, this method will be never be blocked. Syntax: p
    4 min read
    PriorityQueue peek() Method in Java
    The java.util.PriorityQueue.peek() method in Java is used to retrieve or fetch the first element of the Queue or the element present at the head of the Queue. The element retrieved does not get deleted or removed from the Queue. Syntax: Priority_Queue.peek() Parameters: The method does not take any
    2 min read
    PriorityBlockingQueue add() Method in Java
    The add(E e) method of PriorityBlockingQueue inserts the element passed as a parameter to the method at the tail of this PriorityBlockingQueue. This method returns true if the adding of the element is successful. Else it returns false. Syntax: public boolean add(E e) Parameter: This method takes a m
    2 min read
    PriorityBlockingQueue put() method in Java
    The put(E e) method of PriorityBlockingQueue is used to add an element into this queue. This method inserts the specified element into this priority queue. Since the queue is unbounded, this method will be never be blocked.Syntax: public void put(E e) Parameter: This method accepts a mandatory param
    2 min read
geeksforgeeks-footer-logo
Corporate & Communications Address:
A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh (201305)
Registered Address:
K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar, Uttar Pradesh, 201305
GFG App on Play Store GFG App on App Store
Advertise with us
  • Company
  • About Us
  • Legal
  • Privacy Policy
  • In Media
  • Contact Us
  • Advertise with us
  • GFG Corporate Solution
  • Placement Training Program
  • Languages
  • Python
  • Java
  • C++
  • PHP
  • GoLang
  • SQL
  • R Language
  • Android Tutorial
  • Tutorials Archive
  • DSA
  • Data Structures
  • Algorithms
  • DSA for Beginners
  • Basic DSA Problems
  • DSA Roadmap
  • Top 100 DSA Interview Problems
  • DSA Roadmap by Sandeep Jain
  • All Cheat Sheets
  • Data Science & ML
  • Data Science With Python
  • Data Science For Beginner
  • Machine Learning
  • ML Maths
  • Data Visualisation
  • Pandas
  • NumPy
  • NLP
  • Deep Learning
  • Web Technologies
  • HTML
  • CSS
  • JavaScript
  • TypeScript
  • ReactJS
  • NextJS
  • Bootstrap
  • Web Design
  • Python Tutorial
  • Python Programming Examples
  • Python Projects
  • Python Tkinter
  • Python Web Scraping
  • OpenCV Tutorial
  • Python Interview Question
  • Django
  • Computer Science
  • Operating Systems
  • Computer Network
  • Database Management System
  • Software Engineering
  • Digital Logic Design
  • Engineering Maths
  • Software Development
  • Software Testing
  • DevOps
  • Git
  • Linux
  • AWS
  • Docker
  • Kubernetes
  • Azure
  • GCP
  • DevOps Roadmap
  • System Design
  • High Level Design
  • Low Level Design
  • UML Diagrams
  • Interview Guide
  • Design Patterns
  • OOAD
  • System Design Bootcamp
  • Interview Questions
  • Inteview Preparation
  • Competitive Programming
  • Top DS or Algo for CP
  • Company-Wise Recruitment Process
  • Company-Wise Preparation
  • Aptitude Preparation
  • Puzzles
  • School Subjects
  • Mathematics
  • Physics
  • Chemistry
  • Biology
  • Social Science
  • English Grammar
  • Commerce
  • World GK
  • GeeksforGeeks Videos
  • DSA
  • Python
  • Java
  • C++
  • Web Development
  • Data Science
  • CS Subjects
@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox
Improvement
Suggest Changes
Help us improve. Share your suggestions to enhance the article. Contribute your expertise and make a difference in the GeeksforGeeks portal.
geeksforgeeks-suggest-icon
Create Improvement
Enhance the article with your expertise. Contribute to the GeeksforGeeks community and help create better learning resources for all.
geeksforgeeks-improvement-icon
Suggest Changes
min 4 words, max Words Limit:1000

Thank You!

Your suggestions are valuable to us.

What kind of Experience do you want to share?

Interview Experiences
Admission Experiences
Career Journeys
Work Experiences
Campus Experiences
Competitive Exam Experiences