new_node          109 WordTree.cpp   void tree::enter_node(offset_ptr<node>& new_node, const std::string& new_word,
new_node          116 WordTree.cpp       if (new_node == NULL) {
new_node          118 WordTree.cpp           new_node = new(reinterpret_cast<node*>(ShmP)) node;
new_node          121 WordTree.cpp           new_node->left  = NULL;
new_node          122 WordTree.cpp           new_node->right = NULL;
new_node          124 WordTree.cpp           new_node->word  = new(ShmP) char[sz];
new_node          128 WordTree.cpp           new_node->counter = 1;
new_node          130 WordTree.cpp           new_node->fpos = new(reinterpret_cast<wpos*>(ShmP))
new_node          132 WordTree.cpp           new_node->lpos = new_node->fpos;
new_node          139 WordTree.cpp       char* wp = (new_node->word).get();
new_node          143 WordTree.cpp           new_node->counter += 1;
new_node          144 WordTree.cpp           (new_node->lpos)->next = new(reinterpret_cast<wpos*>(ShmP))
new_node          146 WordTree.cpp           new_node->lpos = (new_node->lpos)->next;
new_node          153 WordTree.cpp           enter_node(new_node->right, new_word, gi, fi, li, ii, pi, wi);
new_node          155 WordTree.cpp           enter_node(new_node->left,  new_word, gi, fi, li, ii, pi, wi);