Uiua: Difference between revisions

Jump to navigation Jump to search

Uiua (view source)

Revision as of 17:52, 5 July 2024

2,710 bytes removed ,  5 July
General improvements
m (Remove unnecessary comment)
(General improvements)
Line 8: Line 8:
| released                = 2023
| released                = 2023
| developer                = Kai Schmidt
| developer                = Kai Schmidt
| latest release version  = 0.8.0 / 2024
| latest release version  = 0.11.1 / 2024
| implementation languages = [[Wikipedia:Rust (programming language)|Rust]]
| implementation languages = [[Wikipedia:Rust (programming language)|Rust]]
| source                  = [https://github.com/uiua-lang/uiua GitHub]
| source                  = [https://github.com/uiua-lang/uiua GitHub]
Line 28: Line 28:


== Primitives ==  
== Primitives ==  
=== Function with unique glyph ===
=== Functions with unique glyphs ===
In the web version of Uiua, we can type in the name of the function or a part of it and when run, the interpreter will format the name to Unicode Symbol, so that we don't need the use of non-ASCII keyboards.
In Uiua, we can type in the name of the function or a part of it and when formatted, it will format the name to its corresponding Unicode Symbol, so that we don't have to use non-ASCII keyboards (or Alt-codes).


The tables below are based on Uiua version 0.12.0, with since-removed primitives taken out.
The tables below are based on Uiua version 0.12.0, with since-removed primitives taken out.
Line 36: Line 36:
Work with the stack
Work with the stack
{| class="wikitable"
{| class="wikitable"
|+ Table of Stack function in Uiua
|+ Table of Stack functions in Uiua
|-
|-
! Glyph !! Name !! Type !! Definition
! Glyph !! Name !! Type !! Definition
Line 46: Line 46:
| <code>:</code> || Flip || Dyadic 2-output function || Swap the top two values on the stack  
| <code>:</code> || Flip || Dyadic 2-output function || Swap the top two values on the stack  
|-
|-
| <code>◌(;)</code> || Pop ||Monadic 0-output function || Discard the top stack value
| <code>◌</code> || Pop || Monadic 0-output function || Discard the top stack value
|-
| <code>⟜</code> || On || Monadic modifier || Call a function but keep its top argument on top of the stack
|-
| <code>⤙</code> || But || Monadic modifier || Call a function but keep its last argument on top of the stack
|-
| <code>⤚</code> || With || Monadic modifier || Call a function but keep its top argument below the outputs on the stack
|-
| <code>⊸</code> || By || Monadic modifier || Duplicate a function's last argument before calling it
|-
| <code>¨</code> || Backward || Monadic modifier || Call a function with its arguments reversed
|-
|-
| <code>?</code> || Stack || Noadic 0-output function || Debug print all stack values without popping them
| <code>?</code> || Stack || Noadic 0-output function || Debug print all stack values without popping them
Line 71: Line 81:
Operate on every element in an array
Operate on every element in an array
{| class="wikitable"
{| class="wikitable"
|+ Table of Monadic Pervasive in Uiua
|+ Table of Monadic Pervasive functions in Uiua
! Glyph !! Name !! Definition
! Glyph !! Name !! Definition
|-
|-
Line 84: Line 94:
| <code>√</code> || [[Square Root|Sqrt]] || Take the square root of a number
| <code>√</code> || [[Square Root|Sqrt]] || Take the square root of a number
|-
|-
| <code>○</code> || Sine || Get the sine of a number
| <code>∿</code> || Sine || Get the sine of a number
|-
|-
| <code>⌊</code> || [[Floor]] || Round to the nearest integer towards <code>¯∞</code>
| <code>⌊</code> || [[Floor]] || Round to the nearest integer towards <code>¯∞</code>
Line 93: Line 103:
|}
|}
==== Dyadic Pervasive ====
==== Dyadic Pervasive ====
Operate on every pair of elements in two arrays (Note that True is 1 and False is 0)
Operate on every pair of elements in two arrays
{| class="wikitable"
{| class="wikitable"
|+ Table of Monadic Pervasive in Uiua
|+ Table of Dyadic Pervasive functions in Uiua
! Glyph !! Name !! Definition !! Formats from:
! Glyph !! Name !! Definition !! Formats from:
|-
|-
Line 135: Line 145:
Operate on a single array
Operate on a single array
{| class="wikitable"
{| class="wikitable"
|+ Table of Monadic Array in Uiua
|+ Table of Monadic Array functions in Uiua
! Glyph !! Name !! Definition  
! Glyph !! Name !! Definition  
|-
|-
Line 169: Line 179:
|-
|-
| <code>□</code> || [[Box]] || Turn an array into a box
| <code>□</code> || [[Box]] || Turn an array into a box
This is Uiua's primary way to create nested or mixed-type arrays.
Normally, arrays can only be created if their rows have the same shape and type.
⬚ fill can help you with the shape part, but it is not always wanted, and it can't help with the type part.
You can go to ([https://www.uiua.org/docs/box To See more information about the <code>□ box</code> function])
|-
|-
|}
|}
Line 179: Line 185:
Operate on two arrays
Operate on two arrays
{| class="wikitable"
{| class="wikitable"
|+ Table of Monadic Array in Uiua
|+ Table of Dyadic Array functions in Uiua
! Glyph !! Name !! Definition  
! Glyph !! Name !! Definition  
|-
|-
Line 213: Line 219:
|-
|-
| <code>⊗</code> || [[Index Of|Indexof]] || Find the first index of each row of one array in another
| <code>⊗</code> || [[Index Of|Indexof]] || Find the first index of each row of one array in another
|-
| <code>⟔</code> || Coordinate || Find the first deep index of an array in another
|}
|}
==== Iterating Modifiers ====
==== Iterating Modifiers ====
Line 221: Line 229:
|-
|-
| <code>∵</code> || [[Each]] || Monadic modifier || Apply a function to each element of an array or arrays.
| <code>∵</code> || [[Each]] || Monadic modifier || Apply a function to each element of an array or arrays.
This is the element-wise version of <code>≡ rows.</code>
|-
|-
| <code>≡</code> || Rows || Monadic modifier || Apply a function to each row of an array or arrays.
| <code>≡</code> || Rows || Monadic modifier || Apply a function to each row of an array or arrays.
This is the row-wise version of <code>∵ each.</code>
|-
|-
| <code>⊞</code> || Table || Monadic 2-argument modifier || Apply a function to each combination of rows of two arrays.
| <code>⊞</code> || [[Outer Product|Table]] || Monadic 2-argument modifier || Apply a function to each combination of rows of two arrays.
This is often what you want instead of <code>∵ each.</code>
|-
|-
| <code>⍚</code> || Inventory || Monadic modifier || Apply a function to each unboxed row of an array and re-box the results.
| <code>⍚</code> || Inventory || Monadic modifier || Apply a function to each unboxed row of an array and re-box the results.
For box arrays, this is equivalent to <code>≡⍜°□</code>.
|-
|-
| <code>⍥</code> || [[Repeat]] || Monadic modifier || Repeat a function a number of times
| <code>⍥</code> || [[Repeat]] || Monadic modifier || Repeat a function a number of times
Line 250: Line 254:
|-
|-
| <code>⊕</code> || [[Group (BQN)|Group]] || Group elements of an array into buckets by index
| <code>⊕</code> || [[Group (BQN)|Group]] || Group elements of an array into buckets by index
Takes a function and two arrays.
The arrays must be the same <code>⧻ length.</code>
The first array must be rank <code>1</code> and contain integers.
Rows in the second array will be grouped into buckets by the indices in the first array.
Keys <code><0</code> will be omitted.
The function then processes each group in order. The result depends on what the function is.
If the function takes 0 or 1 arguments, then <code>⊕ group</code> behaves like <code>≡ rows.</code> This is called iterating <code>⊕ group.</code>
Expects as many arguments as its function takes.
The function must take at least 1 more argument than it returns outputs.
Arguments that are lower on the stack will be used as accumulators.
Arguments that are higher on the stack will be iterated over.
The function will be repeatedly called with the rows of the iterated arrays followed by the accumulators.
The returned values will be used as the new accumulators on each iteration.
|-
|-
| <code>⊜</code> || [[Partition]] || Group sequential sections of an array
| <code>⊜</code> || [[Partition]] || Group sequential sections of an array
The most common use of <code>⊜ partition</code> is to split an array by a delimiter.
|-
 
| <code>◹</code> || Triangle || Apply a function to each shrinking row of an array
Takes a function and two arrays.
The arrays must be the same <code>⧻ length.</code>
The first array must be rank <code>1</code> and contain integers.
Consecutive rows in the second array that line up with groups of the same key in the first array will be grouped.
Keys <code>≤0</code> will be omitted.
The function then processes each group in order. The result depends on what the function is.
If the function takes 0 or 1 arguments, then <code>⊜ partition</code> behaves like <code>≡ rows</code>. This is called iterating <code>⊜ partition.</code>
|}
|}


Line 279: Line 263:
Work with the inverses of functions
Work with the inverses of functions
{| class="wikitable"
{| class="wikitable"
|+ Table of Iterating Modifiers in Uiua
|+ Table of Inversion Modifiers in Uiua
! Glyph !! Name !! Type !! Definition
! Glyph !! Name !! Type !! Definition
|-
|-
| <code>°</code> || [[Un]] || Monadic modifier || Invert the behavior of a function
| <code>°</code> || [[Un]] || Monadic modifier || Invert the behavior of a function
Most functions are not invertible.
|-
|-
| <code>⍜</code> || [[Under]] || Dyadic modifier || Apply a function under another
| <code>⍜</code> || [[Under]] || Dyadic modifier || Apply a function under another
This is a more powerful version of <code>° un.</code>
Conceptually, <code>⍜ under</code> transforms a value, modifies it, then reverses the transformation.
<code>⍜ under</code> takes 2 functions <code>f</code> and <code>g</code> and another argument <code>x</code>.
It applies <code>f</code> to <code>x</code>, then applies <code>g</code> to the result.
It then applies the inverse of <code>f</code> to the result of <code>g</code>.
Any function that can be <code>° un</code>ed can be used with <code>⍜ under</code>.
Some functions that can't be <code>° un</code>ed can still be used with <code>⍜ under</code>.
You can go to ([https://www.uiua.org/docs/under To See more information about the <code>⍜ under</code> function])
|}
|}
==== 🌎 Planet 🪐 ====
==== 🌎 Planet 🪐 ====
Advanced stack manipulation
Advanced stack manipulation
{| class="wikitable"
{| class="wikitable"
|+ Table of Iterating Modifiers in Uiua
|+ Table of Planet modifiers in Uiua
! Glyph !! Name !! Type !! Definition
! Glyph !! Name !! Type !! Definition
|-
|-
Line 310: Line 283:
|-
|-
| <code>∩</code> || Both || Monadic 2-argument modifier || Call a function on two sets of values
| <code>∩</code> || Both || Monadic 2-argument modifier || Call a function on two sets of values
For monadic functions, <code>∩ both</code> calls its function on each of the top 2 values on the stack.
|-
|-
| <code>⊃</code> || [[Fork]] || Dyadic modifier || Call two functions on the same values
| <code>⊃</code> || [[Fork]] || Dyadic modifier || Call two functions on the same values
<code>⊃ fork</code> is one of the most important functions for working with the stack.
|-
|-
| <code>⊓</code> || Bracket || Dyadic modifier || Call two functions on two distinct sets of values
| <code>⊓</code> || Bracket || Dyadic modifier || Call two functions on two distinct sets of values
|}
|}


==== Other Modifier ====
==== Other Modifiers ====
{| class="wikitable"
{| class="wikitable"
|+ Table of Other Modifiers in Uiua
|+ Table of Other Modifiers in Uiua
Line 326: Line 297:
|-
|-
| <code>⬚</code> || Fill || Dyadic Modifier || Set the fill value for a function
| <code>⬚</code> || Fill || Dyadic Modifier || Set the fill value for a function
By default, some operations require that arrays' <code>△ shape</code> are in some way compatible.
|-
<code>⬚ fill</code> allows you to specify a value that will be used to extend the shape of one or both of the operands to make an operation succeed.
| <code>⨬</code> || Switch || Dyadic modifier || Call the function at the given index
The function is modified to take a fill value which will be used to fill in shapes.
|}
|}


Line 334: Line 304:
* [https://concatenative.org/wiki/view/Uiua Uiua] on the concatenative language wiki
* [https://concatenative.org/wiki/view/Uiua Uiua] on the concatenative language wiki
* [https://www.arraycast.com/episodes/episode63-uiua Uiua, a Stack-based Array language] on the [[Array Cast]]
* [https://www.arraycast.com/episodes/episode63-uiua Uiua, a Stack-based Array language] on the [[Array Cast]]
* [https://www.uiua.org/docs Doc] for the Documentation
* [https://www.uiua.org/docs Documentation]
* [https://www.uiua.org Interpreter] for the interpreter
* [https://www.uiua.org/pad Interpreter]
* [https://www.uiua.org/docs/basic Basic] to start learning Uiua
* [https://www.uiua.org/tutorial/basic Basic tutorial]


{{APL dialects}}[[Category:Flat array languages]][[Category:Stack-based languages]][[Category:Leading axis languages]][[Category:Languages with tacit programming]][[Category:IR compilers]]
{{APL dialects}}[[Category:Flat array languages]][[Category:Stack-based languages]][[Category:Leading axis languages]][[Category:Languages with tacit programming]][[Category:IR compilers]]
Joaozin003
2

edits

Retrieved from ‘https://aplwiki.com/wiki/Special:MobileDiff/11497’

Navigation menu