This repository contains various ideas and proofs of concept techniques implemented in the ATS2 programming language.
"lines" is a simple software rasterization benchmark, please see:
https://github.com/alekseysidorov/playground/tree/master/swift_vs_rust/raster
for details. To build the ATS version, please use:
make -f Makefile_lines`
To run the program, please use:
./lines
The program can also output a PPM file prior to exiting. If this is
what you want, please comment out a call to pixmap_save_ppm in the
main0 function).
The idea is to implement a doubly-linked n-ary tree (i.e. a tree with links between siblings, as well as from siblings back to their parents) in a typeful manner. Such a tree is most useful in a DOM/XPath implementation, and that has been used as a motivator.
The end result? Putting a lot of indices into a data structure makes it hard to program with.
BASE64 encoding/decoding routines.
A lightbulb, demonstrates a stateful object.
Freely duplicable "offsets" into an fully linear array. Allows the style of programming where you can get "pointers" into an array, but it is statically guaranteed that the pointers are only used when the array is safe to work with.
Flat "nullable" kind of type. Inspired by databases. Assume you want a
datatype like int but that might be not present (or its value might
be unknown). If you use Option(int), then it means one level of
indirection, and a heap allocation to boot! Nullable(int) solves
this issue: it is just a pair of bool and int (its type
parameter), no heap allocation is ever involved.
The function printme should work with any type of a value as soon as
tag is passed in.
Shunting yard algorithm implementation. Provides a math formula calculator for testing. All memory allocation is managed manually.
A command-line utility to load an image file in TGA format and convert it to a PPM file. Using pervasive manual memory allocation, the style is very similar to what you would use in C.
A static array with shared (non-linear) pointers taken out from it. Useful if you want to implement a system where some named resources can be allocated and then referred to by user.
An attempt to provide Ur/Web-style tuples for ATS.
A safe binary heap implementation. Converted from C to ATS.
A C++ expression template example ported to ATS.
Functional implementation of a directed graph (internally represented as adjacency list).
Figuring out how to implement low-dimensional vectors and matrices in ATS, with application to computer graphics.
--Artyom Shalkhakov