Jump table optimization in the Jason library?

https://github.com/michalmuskala/jason/blob/master/lib/decoder.ex#L36

Could somebody elaborate on this optimization and how to achieve it in Elixir?
(in the context of Elixir, not simple mentions of assembly)

Check out “select_val optimizations” in The BEAM Book. Pattern matching on a variable when all cases are integers close to each other makes it possible to use a jump table (jump_on_val) rather than linear or binary search.