|
|
@ -1,23 +1,22 @@
|
|
|
|
/*
|
|
|
|
/*
|
|
|
|
* This file is part of the DOM implementation for KDE.
|
|
|
|
This file is part of the DOM implementation for KDE.
|
|
|
|
* Copyright (C) 2005, 2006 Apple Computer, Inc.
|
|
|
|
Copyright (C) 2005, 2006 Apple Computer, Inc.
|
|
|
|
* Copyright (C) 2002 Lars Knoll
|
|
|
|
Copyright (C) 2002 Lars Knoll
|
|
|
|
*
|
|
|
|
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Library General Public
|
|
|
|
modify it under the terms of the GNU Library General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
License as published by the Free Software Foundation; either
|
|
|
|
* version 2 of the License, or (at your option) any later version.
|
|
|
|
version 2 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
|
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
This library is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Library General Public License for more details.
|
|
|
|
Library General Public License for more details.
|
|
|
|
*
|
|
|
|
|
|
|
|
* You should have received a copy of the GNU Library General Public License
|
|
|
|
You should have received a copy of the GNU Library General Public License
|
|
|
|
* along with this library; see the file COPYING.LIB. If not, write to
|
|
|
|
along with this library; see the file COPYING.LIB. If not, write to
|
|
|
|
* the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
|
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
|
|
|
|
* Boston, MA 02111-1307, USA.
|
|
|
|
Boston, MA 02110-1301, USA.
|
|
|
|
*
|
|
|
|
|
|
|
|
*/
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
@ -53,7 +52,7 @@ public:
|
|
|
|
TreeShared() { _ref = 0; m_parent = 0; /*counter++;*/ }
|
|
|
|
TreeShared() { _ref = 0; m_parent = 0; /*counter++;*/ }
|
|
|
|
TreeShared( type *parent ) { _ref=0; m_parent = parent; /*counter++;*/ }
|
|
|
|
TreeShared( type *parent ) { _ref=0; m_parent = parent; /*counter++;*/ }
|
|
|
|
~TreeShared() { /*counter--;*/ }
|
|
|
|
~TreeShared() { /*counter--;*/ }
|
|
|
|
|
|
|
|
|
|
|
|
virtual void removedLastRef() { delete static_cast<type*>(this); }
|
|
|
|
virtual void removedLastRef() { delete static_cast<type*>(this); }
|
|
|
|
|
|
|
|
|
|
|
|
void ref() { _ref++; }
|
|
|
|
void ref() { _ref++; }
|
|
|
@ -135,7 +134,7 @@ template <class T, class U> inline SharedPtr<T> static_pointer_cast(const Shared
|
|
|
|
template <class T, class U> inline SharedPtr<T> const_pointer_cast(const SharedPtr<U> &p) { return SharedPtr<T>(const_cast<T *>(p.get())); }
|
|
|
|
template <class T, class U> inline SharedPtr<T> const_pointer_cast(const SharedPtr<U> &p) { return SharedPtr<T>(const_cast<T *>(p.get())); }
|
|
|
|
|
|
|
|
|
|
|
|
//A special pointer for nodes keeping track of the document,
|
|
|
|
//A special pointer for nodes keeping track of the document,
|
|
|
|
//which helps distinguish back links from them to it, in order to break
|
|
|
|
//which helps distinguish back links from them to it, in order to break
|
|
|
|
//cycles
|
|
|
|
//cycles
|
|
|
|
template <class T> class DocPtr {
|
|
|
|
template <class T> class DocPtr {
|
|
|
|
public:
|
|
|
|
public:
|
|
|
@ -143,35 +142,35 @@ public:
|
|
|
|
DocPtr(T *ptr) : m_ptr(ptr) { if (ptr) ptr->selfOnlyRef(); }
|
|
|
|
DocPtr(T *ptr) : m_ptr(ptr) { if (ptr) ptr->selfOnlyRef(); }
|
|
|
|
DocPtr(const DocPtr &o) : m_ptr(o.m_ptr) { if (T *ptr = m_ptr) ptr->selfOnlyRef(); }
|
|
|
|
DocPtr(const DocPtr &o) : m_ptr(o.m_ptr) { if (T *ptr = m_ptr) ptr->selfOnlyRef(); }
|
|
|
|
~DocPtr() { if (T *ptr = m_ptr) ptr->selfOnlyDeref(); }
|
|
|
|
~DocPtr() { if (T *ptr = m_ptr) ptr->selfOnlyDeref(); }
|
|
|
|
|
|
|
|
|
|
|
|
template <class U> DocPtr(const DocPtr<U> &o) : m_ptr(o.get()) { if (T *ptr = m_ptr) ptr->selfOnlyRef(); }
|
|
|
|
template <class U> DocPtr(const DocPtr<U> &o) : m_ptr(o.get()) { if (T *ptr = m_ptr) ptr->selfOnlyRef(); }
|
|
|
|
|
|
|
|
|
|
|
|
void resetSkippingRef(T *o) { m_ptr = o; }
|
|
|
|
void resetSkippingRef(T *o) { m_ptr = o; }
|
|
|
|
|
|
|
|
|
|
|
|
T *get() const { return m_ptr; }
|
|
|
|
T *get() const { return m_ptr; }
|
|
|
|
|
|
|
|
|
|
|
|
T &operator*() const { return *m_ptr; }
|
|
|
|
T &operator*() const { return *m_ptr; }
|
|
|
|
T *operator->() const { return m_ptr; }
|
|
|
|
T *operator->() const { return m_ptr; }
|
|
|
|
|
|
|
|
|
|
|
|
bool operator!() const { return !m_ptr; }
|
|
|
|
bool operator!() const { return !m_ptr; }
|
|
|
|
|
|
|
|
|
|
|
|
// this type conversion operator allows implicit conversion to
|
|
|
|
// this type conversion operator allows implicit conversion to
|
|
|
|
// bool but not to other integer types
|
|
|
|
// bool but not to other integer types
|
|
|
|
|
|
|
|
|
|
|
|
typedef T * (DocPtr::*UnspecifiedBoolType)() const;
|
|
|
|
typedef T * (DocPtr::*UnspecifiedBoolType)() const;
|
|
|
|
operator UnspecifiedBoolType() const
|
|
|
|
operator UnspecifiedBoolType() const
|
|
|
|
{
|
|
|
|
{
|
|
|
|
return m_ptr ? &DocPtr::get : 0;
|
|
|
|
return m_ptr ? &DocPtr::get : 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
DocPtr &operator=(const DocPtr &);
|
|
|
|
DocPtr &operator=(const DocPtr &);
|
|
|
|
DocPtr &operator=(T *);
|
|
|
|
DocPtr &operator=(T *);
|
|
|
|
|
|
|
|
|
|
|
|
private:
|
|
|
|
private:
|
|
|
|
T *m_ptr;
|
|
|
|
T *m_ptr;
|
|
|
|
};
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
template <class T> DocPtr<T> &DocPtr<T>::operator=(const DocPtr<T> &o)
|
|
|
|
template <class T> DocPtr<T> &DocPtr<T>::operator=(const DocPtr<T> &o)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
T *optr = o.m_ptr;
|
|
|
|
T *optr = o.m_ptr;
|
|
|
|
if (optr)
|
|
|
|
if (optr)
|
|
|
@ -192,34 +191,34 @@ template <class T> inline DocPtr<T> &DocPtr<T>::operator=(T *optr)
|
|
|
|
return *this;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
template <class T> inline bool operator==(const DocPtr<T> &a, const DocPtr<T> &b)
|
|
|
|
template <class T> inline bool operator==(const DocPtr<T> &a, const DocPtr<T> &b)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
return a.get() == b.get();
|
|
|
|
return a.get() == b.get();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
template <class T> inline bool operator==(const DocPtr<T> &a, const T *b)
|
|
|
|
template <class T> inline bool operator==(const DocPtr<T> &a, const T *b)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
return a.get() == b;
|
|
|
|
return a.get() == b;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
template <class T> inline bool operator==(const T *a, const DocPtr<T> &b)
|
|
|
|
template <class T> inline bool operator==(const T *a, const DocPtr<T> &b)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
return a == b.get();
|
|
|
|
return a == b.get();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
template <class T> inline bool operator!=(const DocPtr<T> &a, const DocPtr<T> &b)
|
|
|
|
template <class T> inline bool operator!=(const DocPtr<T> &a, const DocPtr<T> &b)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
return a.get() != b.get();
|
|
|
|
return a.get() != b.get();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
template <class T> inline bool operator!=(const DocPtr<T> &a, const T *b)
|
|
|
|
template <class T> inline bool operator!=(const DocPtr<T> &a, const T *b)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
return a.get() != b;
|
|
|
|
return a.get() != b;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
template <class T> inline bool operator!=(const T *a, const DocPtr<T> &b)
|
|
|
|
template <class T> inline bool operator!=(const T *a, const DocPtr<T> &b)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
return a != b.get();
|
|
|
|
return a != b.get();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|