📄 managementnode.cpp
字号:
/*
* Copyright (C) 2003-2007 Funambol, Inc.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY, TITLE, NONINFRINGEMENT or FITNESS FOR A PARTICULAR
* PURPOSE. See the GNU General Public License for more details.
*
* You should have received a copy of the GNU 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
*/
#include "base/fscapi.h"
#include "base/Log.h"
#include "base/util/utils.h"
#include "spdm/ManagementNode.h"
/*
* Constructor.
*
* @param parent - a ManagementNode is usually under the context of a
* parent node.
* @param name - the node name
*
*/
ManagementNode::ManagementNode(const char* parent, const char* name) {
context = stringdup(parent);
this->name = stringdup(name);
}
ManagementNode::ManagementNode(const char* fullname) {
if(setFullName(fullname)){
char msg[512];
sprintf(msg, "Invalid context: %s", fullname);
//TODO call ErrorHandler XXX
LOG.error(msg);
}
}
ManagementNode::~ManagementNode() {
if (context)
delete [] context;
if (name)
delete [] name;
}
/*
* Returns the full node name (in a new-allocated buffer)
*/
char* ManagementNode::createFullName(){
char*ret = new char[strlen(context)+strlen(name)+2];
sprintf(ret, "%s/%s", context, name);
return ret;
}
int ManagementNode::setFullName(const char *fullname) {
char* p;
int len;
p = strrchr((char*)fullname, '/');
if ( !p )
return -1;
len = p-fullname;
context = stringdup(fullname, len);
p++; len=strlen(fullname)-len;
name = stringdup(p, len);
return 0;
}
const char *ManagementNode::getName() {
return name;
}
/*
* Returns how many children belong to this node.
*
*/
int ManagementNode::getChildrenCount() {
return children.size();
}
/*
* Get a child from the list
*/
ManagementNode * ManagementNode::getChild(int index) {
return (ManagementNode *)children[index];
}
ManagementNode * ManagementNode::getChild(const char* name) {
for (int index = 0; index < children.size(); index++) {
if (!strcmp(((ManagementNode *)children[index])->getName(), name)) {
return (ManagementNode *)children[index];
}
}
return NULL;
}
/*
* Adds a new child. A clone of the given node is created internally, so that
* the caller is free to release node as soon as it wants.
*
* @parent node the new node
*/
void ManagementNode::addChild(ManagementNode& node) {
children.add(node);
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -