By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
435,594 Members | 3,017 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 435,594 IT Pros & Developers. It's quick & easy.

Reference Counting

P: n/a
OK, this code compiles, links, and executes, but, how do I setup, like,
a spinlock to query the DataBase object's status to let the SmrtPtr
know that the object's been deleted?:

#pragma once

class SmrtPtrDB
{
public:
SmrtPtrDB():num(0){}
~SmrtPtrDB(){}
void add(){num++;}
void sub(){num--;}
int status(){return num;}
private:
int num;
};

#pragma once
#include "SmrtPtrDB.hpp"

template<class T>
class SmrtPtr
{
public:
SmrtPtr<T>(T* obj=0):ptr(obj){DataBase.add();)
SmrtPtr<T>(const SmrtPtr<T>& rhs):ptr(new
T(*(rhs.ptr))){DataBase.add();}
~SmrtPtr<T>(){delete ptr; ptr=0; DataBase.sub();}
void operator=(T val){*ptr=val;}
SmrtPtr<T>& operator=(const SmrtPtr<T>& rhs)
{
if(this!=&rhs)
{
delete ptr;
ptr(rhs.ptr);
}
else return this;
}
int status(){DataBase.status();}
T& operator*()const{return *ptr;}
T* operator->()const{return ptr;}
private:
SmrtPtrDB DataBase;
T* ptr;
};

I'm very confused. Am I implementing this right? Thanks!!!!

Jul 10 '06 #1
Share this Question
Share on Google+
20 Replies


P: n/a
Protoman wrote:
OK, this code compiles, links, and executes, but, how do I setup, like,
a spinlock to query the DataBase object's status to let the SmrtPtr
know that the object's been deleted?:

#pragma once

class SmrtPtrDB
{
public:
SmrtPtrDB():num(0){}
~SmrtPtrDB(){}
void add(){num++;}
void sub(){num--;}
int status(){return num;}
private:
int num;
};

#pragma once
#include "SmrtPtrDB.hpp"

template<class T>
class SmrtPtr
{
public:
SmrtPtr<T>(T* obj=0):ptr(obj){DataBase.add();)
SmrtPtr<T>(const SmrtPtr<T>& rhs):ptr(new
T(*(rhs.ptr))){DataBase.add();}
~SmrtPtr<T>(){delete ptr; ptr=0; DataBase.sub();}
void operator=(T val){*ptr=val;}
SmrtPtr<T>& operator=(const SmrtPtr<T>& rhs)
{
if(this!=&rhs)
{
delete ptr;
ptr(rhs.ptr);
}
else return this;
}
int status(){DataBase.status();}
T& operator*()const{return *ptr;}
T* operator->()const{return ptr;}
private:
SmrtPtrDB DataBase;
T* ptr;
};

I'm very confused. Am I implementing this right? Thanks!!!!
This is our current counted pointer code:

//
//counted_ptr - simple reference counted pointer.
//
//The is a non-intrusive implementation that allocates an additional
//int and pointer for every counted object.

#ifndef __COUNTED_PTR_H
#define __COUNTED_PTR_H

template <class Xclass counted_ptr
{
public:
typedef X element_type;

explicit counted_ptr(X* p = 0) // allocate a new counter
: itsCounter(0) {if (p) itsCounter = new counter(p);}
~counted_ptr()
{release();}
counted_ptr(const counted_ptr& r) throw()
{acquire(r.itsCounter);}
counted_ptr& operator=(const counted_ptr& r)
{
if (this != &r) {
release();
acquire(r.itsCounter);
}
return *this;
}

template <class Y>
counted_ptr(const counted_ptr<Y>& r) throw()
{acquire(r.itsCounter);}
template <class Y>
counted_ptr& operator=(const counted_ptr<Y>& r)
{
if (this != &r) {
release();
acquire(r.itsCounter);
}
return *this;
}

X& operator*() const throw() {return *itsCounter->ptr;}
X* operator->() const throw() {return itsCounter->ptr;}
X* get() const throw() {return itsCounter ?
itsCounter->ptr : 0;}
bool unique() const throw()
{return (itsCounter ? itsCounter->count == 1 : true);}

private:

struct counter {
counter(X* p = 0, unsigned c = 1) : ptr(p), count(c) {}
X* ptr;
unsigned count;
}* itsCounter;

void acquire(counter* c) throw()
{ // increment the count
itsCounter = c;
if (c) ++c->count;
}

void release()
{ // decrement the count, delete if it is 0
if (itsCounter) {
if (--itsCounter->count == 0) {
delete itsCounter->ptr;
delete itsCounter;
}
itsCounter = 0;
}
}
};

#endif
Jul 10 '06 #2

P: n/a
Jon Rea wrote:
Protoman wrote:
>OK, this code compiles, links, and executes, but, how do I setup, like,
a spinlock to query the DataBase object's status to let the SmrtPtr
know that the object's been deleted?:
It's very hard to understand what it is you're trying to do.

Could you write a snippet of code that describes more about what you're
trying to achieve ? More like a test case for your smart pointer ...
Jul 10 '06 #3

P: n/a

Gianni Mariani wrote:
Jon Rea wrote:
Protoman wrote:
OK, this code compiles, links, and executes, but, how do I setup, like,
a spinlock to query the DataBase object's status to let the SmrtPtr
know that the object's been deleted?:

It's very hard to understand what it is you're trying to do.

Could you write a snippet of code that describes more about what you're
trying to achieve ? More like a test case for your smart pointer ...
Actually here's the code; it achieves reference counting (I hope!!!)

SmrtPtrDB.hpp

#pragma once

class SmrtPtrDB
{
public:
SmrtPtrDB():num(1){}
SmrtPtrDB(const SmrtPtrDB& rhs):num(rhs.num){}
~SmrtPtrDB(){}
void add(){num++;}
void sub(){num--;}
int status(){return num;}
private:
int num;
};

SmrtPtr.hpp

template<class T>
class SmrtPtr
{
public:
SmrtPtr<T>(T* obj=0):ptr(obj){}
SmrtPtr<T>(const SmrtPtr<T>& rhs):ptr(rhs.ptr){DataBase.add();}
~SmrtPtr<T>()
{
DataBase.sub();
if(DataBase.status()==0)
{delete ptr;cout << "Deleted.";}
else cout << "Out of scope. " << endl;
}
void operator=(T val){*ptr=val;}
void operator=(T* val){ptr=val;}
SmrtPtr<T>& operator=(const SmrtPtr<T>& rhs)
{
if(this!=&rhs)
{
delete ptr;
ptr(rhs.ptr);
}
else return this;
}
int status(){return DataBase.status();}
T& operator*()const{return *ptr;}
T* operator->()const{return ptr;}
operator T*()const{return ptr;}
private:
SmrtPtrDB DataBase;
T* ptr;
};

main.cpp

#include <iostream>
#include <cstdlib>
#include "SmrtPtr.hpp"
using namespace std;

int main()
{
{
SmrtPtr<intptr(new int);
ptr=5;
cout << *ptr << endl;
{
SmrtPtr<intptr2(ptr);
ptr2=6;
cout << *ptr << endl;
cout << *ptr2 << endl;
}
cout << *ptr << endl;
}
system("PAUSE");
return EXIT_SUCCESS;
}
It works apparently. Could you help me improve? Thanks!!!!

Jul 10 '06 #4

P: n/a
Protoman schrieb:
Gianni Mariani wrote:
>Jon Rea wrote:
>>Protoman wrote:

OK, this code compiles, links, and executes, but, how do I setup, like,
a spinlock to query the DataBase object's status to let the SmrtPtr
know that the object's been deleted?:
It's very hard to understand what it is you're trying to do.

Could you write a snippet of code that describes more about what you're
trying to achieve ? More like a test case for your smart pointer ...

Actually here's the code; it achieves reference counting (I hope!!!)
[...]
system("PAUSE");
return EXIT_SUCCESS;
}
It works apparently. Could you help me improve? Thanks!!!!
You could start by
1) not using platform dependent things like system("PAUSE");
2) using whitespace (indentation),
3) describing, what you want to improve.

Well, I don't think that it works, because your SmrtPtr<class holds a
SmrtPtrDB class (the ref counter) by value, while there should be only
one counter per object, shared by the smart pointers. Also, you should
handle operator=() by decrementing the count of the old object and
incrementing the new one.

--
Thomas
Jul 11 '06 #5

P: n/a

Thomas J. Gritzan wrote:
Protoman schrieb:
Gianni Mariani wrote:
Jon Rea wrote:
Protoman wrote:

OK, this code compiles, links, and executes, but, how do I setup, like,
a spinlock to query the DataBase object's status to let the SmrtPtr
know that the object's been deleted?:
It's very hard to understand what it is you're trying to do.

Could you write a snippet of code that describes more about what you're
trying to achieve ? More like a test case for your smart pointer ...
Actually here's the code; it achieves reference counting (I hope!!!)
[...]
system("PAUSE");
return EXIT_SUCCESS;
}
It works apparently. Could you help me improve? Thanks!!!!

You could start by
1) not using platform dependent things like system("PAUSE");
2) using whitespace (indentation),
3) describing, what you want to improve.

Well, I don't think that it works, because your SmrtPtr<class holds a
SmrtPtrDB class (the ref counter) by value, while there should be only
one counter per object, shared by the smart pointers. Also, you should
handle operator=() by decrementing the count of the old object and
incrementing the new one.

--
Thomas
Which one's the "old object", the one of the right side of operator=,
or the left side? And do you mean this:

SmrtPtr<T>& operator=(const SmrtPtr<T>& rhs)
{
if(this!=&rhs)
{
this->DataBase.sub();
delete ptr;
ptr(rhs.ptr);
rhs->DataBase.add();
}
else return this;
}

So, should DataBase be held by reference? And, system("PAUSE") is the
only way I can see my output, otherwise, the console opens and closes
before I get a chance to review. And I want to improve the handling of
the reference count; I don't think my impl is very effecient or
effective. And speed. And the handling of a null pointer, like if
someone writes:

SmrtPtr<intptr;

ptr will be initialized to null with my ctor, so deferencing it will be
illegal. I think it should throw an exception.

Jul 11 '06 #6

P: n/a
Protoman <Pr**********@gmail.comwrote:
And, system("PAUSE") is the
only way I can see my output, otherwise, the console opens and closes
before I get a chance to review.
A standards-compliant way to achieve a similar effect is:

std::cout << "\nPress <Enterto continue...\n";
std::string trash;
std::getline(std::cin, trash);

--
Marcus Kwok
Replace 'invalid' with 'net' to reply
Jul 12 '06 #7

P: n/a
Protoman schrieb:
Thomas J. Gritzan wrote:
>>It works apparently. Could you help me improve? Thanks!!!!
You could start by
1) not using platform dependent things like system("PAUSE");
2) using whitespace (indentation),
3) describing, what you want to improve.

Well, I don't think that it works, because your SmrtPtr<class holds a
SmrtPtrDB class (the ref counter) by value, while there should be only
one counter per object, shared by the smart pointers. Also, you should
handle operator=() by decrementing the count of the old object and
incrementing the new one.

Which one's the "old object", the one of the right side of operator=,
or the left side?
By assigning one smart pointer to another, you release the pointer on
the left hand side and copy the pointer from the right hand side to the
other.
So you have to decrement the lhs counter and increment the rhs counter.
But you must not delete the lhs pointer when the counter is not zero.
SmrtPtr<T>& operator=(const SmrtPtr<T>& rhs)
{
if(this!=&rhs)
{
this->DataBase.sub();
delete ptr;
Here you delete ptr. Don't do it when the counter is not zero.
ptr(rhs.ptr);
rhs->DataBase.add();
rhs is const and DataBase is private. This line should not work.
}
else return this;
}

So, should DataBase be held by reference?
By pointer. Look at the implementation of other smart pointers, like
shared_ptr from boost.

Buy a good C++ book and read it.
And, system("PAUSE") is the
only way I can see my output, otherwise, the console opens and closes
before I get a chance to review.
My IDE (Visual Studio) does this for me.

--
Thomas
Jul 12 '06 #8

P: n/a
Thomas J. Gritzan wrote:
By assigning one smart pointer to another, you release the pointer on
the left hand side and copy the pointer from the right hand side to the
other.
So you have to decrement the lhs counter and increment the rhs counter.
But you must not delete the lhs pointer when the counter is not zero.

>>SmrtPtr<T>& operator=(const SmrtPtr<T>& rhs)
{
if(this!=&rhs)
{
this->DataBase.sub();
delete ptr;

The standard way of doing this is to do a copy ctor on the source,
swap with the destination, and let the dtor for the local copy,
which is now the destination, run when it goes out of scope

SmrtPtr<T>& operator=(const SmrtPtr<T>& rhs) {
SmrtPtr<Ttemp(rhs);
swap(temp);
return *this;
}

You're safe in the case of source and destination being the same
since the refcount will be incremented before it gets decremented.
--
Joe Seigh

When you get lemons, you make lemonade.
When you get hardware, you make software.
Jul 12 '06 #9

P: n/a

Joe Seigh wrote:
Thomas J. Gritzan wrote:
By assigning one smart pointer to another, you release the pointer on
the left hand side and copy the pointer from the right hand side to the
other.
So you have to decrement the lhs counter and increment the rhs counter.
But you must not delete the lhs pointer when the counter is not zero.

>SmrtPtr<T>& operator=(const SmrtPtr<T>& rhs)
{
if(this!=&rhs)
{
this->DataBase.sub();
delete ptr;

The standard way of doing this is to do a copy ctor on the source,
swap with the destination, and let the dtor for the local copy,
which is now the destination, run when it goes out of scope

SmrtPtr<T>& operator=(const SmrtPtr<T>& rhs) {
SmrtPtr<Ttemp(rhs);
swap(temp);
return *this;
}

You're safe in the case of source and destination being the same
since the refcount will be incremented before it gets decremented.
--
Joe Seigh

When you get lemons, you make lemonade.
When you get hardware, you make software.
OK, here's the new SmrtPtr class:

// COPYRIGHT CMDR DOUGLAS I. PEREIRA 07/10/06
// ALL UNAUTHORIZED THIRD PARTY USE IS PROHIBITED
// I HAVE WORKED VERY HARD AND HAVE SPENT HOURS OF
// TIME DEVELOPING THIS. DO NOT COPY IT OR I WILL SUE YOU
// ************************************************** **********
#pragma once
#include <iostream>
#include "SmrtPtrDB.hpp"
using namespace std;
class NullPtr{};
template<class T>
class SmrtPtr
{
public:
explicit SmrtPtr<T>(T* obj=0):ptr(obj), DataBase(new SmrtPtrDB){}
SmrtPtr<T>(const SmrtPtr<T>& rhs):ptr(rhs.ptr), DataBase(new
SmrtPtrDB(rhs.DataBase->status())){DataBase->add();}
~SmrtPtr<T>()
{
DataBase->sub();
if(DataBase->status()==0)
{delete ptr;cout << "Deleted." << endl;}
else cout << "Out of scope. " << endl;
}
void operator=(T val){if(ptr==0)throw NullPtr();else *ptr=val;}
void operator=(T* val){ptr=val;}
SmrtPtr<T>& operator=(const SmrtPtr<T>& rhs)
{
if(this!=&rhs)
{
SmrtPtr<Ttemp(rhs);
swap(temp);
}
else return *this;
}
bool operator==(const SmrtPtr<T>& rhs)const{if(ptr==rhs.ptr)return
true;else return false;}
bool operator!=(const SmrtPtr<T>& rhs)const{if(ptr!=rhs.ptr)return
true;else return false;}
bool operator<=(const SmrtPtr<T>& rhs)const{if(ptr<=rhs.ptr)return
true;else return false;}
bool operator>=(const SmrtPtr<T>& rhs)const{if(ptr>=rhs.ptr)return
true;else return false;}
int status(){return DataBase->status();}
T& operator*()const{if(ptr==0)throw NullPtr();else return *ptr;}
T* operator->()const{if(ptr==0)throw NullPtr();else return ptr;}
operator T*()const{if(ptr==0)throw NullPtr();else return ptr;}
private:
void swap(SmrtPtr<T>& rhs){this=&rhs;}
mutable SmrtPtrDB* DataBase;
T* ptr;
};

Did I impl swap() correctly? Should DataBase be mutable?

Jul 13 '06 #10

P: n/a
Protoman wrote:
SmrtPtr<T>& operator=(const SmrtPtr<T>& rhs)
{
if(this!=&rhs)
{
SmrtPtr<Ttemp(rhs);
swap(temp);
}
else return *this;
}
Ah, I was going to mention not testing if the target
and source were the same. One, it doesn't hurt anything
if you don't test for it. Two, you increased your mainline
path for something that occurs very rarely. When was the
last time you saw a program assign a variable to itself?

....
private:
void swap(SmrtPtr<T>& rhs){this=&rhs;}
mutable SmrtPtrDB* DataBase;
T* ptr;
};

Did I impl swap() correctly? Should DataBase be mutable?
swap should swap the contents of *this and rhs. Your
basically faking things out so the destructor runs on
the old target ptr.

void swap(SmrtPtr<T>& rhs) {
SmrtPtrDB* dbTemp = rhs.Database;
T* ptrTemp = rhs.ptr;
rhs.Database = Database;
rhs.ptr = ptr;
Database = dbTemp;
ptr = ptrTemp;
}

Something like that.
--
Joe Seigh

When you get lemons, you make lemonade.
When you get hardware, you make software.
Jul 13 '06 #11

P: n/a

Joe Seigh wrote:
Protoman wrote:
SmrtPtr<T>& operator=(const SmrtPtr<T>& rhs)
{
if(this!=&rhs)
{
SmrtPtr<Ttemp(rhs);
swap(temp);
}
else return *this;
}

Ah, I was going to mention not testing if the target
and source were the same. One, it doesn't hurt anything
if you don't test for it. Two, you increased your mainline
path for something that occurs very rarely. When was the
last time you saw a program assign a variable to itself?

...
private:
void swap(SmrtPtr<T>& rhs){this=&rhs;}
mutable SmrtPtrDB* DataBase;
T* ptr;
};

Did I impl swap() correctly? Should DataBase be mutable?

swap should swap the contents of *this and rhs. Your
basically faking things out so the destructor runs on
the old target ptr.

void swap(SmrtPtr<T>& rhs) {
SmrtPtrDB* dbTemp = rhs.Database;
T* ptrTemp = rhs.ptr;
rhs.Database = Database;
rhs.ptr = ptr;
Database = dbTemp;
ptr = ptrTemp;
}

Something like that.
--
Joe Seigh

When you get lemons, you make lemonade.
When you get hardware, you make software.
OK, what if I wrote:

void swap(SmrtPtr<T>& rhs)
{
*this=rhs;
}

No, wait...

OK what about:

void swap(SmrtPtr<T>& rhs)
{
std::swap(ptr,rhs.ptr);
std::swap(DataBase,rhs.DataBase);
}

which is what I'm currently doing. And, self-assignment can happen in a
very large program, where you have multiple references to the same
thing, and the like. It's always good to test for it. And when I write
this, the console opens and shuts:

SmrtPtr<Ttemp(ptr);
ptr=ptr2;
ptr2=temp;

Why is that?

Jul 13 '06 #12

P: n/a
Protoman schrieb:
OK, here's the new SmrtPtr class:

// COPYRIGHT CMDR DOUGLAS I. PEREIRA 07/10/06
// ALL UNAUTHORIZED THIRD PARTY USE IS PROHIBITED
// I HAVE WORKED VERY HARD AND HAVE SPENT HOURS OF
// TIME DEVELOPING THIS. DO NOT COPY IT OR I WILL SUE YOU
// ************************************************** **********
#pragma once
#include <iostream>
#include "SmrtPtrDB.hpp"
using namespace std;
class NullPtr{};
template<class T>
class SmrtPtr
{
public:
explicit SmrtPtr<T>(T* obj=0):ptr(obj), DataBase(new SmrtPtrDB){}
SmrtPtr<T>(const SmrtPtr<T>& rhs):ptr(rhs.ptr), DataBase(new
SmrtPtrDB(rhs.DataBase->status())){DataBase->add();}
The smartpointers should _share_ a common SmrtPtrDB, if they share a
common object pointer. Here you create another copy of SmrtPtrDB in the
copy constructor.
~SmrtPtr<T>()
{
DataBase->sub();
if(DataBase->status()==0)
{delete ptr;cout << "Deleted." << endl;}
else cout << "Out of scope. " << endl;
}
You don't delete the SmrtPtrDB.
void operator=(T val){if(ptr==0)throw NullPtr();else *ptr=val;}
Remove this. The user should dereference the smart pointer to access its
value.
void operator=(T* val){ptr=val;}
Here you should release the old ptr/SmrtPtrDB and create a new pair.
Something like this:

void operator=(T* val)
{
SmrtPtr<Ttemp(val);
swap(temp);
}
SmrtPtr<T>& operator=(const SmrtPtr<T>& rhs)
{
if(this!=&rhs)
{
SmrtPtr<Ttemp(rhs);
swap(temp);
}
else return *this;
}
You return *this in the "else" but not in the "if". Why?
bool operator==(const SmrtPtr<T>& rhs)const{if(ptr==rhs.ptr)return
true;else return false;}
bool operator!=(const SmrtPtr<T>& rhs)const{if(ptr!=rhs.ptr)return
true;else return false;}
bool operator<=(const SmrtPtr<T>& rhs)const{if(ptr<=rhs.ptr)return
true;else return false;}
bool operator>=(const SmrtPtr<T>& rhs)const{if(ptr>=rhs.ptr)return
true;else return false;}
int status(){return DataBase->status();}
T& operator*()const{if(ptr==0)throw NullPtr();else return *ptr;}
T* operator->()const{if(ptr==0)throw NullPtr();else return ptr;}
operator T*()const{if(ptr==0)throw NullPtr();else return ptr;}
private:
void swap(SmrtPtr<T>& rhs){this=&rhs;}
Better this way:
void swap(SmrtPtr<T>& rhs)
{
std::swap(ptr,rhs.ptr);
std::swap(DataBase,rhs.DataBase);
}
mutable SmrtPtrDB* DataBase;
T* ptr;
};
Well, your operator= should return *this by reference, as every
operator= does.

Anyway, if you won't get your indentation right, I won't read your code
anymore. It is horrible...

--
Thomas
Jul 13 '06 #13

P: n/a

Thomas J. Gritzan wrote:
Protoman schrieb:
OK, here's the new SmrtPtr class:

// COPYRIGHT CMDR DOUGLAS I. PEREIRA 07/10/06
// ALL UNAUTHORIZED THIRD PARTY USE IS PROHIBITED
// I HAVE WORKED VERY HARD AND HAVE SPENT HOURS OF
// TIME DEVELOPING THIS. DO NOT COPY IT OR I WILL SUE YOU
// ************************************************** **********
#pragma once
#include <iostream>
#include "SmrtPtrDB.hpp"
using namespace std;
class NullPtr{};
template<class T>
class SmrtPtr
{
public:
explicit SmrtPtr<T>(T* obj=0):ptr(obj), DataBase(new SmrtPtrDB){}
SmrtPtr<T>(const SmrtPtr<T>& rhs):ptr(rhs.ptr), DataBase(new
SmrtPtrDB(rhs.DataBase->status())){DataBase->add();}

The smartpointers should _share_ a common SmrtPtrDB, if they share a
common object pointer. Here you create another copy of SmrtPtrDB in the
copy constructor.
~SmrtPtr<T>()
{
DataBase->sub();
if(DataBase->status()==0)
{delete ptr;cout << "Deleted." << endl;}
else cout << "Out of scope. " << endl;
}

You don't delete the SmrtPtrDB.
void operator=(T val){if(ptr==0)throw NullPtr();else *ptr=val;}

Remove this. The user should dereference the smart pointer to access its
value.
void operator=(T* val){ptr=val;}

Here you should release the old ptr/SmrtPtrDB and create a new pair.
Something like this:

void operator=(T* val)
{
SmrtPtr<Ttemp(val);
swap(temp);
}
SmrtPtr<T>& operator=(const SmrtPtr<T>& rhs)
{
if(this!=&rhs)
{
SmrtPtr<Ttemp(rhs);
swap(temp);
}
else return *this;
}

You return *this in the "else" but not in the "if". Why?
bool operator==(const SmrtPtr<T>& rhs)const{if(ptr==rhs.ptr)return
true;else return false;}
bool operator!=(const SmrtPtr<T>& rhs)const{if(ptr!=rhs.ptr)return
true;else return false;}
bool operator<=(const SmrtPtr<T>& rhs)const{if(ptr<=rhs.ptr)return
true;else return false;}
bool operator>=(const SmrtPtr<T>& rhs)const{if(ptr>=rhs.ptr)return
true;else return false;}
int status(){return DataBase->status();}
T& operator*()const{if(ptr==0)throw NullPtr();else return *ptr;}
T* operator->()const{if(ptr==0)throw NullPtr();else return ptr;}
operator T*()const{if(ptr==0)throw NullPtr();else return ptr;}
private:
void swap(SmrtPtr<T>& rhs){this=&rhs;}

Better this way:
void swap(SmrtPtr<T>& rhs)
{
std::swap(ptr,rhs.ptr);
std::swap(DataBase,rhs.DataBase);
}
mutable SmrtPtrDB* DataBase;
T* ptr;
};

Well, your operator= should return *this by reference, as every
operator= does.

Anyway, if you won't get your indentation right, I won't read your code
anymore. It is horrible...

--
Thomas
For swap(), how about *this=rhs? Will that work?

Here's the stuff I fixed:

~SmrtPtr<T>()
{
DataBase->sub();
if(DataBase->status()==0)
{
delete ptr;
delete DataBase;
cout << "Deleted." << endl;
}
else
{
delete DataBase;
cout << "Out of scope. " << endl;
}
}

void operator=(T* val)
{
SmrtPtr<Ttemp(val);
swap(temp);
}

SmrtPtr<T>& operator=(const SmrtPtr<T>& rhs)
{
SmrtPtr<Ttemp(rhs);
swap(temp);
return *this;
}

void swap(const SmrtPtr<T>& rhs){*this=rhs;}
Sorry about my indenting, it looks normal on my screen.

Jul 13 '06 #14

P: n/a
Protoman schrieb:
For swap(), how about *this=rhs? Will that work?
No, swap() _swaps_ the contents, *this=rhs assigns the rhs to the lhs
(lhs gets overridden).
Here's the stuff I fixed:

~SmrtPtr<T>()
{
DataBase->sub();
if(DataBase->status()==0)
{
delete ptr;
delete DataBase;
cout << "Deleted." << endl;
}
else
{
delete DataBase;
Really, think about what you are doing here. Ask yourself this questions:

- Who is the owner of the object pointed to by ptr? Who may delete it
and when?
- Who owns DataBase, who deletes it?
Sorry about my indenting, it looks normal on my screen.
Try another newsreader, or try spaces instead of tabs.

--
Thomas
Jul 15 '06 #15

P: n/a

Thomas J. Gritzan wrote:
Protoman schrieb:
For swap(), how about *this=rhs? Will that work?

No, swap() _swaps_ the contents, *this=rhs assigns the rhs to the lhs
(lhs gets overridden).
Here's the stuff I fixed:

~SmrtPtr<T>()
{
DataBase->sub();
if(DataBase->status()==0)
{
delete ptr;
delete DataBase;
cout << "Deleted." << endl;
}
else
{
delete DataBase;

Really, think about what you are doing here. Ask yourself this questions:

- Who is the owner of the object pointed to by ptr? Who may delete it
and when?
- Who owns DataBase, who deletes it?
Sorry about my indenting, it looks normal on my screen.

Try another newsreader, or try spaces instead of tabs.

--
Thomas
So, how do I fix it?

Jul 15 '06 #16

P: n/a

Protoman wrote:
Thomas J. Gritzan wrote:
Protoman schrieb:
For swap(), how about *this=rhs? Will that work?
No, swap() _swaps_ the contents, *this=rhs assigns the rhs to the lhs
(lhs gets overridden).
Here's the stuff I fixed:
>
~SmrtPtr<T>()
{
DataBase->sub();
if(DataBase->status()==0)
{
delete ptr;
delete DataBase;
cout << "Deleted." << endl;
}
else
{
delete DataBase;
Really, think about what you are doing here. Ask yourself this questions:

- Who is the owner of the object pointed to by ptr? Who may delete it
and when?
- Who owns DataBase, who deletes it?
Sorry about my indenting, it looks normal on my screen.
Try another newsreader, or try spaces instead of tabs.

--
Thomas

So, how do I fix it?
OK, I fixed the above, but, now I'm wondering: is SmrtPtr<Tsafe to
use in a container, such as a linked list? Is it thread safe?

Jul 17 '06 #17

P: n/a
Protoman schrieb:
[ SmrtPtr<template class ]
OK, I fixed the above, but, now I'm wondering: is SmrtPtr<Tsafe to
use in a container, such as a linked list? Is it thread safe?
Depends on the container, if it can be used with it.

For the standard container classes, the values have to have
value-semantics. If your smart pointer works as it should, then its safe
to use in on of them.

For thread safety: Don't ask here, since C++ doesn't know about threads
(you should know this already)

--
Thomas
Jul 18 '06 #18

P: n/a

Thomas J. Gritzan wrote:
Protoman schrieb:
[ SmrtPtr<template class ]
OK, I fixed the above, but, now I'm wondering: is SmrtPtr<Tsafe to
use in a container, such as a linked list? Is it thread safe?

Depends on the container, if it can be used with it.

For the standard container classes, the values have to have
value-semantics. If your smart pointer works as it should, then its safe
to use in on of them.

For thread safety: Don't ask here, since C++ doesn't know about threads
(you should know this already)

--
Thomas
OK, but how do I access this:

class Data
{
public:
Data():plus(new long double),mult(new long double),pow(new long
double){}
SmrtPtr<long doubleplus;
SmrtPtr<long doublemult;
SmrtPtr<long doublepow;
};

SmrtPtr<Datatuple(new Data);
//how do I access the members of tuple?

Jul 18 '06 #19

P: n/a
Protoman schrieb:
Thomas J. Gritzan wrote:
>Protoman schrieb:
[ SmrtPtr<template class ]
>>OK, I fixed the above, but, now I'm wondering: is SmrtPtr<Tsafe to
use in a container, such as a linked list? Is it thread safe?
Depends on the container, if it can be used with it.

For the standard container classes, the values have to have
value-semantics. If your smart pointer works as it should, then its safe
to use in on of them.

For thread safety: Don't ask here, since C++ doesn't know about threads
(you should know this already)

--
Thomas

OK, but how do I access this:

class Data
{
public:
Data():plus(new long double),mult(new long double),pow(new long
double){}
SmrtPtr<long doubleplus;
SmrtPtr<long doublemult;
SmrtPtr<long doublepow;
};

SmrtPtr<Datatuple(new Data);
//how do I access the members of tuple?
Smart pointers usually imitate the syntax of normal pointers.

tuple->plus
tuple->mult
tuple->pow

or:

(*tuple).plus
....

--
Thomas
Jul 18 '06 #20

P: n/a
In message <11**********************@75g2000cwc.googlegroups. com>,
Protoman <Pr**********@gmail.comwrites
>
Thomas J. Gritzan wrote:
>Protoman schrieb:
[ SmrtPtr<template class ]
OK, I fixed the above, but, now I'm wondering: is SmrtPtr<Tsafe to
use in a container, such as a linked list? Is it thread safe?

Depends on the container, if it can be used with it.

For the standard container classes, the values have to have
value-semantics. If your smart pointer works as it should, then its safe
to use in on of them.

For thread safety: Don't ask here, since C++ doesn't know about threads
(you should know this already)

OK, but how do I access this:

class Data
{
public:
Data():plus(new long double),mult(new long double),pow(new long
double){}
SmrtPtr<long doubleplus;
Why? It appears to be a simple value class, so why do you have yet
another level of indirection just to access public data members?
>SmrtPtr<long doublemult;
SmrtPtr<long doublepow;
};

SmrtPtr<Datatuple(new Data);
//how do I access the members of tuple?
tuple->member

--
Richard Herring
Jul 19 '06 #21

This discussion thread is closed

Replies have been disabled for this discussion.