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 6885165
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T05:36:02+00:00 2026-05-27T05:36:02+00:00

I wrote this method. I don’t understand why it is write out this exception:

  • 0

I wrote this method. I don’t understand why it is write out this exception:

Exception in thread “main” java.lang.ClassCastException: Kocsma.Sör cannot be cast to java.lang.Comparable

Anybody know what is my mistake?

The compiler reference this line

beers.put(beer, dl);

This is my code:

private Map<Beer, Integer> beers = new TreeMap<Beer, Integer>();


public void Upload(Beer beer, int dl) {
    int d = 0;
    Beer s = null;
    for (Map.Entry<Beer, Integer> item : beers.entrySet()) {
        if (item.getKey().equals(beer)) {
            d = item.getValue();
            s = item.getKey();
        }
    }
    if (s != null) {
        beers.put(s, d + dl);
    }else
    beers.put(beer, dl); // Here is the problem by the Compiler
}

Class Kocsma:

public Kocsma() {
    Upload(new Beer("Borsodi sör", 160, 4.6), 1000);
    Upload(new Beer("Pilsner Urquell", 250, 4.4), 800);
    Upload(new Beer("Soproni Ászok", 150, 4.5), 900);
    Upload(new Beer("Dreher Classic", 200, 5.2), 600);
}
  • 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-27T05:36:03+00:00Added an answer on May 27, 2026 at 5:36 am

    Your Beer class needs to implement Comparable<Beer> or you need to provide a Comparator<Beer> to the TreeMap constructor.

    private static class BeerComparator implements Comparator<Beer> {
         @Override
         public int compare(Beer b1, Beer b2) {
             //return a value > 1 if b1 is greater than b2, < 1 if b2 greater than b1,
             //and exactly 0 if the two are equal
         }
    }
    
    beers = new TreeMap<Beer, Integer>(new BeerComparator());
    

    TreeMap stores keys by using a binary search tree. This works without effort for some common classes like Integer and String because they are naturally sortable and implement Comparable out of the box. However, for your Beer class, you would have to implement it manually.

    If Beer is not a good candidate for comparisons (most things aren’t) then consider using HashMap instead, and overriding equals() and hashCode() on Beer (see Effective Java Chapter 3 for a great reference on this).

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

Sidebar

Related Questions

I wrote this method to check if a page exists or not: protected bool
I wrote a method that extracts fields from an object like this: private static
I recently found out about C# extension methods and wrote this one: /// <summary>
I'm trying to write a method like this: public static T Test<T>() { if
Im new on Dxpreince 10.(and don't think im expert on this) I wrote simple
I am new to java.util.concurrent package and wrote a simple method which fetches some
So I have this really large method I wrote. If it's given a stack,
I wrote this function that's supposed to do StringPadRight("Hello", 10, "0") -> "Hello00000" .
I wrote this snippet of code and I assume len is tail-recursive, but a
I wrote this code I have these errors Cannot implicitly convert type x.Program.TreeNode' to

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.