> In the improvement of @cl4es PR #15591, the advantages of non-lookup-table > were discussed. > > But if the input is byte[], using lookup table can improve performance. > > For HexFormat#formatHex(Appendable, byte[]) and HexFormat#formatHex(byte[]), > If the length of byte[] is larger, the performance of table lookup will be > improved more obviously.
温绍锦 has updated the pull request incrementally with one additional commit since the last revision: fix typo ------------- Changes: - all: https://git.openjdk.org/jdk/pull/15768/files - new: https://git.openjdk.org/jdk/pull/15768/files/ee78697d..8eff0ee4 Webrevs: - full: https://webrevs.openjdk.org/?repo=jdk&pr=15768&range=06 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=15768&range=05-06 Stats: 2 lines in 1 file changed: 0 ins; 0 del; 2 mod Patch: https://git.openjdk.org/jdk/pull/15768.diff Fetch: git fetch https://git.openjdk.org/jdk.git pull/15768/head:pull/15768 PR: https://git.openjdk.org/jdk/pull/15768
