class HeapTest {
public:
	HeapTest() {
		printf("0x%x HeapTest alive!\n",this);
	}
	~HeapTest() {
		printf("0x%x goodbye from HeapTest!\n",this);
	}
	static void *operator new (size_t size) {
		void *memPtr=::operator new(size);
		printf("0x%x heap!\n",memPtr);
		return memPtr;
	}
	static void *operator new[] (size_t size) {
		void *memPtr=::operator new(size);
		printf("0x%x heap array!\n",memPtr);
		printf("sizeof(me):%d\n",sizeof(HeapTest));
		printf("therefore, i am creating %d of me\n",(size/sizeof(HeapTest))-1);
		printf("therefore the following are on the heap:\n");
		char *htp=(char *) memPtr;
		for (unsigned int i=1;i<size/sizeof(HeapTest);i++)
			printf("0x%x (%d)\n",htp+i*sizeof(HeapTest),i);
		return memPtr;
	}
	void SayHi(char *msg) {
		printf("0x%x hi:%s\n",this,msg);
	}
	int x;	

};

int main() {

	HeapTest ht;
	ht.SayHi("ht");

	HeapTest *htp = new HeapTest;
	htp->SayHi("htp");
	delete htp;

	HeapTest *htpa = new HeapTest[3];
	htpa[2].SayHi("htpa[2]");

	delete [] htpa;
	printf("eop\n");
}

quote:Hi, I am trying to write a class to let me know if the object has been constructed on the heap.

static int nHeap; //this will let me know if I am on the heapclass HeapTest {public:	HeapTest() {		printf("0x%x HeapTest alive.\n",this);		if (nHeap>0)			printf("0x%x And I am on the Heap!\n",this);		nHeap--;	}	virtual ~HeapTest() {		printf("0x%x goodbye from HeapTest.\n",this);	}	static void *operator new (size_t size) {		void *memPtr=::operator new(size);		nHeap=1;		return memPtr;	}	static void *operator new[] (size_t size) {		void *memPtr=::operator new(size);		nHeap=(size/sizeof(HeapTest))-1;		return memPtr;	}	virtual void SayHi(char *msg) {		printf("0x%x hi:%s\n",this,msg);	}	int x;};

#include <vector>using namespace std;class HeapTest {	public:		HeapTest() {			printf("0x%x HeapTest alive.\n",this);			int i;			for (i=0;i<low_address.size();i++) 				if (this>=low_address[i]) {					//printf("0x%x is greater than 0x%x\n",this,low_address);<br></font><br>					<font color=blue>if</font> (<font color=blue>this</font>&lt;high_address[<font color=purple>i</font>]) {<br>						printf(<font color=darkred>"0x%x I am on the heap!\n"</font>,<font color=blue>this</font>);<br>					}<br>				}<br><br>		}<br>		<font color=blue>virtual</font> ~HeapTest() {<br>			printf(<font color=darkred>"0x%x goodbye from HeapTest.\n"</font>,<font color=blue>this</font>);<br>		}<br>		<font color=blue>static</font> <font color=blue>void</font> *<font color=blue>operator</font> <font color=blue>new</font> (size_t size) {<br>			<font color=blue>void</font> *memPtr=::<font color=blue>operator</font> <font color=blue>new</font>(size);<br><br>			low_address.push_back(memPtr);<br>			<br>			<font color=blue>char</font> *bytePtr = (<font color=blue>char</font> *)memPtr;<br>			bytePtr+=size;<br>			high_address.push_back((<font color=blue>void</font> *)bytePtr);<br><br>			<font color=blue>return</font> memPtr;<br>		}<br>		<font color=blue>static</font> <font color=blue>void</font> *<font color=blue>operator</font> <font color=blue>new</font>[] (size_t size) {<br>			<font color=blue>void</font> *memPtr=::<font color=blue>operator</font> <font color=blue>new</font>(size);<br><br>			low_address.push_back(memPtr);<br>			<br>			<font color=blue>char</font> *bytePtr = (<font color=blue>char</font> *)memPtr;<br>			bytePtr+=size;<br>			high_address.push_back((<font color=blue>void</font> *)bytePtr);<br><br>			<font color=blue>return</font> memPtr;<br>		}<br>		<font color=blue>virtual</font> <font color=blue>void</font> SayHi(<font color=blue>char</font> *msg) {<br>			printf(<font color=darkred>"0x%x hi:%s\n"</font>,<font color=blue>this</font>,msg);<br>		}<br>		<font color=blue>int</font> x;<br>		<font color=blue>static</font> vector &lt;<font color=blue>void</font> *&gt; low_address;<br>		<font color=blue>static</font> vector &lt;<font color=blue>void</font> *&gt; high_address;<br>	};<br><br>vector &lt;<font color=blue>void</font> *&gt; HeapTest::low_address;<br>vector &lt;<font color=blue>void</font> *&gt; HeapTest::high_address;<br></pre><!–ENDSCRIPT–><br><br>By using TWO vectors to store the high and low addresses of the memory we have allocated then we can determine if we are &#111;n the heap by searching through the vectors and ensureing we are inbetween the two addresses.<br><br>I dont think there are any flaws in this? Now my solution is slower than Scott Meyers <img src="sad.gif" width=15 height=15 align=middle><br><br>Again I would love to get feedback &#111;n this design.   

quote:Original post by aboeing
Sorry, I should have mentioned that I didnt want to do that.