1 /**
2 * Phoebe DOM Implementation.
3 *
4 * This is a C++ approximation of the W3C DOM model, which follows
5 * fairly closely the specifications in the various .idl files, copies of
6 * which are provided for reference. Most important is this one:
7 *
8 * http://www.w3.org/TR/2004/REC-DOM-Level-3-Core-20040407/idl-definitions.html
9 *
10 * Authors:
11 * Bob Jamison
12 *
13 * Copyright (C) 2006-2008 Bob Jamison
14 *
15 * This library is free software; you can redistribute it and/or
16 * modify it under the terms of the GNU Lesser General Public
17 * License as published by the Free Software Foundation; either
18 * version 2.1 of the License, or (at your option) any later version.
19 *
20 * This library is distributed in the hope that it will be useful,
21 * but WITHOUT ANY WARRANTY; without even the implied warranty of
22 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
23 * Lesser General Public License for more details.
24 *
25 * You should have received a copy of the GNU Lesser General Public
26 * License along with this library; if not, write to the Free Software
27 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
28 */
30 #include "dom.h"
31 #include "domptr.h"
34 namespace org
35 {
36 namespace w3c
37 {
38 namespace dom
39 {
44 /*#########################################################################
45 ## NodePtr
46 #########################################################################*/
50 /**
51 * Increment the ref counter of the wrapped class instance
52 */
53 void incrementRefCount(Node *p)
54 {
55 if (p)
56 p->_refCnt++;
57 }
59 /**
60 * Decrement the ref counter of the wrapped class instance. Delete
61 * the object if the reference count goes to zero
62 */
63 void decrementRefCount(Node *p)
64 {
65 if (p)
66 {
67 if (--(p->_refCnt) < 1)
68 delete p;
69 }
70 }
75 } //namespace dom
76 } //namespace w3c
77 } //namespace org
81 /*#########################################################################
82 ## E N D O F F I L E
83 #########################################################################*/