/***************************************************************************
*   Copyright (C) 2006 by Ian Reinhart Geiser   *
*   geiseri@sourcextreme.com   *
*                                                                         *
*   This program is free software; you can redistribute it and/or modify  *
*   it under the terms of the GNU Library General Public License as       *
*   published by the Free Software Foundation; either version 2 of the    *
*   License, or (at your option) any later version.                       *
*                                                                         *
*   This program is distributed in the hope that it will be useful,       *
*   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
*   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
*   GNU General Public License for more details.                          *
*                                                                         *
*   You should have received a copy of the GNU Library General Public     *
*   License along with this program; if not, write to the                 *
*   Free Software Foundation, Inc.,                                       *
*   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
***************************************************************************/
#ifndef KRPCNODEREFERENCE_H
#define KRPCNODEREFERENCE_H

namespace KRPC
{
	class NodeInterface;
	/**
	This is a reference counted wrapper around node interfaces to manage their lifetime.

		@author Ian Reinhart Geiser <geiseri@kde.org>
	*/
	class NodeReference
	{
		mutable struct Tracker *m_tracker;
	public:
		explicit NodeReference( NodeInterface *ptr = 0, bool weak = false);
		~NodeReference();

		NodeReference( const NodeReference &rhs );
		NodeReference &operator=( const NodeReference &rhs );
		NodeInterface *operator->() const;

		bool isValid() const;
	private:
		NodeInterface &operator*() const;
		void aquire( Tracker *tracker) const;
		void release() const;
	};

}

#endif