zstd
diff-match-patch
Our great sponsors
zstd | diff-match-patch | |
---|---|---|
105 | 8 | |
22,356 | 7,102 | |
2.2% | 1.8% | |
9.7 | 0.0 | |
9 days ago | about 1 month ago | |
C | Python | |
GNU General Public License v3.0 or later | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
zstd
-
Chrome Feature: ZSTD Content-Encoding
Of course, you may get different results with another dataset.
gzip (zlib -6) [ratio=32%] [compr=35Mo/s] [dec=407Mo/s]
zstd (zstd -2) [ratio=32%] [compr=356Mo/s] [dec=1067Mo/s]
NB1: The default for zstd is -3, but the table only had -2. The difference is probably small. The range is 1-22 for zstd and 1-9 for gzip.
NB2: The default program for gzip (at least with Debian) is the executable from zlib. With my workflows, libdeflate-gzip iscompatible and noticably faster.
NB3: This benchmark is 2 years old. The latest releases of zstd are much better, see https://github.com/facebook/zstd/releases
For a high compression, according to this benchmark xz can do slightly better, if you're willing to pay a 10× penalty on decompression.
xz -9 [ratio=23%] [compr=2.6Mo/s] [dec=88Mo/s]
zstd -9 [ratio=23%] [compr=2.6Mo/s] [dec=88Mo/s]
- Zstandard v1.5.6 – Chrome Edition
-
Optimizating Rabin-Karp Hashing
Compression, synchronization and backup systems often use rolling hash to implement "content-defined chunking", an effective form of deduplication.
In optimized implementations, Rabin-Karp is likely to be the bottleneck. See for instance https://github.com/facebook/zstd/pull/2483 which replaces a Rabin-Karp variant by a >2x faster Gear-Hashing.
- Show HN: macOS-cross-compiler – Compile binaries for macOS on Linux
-
Cyberpunk 2077 dev release
Get the data https://publicdistst.blob.core.windows.net/data/root.tar.zst magnet:?xt=urn:btih:84931cd80409ba6331f2fcfbe64ba64d4381aec5&dn=root.tar.zst How to extract https://github.com/facebook/zstd Linux (debian): `sudo apt install zstd` ``` tar -I 'zstd -d -T0' -xvf root.tar.zst ```
-
Honey, I shrunk the NPM package · Jamie Magee
I've done that experiment with zstd before.
https://github.com/facebook/zstd/blob/dev/programs/zstd.1.md...
Not sure about brotli though.
-
How in the world should we unpack archive.org zst files on Windows?
If you want this functionality in zstd itself, check this out: https://github.com/facebook/zstd/pull/2349
- Release Zstandard v1.5.5 · facebook/zstd
- ZSTD 1.5.5 is released with a corruption fix found at Google
-
zstd is used at Google
The story says : "ZSTD 1.5.5 is released with a corruption fix found at Google"
diff-match-patch
-
Ideas for approaching pattern matching/distance problem
I also came across this diff match algorithms: https://github.com/google/diff-match-patch
-
Form editing, changelogs, and progressive diffing - am I reinventing the wheel?
Outside of that, to get the diffs there is a library called diff-match-patch that has implementations in most languages. Your data model / state tracking sounds like it matches the internal constraints.
-
Here’s my ~600 byte (minified, gzipped) package for diffing two strings.
So I'll just leave you with this question - why, as a developer, would I ever advise using this, when fast diff is an industry standard tool that does exactly this, but better, using well tested methods that are being implemented in JS and further optimized by one of the largest global tech companies. Mind you, this is the same company which has developed its own proprietary monolithic VCS, managing versioning for 2billion+ lines of code.
-
Show HN: Character-Based Git Conflict Resolution
Hello HN!
I was always annoyed by conflicts that can be solved automatically, but still need human intervention. E.g. two people changing the same line, but at different, non-conflicting positions. So I searched for a character based patching library and found this nice article https://neil.fraser.name/writing/patch/ and its corresponding library https://github.com/google/diff-match-patch.
Parsing git conflicts, applying patches and showing some useful diffs in the UI helps me to solve 80% of my conflicts automatically. I hope it can help you too.
Happy Hacking!
-
Keeping track of changes made to xml file.
A bit late to the party but have you checked this? google/diff-match-patch
-
Ask HN: What are the best the publicly available FAMANG code repos?
Found this, simple and seems interesting: https://github.com/google/diff-match-patch
-
Getting the difference of two strings
If you need to know exactly what the diff is, you might want to use something like github.com/google/diff-match-patch. Otherwise, a simple Levenshtein distance would suffice. This library seems to have a whole bunch of string distances implemented. Hope this helps!
-
Get Diff and Patch Html
Photo by Markus Spiske on Diff.Match.Patch based on Google library.
What are some alternatives?
LZ4 - Extremely Fast Compression algorithm
esbuild - An extremely fast bundler for the web
Snappy - A fast compressor/decompressor
StringDistances.jl - String Distances in Julia
LZMA - (Unofficial) Git mirror of LZMA SDK releases
webdiff - Two-column web-based git difftool
7-Zip-zstd - 7-Zip with support for Brotli, Fast-LZMA2, Lizard, LZ4, LZ5 and Zstandard
tmatch - Super fast token matcher
ZLib - A massively spiffy yet delicately unobtrusive compression library.
Eureka - AWS Service registry for resilient mid-tier load balancing and failover.
brotli - Brotli compression format
haproxy - HAProxy Load Balancer's development branch (mirror of git.haproxy.org)