List

Generated from the engine's own definition: compute-engine's symbol, which we neither extend nor document by hand.

An ordered collection of elements (a list).

✓ checked against that system · ! checked, with disagreements (hover a chip)FungrimList↗Wolfram LanguageList!↗JuliaAny[$*,]Rustlist(vec![$*,])

List(any*) -> listas compute-engine declares it

Typed signatures

Type	Package	Applies
(any*) -> list	compute-engine	always

Domain: Compute engine

Examples

Scope #

A scalar multiplies every element

live ↗

In$2\bigl\lbrack1, 2, 3\bigr\rbrack$Out$\bigl\lbrack2, 4, 6\bigr\rbrack$

A scalar threads through nested lists

live ↗

In$a\bigl\lbrack\bigl\lbrack1, 2\bigr\rbrack, \bigl\lbrack3, 4\bigr\rbrack\bigr\rbrack$Out$\bigl\lbrack\bigl\lbrack a, 2a\bigr\rbrack, \bigl\lbrack3a, 4a\bigr\rbrack\bigr\rbrack$

Outer builds every pairing of the two lists' elements

live ↗

In$\mathrm{Outer}(f, \bigl\lbrack1, 2\bigr\rbrack, \bigl\lbrack a, b, c\bigr\rbrack)$Out$\bigl\lbrack\bigl\lbrack f(1, a), f(1, b), f(1, c)\bigr\rbrack, \bigl\lbrack f(2, a), f(2, b), f(2, c)\bigr\rbrack\bigr\rbrack$

Prepend with a list adds it as one element, not spliced

live ↗

In$\mathrm{Prepend}(\bigl\lbrack1, 2, 3\bigr\rbrack, \bigl\lbrack a, b, c\bigr\rbrack)$Out$\bigl\lbrack\bigl\lbrack a, b, c\bigr\rbrack, 1, 2, 3\bigr\rbrack$

Flatten removes the nesting and joins the rows

live ↗

In$\mathrm{Flatten}(\bigl\lbrack\bigl\lbrack1, 2\bigr\rbrack, \bigl\lbrack a, b, c\bigr\rbrack\bigr\rbrack)$Out$\bigl\lbrack1, 2, a, b, c\bigr\rbrack$

Map applies a symbolic head to each element

live ↗

In$\mathrm{Map}(f, \bigl\lbrack1, 2, 3, 4\bigr\rbrack)$Out$\bigl\lbrack f(1), f(2), f(3), f(4)\bigr\rbrack$

live ↗

In$\bigl\lbrack a, b, c\bigr\rbrack+\bigl\lbrack1, 2, 3\bigr\rbrack$Out$\bigl\lbrack a+1, b+2, c+3\bigr\rbrack$

live ↗

In$\mathrm{Subsets}(\bigl\lbrack1, 2, 3\bigr\rbrack)$Out$\bigl\lbrack\bigl\lbrack\bigr\rbrack, \bigl\lbrack1\bigr\rbrack, \bigl\lbrack2\bigr\rbrack, \bigl\lbrack3\bigr\rbrack, \bigl\lbrack1, 2\bigr\rbrack, \bigl\lbrack1, 3\bigr\rbrack, \bigl\lbrack2, 3\bigr\rbrack, \bigl\lbrack1, 2, 3\bigr\rbrack\bigr\rbrack$

live ↗

In$\mathrm{Solve}(\begin{cases}x-y=1\\x+y=0\end{cases}, x, y)$Out$\bigl\lbrack(\frac{1}{2},-\frac{1}{2})\bigr\rbrack$

live ↗

In$\mathrm{Map}(f, \bigl\lbrack\bigl\lbrack1, 2\bigr\rbrack, \bigl\lbrack3, 4\bigr\rbrack, \bigl\lbrack5, 6\bigr\rbrack\bigr\rbrack, \bigl\lbrack2\bigr\rbrack)$Out$\bigl\lbrack f(\bigl\lbrack1, 2\bigr\rbrack, 2)\bigr\rbrack$

live ↗

In$\mathrm{Solve}(\begin{cases}x+y+z=0\\x+y=1\\y+z=2\end{cases}, x, y, z)$Out$\bigl\lbrack(-2,3,-1)\bigr\rbrack$

live ↗

In$e^{\bigl\lbrack\bigl\lbrack1, 2, 3\bigr\rbrack, \bigl\lbrack4, 5, 6\bigr\rbrack\bigr\rbrack}$Out$\bigl\lbrack\bigl\lbrack e, e^2, e^3\bigr\rbrack, \bigl\lbrack e^4, e^5, e^6\bigr\rbrack\bigr\rbrack$

live ↗

In$\mathrm{Insert}(\bigl\lbrack1, 2, 3\bigr\rbrack, 2, \bigl\lbrack a, b, c\bigr\rbrack)$Out$\bigl\lbrack1, \bigl\lbrack a, b, c\bigr\rbrack, 2, 3\bigr\rbrack$

About

Examples	13
Checked against	Wolfram Language 12 agree1 differSageMath 4 agreeSymPy 4 agreeJulia 2 agreeRust 2 errorCombinatorica 1 agreempmath 1 agree
Crosswalk	FungrimWolfram LanguageJuliaRust

Implementation

mappedsympypackages/oracle/src/mappings.ts

mappedmpmathpackages/oracle/src/mappings.ts

mappedsagepackages/oracle/src/mappings.ts

mappedoscarpackages/oracle/src/mappings.ts

mappedjuliapackages/oracle/src/mappings.ts

mappedmathlib4packages/oracle/src/mappings.ts

mappedrustpackages/oracle/src/mappings.ts