Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

toHexString util: try String.fromCharCode api #277

Closed
twoeths opened this issue Jul 29, 2022 · 6 comments
Closed

toHexString util: try String.fromCharCode api #277

twoeths opened this issue Jul 29, 2022 · 6 comments
Labels

Comments

@twoeths
Copy link
Contributor

twoeths commented Jul 29, 2022

Is your feature request related to a problem? Please describe.

Refer to achingbrain/uint8arrays#30 (comment)

Given how efficient protobuf creates a string from Uint8Array in one go, we could try to use String.fromCharCode() api for our toHexString() function without using string concatenation (which create temporary strings that cause gc run more frequently)

Describe the solution you'd like

  • Create a function to map a number from 0 to 15 to char code
  • For each byte extract to 1st 4-bits uint and 2nd 4-bits uint
  • Combine to an array of char codes
  • Create string from there in one go
@dapplion
Copy link
Contributor

For NodeJS where performance is important we should just use Buffer utils which will probably be the faster and more memory efficient.

Given how efficient protobuf creates a string from Uint8Array in one go

Efficient in terms of CPU time, memory or what specifically?

@twoeths
Copy link
Contributor Author

twoeths commented Jul 30, 2022

Efficient in terms of CPU time, memory or what specifically?

in CPU time, but I guess could be better in terms of memory too since there is no created strings in the middle (need more benchmarks to see)

export function toHexString2(bytes: Uint8Array): string {
  const chunks = new Array<number>(bytes.length * 2 + 2);
  chunks[0] = 48;
  // "x".charCodeAt(0)
  chunks[1] = 120;
  for (let i = 0; i < bytes.length; i++) {
    const byte = bytes[i];
    const first = (byte & 0xf0) >> 4;
    const second = byte & 0x0f;

    // "0".charCodeAt(0) = 48
    // "a".charCodeAt(0) = 97 => delta = 87
    chunks[2 + 2 * i] = first < 10 ? first + 48 : first + 87;
    chunks[2 + 2 * i + 1] = second < 10 ? second + 48 : second + 87;
  }
  // return String.fromCharCode.apply(String, chunks);
  return String.fromCharCode(...chunks);
}

some quick benchmarks:

  toHexString vs String.fromCharCode
    ✓ fromCharCode                                                        320.1892 ops/s    3.123153 ms/op        -      19043 runs   60.0 s
    ✓ toHexString                                                         211.8084 ops/s    4.721247 ms/op   x0.985      12598 runs   60.0 s
    ✓ Buffer.toString hex                                                 342.6784 ops/s    2.918188 ms/op   x0.995      20385 runs   60.0 s

@dapplion
Copy link
Contributor

@tuyennhv For memory efficiency there's this library that flattens strings. Check it out it's magic https://github.com/davidmarkclements/flatstr

@wemeetagain
Copy link
Member

The fromCharCode approach looks good. Probably the best browser-compatible implementation

@dapplion
Copy link
Contributor

dapplion commented Aug 2, 2022

@tuyennhv For memory efficiency there's this library that flattens strings. Check it out it's magic https://github.com/davidmarkclements/flatstr

Note this was recommended by Ben (the libuv mantainer)

@philknows
Copy link
Member

No longer a priority since this is fixed in Lodestar

@philknows philknows closed this as not planned Won't fix, can't repro, duplicate, stale Oct 8, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

4 participants