X-Git-Url: http://shamusworld.gotdns.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=src%2Fcontainer.cpp;h=a8cf0ad87ec45015ee5f0f73729ed7412b33a680;hb=9d59b5831000704a1ed39c22a6043ba658993159;hp=e125672eac63c6690d4d1cbc4da044e08a9e6ee7;hpb=043ecf4d074909ba2f7f53237962f9eaa72f19c2;p=architektonas

diff --git a/src/container.cpp b/src/container.cpp
index e125672..a8cf0ad 100644
--- a/src/container.cpp
+++ b/src/container.cpp
@@ -16,6 +16,7 @@
 #include "container.h"
 
 #include <QtGui>
+#include "dimension.h"
 
 
 Container::Container(Vector p1, Object * p/*= NULL*/): Object(p1, p),
@@ -23,22 +24,55 @@ Container::Container(Vector p1, Object * p/*= NULL*/): Object(p1, p),
 {
 }
 
+
+// Copy constructor
+Container::Container(const Container & copy): Object(copy.position, copy.parent)
+{
+	// Use overloaded assignment operator
+	*this = copy;
+}
+
+
 Container::~Container()
 {
-	// No memory leaks!
-	while (objects.size() > 0)
+	Clear();
+}
+
+
+// Assignment operator
+Container & Container::operator=(const Container & from)
+{
+	// Take care of self-assignment
+	if (this == &from)
+		return *this;
+
+	Clear();
+
+	// Small problem with this approach: if the copied object goes out of scope,
+	// all of the objects we copied in here will be deleted. D'oh!
+	for(uint i=0; i<from.objects.size(); i++)
 	{
-		delete objects[0];
-		objects.erase(objects.begin());
+		Object * object = from.objects[i];
+
+		// Need to copy the object here...
+
+		objects.push_back(object);
 	}
+
+	return *this;
 }
 
+
 /*virtual*/ void Container::Draw(Painter * painter)
 {
 	for(int i=0; i<(int)objects.size(); i++)
+	{
+//printf("Container: About to draw (object = $%X)\n", objects[i]);
 		objects[i]->Draw(painter);
+	}
 }
 
+
 /*virtual*/ Vector Container::Center(void)
 {
 	return position;
@@ -57,6 +91,7 @@ I click here and drag there?"
 Also: should put the snap logic into the Object base class (as a static method)...
 */
 
+
 /*virtual*/ bool Container::Collided(Vector point)
 {
 	objectWasDragged = false;
@@ -117,8 +152,38 @@ Like so:
 		{
 			if (objects[i]->Collided(point))
 			{
-				objects.erase(objects.begin() + i);	// Calls the destructor, (deletes the object, I presume... O_o)
+#if 0
+Dimension * dimension = objects[i]->GetAttachedDimension();
+#endif
+				Object * objectToDelete = objects[i];
+				objects.erase(objects.begin() + i);	// Calls the destructor, (deletes the object, I presume... O_o) [NOPE! SURE DOESN'T!]
+				delete objectToDelete;
+
+// If this object had an attached dimension, reattach it to another object, if any...
+// The only problem with that approach is if the object it gets attached to is deleted,
+// it will call the dimension to use a NULL pointer and BLAMMO
+#if 0
+if (dimension)
+{
+	Vector p1 = dimension->GetPoint1();
+	Vector p2 = dimension->GetPoint2();
+	for(int j=0; j<(int)objects.size(); j++)
+	{
+		Vector * objectP1 = objects[i]->GetPointAt(p1);
+		Vector * objectP2 = objects[i]->GetPointAt(p2);
+
+		if (objectP1)
+			dimension->SetPoint1(objectP1);
+
+		if (objectP2)
+			dimension->SetPoint2(objectP2);
+	}
+}
+#endif
+				// This only allows deleting objects one at a time...
 				break;
+				// however, this way of doing things could be problematic if we don't
+				// delete one at a time... Need to come up with a better approach.
 			}
 		}
 	}
@@ -138,8 +203,10 @@ Like so:
 	return collision;
 }
 
+
 // The TLC is passing all mouse movement here, so we're doing the same here.
 // Need to adjust all other objects to handle things correctly.
+
 // One optimization that will need to be done eventually is to subdivide the screen
 // into parts and keep subdividing until an acceptable number of objects lie within
 // the slice. This way, the GUI will still be responsive and *not* have to test
@@ -159,6 +226,7 @@ Like so:
 //	needUpdate = false;
 }
 
+
 /*virtual*/ void Container::PointerReleased(void)
 {
 	dragging = false;
@@ -179,11 +247,12 @@ about keeping track of old states...
 		objects[i]->PointerReleased();
 }
 
+
 /*virtual*/ bool Container::NeedsUpdate(void)
 {
 	needUpdate = false;
 
-	for(int i=0; i<(int)objects.size(); i++)
+	for(uint i=0; i<objects.size(); i++)
 	{
 		if (objects[i]->NeedsUpdate())
 			needUpdate = true;
@@ -192,7 +261,36 @@ about keeping track of old states...
 	return needUpdate;
 }
 
+
 /*virtual*/ void Container::Add(Object * object)
 {
 	objects.push_back(object);
+printf("Container: Added object (=$%X). size = %li\n", object, objects.size());
+}
+
+
+void Container::Clear(void)
+{
+	// No memory leaks!
+	while (objects.size() > 0)
+	{
+printf("Container: Deleting object ($%X)...\n", objects[0]);
+		delete objects[0];
+		objects.erase(objects.begin());
+	}
 }
+
+
+/*virtual*/ void Container::Enumerate(FILE * file)
+{
+	// Only put "CONTAINER" markers if *not* the top level container
+	if (parent != NULL)
+		fprintf(file, "CONTAINER\n");
+
+	for(uint i=0; i<objects.size(); i++)
+		objects[i]->Enumerate(file);
+
+	if (parent != NULL)
+		fprintf(file, "ENDCONTAINER\n");
+}
+