Still celebrating National IT Professionals Day with 3 months of free Premium Membership. Use Code ITDAY17

x
?
Solved

removing members from an ArrayList

Posted on 2007-04-05
6
Medium Priority
?
218 Views
Last Modified: 2012-05-05
i am adding an object "pnew" to a queue (which i am implementing as an arrayList--same thing right?) after I add it i need to back up a step so I have a "remove" method which takes off the last element in "pnew".  The problem is that when I remove the member from "pnew", it also removes it from the queue.  The queue is an ArrayList of paths, pnew is an ArrayList of integers

path pnew = new path(start);
ArrayList<path> queue = new ArrayList<path>();

queue.add(pnew);
pnew.remove();
0
Comment
Question by:jpking72
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
  • 3
  • 3
6 Comments
 
LVL 30

Expert Comment

by:Mayank S
ID: 18860643
>> which i am implementing as an arrayList--same thing right

You mean the ArrayList implements a queue? It can....

Though it looks like you have:

/* Queue --> */ path pnew = new path(start);
/* ArrayList --> */ ArrayList<path> queue = new ArrayList<path>(); // also named as 'queue' ?

>> pnew.remove();

We need to know what is the implementation of the path class and what it does.
0
 

Author Comment

by:jpking72
ID: 18861378
====================================================

        int source = this.findNode(a);
        int sink = this.findNode(b);
        curr.add(source);
        path p = new path(curr);
        queue.add(p);
       
       
       
        for (int row = 0; row < nodes.length; row++) {
            path pnew = queue.remove(0);
            for (int col = 0; col < nodes.length;  col++) {
                if (matrixCap[row][col] != 0) {
                    pnew.add(col);
                    if (pnew.contains(sink))
                        System.out.println(queue.toString());
                    queue.add(pnew);
                    pnew.remove();
                }
        }
           
       
    }
========================================
class path
========================================
public class path {
   
    private ArrayList<Integer> in = new ArrayList<Integer>();
   
    /** Creates a new instance of path */
    public path(ArrayList<Integer> i) {
       
        for (int j = 0; j < i.size(); j ++) {
            in.add(j, i.get(j));
        }
       
    }
   
    public ArrayList<Integer> add(Integer i) {
       
        in.add(i);
        return in;
    }
   
    public ArrayList<Integer> remove() {
       
        if (in.size() >0){
        in.remove(in.size()-1);
        return in;}
       
        else return in;
       
    }
   
    public boolean contains(int sink) {
        for (int i = 0; i < in.size(); i++) {
            if (in.get(i).equals(sink))
                return true;
        }
        return false;
    }
   
    public String toString() {
        StringBuilder out = new StringBuilder();
        out.append("found path: ");
       
        for (int i = 0; i < in.size(); i++)  {
            out.append(in.get(i));
            out.append(" ");
        }    
            return out.toString();
       
   
}
}
0
 
LVL 30

Accepted Solution

by:
Mayank S earned 1000 total points
ID: 18866335
'queue' is an array list of path, so there is not a direct relationship between path and 'queue'.
0
Technology Partners: We Want Your Opinion!

We value your feedback.

Take our survey and automatically be enter to win anyone of the following:
Yeti Cooler, Amazon eGift Card, and Movie eGift Card!

 

Author Comment

by:jpking72
ID: 18867304
i don't understand...i rewrote the code and still the same problem:
when I update current[i], queue also changes the previous entry in the ArrayList.  I want it to add another distinct array to the end of the ArrayList every time.

ArrayList<int[]> queue = new ArrayList<int[]>();
int[] current = new int[10];

for (col = 0; col<nodes.length; col++) {
current[i] = col;
queue.add(current)
}
0
 

Author Comment

by:jpking72
ID: 18868345
hello?
0
 
LVL 30

Expert Comment

by:Mayank S
ID: 18868854
If path holds Integers, maybe even the array list should be of Integers

ArrayList <Integer> queue = new ArrayList <Integer> () ;

>> hello?

Be patient - I come here in my free time and our time zones could also be different. Any reason for the C  grade?
0

Featured Post

Free Tool: Subnet Calculator

The subnet calculator helps you design networks by taking an IP address and network mask and returning information such as network, broadcast address, and host range.

One of a set of tools we're offering as a way of saying thank you for being a part of the community.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Java contains several comparison operators (e.g., <, <=, >, >=, ==, !=) that allow you to compare primitive values. However, these operators cannot be used to compare the contents of objects. Interface Comparable is used to allow objects of a cl…
In this post we will learn different types of Android Layout and some basics of an Android App.
Viewers learn how to read error messages and identify possible mistakes that could cause hours of frustration. Coding is as much about debugging your code as it is about writing it. Define Error Message: Line Numbers: Type of Error: Break Down…
This tutorial covers a step-by-step guide to install VisualVM launcher in eclipse.
Suggested Courses

721 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question