//中序线索二叉树的插入算法,参数R作为参数S的左儿子 void LInsert ( THTREE S , THTREE R ) { THTREE w ; R->lchild = S->lchild ; R->ltag = S->ltag ; R->rchild = S ; R->rtag = FALSE ; S->lchild = R ; S->ltag = TRUE ; if ( R->ltag == TRUE ) { w = InPre( R ) ; w->rchild = R ; } }
bool PreMgr::IsLoadPreFinished(const char *pFilename) { // If it's in the pending list, it isn't done loading for (int i = 0; i < m_num_pending_pre_files; i++) { if (strcmp(m_pending_pre_files[i].m_file_name, pFilename) == 0) { return false; } } Dbg_MsgAssert(InPre(pFilename), ("IsLoadPreFinished(): Can't find Pre file")); return true; }