Which XXX completes the C$++$ OpenAddressingHashTable class's Search$()$ function?

V$*$ Search$($const K& key$)$ const override $\{$

for $($int i $=0$; i $<$ table.size$()$; i$++)\{$

int bucketIndex $=$ Probe$($key$,$ i$)$;

if $($table$[$bucketIndex$]==$ &OpenAddressingBucket::EMPTY$\_$SINCE$\_$START$)\{$

return nullptr;

$\}$

if $($table$[$bucketIndex$]!=$ XXX$)\{$

if $($key $==*$table$[$bucketIndex$]->$key$)\{$

return table$[$bucketIndex$]->$value;

$\}$

$\}$

$\}$

return nullptr; $//$ key not found

$\}$