Kolmafia - User contributions [en]

Control Structures

2010-06-16T08:36:26Z

210.119.98.20: /* foreach */ whoops, mistake

{{TOCright}}
==Conditional==
===if===
{{
CodeSample|
code=
<syntaxhighlight>
if ( boolean )
{
// any statements here
// are only going to be executed
// if the boolean returns true
}
</syntaxhighlight>}}
{{
CodeSample|
description=Single-statement conditionals may omit the curly braces.|
code=
<syntaxhighlight>
if ( boolean )
// curly braces aren't required if only one statement follows the conditional
</syntaxhighlight>}}
===else===
{{
CodeSample|
code=
<syntaxhighlight>
if ( boolean )
{
// statements if true
}
else
{
// the statements here
// are only going to be executed
// if the boolean returns false
}
</syntaxhighlight>}}

===else if===
{{
CodeSample|
code=
<syntaxhighlight>
if ( boolean 1 )
{
// statements if true
}
else if ( boolean 2 )
{
// the statements here
// are only going to be executed
// if boolean 1 returns false
// & boolean 2 returns true
}
</syntaxhighlight>}}

===switch===
{{
CodeSample|
code=
<syntaxhighlight>
switch ( variable )
{
case value:
// statements if variable == value
// more such statements
break;
//repeat above for as many values as desired
default:
// statements executed if
// none of the cases were true
}
</syntaxhighlight>}}

Note that each "case" can only test against a single value; that value can be a variable itself, but not a test expression.

{{
CodeSample|
description=If switch has no parameter, then each case is evaluated as a boolean expression, like a string of if-then statements.|
code=
<syntaxhighlight>
switch
{
case boolean expression:
// if the expression is true, this statement is executed
// more such statements
break;
//repeat above for as many conditionals as desired
default:
// statements executed if
// none of the cases were true
}
</syntaxhighlight>}}

==Loops==
===while===
{{
CodeSample|
code=
<syntaxhighlight>
while ( boolean )
{
// as with an if statement
// this area is only entered
// if the boolean tests true
// once all this is done
// it goes back to the begining
// and will keep executing
// as long as the boolean remains true
}
</syntaxhighlight>}}

===repeat until===
{{
CodeSample|
code=
<syntaxhighlight>
repeat
{
// this is the same
// as the while loop above
// with one exception:
// all of this code will
// execute at least once
// as the test doesn't occur
// until the very end
} until ( boolean )
</syntaxhighlight>}}

===for===
{{
CodeSample|
code=
<syntaxhighlight>
for x from a to b by c {
//do stuff
}
</syntaxhighlight>}}
Above is the general case. You don't need to specify whether it's going up or down - although doing so by using upto or downto does allow a runtime check to make sure you didn't screw up.

If you don't specify "c", it defaults to incrementing/decrementing by 1. The first iteration is at a and the last is at b (that is to say, it goes from a to b, inclusive).

===foreach===
{{
CodeSample|
code=
<syntaxhighlight>
foreach key in aggregate {
//do stuff
}
</syntaxhighlight>}}
Assigns each key in the supplied map or slice to "key" and iterates through the map.

{{
CodeSample|
description=For example:|
code=
<syntaxhighlight>
boolean [int][string] map;
map[15]["test"] = true;
foreach int_index in map {
print(int_index); //this will print '15' once, since there is only one valid value for this index
foreach string_index in map[int_index] //this iterates over the "slice" of the map where 1 is fixed as the index
{
print(string_index); //This will print "test" once, since there is only one valid value for this index
print(map[int_index][string_index]); //this will print "true"
}
}
</syntaxhighlight>|
moreinfo=
So the output is
<pre>
15
test
true
</pre>}}
{{
CodeSample|
description=Note that instead of nesting foreach statements, for a multidimensional map, two iterators can be used inline.|
code=
<syntaxhighlight>
foreach x,y in map {
//do stuff
}
</syntaxhighlight>}}
{{
CodeSample|
description=This is identical to:|
code=
<syntaxhighlight>
foreach x in map {
foreach y in map[x] {
//do stuff
}
}
</syntaxhighlight>}}

{{CodeSample|
description=You can also directly specify the value stored in the map by specifying one more variable than the number of keys in the map:|
code=
<syntaxhighlight>
//string [string, int, item] my_map;
foreach s, i, m, value in my_map {
print( s + ", " + i + ", " + m + " => " + value );
}
</syntaxhighlight>
}}

See the page for [[Data Structures]] for more information on aggregates.

==Continuation & Exiting==
Like many languages with looping structures, ASH supports the break and continue statements. All looping structures (for, while, repeat until, and foreach) support these statements.

===break===
Breaks out of the smallest enclosing loop. In a switch statement, breaks out of the switch statement. Execution resumes at the first statement after the end of the loop/switch statement.

===continue===
Continues on to the next iteration of the loop (skipping any statements in this iteration that occur after the continue statement). In a switch statement, continue is allowed iff the switch is inside a loop, and acts as any other continue.

===return===
Exits the function and returns the value following the return statement, if specified. Note that the value's datatype must match that of the function itself (void functions can only use return by itself).

[[Category:ASH Scripting]]

Control Structures

2010-06-16T08:35:30Z

210.119.98.20: Added "one-more-var-than-the-number-of-keys" information

{{TOCright}}
==Conditional==
===if===
{{
CodeSample|
code=
<syntaxhighlight>
if ( boolean )
{
// any statements here
// are only going to be executed
// if the boolean returns true
}
</syntaxhighlight>}}
{{
CodeSample|
description=Single-statement conditionals may omit the curly braces.|
code=
<syntaxhighlight>
if ( boolean )
// curly braces aren't required if only one statement follows the conditional
</syntaxhighlight>}}
===else===
{{
CodeSample|
code=
<syntaxhighlight>
if ( boolean )
{
// statements if true
}
else
{
// the statements here
// are only going to be executed
// if the boolean returns false
}
</syntaxhighlight>}}

===else if===
{{
CodeSample|
code=
<syntaxhighlight>
if ( boolean 1 )
{
// statements if true
}
else if ( boolean 2 )
{
// the statements here
// are only going to be executed
// if boolean 1 returns false
// & boolean 2 returns true
}
</syntaxhighlight>}}

===switch===
{{
CodeSample|
code=
<syntaxhighlight>
switch ( variable )
{
case value:
// statements if variable == value
// more such statements
break;
//repeat above for as many values as desired
default:
// statements executed if
// none of the cases were true
}
</syntaxhighlight>}}

Note that each "case" can only test against a single value; that value can be a variable itself, but not a test expression.

{{
CodeSample|
description=If switch has no parameter, then each case is evaluated as a boolean expression, like a string of if-then statements.|
code=
<syntaxhighlight>
switch
{
case boolean expression:
// if the expression is true, this statement is executed
// more such statements
break;
//repeat above for as many conditionals as desired
default:
// statements executed if
// none of the cases were true
}
</syntaxhighlight>}}

==Loops==
===while===
{{
CodeSample|
code=
<syntaxhighlight>
while ( boolean )
{
// as with an if statement
// this area is only entered
// if the boolean tests true
// once all this is done
// it goes back to the begining
// and will keep executing
// as long as the boolean remains true
}
</syntaxhighlight>}}

===repeat until===
{{
CodeSample|
code=
<syntaxhighlight>
repeat
{
// this is the same
// as the while loop above
// with one exception:
// all of this code will
// execute at least once
// as the test doesn't occur
// until the very end
} until ( boolean )
</syntaxhighlight>}}

===for===
{{
CodeSample|
code=
<syntaxhighlight>
for x from a to b by c {
//do stuff
}
</syntaxhighlight>}}
Above is the general case. You don't need to specify whether it's going up or down - although doing so by using upto or downto does allow a runtime check to make sure you didn't screw up.

If you don't specify "c", it defaults to incrementing/decrementing by 1. The first iteration is at a and the last is at b (that is to say, it goes from a to b, inclusive).

===foreach===
{{
CodeSample|
code=
<syntaxhighlight>
foreach key in aggregate {
//do stuff
}
</syntaxhighlight>}}
Assigns each key in the supplied map or slice to "key" and iterates through the map.

{{
CodeSample|
description=For example:|
code=
<syntaxhighlight>
boolean [int][string] map;
map[15]["test"] = true;
foreach int_index in map {
print(int_index); //this will print '15' once, since there is only one valid value for this index
foreach string_index in map[int_index] //this iterates over the "slice" of the map where 1 is fixed as the index
{
print(string_index); //This will print "test" once, since there is only one valid value for this index
print(map[int_index][string_index]); //this will print "true"
}
}
</syntaxhighlight>|
moreinfo=
So the output is
<pre>
15
test
true
</pre>}}
{{
CodeSample|
description=Note that instead of nesting foreach statements, for a multidimensional map, two iterators can be used inline.|
code=
<syntaxhighlight>
foreach x,y in map {
//do stuff
}
</syntaxhighlight>}}
{{
CodeSample|
description=This is identical to:|
code=
<syntaxhighlight>
foreach x in map {
foreach y in map[x] {
//do stuff
}
}
</syntaxhighlight>}}

{{CodeSample|
description=You can also directly specify the value stored in the map by specifying one more variable than the number of keys in the map:|
code=
<syntaxhighlight>
//string [string, int, item] my_map;
foreach s, i, m, value in my_map {
print( s + ", " + i + ", " + m + " => " + value );
}
</syntaxhighlight>

See the page for [[Data Structures]] for more information on aggregates.

==Continuation & Exiting==
Like many languages with looping structures, ASH supports the break and continue statements. All looping structures (for, while, repeat until, and foreach) support these statements.

===break===
Breaks out of the smallest enclosing loop. In a switch statement, breaks out of the switch statement. Execution resumes at the first statement after the end of the loop/switch statement.

===continue===
Continues on to the next iteration of the loop (skipping any statements in this iteration that occur after the continue statement). In a switch statement, continue is allowed iff the switch is inside a loop, and acts as any other continue.

===return===
Exits the function and returns the value following the return statement, if specified. Note that the value's datatype must match that of the function itself (void functions can only use return by itself).

[[Category:ASH Scripting]]

Data Structures

2010-06-16T01:40:25Z

210.119.98.20: Modified headers and properly located the Records section- PhilmASTErpLus

{{TOCright}}
== Maps ==
Most of this information was copied directly from ASH Maps Tutorial, by Veracity
(http://kolmafia.sourceforge.net/advanced.html#maps)

A map is indexed by one data type (the key) and associates that key with another (or the same) data type (the value). The key can be any ASH simple data type: boolean, int, float, string, item, location, class, stat, skill, effect, familiar, slot, or monster. The value can be any ASH data type at all: a simple type, a record, or can be an aggregate - another map. This effectively allows multi-dimensional maps and. In fact, that's how the syntax we provide for multi-dimensional aggregates actually operates: maps of maps of maps ...

You can declare a map any time you can declare a variable: as a top level (global) variable, as a function parameter, or as a local variable in any scope.

You can fetch data from a map any time you can provide a data value: in an expression, as a function parameter, on the right side of an assignment statement, from a "return" statement, as so on. You can pass around entire maps, individual elements, or intermediate maps: "slices".

=== Assignments ===

If you use a map on the left side of an assignment, you set the whole map at once to the new value. If you specify a map and a complete set of indices (of the correct types) on the left side of an assignment statement, you set a single element. If you specify a map and a prefix of indices (of the correct type), you directly set one of the intermediate maps, a "slice".

=== Declarations ===

The syntax for declaring the data type of a map:

<data type> [ <key type>, ... ]

=== References ===

The syntax for referencing an element (or slice) of a map:

<variablename>[ <key expression>, ... ]

All the key expressions will be evaluated at run time. If you specify all the keys the map expects, you fetch data of the type specified by the map. If you specify fewer keys than the map expects, you get an intermediate map, a "slice".

As an example:
{{
CodeSample|
code=
<syntaxhighlight>
boolean [string, string] props;
</syntaxhighlight>}}

might be used to hold "properties" associated with names.
{{
CodeSample|
code=
<syntaxhighlight>
props[ "dog", "mammal" ] = true;
props[ "dog", "pet" ] = true;
props[ "dog", "fun" ] = false;
props[ "turtle", "mammal" ] = false;
props[ "turtle", "pet" ] = true;
props[ "turtle", "fun" ] = false;
props[ "aardvark", "mammal" ] = true;
props[ "aardvark", "pet" ] = false;
props[ "aardvark", "fun" ] = true;
</syntaxhighlight>}}

references:

props[ "dog", "mammal"] => true
boolean [string] animal = props[ "turtle" ];
animal[ "fun" ] => false

=== Contains ===

You can test the presence of a key in a map using the "contains" operator:

<aggregate reference expression> contains <key expression>

Where <aggregate reference expression> must evaluate at run time to a map or slice, and must evaluate at run time to a key of the appropriate type. (Note that that is enforced at parse time; ASH can tell the datatype any expression will produce).

props contains "dog" => true
props contains "elephant" => false
props[ "aardvark" ] contains "fun" => true
animal contains "pet" => true
animal contains "favorite food" => false

=== Remove ===

You can remove a key-value association from a map using the "remove" unary operator:

remove <aggregate reference>

For clarification, an aggregate reference is "<map name>[ <index 1> ... <index n> ]" where <map name>[ <index 1> ... <index n-1> ] specifies the "slice" and <index n> specifies the "key". Which is just what you expect, if you fully specify the indices; for a single dimensional map, "map[10]" -> "map" is the slice and 10 is the key. The "remove" operator removes the "key" from the "slice". For example:

string [int] map1;
map1[5] = "foo";
print( count( map1 ) + " " + map1 contains 5 + " " + map1[5] );
print( "remove: " + remove map1[5] );
print( count( map1 ) + " " + map1 contains 5 + " " + map1[5] );
print( "remove: " + remove map1[5] );
int [string, string] map2;
map2["me","you"] = 17;
print( count( map2["me"] ) + " " + map2["me"] contains "you" + " " + map2["me","you"] );
print( "remove: " + remove map2["me", "you"] );
print( count( map2["me"] ) + " " + map2["me"] contains "you" + " " + map2["me","you"] );
print( "remove: " + remove map2["me", "you"] );
print( count( map2 ) + " " + map2["me"] );
print( "remove: " + remove map2["me"] );
print( count( map2 ) + " " + map2["me"] );

yields:

1 true foo
remove: foo
0 false
remove:
1 true 17
remove: 17
0 false 0
remove: 0
1 aggregate int [string]
remove: aggregate int [string]
0 aggregate int [string]

=== Deletion ===

clear (theMap) will remove all entries

=== Sort ===

From http://kolmafia.us/showthread.php?t=1738

The syntax is:
sort aggregate by keyExpr;
aggregate is a reference to the object to be sorted - arrays are probably the most useful things to sort, but any mapping type can be used (even multidimensional maps, but note that you can only sort along a single dimension at a time). The reference must not be enclosed in parentheses, as that would look like a call to a function named sort() - which is still perfectly valid, "sort" has not become a [[Reserved Words|reserved word]].

keyExpr is an arbitrary expression that defines how the items should be ordered. It is evaluated once for every entry in the aggregate, in a scope with two additional variables implicitly defined: 'index' and 'value', holding the details of that entry. The value of the keyExpr is used as the sort key; typically it would be an int or string, but can be any ASH type that can be compared via "<" and the other relational operators.

The most basic form of sorting would therefore be "sort ... by value", but many useful things can be done with the use of a more complex keyExpr - the only real restriction is that the expression should not modify the object you're sorting. For example, if you had an array of items, you could sort it "by autosell_price(value)". An array of weapon items could be sorted "by -get_power(value)" to put it in decreasing order of power. If the elements of your aggregate are records, you'd need to use something like "by value.fieldName", since the records themselves can't be meaningfully compared.

After the sort statement, the aggregate will have exactly the same sets of keys and values as before (even if the keys weren't consecutive), and the iteration order of the keys will be the same, but the values will likely be associated with different keys. The sort is stable - in other words, elements with sort keys that compare as equal will remain in the same order. This means that you can sort on multiple criteria by simply performing separate sorts for each of the criteria, in increasing order of significance.

A few more examples of things you can do:
* "by -value" sorts integers in decreasing order (there's no similar trick for string values).
* "by -index" reverses the existing order of an array (or map with integer keys).
* "by random(1000000)" shuffles into a random order.
* "by otherArray[index]" uses values from a parallel array as the sort keys (you'd then need to do "sort otherArray by value;" if you wanted the two arrays to remain in sync).

== Records ==

(copy-pasted from Veracity's post introducing the record [http://kolmafia.us/showthread.php?t=280])

Starting with SVN revision 1311 of KoLmafia, ASH now supports a new kind of structured data: the record. Here is a little example of how you declare a record and variables of the new type you've created by doing so.

record my_type {
int ifield;
string sfield;
record {
int first;
int second;
} rfield;
int [int, int] mfield;
};

my_type rvar;
my_type [int] mrvar;

What I've done with the above is declare a new data type which I've named "my_type". Having declared the new type, I can use it (almost) anywhere that I can use a built-in type name. I declared a variable, "rvar", of that type, and I defined a map, "mrvar", which maps keys of type integer to values of type my_type.

The new type, "my_type" is a "composite" type. It contains four fields. "ifield" is an integer. "sfield" is a string. "rfield" is another composite field: an anonymous record containing two integers named "first" and "second". Finally, "mfield" is a map from [int, int] to int.

As you can see, a record can combine data of all the types ASH supports: primitive, aggregate, and composite.

Having defined the new data type and several variables using it, here are some examples of how to access the fields.

rvar.ifield = 10;
rvar.sfield = "secret";
rvar.rfield.first = 1000;
rvar.sfield.second = 2000;
rvar.mfield[ 2, 3 ] = 12;

mrvar[ 1 ] = rvar;

foreach key in mrvar
foreach key1, key2 in mrvar[key].mfield
print( "val = " + mrvar[key].mfield[key1,key2] );

As you can see, if you have a variable that is a record, you access the fields of the record by following the variable name with ".<field name>". The resulting value will be of whatever type you declared in the definition of the record. If the value is a map, you can give a list of keys within [], just like any other map. If the value is another record, you can access the fields of the nested record by using another ".<field name>".

If you are familiar with Pascal "records" or C/C++ "structs", this should all be comfortably familiar.

Finally, if you create a map whose values is a record, the file_to_map and map_to_file built-in ASH functions will Do The Right Thing; they will efficiently and reliably save and restore your data.
{{RFI|I, for one, don't have a good handle on multi-dimensional maps. Any effort to clarify how they are defined & accessed would be greatly appreciated.|Don't worry about formatting for now; I'll get to that once the info is there, unless you're feeling super-ambitious.}}
{{Format}}

[[Category:ASH Scripting]]