Learn how to a build a cloud-first strategyRegister Now

x
  • Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 529
  • Last Modified:

C++ Vectors

I was looking at figuring out what the quickest way of 'finding' a value in vectors are.

For example, when I scan through all my ships in game, I'll do something like:

      const ShipClass *ship = &game->ship[0];
      const ShipClass* end1 = ship + Nobj;
      while (ship != end1)
      {
            if (ship && ship->active) {
                                      //DO STUFF HERE
            }
            ship++;
      }

I'm wondering to 'find', I need to do something similar, going through an array and matching it with what I'm looking for, like:

              int findthis = 30;
      const ShipClass *ship = &game->ship[0];
      const ShipClass* end1 = ship + Nobj;
      while (ship != end1)
      {
            if (ship && ship->id == findthis) {
                                      //DO STUFF HERE
            }
            ship++;
      }


Rather, I am wondering if this is the fastest possible solution for this, or if there is a better/quicker method for finding a value in a vector list.

Any suggestions/tips? Thanks!
0
Valleriani
Asked:
Valleriani
  • 2
2 Solutions
 
w00teCommented:
This is from memory, but it should work for a simple function.  It's an example of the kind of things evilrix is pointing out.
It uses a template function though, you just pass in the int value you want to search for as a template parameter and it looks for it.  You could adjust this to take in any value (including another Ship object), and you can perform whatever comparisons you want in the function.  Find if will always give the iterator to the first position the said value was found in.
Most of the code is just there to set up the vector, the find if function accomplishes pretty much everything :)
Enjoy,
(PS, I compiled it on linux but i had to type it on windows where there istn a compiler, so if theres a typo just try and fix it, the idea works ;) )
-w00te

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct Ship
{
	int id;
	Ship(int x) : id(x) {}
};

int main()
{
	template <int T>
	bool FindCondition(const Ship& ship) {return ship.id == T; }

	vector<Ship> sVec;
	sVec.push_back(Ship(12));
	sVec.push_back(Ship(15));

	vector<Ship>::iterator iter = find_if(sVec.begin(), sVec.end(), FindCondition<15>);

	if (iter != sVec.end())
		cout<<iter->id<<" was found." <<endl;
}

Open in new window

0
 
w00teCommented:
Sorry about that, tried to compile now, i pushed the template in main accidentally hehe.  Here's the working code:
 template <int T>
 bool FindCondition(const Ship& ship) {return ship.id == T; }

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct Ship
{
	int id;
	Ship(int x) : id(x) {}
};

template <int T>
bool FindCondition(const Ship& ship) {return ship.id == T; }

int main()
{
	vector<Ship> sVec;
	sVec.push_back(Ship(12));
	sVec.push_back(Ship(15));

	vector<Ship>::iterator iter = find_if(sVec.begin(), sVec.end(), FindCondition<15>);

	if (iter != sVec.end())
		cout<<iter->id<<" was found." <<endl;
}

Open in new window

0
 
VallerianiAuthor Commented:
Thank you both!
0

Featured Post

What does it mean to be "Always On"?

Is your cloud always on? With an Always On cloud you won't have to worry about downtime for maintenance or software application code updates, ensuring that your bottom line isn't affected.

  • 2
Tackle projects and never again get stuck behind a technical roadblock.
Join Now