cryptocode

joined 1 year ago
MODERATOR OF
 

From the README:

ZTS is a minimalist Zig module that helps you use text templates in a way that is simple, maintainable, and efficient.

 

Nexus is an SDK for writing DOS applications/games based on Jay Petacat's dos.zig.

We've expanded on the original library to include:

  • Better FarPtr support/use
  • More and compatibility
  • A simple graphics API
  • Using DPMI VGA access
  • And a simple 320x200x256 mode (mode 13h) graphics API
 

From the README:

A simple version of Rust style type traits for Zig. Allows defining type traits and compile time verifying that types satisfy them.

It does not constrain that every declaration referenced on a type must belong to a trait that was implemented. Thus this trait library mainly serves as a convention that provides nice error messages and type documentation for comptime generics.

 

An HTTP framework loosly based on the Ruby Sinatra library.

 

Based on Neotest and uses Treesitter

This enables Zig tests to be executed from within Neovim

 

Command line wireguard configuration manager for complex VPN setups.

Written in Zig with a dependency on sqlite3.

 

A Zig port of Stream VByte encoding

StreamVByte is a new integer compression technique that applies SIMD instructions (vectorization) to Google's Group Varint approach. The net result is faster than other byte-oriented compression techniques.

 

zigTensor is a fast, flexible machine learning library written entirely in Zig; the design is heavily inspired by the Flashlight library.

Tracks Zig mainline.

Currently target macOS.

 

This presentation was recorded at GOTO Chicago 2023

ORIGINAL TALK TITLE How to Build Software From Source

PRESENTER Andrew Kelley

Download slides and read the full abstract here

 

sekao gives his thoughts about Zig after using it for a few months. Touches on memory management, C integration and comptime.

 

Excerpt:

To me, one of the biggest motivators for efficient enum arrays has been compilers. One problem that keeps coming up when designing an AST is figuring out how to reduce its memory footprint. Big ASTs can incur a hefty performance penalty during compilation, because memory bandwidth and latency are a frequent bottleneck in compiler frontends. Chandler Carruth's video on the Carbon compiler has been making the rounds on language forums. In it he describes how a parsed clang AST regularly consumes 50x more memory than the original source code!

 

Cases supported:

  • camelCase
  • PascalCase
  • snake_case
  • CONSTANT_CASE
  • kebab-case
  • Header-Case
  • lower case
  • UPPER CASE
  • Capital Case
view more: ‹ prev next ›