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

  • Home
  • SEARCH
  • 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 96787
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 10, 20262026-05-10T23:52:48+00:00 2026-05-10T23:52:48+00:00

I created a Linked List, with insert, search and remove functions. I also created

  • 0

I created a Linked List, with insert, search and remove functions. I also created a iterator for it. Now, suppose I do this:

myList<Integer> test = new myList(); test.insert(30); test.insert(20); test.insert(10); myList.iterator it = test.search(20); if(it.hasNext())     System.out.println(it.next()); 

And voila, it works (it prints the value of the element at the node, in this case 20). Now, if I do this:

myList<Double> test = new myList(); test.insert(30.1); test.insert(20.1); test.insert(10.1); myList.iterator it = test.search(20.1); if(it.hasNext())     System.out.println(it.next()); 

It doesn’t, because the iterator is pointing to null. Here is the implementation of the search function:

public iterator search(T data) {     no<T> temp = first;     while( (temp != null) && (temp.data != data) )         temp = temp.next;     return (new iterator(temp)); } 

Here’s how I know there’s something fishy with the comparisons: If I change part of the above code like this:

while( (temp != null) && (temp.data != data) )      System.out.println(temp.data + ' ' + data);      temp = temp.next; 

I can see it printing the numbers in the list. It prints, at one point, ‘20.1 20.1’ (for example). So how can I fix this? The function appears to be right, but it just seems as if Java isn’t comparing the numbers correctly.

EDIT: wth, BigDecimal gave me the same kind of problem too.

EDIT 2: equals() worked, didn’t realize something else was amiss. Sorry.

  • 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. 2026-05-10T23:52:49+00:00Added an answer on May 10, 2026 at 11:52 pm

    You don’t want the != operator for this. It comapres references. You want the .equals() method:

    public iterator search(T data) {     no<T> temp = first;     while (!data.equals(temp.data)) {         temp = temp.next;     }     return (new iterator(temp)); } 

    Also, watch out for auto-boxing. You may find that test.search(20.1) boxes 20.1 to a Float not a Double, which will probably break your comparison. Compare the results with test.search(20.1d). If I recall correctly, the expression:

    new Float(20.1).equals(new Double(20.1)) 

    is false.

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

Sidebar

Ask A Question

Stats

  • Questions 335k
  • Answers 335k
  • Best Answers 0
  • User 1
  • Popular
  • Answers
  • Editorial Team

    How to approach applying for a job at a company ...

    • 7 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • Editorial Team

    How to handle personal stress caused by utterly incompetent and ...

    • 5 Answers
  • Editorial Team
    Editorial Team added an answer The safest option would be to revert your development environment… May 14, 2026 at 3:38 am
  • Editorial Team
    Editorial Team added an answer RuleFor(s => s.DepartureDateTime) .Must(BeAValidDate) .WithMessage("Invalid date/time"); and: private bool BeAValidDate(string… May 14, 2026 at 3:38 am
  • Editorial Team
    Editorial Team added an answer Here is what I ultimately arrived at. I will mark… May 14, 2026 at 3:38 am

Related Questions

[SOLVED] So I decided to try and create a sorted doubly linked skip list...
I'm using a SELECT statement in T-SQL on a table similar to this: SELECT
How would I create a linked list to hold my data in OCaml? I'm
I've been pondering this question for a while: Can you build a faster fundamental

Trending Tags

analytics british company computer developers django employee employer english facebook french google interview javascript language life php programmer programs salary

Top Members

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.