The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning. Learn more →
Top 23 Incremental Open-Source Projects
-
Project mention: Lezer: A Parsing System for CodeMirror, Inspired by Tree-Sitter | news.ycombinator.com | 2024-03-24
I learned from a google search that these days upstream tree-sitter provides WebAssembly bindings.
Source: https://github.com/tree-sitter/tree-sitter/tree/master/lib/b...
NPM: https://www.npmjs.com/package/web-tree-sitter
Download from the latest Github release: js file (https://github.com/tree-sitter/tree-sitter/releases/download...) and wasm file (https://github.com/tree-sitter/tree-sitter/releases/download...)
-
This tutorial explains how to backup PostgreSQL database using pgBackRest and S3.
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
-
BartyCrouch
Localization/I18n: Incrementally update/translate your Strings files from .swift, .h, .m(m), .storyboard or .xib files.
-
differential-datalog
DDlog is a programming language for incremental computation. It is well suited for writing programs that continuously update their output in response to input changes. A DDlog programmer does not write incremental algorithms; instead they specify the desired input-output mapping in a declarative manner.
Project mention: DDlog: A programming language for incremental computation | news.ycombinator.com | 2024-02-13 -
I really like restic, and am personally happy to use it via the command line. It's very fast and efficient! However, I do wish there was better tooling / wrappers around it. For example, Pika Backup is a popular UI for Borg of which no equivalent exists for Restic. I'd love to be able to set something simple up on my partner's Macbook.
For my own purposes, I've been using a script I found on Github[0] for a while, but it only really supports Backblaze B2 AFAIK.[1]
I've been meaning to try autorestic[2] and resticprofile[3] as they are potentially more flexible than the script I'm currently using, and prestic[4] looks intriguing for my partner's use, but seems to have very few users. And the fact that there are so many competing tools makes it difficult to land on one.
[0] https://github.com/erikw/restic-automatic-backup-scheduler
[1] https://github.com/erikw/restic-automatic-backup-scheduler/i...
[2] https://github.com/cupcakearmy/autorestic
-
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
-
-
Look at the original integration project https://github.com/emacs-tree-sitter/elisp-tree-sitter, before it was done inside Emacs 29+.
-
Project mention: How to Effortlessly Improve a Legacy Codebase Using Robots | /r/RedditEng | 2023-05-01
We first took a shot at addressing this gradually using a tool called Betterer, which works by taking a snapshot of the state of a set of errors, warnings, or undesired regular expressions in the codebase and surfacing changes in pull request diffs. Betterer had served us well in the past, such as when it helped us deprecate the Enzyme testing framework in favor of React testing library. However, because there were so many instances of noImplicitAny errors in the codebase, we found that much like snapshot tests, reviewers had begun to ignore Betterer results and we weren’t in fact getting better at all. Begrudgingly, we removed the rule from our Betterer tests and agreed to find a different way to enforce it. Luckily, this decision took place just in time for Snoosweek (Reddit’s internal hack week) so I was able to invest a few days into adding a new automation step to ensure incremental progress toward adherence to this rule.
-
I wonder how this compares to comemo [1] [2], they're both memoization frameworks with "tricks" to limit invalidation.
The trick in comemo's blog post is to make the dependencies fine-grained, by tracking and only comparing what parts of them are actually used; while the trick here is to have functions depend on other outputs instead of the root input, so changes don't propagate all the way.
-
-
virtnbdbackup
Backup utility for Libvirt / qemu / kvm supporting incremental and differential backups + instant recovery (agentless).
Project mention: virtnbdbackup: Backup utility for Libvirt / qemu / kvm supporting incremental and differential backups + instant recovery. | /r/coolgithubprojects | 2023-05-18 -
Project mention: My SSD suddenly died. I only lost 10 minutes of data, thanks to ZFS | news.ycombinator.com | 2023-08-22
For people who don't want to use ZFS but are okay with LVM: wyng-backup (formerly sparsebak)
-
-
-
Butterfly-Backup
Butterfly Backup is a simple command line wrapper of rsync for complex task, written in python.
-
tmu
Implements the Tsetlin Machine, Coalesced Tsetlin Machine, Convolutional Tsetlin Machine, Regression Tsetlin Machine, and Weighted Tsetlin Machine, with support for continuous features, drop clause, Type III Feedback, focused negative sampling, multi-task classifier, autoencoder, literal budget, and one-vs-one multi-class classifier. TMU is written in Python with wrappers for C and CUDA-based clause evaluation and updating.
-
Project mention: Why Split Lexing and Parsing into Two Separate Phases? | news.ycombinator.com | 2023-05-04
Well, my personal experience was in the opposite direction actually.
I used to use combinators-based approach without Lex/Syn separation (aka PEGs) for a long time. But then I came up to understanding that the separation approach is actually better in performance. And also that working and debugging of the Token sequences while writing parser manually is just more handy (at least for me).
But this is my personal experience of course. I do believe too that it all depends on the goal, and parsers micro-optimizations is not that much critical in many cases, and that combinators approach actually works quite well too.
As of Nom, I can say that it works quite well. But I think that the it's performance gains stem from the fact that Rust is a systems-based PL, and it optimizes function combinations just better than, let say, JavaScript or Python.
In my incremental parsers library Lady Deirdre I utilize Lex/Syn separation, and the LL(1) recursive-descend parsing, and it shows much better performance than in Tree-Sitter at least on relatively big files [1].
[1] https://github.com/Eliah-Lakhin/lady-deirdre/tree/master/wor...
-
-
-
-
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
Incremental related posts
- Lezer: A Parsing System for CodeMirror, Inspired by Tree-Sitter
- Effective Neovim Setup. A Beginner’s Guide
- DDlog: A programming language for incremental computation
- Feldera – a more performant streaming database based on Z-sets
- Any ideas for new addons?
- Spaced Repetition for concepts, frameworks and ideas
- An incremental parsing system for programming tools
-
A note from our sponsor - WorkOS
workos.com | 29 Mar 2024
Index
What are some of the best open-source Incremental projects? This list will help you:
Project | Stars | |
---|---|---|
1 | tree-sitter | 16,106 |
2 | pgBackRest | 2,145 |
3 | react-countup | 1,891 |
4 | BartyCrouch | 1,348 |
5 | differential-datalog | 1,332 |
6 | autorestic | 1,055 |
7 | zrepl | 890 |
8 | moxie | 827 |
9 | elisp-tree-sitter | 804 |
10 | betterer | 560 |
11 | comemo | 368 |
12 | SpaceCompany | 284 |
13 | virtnbdbackup | 259 |
14 | wyng-backup | 234 |
15 | incremental-reading | 210 |
16 | Pokeclicker-Scripts | 178 |
17 | Butterfly-Backup | 111 |
18 | tmu | 106 |
19 | lady-deirdre | 70 |
20 | ipasir | 47 |
21 | Calculator-Evolution | 26 |
22 | zinoma | 24 |
23 | Resource-Grid | 22 |