fNrEntries++;
fFastAccess=kFALSE;
fFastAccessSerialize=kFALSE;
- UInt_t balanceHeight = (UInt_t) (log(fNrEntries+1)/log(2)+1);
+ UInt_t balanceHeight = (UInt_t) (TMath::Log(fNrEntries+1)/TMath::Log(2)+1);
if ( (height-balanceHeight)*(height-balanceHeight) > fNrEntries ) {
Balance();
}
else if (key>node->Key()) return FindNode(key,node->Right(),height);
else { // Match
// //*** balance if height too high. const above have to be removed if this is needed ***
-// UInt_t balanceHeight = (UInt_t) (log(fNrEntries+1)/log(2)+1);
+// UInt_t balanceHeight = (UInt_t) (TMath::Log(fNrEntries+1)/TMath::Log(2)+1);
// if ( (height-balanceHeight)*(height-balanceHeight) > fNrEntries ) {
// Balance();
// }
void AliITSIntMap::InitFastAccess(){
// initializes the fast access array
+ if (fFastAccess) return;
ClearFastAccess();
if (fNrEntries>0) {
fFastAccessArray = new AliITSIntMapNode*[fNrEntries];
void AliITSIntMap::InitFastAccessSerialize(){
// initializes the fast access array
+ if (fFastAccessSerialize) return;
ClearFastAccess();
if (fNrEntries>0) {
fFastAccessArray = new AliITSIntMapNode*[fNrEntries];