if (node->children[childIndex] == NULL) {
if(ret != Decision::ANY)
return ret;
- else if(policy.getTreeRoot()->__is_prefix)
+ else if (policy.getTreeRoot()->__is_prefix)
return policy.getTreeRoot()->__decisionItem.getDecision();
else
return Decision::ANY;
}
/*If item is prefix, delete children*/
if(item->isPrefix()){
- for(int i=0; i<MAX_CHILDREN; i++)
+ for(int i = 0; i < MAX_CHILDREN; i++)
nodeRemove(&(node->children[i]));
}
node->__decisionItem = item->getDecision();
int len;
j = i;
if (tslog::verbose() && !((name[i] >= 'a'&& name[i] <= 'z') || (name[i] >= 'A'&& name[i] <= 'Z') || (name[i] >= '0'&& name[i] <= '9') || name[i] == ' ')) {
- std::cout<<"Wrong name("<<i<<"): "<<name<<std::endl;
+ std::cout << "Wrong name("<< i <<"): " << name << std::endl;
}
while ((c = name[i++]) && ' ' != c);
if (!c) {
struct test_case* test_cases;
int timeout;
- char** (*prepare_args) (const struct binary* b, const char* test_name);
- void (*parse) (const struct binary* b, const char* test_name, char* buffer, int state_change, int state_option);
+ char** (*prepare_args)(const struct binary* b, const char* test_name);
+ void (*parse)(const struct binary* b, const char* test_name, char* buffer, int state_change, int state_option);
int (*init)(void);
int (*clean)(void);
};