Commit Graph

9 Commits

Author SHA1 Message Date
Frederik Hertzum cda22f6879 Updated readme
Some checks failed
/ Build-Stuff (push) Failing after 4s
2024-02-27 23:54:07 +01:00
Frederik Hertzum 75442b923a benchmark files
All checks were successful
/ Build-Stuff (push) Successful in 5s
2024-02-27 22:54:25 +01:00
Frederik Hertzum 0171411d66 Templatize the implementation
All checks were successful
/ Build-Stuff (push) Successful in 5s
Also introduces an optimziation that uses the stack, if the buffer size
required, is lower than a pre-determined threshold
2024-02-27 22:53:04 +01:00
Frederik Hertzum c8a1e82cc7 testing markdown formatting
All checks were successful
/ Build-Stuff (push) Successful in 5s
2024-02-26 00:03:40 +01:00
Frederik Hertzum 92e99a5874 Reduced memory usage by 50%
All checks were successful
/ Build-Stuff (push) Successful in 5s
2024-02-26 00:02:04 +01:00
Frederik Hertzum 23e5b02052 add notes about templating 2024-02-26 00:00:17 +01:00
Frederik Hertzum a4f830f917 Updated readme about templating
All checks were successful
/ Build-Stuff (push) Successful in 4s
2024-02-25 01:16:05 +01:00
Frederik Hertzum db222ed60b Readme
All checks were successful
/ Build-Stuff (push) Successful in 5s
2024-02-25 01:14:25 +01:00
Frederik Hertzum 3ee51fa485 Functional implementation.
All checks were successful
/ Build-Stuff (push) Successful in 6s
This has the same time and memory complexity as the original, and lost,
version. It does use twice the memory needed for the buffer.

TODO: reduce the size of the buffer to half of what it is now.

TODO: add some more tests. Pay attention to odd/even sized strings in
combination. Add some string that are closer to being the same with some
weird mix of pre, post and infix strings.

TODO: See if it's possible to make this faster by divide-and-conquer

TODO: See if it's possible to use SIMD instructions to improve
performance.
2024-02-25 01:04:17 +01:00