Velocity Reviews (http://www.velocityreviews.com/forums/index.php)
-   C++ (http://www.velocityreviews.com/forums/f39-c.html)
-   -   STL algorithm problem vector<vector<double> > and find (http://www.velocityreviews.com/forums/t283575-stl-algorithm-problem-vector-vector-double-and-find.html)

 Dennis 06-07-2004 09:40 PM

STL algorithm problem vector<vector<double> > and find

Hi

I'm trying to implement a vector of vectors where find can be used to
find a vector<double> in the vectors of vectors, that is hard to
understand i guess.
What I mean is that I got a vector foo containing vectors of the size
3. I then want to compare a vector<double> of size 3 (coord) with foo to find
a sequence of elements in foo that equals coord. However, when I try
this it returns when just one of the element of coord equals one
element in foo.

I just can't figure this out, is it possible to do this in any way ?
Example of what I want:

vector<double> coord(3,1);
vector<vector<double> > foo;
//fill foo with coordinates .......
vector<vector<double> >::iterator findIte =
find(foo.begin(),foo.end(),coord);

an example of foo:
1 1 0
0 0 1
0 0 2
1 1 1 <------- coord = (1 1 1), this is where findIte should point
1 0 1
1 0 0

I hope it makes a little sense what i'm trying to do.

Best Regards

Dennis

 Dennis 06-07-2004 10:09 PM

Re: STL algorithm problem vector<vector<double> > and find

Dennis <dler00TIL@control.auc.dk> writes:

> I hope it makes a little sense what i'm trying to do.
>

My mistake it was just my f.... debug code that didn't work as
expected, everything is as it should be.

Dennis

 All times are GMT. The time now is 12:37 PM.