Zig aims to be a simple language. It is not easy to define what simple exactly means, but zig is also a low-level programming language that aims for c-compatibility. To reach this goal, it needs good semantics in its type system so that developers have a complete toolbox to manipulate data.
So types in zig are composable, but this can become rapidly overwhelming. See those examples. Are you able to understand them at a glance, as soon as you read them?
*const ?u8
?*const u8
*const [2]u8
| Bacon = require('baconjs') | |
| Imm = require('immutable') | |
| React = require('react') | |
| window.Actions = | |
| changeFirstName: new Bacon.Bus() | |
| changeLastName: new Bacon.Bus() | |
| changeCountry: new Bacon.Bus() | |
| addCountryBird: new Bacon.Bus() | |
| addFriend: new Bacon.Bus() |
| // no failures from small crush, | |
| // one questionable from small crush (bit reversed) | |
| // 6 MaxOft | |
| // failure from crush | |
| // 72 LinearComp, r = 29 | |
| uint32_t xorshift32ma(void) | |
| { | |
| int s0 = state; |
| package main | |
| import ( | |
| "crypto/tls" | |
| "crypto/x509" | |
| "fmt" | |
| "io" | |
| "log" | |
| ) |
| ''' | |
| redis_search.py | |
| Written by Josiah Carlson July 3, 2010 | |
| Released into the public domain. | |
| This module implements a simple TF/IDF indexing and search algorithm using | |
| Redis as a datastore server. The particular algorithm implemented uses the |
