- All languages
- C
- C#
- C++
- CSS
- Cirru
- Clojure
- CoffeeScript
- Common Lisp
- Crystal
- Dart
- Dockerfile
- Elixir
- Emacs Lisp
- Erlang
- F#
- Factor
- Fennel
- Frege
- Go
- HTML
- Haskell
- Janet
- Java
- JavaScript
- Julia
- Jupyter Notebook
- Kotlin
- LFE
- Lex
- Lua
- Makefile
- Markdown
- Mathematica
- Nim
- Nix
- OCaml
- Objective-C
- Odin
- PHP
- PLpgSQL
- Perl
- PlantUML
- Protocol Buffer
- Python
- R
- Racket
- Raku
- Rebol
- Red
- Ruby
- Rust
- SCSS
- Scala
- Shell
- Swift
- TeX
- TypeScript
- V
- Vala
- Vim Script
- Vue
- Wren
- YAML
- Zig
Starred repositories
Empowering everyone to build reliable and efficient software.
A modern runtime for JavaScript and TypeScript.
🦀 Small exercises to get you used to reading and writing Rust code!
Code at the speed of thought – Zed is a high-performance, multiplayer code editor from the creators of Atom and Tree-sitter.
An extremely fast Python linter and code formatter, written in Rust.
Dataframes powered by a multithreaded, vectorized query engine, written in Rust
A runtime for writing reliable asynchronous applications with Rust. Provides I/O, networking, scheduling, timers, ...
A smarter cd command. Supports all major shells.
Actix Web is a powerful, pragmatic, and extremely fast web framework for Rust.
a structural diff that understands syntax 🟥🟩
🦔 Fast, lightweight & schema-less search backend. An alternative to Elasticsearch that runs on a few MBs of RAM.
⭐️ A friendly language for building type-safe, scalable systems!
the AI-native open-source embedding database
Hurl, run and test HTTP requests with plain text.
A safe, extensible ORM and Query Builder for Rust
Tantivy is a full-text search engine library inspired by Apache Lucene and written in Rust
A bunch of lints to catch common mistakes and improve your Rust code. Book: https://doc.rust-lang.org/clippy/
A native gRPC client & server implementation with async/await support.
PROST! a Protocol Buffers implementation for the Rust Language
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.