def mknode(self, al_branchNodes):
b_ret = True<EOL>l_branchNodes = []<EOL>for node in al_branchNodes:<EOL><INDENT>l_path      = self.l_cwd[:]<EOL>l_path.append(node)<EOL>if not self.b_pathOK(l_path):<EOL><INDENT>l_branchNodes.append(node)<EOL><DEDENT><DEDENT>if not len(l_branchNodes):<EOL><INDENT>return False<EOL><DEDENT>snodeBranch   = C_snodeBranch(l_branchNodes)<EOL>for node in l_branchNodes:<EOL><INDENT>depth = self.snode_current.depth()<EOL>snodeBranch.dict_branch[node].depth(depth+<NUM_LIT:1>)<EOL>snodeBranch.dict_branch[node].snode_parent = self.snode_current<EOL><DEDENT>self.snode_current.node_dictBranch(snodeBranch.dict_branch)<EOL>self.paths_update(al_branchNodes)<EOL>return b_ret<EOL>
Create a set of nodes (branches) at current node. Analogous to
a UNIX mkdir call, however nodes can be any type (i.e. not
just "directories" but also "files")