Use HashMap for literals look up

[987Nabil]

A state machine can not improve literal path matching, since it is only fast for misses, but we need the best performance for hits. This is best done with hash maps.

This PR adds a benchmark for literal path matching and replaces the current ListMap with HashMap. This leads to a significant performance increase, as can be seen below

Run on MacBook Pro M1 Max
Old implementation:
[info] Benchmark                                   Mode  Cnt   Score    Error  Units
[info] RoutesBenchmark.benchmarkSmallDataZioApi   thrpt    3  45.794 ± 16.348  ops/s
[info] RoutesBenchmark.benchmarkSmallDataZioApi2  thrpt    3  63.488 ± 10.817  ops/s
[info] RoutesBenchmark.notFound1                  thrpt    3  60.807 ± 13.060  ops/s
[info] RoutesBenchmark.notFound2                  thrpt    3  60.809 ± 13.525  ops/s

HashMap instead of ListMap:
[info] Benchmark                                   Mode  Cnt   Score    Error  Units
[info] RoutesBenchmark.benchmarkSmallDataZioApi   thrpt    3  67.768 ±  9.438  ops/s
[info] RoutesBenchmark.benchmarkSmallDataZioApi2  thrpt    3  78.646 ± 15.662  ops/s
[info] RoutesBenchmark.notFound1                  thrpt    3  79.978 ±  3.829  ops/s
[info] RoutesBenchmark.notFound2                  thrpt    3  87.911 ±  9.178  ops/s

closes #2960
/claim #2960