class CompareIndices
{
public:
- int operator() (const SGPropertyNode * n1, const SGPropertyNode *n2) const {
+ int operator() (const SGPropertyNode_ptr n1, const SGPropertyNode_ptr n2) const {
return (n1->getIndex() < n2->getIndex());
}
};
* Locate a child node by name and index.
*/
static int
-find_child (const char * name, int index, vector<SGPropertyNode *> nodes)
+find_child (const char * name, int index, vector<SGPropertyNode_ptr> nodes)
{
int nNodes = nodes.size();
for (int i = 0; i < nNodes; i++) {
#endif
}
+/**
+ * Increment reference counter
+ */
+void
+SGPropertyNode::incrementRef()
+{
+ ++_count;
+}
+
+/**
+ * Decrement reference counter
+ */
+int
+SGPropertyNode::decrementRef()
+{
+ return --_count;
+}
+
\f
////////////////////////////////////////////////////////////////////////
// Public methods from SGPropertyNode.
////////////////////////////////////////////////////////////////////////
+/**
+ * Last used attribute
+ * Update as needed when enum Attribute is changed
+ */
+const int SGPropertyNode::LAST_USED_ATTRIBUTE = TRACE_WRITE;
+
/**
* Default constructor: always creates a root node.
*/
_path_cache(0),
_type(NONE),
_tied(false),
- _attr(READ|WRITE)
+ _attr(READ|WRITE),
+ _count(0)
{
_local_val.string_val = 0;
}
_path_cache(0),
_type(node._type),
_tied(node._tied),
- _attr(node._attr)
+ _attr(node._attr),
+ _count(0)
{
_name = copy_string(node._name);
_local_val.string_val = 0;
_path_cache(0),
_type(NONE),
_tied(false),
- _attr(READ|WRITE)
+ _attr(READ|WRITE),
+ _count(0)
{
_name = copy_string(name);
_local_val.string_val = 0;
SGPropertyNode::~SGPropertyNode ()
{
delete [] _name;
- for (int i = 0; i < (int)_children.size(); i++) {
- delete _children[i];
- }
delete _path_cache;
clear_value();
}
if (pos >= 0) {
return _children[pos];
} else if (create) {
- _children.push_back(new SGPropertyNode(name, index, this));
+ SGPropertyNode_ptr node;
+ pos = find_child(name, index, _removedChildren);
+ if (pos >= 0) {
+ std::vector<SGPropertyNode_ptr>::iterator it = _removedChildren.begin();
+ it += pos;
+ node = _removedChildren[pos];
+ _removedChildren.erase(it);
+ node->setAttribute(REMOVED, false);
+ } else {
+ node = new SGPropertyNode(name, index, this);
+ }
+ _children.push_back(node);
return _children[_children.size()-1];
} else {
return 0;
/**
* Get all children with the same name (but different indices).
*/
-vector<SGPropertyNode *>
-SGPropertyNode::getChildren (const char * name)
+vector<SGPropertyNode_ptr>
+SGPropertyNode::getChildren (const char * name) const
{
- vector<SGPropertyNode *> children;
+ vector<SGPropertyNode_ptr> children;
int max = _children.size();
for (int i = 0; i < max; i++)
/**
- * Get all children const with the same name (but different indices).
+ * Remove a child node
*/
-vector<const SGPropertyNode *>
-SGPropertyNode::getChildren (const char * name) const
+SGPropertyNode_ptr
+SGPropertyNode::removeChild (const char * name, int index, bool keep)
{
- vector<const SGPropertyNode *> children;
- int max = _children.size();
-
- for (int i = 0; i < max; i++)
- if (compare_strings(_children[i]->getName(), name))
- children.push_back(_children[i]);
-
- sort(children.begin(), children.end(), CompareIndices());
- return children;
+ SGPropertyNode_ptr ret;
+ int pos = find_child(name, index, _children);
+ if (pos >= 0) {
+ std::vector<SGPropertyNode_ptr>::iterator it = _children.begin();
+ it += pos;
+ SGPropertyNode_ptr node = _children[pos];
+ _children.erase(it);
+ if (keep) {
+ _removedChildren.push_back(node);
+ }
+ node->setAttribute(REMOVED, true);
+ ret = node;
+ }
+ return ret;
}
return hash;
}
+
+
+/**
+ * Default constructor
+ */
+SGPropertyNode_ptr::SGPropertyNode_ptr()
+{
+ _ptr = 0;
+}
+
+/**
+ * Copy constructor
+ */
+SGPropertyNode_ptr::SGPropertyNode_ptr( const SGPropertyNode_ptr &r )
+{
+ _ptr = r._ptr;
+ if (_ptr)
+ _ptr->incrementRef();
+}
+
+/**
+ * Constructor from a pointer to a node
+ */
+SGPropertyNode_ptr::SGPropertyNode_ptr( SGPropertyNode *p )
+{
+ _ptr = p;
+ if (_ptr)
+ _ptr->incrementRef();
+}
+
+/**
+ * Destructor
+ */
+SGPropertyNode_ptr::~SGPropertyNode_ptr()
+{
+ if (_ptr && _ptr->decrementRef() == 0)
+ delete _ptr;
+}
+
+/**
+ * Assignement operator
+ */
+SGPropertyNode_ptr &
+SGPropertyNode_ptr::operator=( const SGPropertyNode_ptr &r )
+{
+ if (_ptr && _ptr->decrementRef() == 0)
+ delete _ptr;
+ _ptr = r._ptr;
+ if (_ptr)
+ _ptr->incrementRef();
+
+ return *this;
+}
+
+/**
+ * Pointer access operator
+ */
+SGPropertyNode *
+SGPropertyNode_ptr::operator->()
+{
+ return _ptr;
+}
+
+/**
+ * Pointer access operator (const)
+ */
+const SGPropertyNode *
+SGPropertyNode_ptr::operator->() const
+{
+ return _ptr;
+}
+
+/**
+ * Conversion to SGPropertyNode * operator
+ */
+SGPropertyNode_ptr::operator SGPropertyNode *()
+{
+ return _ptr;
+}
+
+/**
+ * Conversion to const SGPropertyNode * operator
+ */
+SGPropertyNode_ptr::operator const SGPropertyNode *() const
+{
+ return _ptr;
+}
+
+/**
+ * Validity test
+ */
+bool
+SGPropertyNode_ptr::valid() const
+{
+ return _ptr != 0;
+}
+
+
// end of props.cxx
setter_t _setter;
};
+\f
+/**
+ * The smart pointer that manage reference counting
+ */
+class SGPropertyNode;
+class SGPropertyNode_ptr
+{
+public:
+
+ /**
+ * Default constructor
+ */
+ SGPropertyNode_ptr();
+
+ /**
+ * Copy constructor
+ */
+ SGPropertyNode_ptr( const SGPropertyNode_ptr &r );
+
+ /**
+ * Constructor from a pointer to a node
+ */
+ SGPropertyNode_ptr( SGPropertyNode *p );
+
+ /**
+ * Destructor
+ */
+ ~SGPropertyNode_ptr();
+
+ /**
+ * Assignement operator
+ */
+ SGPropertyNode_ptr &operator=( const SGPropertyNode_ptr &r );
+
+ /**
+ * Pointer access operator
+ */
+ SGPropertyNode *operator->();
+
+ /**
+ * Pointer access operator (const)
+ */
+ const SGPropertyNode *operator->() const;
+
+ /**
+ * Conversion to SGPropertyNode * operator
+ */
+ operator SGPropertyNode *();
+
+ /**
+ * Conversion to const SGPropertyNode * operator
+ */
+ operator const SGPropertyNode *() const;
+
+ /**
+ * Validity test
+ */
+ bool valid() const;
+
+private:
+
+ SGPropertyNode *_ptr;
+};
\f
/**
READ = 1,
WRITE = 2,
ARCHIVE = 4,
- TRACE_READ = 8,
- TRACE_WRITE = 16
+ REMOVED = 8,
+ TRACE_READ = 16,
+ TRACE_WRITE = 32
};
+ /**
+ * Last used attribute
+ * Update as needed when enum Attribute is changed
+ */
+ static const int LAST_USED_ATTRIBUTE;
+
+
/**
* Default constructor.
*/
/**
* Get a vector of all children with the specified name.
*/
- vector<SGPropertyNode *> getChildren (const char * name);
+ vector<SGPropertyNode_ptr> getChildren (const char * name) const;
/**
- * Get a vector all all children (const) with the specified name.
+ * Remove a child node
*/
- vector<const SGPropertyNode *> getChildren (const char * name) const;
+ SGPropertyNode_ptr removeChild (const char * name, int index = 0,
+ bool keep = true);
//
*/
void trace_write () const;
+
+ /**
+ * Increment reference counter
+ */
+ void incrementRef();
+
+ /**
+ * Decrement reference counter
+ */
+ int decrementRef();
+
+ friend class SGPropertyNode_ptr;
+
+
mutable char _buffer[MAX_STRING_LEN+1];
class hash_table;
char * _name;
int _index;
SGPropertyNode * _parent;
- vector<SGPropertyNode *> _children;
+ vector<SGPropertyNode_ptr> _children;
+ vector<SGPropertyNode_ptr> _removedChildren;
hash_table * _path_cache;
Type _type;
bool _tied;
int _attr;
+ int _count;
// The right kind of pointer...
union {