auto currentSeed = unpredictableSeed(); static if(vdebug){write("UT: vT, member. "); writeln("seed: ", currentSeed);} rndGenInUse.seed(currentSeed); //initialize the random generator auto uS = uniform(allowedArraySize,testedSize, rndGenInUse); VEBtree vT = new VEBtree(uS); size_t n; uint[allowedArraySize] insertedVals; while(n < allowedArraySize) { auto valToInsert = uniform(0U, uS, rndGenInUse); if(vT.insert(valToInsert)) { insertedVals[n] = valToInsert; n++; } } sort(insertedVals[]); auto sortedInserted = assumeSorted(insertedVals[]); for(size_t i; i < testedSize; ++i) { if(sortedInserted.contains(i)) { assert(i in vT); } else { assert(!(i in vT), "i: " ~ to!string(i)); } }
this method is used to determine, whether an element is currently present in the tree