ERAGON007's Stars
NixOS/nixpkgs
Nix Packages collection & NixOS
nix-community/home-manager
Manage a user environment using Nix [maintainer=@rycee]
Airblader/i3
A fork of the i3 window manager with gaps and some other features. :warning: i3-gaps has been merged into i3.
VonHeikemen/lsp-zero.nvim
A starting point to setup some lsp related features in neovim.
srdja/Collections-C
A library of generic data structures for the C language.
meskarune/i3lock-fancy
i3lock script that takes a screenshot of the desktop, blurs the background and adds a lock icon and text
Visgean/Zeus
NOT MY CODE! Zeus trojan horse - leaked in 2011, I am not the author. This repository is for study purposes only, do not message me about your lame hacking attempts.
janestreet/hardcaml
Hardcaml is an OCaml library for designing hardware.
smolck/uivonim
Fork of the Veonim Neovim GUI
kprotty/zap
An asynchronous runtime with a focus on performance and resource efficiency.
526avijitgupta/gokarna
A minimal opinionated theme for Hugo
TheAlgorithms/Elixir
leoantony72/twitter-backend
backend clone of Twitter with golang
alexnask/ctregex.zig
Compile time regular expressions in zig
LorettaDevs/Loretta
A C# Lua, GLua and Luau parser, code analysis, transformation and generation library.
folke/LazyVim
Starter template for lazy Neovim users
DutchGhost/zigiffy
Rust FFI with Zig
kubkon/zdb
Simple debugger in Zig for Zig
uleelx/lupy
A small Python-style OO implementation for Lua
zigtools/sus
Hunt down sus zls activity by spamming zls with hot req/notif garbage
MasterQ32/waveform
Generates nice Unicode rendered waveforms.
aeronavery/zig-orm
A database ORM
leecannon/zig-sbi
Zig wrapper around the RISC-V SBI specification
devins2518/zig-dis-aarch64
RobinKa/zig-socks
SOCKS4 proxy server written in Zig
BlueAlmost/zopenBLAS
zig wrappers for openBLAS
BaseMax/CircularDoublyLinkedListC
This is a simple implementation of Circular Doubly Linked-List in C. Circular Doubly Linked-List is a data structure that is a combination of a doubly linked list and a circular linked list. It is a linked list where all nodes are connected to each other. It is a circular linked list because all nodes are connected to each other.
BaseMax/CompleteTreeCheckerGo
This is a simple Go program that checks if a given tree is complete or not. A tree is complete if all levels are completely filled except possibly the last level and the last level has all keys as left as possible.
BaseMax/CompleteTreeLinkedListGo
This is a Go program for creating a complete tree using linked list. You can easily insert nodes to the tree and print it. This library provide two inserting functions. One of them is for inserting nodes to the tree by filling the tree from left to right in per row. and the next one is to insert to left side of the tree.
Cadu12/mtasa-java-sdk