def find ge(selfk)"""return (key,valuepair with least key greater than or equal to "" key > self find index( len(self table if len(self table)return (self table[jkeyself table[jvalueelsereturn none def find lt(selfk)"""return (key,valuepair with greatest key strictly less than "" key > self find index( len(self table if return (self table[ - keyself table[ - valuenote use of - elsereturn none def find gt(selfk)"""return (key,valuepair with least key strictly greater than "" key > self find index( len(self table if len(self tableand self table[jkey =kj + advanced past match if len(self table)return (self table[jkeyself table[jvalueelsereturn none def find range(selfstartstop)"""iterate all (key,valuepairs such that start <key stop if start is noneiteration begins with minimum key of map if stop is noneiteration continues through the maximum key of map ""if start is nonej= elsefind first result self find index(start len(self table)- while len(self tableand (stop is none or self table[jkey stop)yield (self table[jkeyself table[jvaluej + code fragment an implementation of sortedtablemap class (continued from code fragments and we omit the find le method due to space