> 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: Not ByteArrayLittleEndian ------------- Changes: - all: https://git.openjdk.org/jdk/pull/15768/files - new: https://git.openjdk.org/jdk/pull/15768/files/1463863e..f7d832f9 Webrevs: - full: https://webrevs.openjdk.org/?repo=jdk&pr=15768&range=09 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=15768&range=08-09 Stats: 17 lines in 1 file changed: 1 ins; 3 del; 13 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
