< > BotCompany Repo | #1008021 // nicestClosestKey - floorKey or ceilingKey depending on Levenshtein distance

JavaX fragment (include)

static U nicestClosestKey(NavigableMap<U, ?> map, U key) {
  U a = map.floorKey(key), b = map.ceilingKey(key);
  if (b == null) ret a;
  if (a == null) ret b;
  int d1 = leven(str(key), str(a));
  int d2 = leven_limited(str(key), str(b), d1);
  ret d1 <= d2 ? a : b;
}

download  show line numbers  debug dex  old transpilations   

Travelled to 13 computer(s): aoiabmzegqzx, bhatertpkbcr, cbybwowwnfue, cfunsshuasjs, gwrvuhgaqvyk, ishqpsrjomds, lpdgvwnxivlt, mqqgnosmbjvj, pyentgdyhuwx, pzhvpgtvlbxg, tslmcundralx, tvejysmllsmz, vouqrxazstgt

No comments. add comment