beserved/server-Windows/ubi_AVLtree.cpp

193   ubi_btNodePtr tmp;

195   tmp                      = p->Link[ubi_trRIGHT];

196   p->Link[ubi_trRIGHT]     = tmp->Link[ubi_trLEFT];

197   tmp->Link[ubi_trLEFT]    = p;

199   tmp->Link[ubi_trPARENT]  = p->Link[ubi_trPARENT];

200   tmp->gender              = p->gender;

201   if( NULL != tmp->Link[ubi_trPARENT] )

202     (tmp->Link[ubi_trPARENT])->Link[(int)(tmp->gender)] = tmp;

203   p->Link[ubi_trPARENT]    = tmp;

210   p->balance -= ubi_trNormalize( tmp->balance );

211   (tmp->balance)--;

212   return( tmp );

225   ubi_btNodePtr tmp;

227   tmp                      = p->Link[ubi_trLEFT];

228   p->Link[ubi_trLEFT]      = tmp->Link[ubi_trRIGHT];

229   tmp->Link[ubi_trRIGHT]   = p;

231   tmp->Link[ubi_trPARENT]  = p->Link[ubi_trPARENT];

232   tmp->gender              = p->gender;

233   if( NULL != tmp->Link[ubi_trPARENT] )

234     (tmp->Link[ubi_trPARENT])->Link[(int)(tmp->gender)] = tmp;

235   p->Link[ubi_trPARENT]    = tmp;

242   p->balance -= ubi_trNormalize( tmp->balance );

243   (tmp->balance)++;

244   return( tmp );

257   ubi_btNodePtr tmp, newroot;

259   tmp                         = tree->Link[ubi_trRIGHT];

260   newroot                     = tmp->Link[ubi_trLEFT];

261   tmp->Link[ubi_trLEFT]       = newroot->Link[ubi_trRIGHT];

262   newroot->Link[ubi_trRIGHT]  = tmp;

270   tmp->Link[ubi_trPARENT]     = newroot;

271   tmp->gender                 = ubi_trRIGHT;

278   if( NULL != tmp->Link[ubi_trLEFT] )

280     tmp->Link[ubi_trLEFT]->Link[ubi_trPARENT]   = tmp;

281     tmp->Link[ubi_trLEFT]->gender               = ubi_trLEFT;

289       tree->balance = ubi_trEQUAL; tmp->balance = ubi_trRIGHT; break;

291       tree->balance = ubi_trEQUAL; tmp->balance = ubi_trEQUAL; break;

293       tree->balance = ubi_trLEFT;  tmp->balance = ubi_trEQUAL; break;

309   ubi_btNodePtr tmp, newroot;

311   tmp                         = tree->Link[ubi_trLEFT];

312   newroot                     = tmp->Link[ubi_trRIGHT];

313   tmp->Link[ubi_trRIGHT]      = newroot->Link[ubi_trLEFT];

314   newroot->Link[ubi_trLEFT]   = tmp;

322   tmp->Link[ubi_trPARENT]     = newroot;

323   tmp->gender                 = ubi_trLEFT;

330   if( NULL != tmp->Link[ubi_trRIGHT] )

332     tmp->Link[ubi_trRIGHT]->Link[ubi_trPARENT]  = tmp;

333     tmp->Link[ubi_trRIGHT]->gender              = ubi_trRIGHT;

341       tree->balance = ubi_trRIGHT; tmp->balance = ubi_trEQUAL; break;

343       tree->balance = ubi_trEQUAL; tmp->balance = ubi_trEQUAL; break;

345       tree->balance = ubi_trEQUAL; tmp->balance = ubi_trLEFT;  break;