How about this?

Calculate Scrabble Score of Word in 51 bytes (49 using Ans for input)
Inputs: Str1
Output: Score in Ans
Code:
For -8 bytes

Boolean

Changes A between 1 And 0.

Code:

Did you literally just post not(A→A?

Yes i did, im not the best with optimization and to be honest, i only went over this in my head after the optimization. if it makes you happy, here's the parenthesis version.

Code:

I guess I should leave this here.

Detect if code is running on a monochrome or color calc
Inputs:
none
Output:
none, if condition is true, then its color

Code:

This relies on a parser bug which was fixed between 2.55MP and 4.0. (more specifically between 84C-012 and 84C-020)
This is angle mode-agnostic because [3.14159] and [180] are both non-zero.

Here are some fun routines

Detect if OS version is greater than or equal to 5.1.0.0110
Inputs:
none
Output:
none, if condition is true, then its 5.1.0.0110+

Code:


Detect if OS version is equal to 5.2.0.0035 and if it is greater than or equal to 5.2.1.0042
Inputs:
none
Output:
Str1 will contain either <5.2.0, 5.2.0.0035 or 5.2.1.0042+

Code:

I've combined these 2 version checkers together because the 5.2.1 checker relies on tokens that were added in 5.2.0, so to avoid potentially crashing, you should check for 5.2.0 before checking for 5.2.1.

Getting the type of Ans

Each of these routines can distinguish between two or more possible types contained in Ans. The type is printed, leaving Ans unchanged; this can be changed to a non-modifying variable write using, say, For( or IS>(. If an unsupported type is passed, expect errors.

This post was originally initiated by my discovery of List vs. String using attached formulas. The rest of the routines are assembled from the community and my own attempts to fill out the table of distinguishable types over the past 24 hours. Notably, since toString( fails on strings (go figure), generic strings cannot be distinguished from the other types.

Number vs. List or String (by bfr)

Code:


Number vs. List vs. (Evaluatable) String

If Ans is a string, it must evaluate to a list. If Ans is a list with only one unique value, it cannot be distinguished from a string (and vice-versa).

Code:


Number vs. List vs. Matrix (CE or newer)

This routine requires toString(, which is only available on the CE or newer.

Code:


List vs. Matrix (Destroys Ans)

Code:


List vs. (Non-square) Matrix

If Ans is a square matrix, it cannot be distinguished from a list.

Code:


List vs. Matrix (small-ish dimension)

The number of elements in Ans must be less than 500 (if a list) or less than 200 (if a matrix).

Code:


Ways to fill in the missing comparisons (e.g. String vs. Matrix) are more than welcome.

Check if a list is complex

This routine can determine if a list in Ans is complex, even if it none of its values have nonzero imaginary components. This can occur in any list where a complex value is stored and subsequently removed. Since lists are homogenous, a single complex value will upcast the entire list; the list will remain complex until it is cleared.

The underlying behavior (sorting a complex list) was brought to my attention by clevor, though its almost certain that others have observed and even relied on it.

Code:

Sorting a complex list is bizarre. Even Zeroko thought it shouldn't be possible.

These were very helpful in optimizing some of my old programs for better speed and less space! Thanks to all who have posted these ideas.

Code:

I came up with this a long time ago, it finds the right character in a string from x and y coords. I use strings to store maps by stacking the levels of the string. Such as in basic this is how I would stack them:

Code:

However once we stack them, picking them apart so you can use it as a map is... weird, to say the least...

Code:

For example this algorithm will display "H" to the screen from Str1 which was set above.

The use for this can be to print single characters from the map and even use the map itself as a wall matrix. So I could display the full map using Output and then save precious processing power by not re-rendering the entire map.

Reverse any real integer (using math)
Inputs: X
Output: N

Code:


by Michael2_3B & kg583

This is faster for the same number of bytes (and X is not destroyed)

Inputs: X
Output: Ans

Code:

And as usual, if you're on a color calc, you can replace the 10s with BLUEs to make it faster (the difference is negligible)

Code: