OSDev.org

Code: Select all

//yes..I know this is probably somewhere in the STL, but anyway...
class RobotList{
	unsigned int length;
	RobotObject *first,*last;
	public:
	unsigned int GetLen(){return length;}

	RobotList(Robot *first);
	void AddToList(Robot *to_add);
	void RemoveFromList(Robot *pointer); //this only looks for the first pointer that matches..
	void RemoveFromList(unsigned int index); //this could actually be easily accomplished by using operator []
	RobotObject * const GetFromList(unsigned int index);
	//RobotObject *const FindRobot(Robot *robot);
	unsigned int const FindRobot(Robot *robot);
	//the icing on the cake that makes things simple
	Robot *operator [] (unsigned int index);
	//RobotObject *operator[](unsigned int index);
	bool operator==(const Robot &cmp1,const Robot& cmp2){return 1;}
};

Code: Select all

bool operator==(Robot cmp1, Robot cmp2){return 1;} 

Code: Select all

src/LogiCode.cpp:271: error: no match for 'operator==' in 'LogiCode::crobot == *LogiCode::robots'
/mingw/include/objbase.h:79: note: candidates are: BOOL operator==(const GUID&, const GUID&)

Code: Select all

class Robot
{
public:
    ...
    bool operator==( const Robot& other ) const;
    ...
};

Code: Select all

    Foo foo, bar;
    if (foo == bar) // <-- Uses operator==, if defined.
       ...
    Foo* pFoo = &foo;
    Foo* pBar = &bar;

    if (pFoo == pBar) // <-- Now you're comparing pointers. No compiler magic here.
        ...

Code: Select all

	crobot=new Robot(5,2,test_brain);
	robots=new RobotList(crobot);
	robots->AddToList(new Robot(10,61,test_brain));
	robots->AddToList(new Robot(30,5,test_brain));
	if(crobot==robots[0]){cout << "pass" <<endl;} //error here
	robots->RemoveFromList(1);

Code: Select all

if(crobot(void*)==robots[0](void*))

Code: Select all

if ((void*) crobot == (void*) robots[0])

Code: Select all

class RobotList{
	unsigned int length;
	RobotObject *first,*last;
	public:
	unsigned int GetLen(){return length;}

	RobotList(Robot *first);
	void AddToList(Robot *to_add);
	void RemoveFromList(Robot *pointer); //this only looks for the first pointer that matches..
	void RemoveFromList(unsigned int index); //this could actually be easily accomplished by using operator []
	RobotObject * const GetFromList(unsigned int index);
	//RobotObject *const FindRobot(Robot *robot);
	unsigned int const FindRobot(Robot *robot);
	//the icing on the cake that makes things simple
	Robot *operator [] (unsigned int index); //HERE
	//RobotObject *operator[](unsigned int index);
//	bool operator==(const Robot cmp2){return 1;}
};

Code: Select all

// ~~~~~~~~~~~~~~~~~~~~~~~
// Headers
// ~~~~~~~~~~~~~~~~~~~~~~~
#include <stdlib.h>
#include <stdio.h>
#include <stdint.h>
#include <string.h>
// ~~~~~~~~~~~~~~~~~~~~~~~
// Constants And Defines
// ~~~~~~~~~~~~~~~~~~~~~~~
#define BRAIN_SIZE 5
// ~~~~~~~~~~~~~~~~~~~~~~~
// cRobot Class Declaration
// ~~~~~~~~~~~~~~~~~~~~~~~
class cRobot
{
	public:
	uint8_t brain[BRAIN_SIZE];
	cRobot();
	~cRobot();
	bool operator==(cRobot &a);
	cRobot& operator=(const cRobot &a);
};
// ~~~~~~~~~~~~~~~~~~~~~~~
// cRobotList Class Declaration
// ~~~~~~~~~~~~~~~~~~~~~~~
class cRobotList
{
	public:
	cRobot	*list[1024];
	cRobotList();
	~cRobotList();
	bool AddRobot(cRobot *a);
	cRobot* operator[](int index);
};
// ~~~~~~~~~~~~~~~~~~~~~~~
// cRobotList Class Implementation
// ~~~~~~~~~~~~~~~~~~~~~~~
cRobotList::cRobotList()
{
	memset(&list[0], 0, sizeof(list));
}
cRobotList::~cRobotList()
{
}
bool cRobotList::AddRobot(cRobot *a)
{
	uint32_t x;
	for(x = 0; x < 1024; ++x)
	{
		if(list[x] == 0)
		{
			list[x] = a;
			return true;
		}
	}
	return false;
}

cRobot* cRobotList::operator[](int index)
{
	return list[index];
}
// ~~~~~~~~~~~~~~~~~~~~~~~
// cRobot Class Implementation
// ~~~~~~~~~~~~~~~~~~~~~~~
cRobot::cRobot()
{
	memset(&brain[0], 0, BRAIN_SIZE);
}
cRobot::~cRobot()
{
}
bool cRobot::operator==(cRobot &a)
{
	uint32_t x;
	for(x = 0; (brain[x] == a.brain[x]) && (x < (BRAIN_SIZE-1)); ++x);
	return a.brain[x] == brain[x];
}
cRobot& cRobot::operator=(const cRobot &a)
{
	memcpy(&brain[0], &a.brain[0], BRAIN_SIZE);
	return *this;
}
// ~~~~~~~~~~~~~~~~~~~~~~~
// main entry
// ~~~~~~~~~~~~~~~~~~~~~~~
int main(int argc, char *argv[])
{
	cRobot *a = new cRobot(), *b = new cRobot();
	cRobotList *lst = new cRobotList();
	memset(&a->brain[0], 1, BRAIN_SIZE);
	memset(&b->brain[0], 4, BRAIN_SIZE);

	lst->AddRobot(a);
	lst->AddRobot(b);

	if(*a == *((*lst)[1]))
	{
		printf("equal.\n");
	}else{
		printf("not equal.\n");
	}
	return 1;
}

Code: Select all

(*robots)[0]