/*return true if is found *bool containsconst anytype const return findposx !- figure routine to search cuckoo hash table /*remove from the hash table return true if item was found and removed *bool removeconst anytype int currentpos findposx )if!isactivecurrentpos return falsearraycurrentpos isactive false--currentsizereturn truefigure routine to remove from cuckoo hash table bool insertconst anytype ifcontainsx return falseifcurrentsize >array sizemax_load expand)return inserthelper )figure public insert routine for cuckoo hashing our basic logic is different from the classic scheme we have already tested that the item to insert is not already present at lines to we check to see if any of the valid positions are emptyif sowe place our item in the first available position and we are done otherwisewe evict one of the existing items howeverthere are some tricky issues