Uiua

This article is not detailed enough and needs to be expanded. Please help us by adding some more information.

Uiua is a tacit array programming language being developed since September 2023 or possibly earlier.

Examples

Truth-machine

do(&pf|eq1)-@0 by&pf fir

KDJ indicator

# Input: 2D array
# Each row represents a day
Nine = 9
Cap = max0 min100
Close = las las
Low = redmin redmin
High = redmax redmax
Raw = mul100 div for(gapsub|bacsub)for(Close|Low|High)
K = dro1sca(add brac(div1.5|div3))joi[50]ste(Raw) Nine
D = dro1sca(add brac(div1.5|div3))joi[50] K
J = sub for(mul2D|mul3K)
for(K|D|J)

Problem 1

red add kee off(not min for (mod3)(mod5)) ran1000

Problem 2

red add kee off (min for(lt4000000)(not mod2)) redadd rep(scaadd) for(ran|eq0 tab sub by(mul2)-1ran) 40

Problem 3

redmax un(redmul)600851475143

Problem 6

red +-for(id|mul)by(slfmul) ran,1 100

Problem 8

redmax st(redmul)13 -@0

Problem 15

las rep(scaadd) for(id|backee 1+1) 20

Problem 16

C=add for(joi0 mod10)(bacjoi0 flodiv10)
redadd rep,1000(C mul2)[1]

Problem 28

fil1 redadd fil1scaadd mul2 ceidiv4 ran,1 2000

Problem 30

red add kee off eq by(rowredadd pow5 bas,10)ran,2 1000000

Problem 116

A= -1 redadd rep(scaadd) for(ran|eq0 tab sub by(mul2)-1ran)
B= -1 redadd rep(scaadd) for(ran|eq0 tab sub by(mul3)-1ran)
C= -1 redadd rep(scaadd) for(ran|eq0 tab sub by(mul4)-1ran)
las ++for(A|B|C) 52

External resources

• Uiua official website