Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7402531
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 29, 20262026-05-29T04:46:01+00:00 2026-05-29T04:46:01+00:00

I have created a priority queue using the Java API and I want to

  • 0

I have created a priority queue using the Java API and I want to remove a specific element from the priority queue at the end of the program. I know it has to do something with the comparator but I can’t figure it out. Can someone help? Here’s my code:

public static void main(String[] args)
{
    PriorityQueue<Element> X = new PriorityQueue<Element>(100, new ElementComparator());
    X.add(new Element(30, 3));
    X.add(new Element(700, 4.5));
    X.add(new Element(100, 6.2));
    X.add(new Element(2, 8.1));
    System.out.println(X.remove(new Element(100, 6.2)));
}

and here’s my Element class:

private int index;
private double value;

public Element(int i, double v) 
{
    index = i;
    value = v;
}

public int getIndex() { return index;};
public double getValue() { return value;};
public void setValue(double v) { value = v;};

And here’s the comparator that I created:

public int compare(Element o1, Element o2)
{
    int idx1 = o1.getIndex();
    int idx2 = o2.getIndex();
    if (idx1 < idx2) {
        return -1;
    } else if (idx1 > idx2) {
        return 1;
    } else {
        return 0;
    }
}

public boolean equals(Element o1, Element o2) 
{
    return o1.getIndex() == o2.getIndex();
}

I appreciate your help…

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-29T04:46:02+00:00Added an answer on May 29, 2026 at 4:46 am

    You need to define equals() and hashcode() on your Element object as such:

    public class Element{
        private int index;
        private double value;
    
        public Element(int i, double v)
        {
            index = i;
            value = v;
        }
    
        public int getIndex() { return index;}
        public double getValue() { return value;}
        public void setValue(double v) { value = v;}
    
        @Override
        public boolean equals(Object o) {
            if (this == o) return true;
            if (!(o instanceof Element)) return false;
    
            Element element = (Element) o;
    
            if (index != element.index) return false;
    
            return true;
        }
    
        @Override
        public int hashCode() {
            return index;
        }
    }
    

    Defining equals() on the ElementComparator does not perform the same task.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have to implement Priority Queue using MultiMap. I use MultiMap from Google Collections.
I have created a binary heap, which represents a priority queue. It's just classical
I have created a custom dialog for Visual Studio Setup Project using the steps
I have created a C# class file by using a XSD-file as an input.
I have created a few small flash widgets that stream .mp3 audio from an
have a view that loads and a serial dispatch queue that is created, loads
I have just created an Ubuntu virtual machine for web development and I want
In the big picture, I'm trying to implement Dijkstra's algorithm using a priority queue.
I have created a Java Applet that will be used in IE to print
I am writing a specific priority queue. Its structure needs to be something as

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.