Golfing

It is often the case that many tasks have multiple solutions. Of course, some solutions will be shorter in length than others. Sometimes, it is the task of the user to form the shortest possible code that brings about a particular end. In this case, there are some helpful tips that one can use to considerably shorten up their programs.

Useful functions

Whether or not you read the command index, here are some especially useful commands:

General

  • Q - square a number, double a string, or create a 2D array whose N members are the original array, with N being the length of the array.
  • h - increment a number, i.e. add 1.
  • w - decrement a number, i.e. subtract 1.
  • !6 - evaluate an infix expression (using mathjs).
  • z - creates a range from 1 to a number, inclusive.
  • O - digit product or array product.
  • u - digit sum or array sum.
  • a - output.
  • Μ - array/string character/digit map (capital Mu).

Array/Set Theory

  • Union: +ab; all members in a or b.
  • Minus: -ab; all members of a not in b.
  • Intersection: /ab; all members both in a and b.
  • Cartesion Product: *ab; all pairs of elements [a0,b0], for a0,b0 in a,b.
  • Big union: Zba; the union of all members k in a = k ∪ k ∪ ··· ∪ k = ⋃a.
  • Big intersection: ZBa; the intersection of all members k in a = k ∩ k ∩ ··· ∩ k = ⋂a.

Constants

Constant generation can be done in one of three, general ways. The most common (and efficient) is using a variable that represents this constant. Such variables exist for the digits 0-9 (represnted by the digits), 10 (t), and 42 (mQ). If your constant is not one of those, you may intuitively generate the constant, by using operators. For two bytes, you can generate 11 as ht ("increment ten by 1") and for two bytes you can generate 16 as Q4 ("four squared").

Any constant (integer or real) can be obtained using the P ("number") command, like so: P"23", P"-3", P"3.02",P".5". However, the cost of using this is3 + char. length of number, inefficent relative the previous method. You can generate any number of the formN + p/qas+N/pq. To obtain64 + 3/5, for example, one would create 64 asQQ4("four squared squared"), and obtain +QQ4/35.

Consider a number of the form DN…D0, where Dk is a digit of a number. Then, this number can be "lineearly generated" by taking note of the fact that DN…D0 is the sum of all Dk×10k for k in 0..N. Thus, to generate the number 429, you may use ++*Qt4*t29. However, this method is almost always the longest of any of the methods mentioned.

Finally, you can use @<char> to generate a number whose value is the character's char code. For example, @A is 65, @~ is 126, and @ is 32.

The table below contains representations of constants. If a number is not listed, it is assumed that @CHAR is the cheapest representation of the number, as is often the case. However, if said method is the same length as another method, that other method will be preferred. Also, it is often the case that the best representation of a variable that is 1 unit away from one on the table, is usually hv (v+1) or wv (v-w), unless otherwise listed.

Constant Best Representation Explanation
0-9 0-9 Digit
10 t Constant
16 ά Constant
64 Q8 8^2
100 Qt 10^2
128 mZ7 2^7
256 Qά 16^2
512 mZ9 2^9

(This table is incomplete/suboptimal. You may make a request for a constant by pinging me in the Nineteenth byte (@CᴏɴᴏʀO'Bʀɪᴇɴ), opening up an issue here, or by dropping an email to +"%or'Con' O%rien4god@%.com'B'gmail". It's Jolf code, if you didn't notice.)