Variable declaration reset: Difference between revisions
m
syntax highlighting fixup automation
(Add Seed7) |
Thundergnat (talk | contribs) m (syntax highlighting fixup automation) |
||
Line 12:
=={{header|ALGOL 68}}==
In Algol 68, things that aren't explicitely initialised are notionally initialised to SKIP - an indeterminate value, so there should be no output from the program. Each iteration of the loop will get a new curr and prev, with prev initialised to SKIP. The following is equivalent to the Phix program...
<
[]INT s = ( 1, 2, 2, 3, 4, 4, 5 );
FOR i FROM LWB s TO UPB s DO
Line 21:
prev := curr
OD
END</
...however, one of the non-standard features of Algol 68G is that uninitialised variables cause a runtime error instead of silently being set to SKIP.
{{out}} with [[ALGOL_68_Genie|Algol 68G]]:
Line 31:
No output.
=={{header|AWK}}==
<syntaxhighlight lang="awk">
# syntax: GAWK -f VARIABLE_DECLARATION_RESET.AWK
BEGIN {
Line 44:
exit(0)
}
</syntaxhighlight>
{{out}}
<pre>
Line 55:
The following compiles using either C89/90 (-std=c90 -ansi -pedantic) or C99 syntax using gcc 9.4.0.
<
int main() {
Line 81:
return 0;
}</
<small>(Note: Obviously the <code>for (int i=0, prev</code> needs the outer i and the inner prev removed, and the same "int" added to the second loop, for it to compile cleanly though it only does so under C99 (or later) as for loop initial declarations are not allowed in C89/90.)</small>
{{out}}
Line 90:
=={{header|C++}}==
<
#include <iostream>
Line 116:
}
</syntaxhighlight>
{{out}}
<pre>
Line 125:
=={{header|F_Sharp|F#}}==
Functional programming doesn't really do variables!!! There is no particular judgement of right or wrong here, just a plain-speaking statement that using variables is awful.
<
// Variable declaration reset. Nigel Galloway: June 21st 2022
let s=[1;2;2;3;4;4;5]
Line 138:
if previousValue = currentValue then printfn "%d" i
previousValue <- currentValue
</syntaxhighlight>
{{out}}
<pre>
Line 155:
{{works with|Factor|0.99 2022-04-03}}
<
[let
Line 165:
curr prev!
] each
]</
{{out}}
[none]
Line 173:
{{works with|Factor|0.99 2022-04-03}}
<
[let
Line 183:
curr prev!
] each
]</
{{out}}
<pre>
Line 191:
Now compare to how you would normally solve this in Factor, where issues of variables and scope are irrelevant:
{{works with|Factor|0.99 2022-04-03}}
<
{ 1 2 2 3 4 4 5 } 2 <clumps> [ all-eq? ] arg-where 1 v+n .</
=={{header|FreeBASIC}}==
<
For i As Integer = 1 To Ubound(s)
Dim As Integer curr = s(i), prev
Line 202:
prev = curr
Next i
Sleep</
{{out}}
<pre>
Line 215:
=={{header|Go}}==
Note firstly that unassigned variables are impossible in Go. If a variable is created (using the 'var' keyword) without giving it an explicit value, then it is assigned the default value for its type which in the case of numbers is zero. Fortunately, this doesn't clash with values in the slice in the following program.
<
import "fmt"
Line 243:
prev = curr
}
}</
{{out}}
Line 257:
First off, the idiomatic J approach to finding indices of numbers which match their predecessors would be:
<
2 5</
In other words, compare adjacent numbers (which results in a list of results one element shorter than the argument), find the indices of the matches (which would be the indices of the pairs which match) and add one (to get the indices in the original list of the second value of each of the pairs).
Line 268:
Anyways, here's a rough approximation of what the task is asking for:
<
i=. 0
r=. ,EMPTY
Line 282:
end.
r
}}</
This gives us:
<
2 5</
But, since we were unable to declare 'prev' before it was assigned, we have no way of moving that declaration of 'prev' outside of the loop. We could add a declaration of 'prev' outside of the loop,
<
i=. 0
r=. ,EMPTY
Line 306:
end.
r
}}</
But it would not alter the generated result.
Line 316:
=={{header|Java}}==
Note firstly that variables declared in methods must be assigned a value before they can be used in Java and so here we give '(g)prev' an initial value of 0 which won't clash with the values in the array.
<
public static void main(String[] args) {
int[] s = {1, 2, 2, 3, 4, 4, 5};
Line 340:
}
}
}</
{{out}}
Line 349:
=={{header|JavaScript}}==
<
<html lang="en" >
<head>
Line 369:
</script>
</body>
</html></
No output<br>
Any of 1) manually moving the declaration of prev to before the loop, or 2) using <code>for (let i=0, prev; i<7; i+=1)</code>, and in fact initialising prev there, to any value, works exactly the same, or 3) changing the third "let" to "var" (causes legacy hoisting and) gives:
Line 383:
As it happens, if the first argument of range/2 was changed to 0, then in this particular case the correct results would still be correct because at the first iteration, the test would be $array[0] == $array[-1], the point being that $array[-1] evaluates to the last element of the array. That is, the "bug" in the program would not be revealed by the test case.
<
| . as $array
| range(1;length)
| select( $array[.] == $array[.-1])
</syntaxhighlight>
=={{header|Julia}}==
In Julia, variables are declared by being defined. Because variables also must be defined before they are
referred to in compiled code, the code below yields an error that the variable `prev` is not defined:
<
s = [1, 2, 2, 3, 4, 4, 5]
Line 400:
prev = curr
end
</syntaxhighlight>
If the variable `prev` is defined before the `for` statement, the code then runs. We also may
declare the variable `prev` as global to refer explicitly to the variable declared outside of the for block:
<
s = [1, 2, 2, 3, 4, 4, 5]
prev = -1
Line 413:
prev = curr
end
</
<pre>
3
Line 420:
Parenthetical note: making a global variable to support a for loop has a bad code smell in Julia. A better
way to do such a comparison of adjacent values in an array is to alter the start of the loop variable:
<
s = [1, 2, 2, 3, 4, 4, 5]
Line 426:
s[i] == s[i - 1] && println(i)
end
</syntaxhighlight>
=={{header|Perl}}==
By default, variables can be created on-the-fly, as with <code>$prev</code> here. Testing against <code>$curr</code> is not an error, even when it's value is undefined. This is perhaps not "best practices", but it does work just fine.
<
for ($i = 0; $i < 7; $i++) {
$curr = $s[$i];
if ($i > 1 and $curr == $prev) { print "$i\n" }
$prev = $curr;
}</
{{out}}
<pre>2
Line 441:
But better to do it this way, requiring <code>my</code> declarations imposing lexical scope (an instance of <code>$curr</code> is instantiated on every pass through loop) and employing a <code>state</code> variable (persistent within loop).
<
use warnings;
use feature 'state';
Line 451:
if ($i > 1 and $curr == $prev) { print "$i\n" }
$prev = $curr;
}</
{{out}}
<pre>2
Line 457:
=={{header|Phix}}==
<!--<
<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>
<span style="color: #004080;">sequence</span> <span style="color: #000000;">s</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;">{</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #000000;">2</span><span style="color: #0000FF;">,</span><span style="color: #000000;">2</span><span style="color: #0000FF;">,</span><span style="color: #000000;">3</span><span style="color: #0000FF;">,</span><span style="color: #000000;">4</span><span style="color: #0000FF;">,</span><span style="color: #000000;">4</span><span style="color: #0000FF;">,</span><span style="color: #000000;">5</span><span style="color: #0000FF;">}</span>
Line 467:
<span style="color: #000000;">prev</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">curr</span>
<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>
<!--</
{{out}}
<pre>
Line 480:
Although PL/M has block scope, all variables are static, so PREV retains its value between iterations of the loop.<br>
Note the extra DO which is necessary to introduce a new scope as declarations are not allowed in a DO loop.
<
/* CP/M BDOS SYSTEM CALL */
Line 513:
END;
EOF</
{{out}}
<pre>
Line 524:
The following code is legal, but note that a Python code checker such as pyflakes will flag such code with an error.
<
s = [1, 2, 2, 3, 4, 4, 5]
Line 532:
print(i)
prev = curr
</
<pre>
2
Line 541:
By default, Raku variables need a prefix sigil indicating the storage / interface, and a scope declarator to indicate the variables' accessibility. The vast majority of the time, variables are declared with a "my" scope declarator that constrains them to the present block and any enclosed sub blocks. When a 'my' variable is declared inside a loop (block), a new independent instance of the variable is instantiated every time through.
<syntaxhighlight lang="raku"
loop (my $i = 0; $i < 7; $i += 1) {
my $curr = @s[$i];
Line 549:
}
$prev = $curr;
}</
{{out|Yields}}
<pre>Use of uninitialized value of type Any in numeric context
Line 564:
Lots of warnings but nothing else. If we suppress the warnings:
<syntaxhighlight lang="raku"
quietly loop (my $i = 0; $i < 7; $i += 1) {
my $curr = @s[$i];
Line 572:
}
$prev = $curr;
}</
No output.
Line 579:
We can however, declare the variable with an "our" scope, which effectively makes it a package global. Use of 'our' scoping is discouraged except in a few very specific situations. It "works" (for some value of works), but pollutes the namespace. The 'our' variable will trample any other instance of a variable with that name anywhere in the program in any other scope.
<syntaxhighlight lang="raku"
loop (my $i = 0; $i < 7; $i += 1) {
my $curr = @s[$i];
Line 587:
}
$prev = $curr;
}</
{{out|Yields}}
Line 595:
A better solution is to declare a state variable. A 'state' variable is essentially scoped similar to a 'my' variable (visible only inside the block), but is persistent across calls.
<syntaxhighlight lang="raku"
loop (my $i = 0; $i < 7; $i += 1) {
my $curr = @s[$i];
Line 603:
}
$prev = $curr;
}</
{{out|Yields}}
Line 612:
No scope declarators at all. Every variable is a global. Bad idea. Do not do this casually.
<syntaxhighlight lang="raku"
@s = 1, 2, 2, 3, 4, 4, 5;
loop ($i = 0; $i < 7; $i += 1) {
Line 620:
}
$prev = $curr;
}</
{{out|Yields}}
Line 629:
* Blocks start at index 1 in Red.
* <code>all</code> short-circuits, so <code>prev</code> will be defined by the time <code>curr = prev</code> is checked.
<
s: [1 2 2 3 4 4 5]
repeat i length? s [
Line 637:
]
prev: curr
]</
{{out}}
<pre>
Line 646:
=={{header|Seed7}}==
Variables must be declared in the locals section (or as globals) before execution begins, so this whole excercise is moot. There is only one way to write it and it's the way that works.
<
const proc: main is func
Line 662:
prev := curr;
end for;
end func;</
{{out}}
<pre>
Line 670:
=={{header|Visual Basic .NET}}==
<
Option Explicit On
Line 689:
End Sub
End Module</
{{out}}
<pre>
Line 698:
=={{header|Vlang}}==
Note firstly that unassigned variables are impossible in Vlang. If a variable is created it must have an explicit value, then it is assigned the default value for its type which in the case of numbers is zero. Fortunately, this doesn't clash with values in the slice in the following program.
<
s := [1, 2, 2, 3, 4, 4, 5]
Line 722:
prev = curr
}
}</
{{out}}
Line 732:
=={{header|Wren}}==
Note firstly that unassigned variables are impossible in Wren. If a variable is created without giving it an explicit value, then it is assigned the special value 'null' which is the only instance of the Null class and therefore distinct from all other values in the language.
<
// There is no output as 'prev' is created anew each time
Line 750:
if (i > 0 && curr == prev) System.print(i)
prev = curr
}</
{{out}}
| |||