Variable declaration reset: Difference between revisions
m
→{{header|Wren}}: Changed to Wren S/H
(Added C) |
m (→{{header|Wren}}: Changed to Wren S/H) |
||
| (47 intermediate revisions by 17 users not shown) | |||
Line 1:
{{
A decidely non-challenging task to highlight a potential difference between programming languages.
Line 11:
=={{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...
<syntaxhighlight lang="algol68">BEGIN
[]INT s = ( 1, 2, 2, 3, 4, 4, 5 );
FOR i
INT curr := s[ i ], prev;
IF IF i >
print( ( i, newline ) )
FI;
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]]:
<pre>
5 IF IF i >
1
a68g-2.8.3: runtime error: 1: attempt to use an uninitialised INT value (detected in
...whereas, with [[Rutgers_ALGOL_68|Rutgers Algol 68]]:<br>
No output.
=={{header|AWK}}==
<syntaxhighlight lang="awk">
# syntax: GAWK -f VARIABLE_DECLARATION_RESET.AWK
BEGIN {
n = split("1,2,2,3,4,4,5",arr,",")
for (i=1; i<=n; i++) {
curr = arr[i]
if (i > 1 && prev == curr) {
printf("%s\n",i)
}
prev = curr
}
exit(0)
}
</syntaxhighlight>
{{out}}
<pre>
3
6
</pre>
=={{header|C}}==
Line 37 ⟶ 55:
The following compiles using either C89/90 (-std=c90 -ansi -pedantic) or C99 syntax using gcc 9.4.0.
<
int main() {
Line 44 ⟶ 62:
/* There is no output as 'prev' is created anew each time
around the loop and set
for (i = 0; i < 7; ++i) {
// for (int i = 0, prev; i < 7; ++i) { // as below, see note
int curr = s[i];
int prev = 0;
// int prev; // produces same output as second loop
if (i > 0 && curr == prev) printf("%d\n", i);
prev = curr;
Line 53 ⟶ 73:
/* Now 'gprev' is used and reassigned
each time around the loop producing the desired output. */
for (i = 0; i < 7; ++i) {
int curr = s[i];
if (i > 0 && curr == gprev) printf("%d\n", i);
gprev = curr;
}
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}}
<pre>
2
5
</pre>
=={{header|C++}}==
<syntaxhighlight lang="cpp">#include <array>
#include <iostream>
int main()
{
constexpr std::array s {1,2,2,3,4,4,5};
if(!s.empty())
{
int previousValue = s[0];
for(size_t i = 1; i < s.size(); ++i)
{
// in C++, variables in block scope are reset at each iteration
const int currentValue = s[i];
if(i > 0 && previousValue == currentValue)
{
std::cout << i << "\n";
}
previousValue = currentValue;
}
}
}
</syntaxhighlight>
{{out}}
<pre>
Line 69 ⟶ 123:
</pre>
=={{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.
<syntaxhighlight lang="fsharp">
// Variable declaration reset. Nigel Galloway: June 21st 2022
let s=[1;2;2;3;4;4;5]
// First let me write this in real F#, which rather avoids the whole issue
printfn "Real F#"
s|>List.pairwise|>List.iteri(fun i (n,g)->if n=g then printfn "%d" (i+1))
// Now let me take the opportunity to write some awful F# by translating the C++
printfn "C++ like awful F#"
let mutable previousValue = -1
for i in 0..s.Length-1 do
let currentValue=s.[i]
if previousValue = currentValue then printfn "%d" i
previousValue <- currentValue
</syntaxhighlight>
{{out}}
<pre>
Real F#
2
5
C++ like awful F#
2
5
</pre>
=={{header|Factor}}==
Normally you would not use lexical scoping for something like this in Factor. But since it is possible, here we go. Note that:
Line 76 ⟶ 155:
{{works with|Factor|0.99 2022-04-03}}
<
[let
Line 82 ⟶ 161:
s length <iota> [| i |
i s nth -1 :> ( curr prev! )
i
[ i . ] when
curr prev!
] each
]</
{{out}}
[none]
Line 94 ⟶ 173:
{{works with|Factor|0.99 2022-04-03}}
<
[let
Line 100 ⟶ 179:
s length <iota> [| i |
i s nth :> curr
i
[ i . ] when
curr prev!
] each
]</
{{out}}
<pre>
Line 112 ⟶ 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}}==
<syntaxhighlight lang="freebasic">Dim As Integer s(1 To 7) => {1,2,2,3,4,4,5}
For i As Integer = 1 To Ubound(s)
Dim As Integer curr = s(i), prev
If i > 1 And curr = prev Then Print i
prev = curr
Next i
Sleep</syntaxhighlight>
{{out}}
<pre>
3
6
</pre>
<!-- PL: I assume these comments were incorrectly copied, as you can see there *is* output...
Like the first/unchanged JavaScript example, no output.<br>
Obviously you can achieve consistent results by manually hoisting the declaration of prev to before/outside the loop.
-->
=={{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 146 ⟶ 243:
prev = curr
}
}</
{{out}}
<pre>
2
5
</pre>
=={{header|J}}==
It may be difficult to say what is natural here, from the J perspective.
First off, the idiomatic J approach to finding indices of numbers which match their predecessors would be:
<syntaxhighlight lang="j"> 1+I.(}:=}.) 1 2 2 3 4 4 5
2 5</syntaxhighlight>
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).
Also, J's <tt>for</tt> loop is analogous to javascript's foreach loop (and also tracks and makes available the index of the current value, which is useful when working with parallel lists). So we have to use J's while loop to approximate the javascript implementation.
But, also, J makes no distinction between a variable declaration and a variable assignment. And this task seems to be asking about how we handle that distinction.
Anyways, here's a rough approximation of what the task is asking for:
<syntaxhighlight lang="j">same2=: {{
i=. 0
r=. ,EMPTY
while. i < #y do.
curr=. i{y
if. i>0 do.
if. curr=prev do.
r=. r,i
end.
end.
prev=. curr
i=. i+1
end.
r
}}</syntaxhighlight>
This gives us:
<syntaxhighlight lang="j"> same2 1,2,2,3,4,4,5
2 5</syntaxhighlight>
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,
<syntaxhighlight lang="j">same3=: {{
i=. 0
r=. ,EMPTY
prev=. 99
while. i < #y do.
curr=. i{y
if. i>0 do.
if. curr=prev do.
r=. r,i
end.
end.
prev=. curr
i=. i+1
end.
r
}}</syntaxhighlight>
But it would not alter the generated result.
Also... J's control words (like '<tt>while.</tt>') do not create new variable scopes. Given J's scoping rules, if J introduced new variable scopes for control words, that would prevent updates inside those blocks from being visible outside those blocks (unless we also added new scoping rules for that case -- a major engine upgrade -- or used non-local variables, such as J's "locales" which are probably out of scope for this task...). Where J's block scope isolation is desirable, we can use nested functions (J's verbs, adverbs or conjunctions).
But J's design -- which does not allow variables to be declared which are not assigned -- makes most variable declaration problems trivial. This is arguably a good thing.
=={{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.
<syntaxhighlight lang="java">public class VariableDeclarationReset {
public static void main(String[] args) {
int[] s = {1, 2, 2, 3, 4, 4, 5};
// There is no output as 'prev' is created anew each time
// around the loop and set to zero.
for (int i = 0; i < s.length; ++i) {
int curr = s[i];
int prev = 0;
// int prev; // triggers "error: variable prev might not have been initialized"
if (i > 0 && curr == prev) System.out.println(i);
prev = curr;
}
int gprev = 0;
// Now 'gprev' is used and reassigned
// each time around the loop producing the desired output.
for (int i = 0; i < s.length; ++i) {
int curr = s[i];
if (i > 0 && curr == gprev) System.out.println(i);
gprev = curr;
}
}
}</syntaxhighlight>
{{out}}
Line 155 ⟶ 349:
=={{header|JavaScript}}==
<
<html lang="en" >
<head>
Line 175 ⟶ 369:
</script>
</body>
</html></
No output<br>
{{out}}
<pre>
Line 183 ⟶ 377:
5
</pre>
=={{header|jq}}==
The following "straightforward longhand loop" produces correct answers because the iteration
is specified to begin at the second element.
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.
<syntaxhighlight lang="jq">[1,2,2,3,4,4,5]
| . 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:
<syntaxhighlight lang="julia">
s = [1, 2, 2, 3, 4, 4, 5]
for i in eachindex(s)
curr = s[i]
i > 1 && curr == prev && println(i)
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:
<syntaxhighlight lang="julia">
s = [1, 2, 2, 3, 4, 4, 5]
prev = -1
for i in eachindex(s)
global prev
curr = s[i]
i > 1 && curr == prev && println(i)
prev = curr
end
</syntaxhighlight> {{out}}
<pre>
3
6
</pre>
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:
<syntaxhighlight lang="julia">
s = [1, 2, 2, 3, 4, 4, 5]
for i in eachindex(s)[begin+1:end] # or 2:length(s)
s[i] == s[i - 1] && println(i)
end
</syntaxhighlight>
=={{header|K}}==
There is no such thing as a <i>straightforward longhand loop</i> in K. See also: https://nsl.com/
A natural expression for finding the indices of repeated elements (in [[ngn/k]]) might be:<syntaxhighlight lang=K>&=/'2':1 2 2 3 4 4 5
1 4</syntaxhighlight>
But of course, there's no variables here.
Longhand loops can be emulated, using lambdas (in which case local variables expire when the lambda exits), but this is not what many programmers would think of as a straightforward longhand loop.
=={{header|Nim}}==
In Nim, a loop create a new block. Variables declared in the loop body are created and initialized at each round: they do not retain the value from one round to the next.
Moreover, a variable needs to be declared before use, except variables in “for” loop which are implicitly declared in the loop block scope. If the variable has not been declared, the program fails to compile.
Is is not mandatory to initialize a variable. If there is no explicit initialization, the variable gets a default value which depends on its type (this is a binary zero).
Thus, the following program doesn’t compile, as, at compile time, “prev” is used before its declaration:
<syntaxhighlight lang="Nim">let s = [1, 2, 2, 3, 4, 4, 5]
for i in 0..s.high:
let curr = s[i]
if i > 0 and curr == prev:
echo i
var prev = curr
</syntaxhighlight>
The following program compiles but doesn’t output the right result as “prev” is reset at beginning of each round:
<syntaxhighlight lang="Nim">let s = [1, 2, 2, 3, 4, 4, 5]
for i in 0..s.high:
let curr = s[i]
var prev: int
if i > 0 and curr == prev:
echo i
prev = curr
</syntaxhighlight>
To get the right result, we need to declare “prev” outside the loop.
<syntaxhighlight lang="Nim">let s = [1, 2, 2, 3, 4, 4, 5]
var prev: int
for i in 0..s.high:
let curr = s[i]
if i > 0 and curr == prev:
echo i
prev = curr
</syntaxhighlight>
{{out}}
<pre>2
5
</pre>
=={{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.
<syntaxhighlight lang="perl">@s = <1 2 2 3 4 4 5>;
for ($i = 0; $i < 7; $i++) {
$curr = $s[$i];
if ($i > 1 and $curr == $prev) { print "$i\n" }
$prev = $curr;
}</syntaxhighlight>
{{out}}
<pre>2
5</pre>
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).
<syntaxhighlight lang="perl">use strict;
use warnings;
use feature 'state';
my @s = <1 2 2 3 4 4 5>;
for (my $i = 0; $i < 7; $i++) {
my $curr = $s[$i];
state $prev;
if ($i > 1 and $curr == $prev) { print "$i\n" }
$prev = $curr;
}</syntaxhighlight>
{{out}}
<pre>2
5</pre>
=={{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 195 ⟶ 520:
<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 208 ⟶ 533:
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 241 ⟶ 566:
END;
EOF</
{{out}}
<pre>
2
5
</pre>
=={{header|Python}}==
In Python, variables are not declared before use. If you assign to a non-existent variable, you create a new variable with that name. The language does not prohibit writing code to read a variable that may or may not exist. But if the code tries at runtime to read a variable that happens to not have been assigned to (or a variable that happens to have been <code>del</code>'ed), you get a <code>NameError</code> exception at runtime.
The following code is legal, but note that a Python code checker such as pyflakes will flag such code with an error.
<syntaxhighlight lang="python">
s = [1, 2, 2, 3, 4, 4, 5]
for i in range(len(s)):
curr = s[i]
if i > 0 and curr == prev:
print(i)
prev = curr
</syntaxhighlight>{{out}}
<pre>
2
Line 251 ⟶ 594:
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 259 ⟶ 602:
}
$prev = $curr;
}</
{{out|Yields}}
<pre>Use of uninitialized value of type Any in numeric context
Line 274 ⟶ 617:
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 282 ⟶ 625:
}
$prev = $curr;
}</
No output.
Line 289 ⟶ 632:
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 297 ⟶ 640:
}
$prev = $curr;
}</
{{out|Yields}}
Line 305 ⟶ 648:
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 313 ⟶ 656:
}
$prev = $curr;
}</
{{out|Yields}}
Line 322 ⟶ 665:
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 330 ⟶ 673:
}
$prev = $curr;
}</
{{out|Yields}}
Line 339 ⟶ 682:
* 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 347 ⟶ 690:
]
prev: curr
]</
{{out}}
<pre>
3
6
</pre>
=={{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.
<syntaxhighlight lang="seed7">$ include "seed7_05.s7i";
const proc: main is func
local
const array integer: s is [] (1, 2, 2, 3, 4, 4, 5);
var integer: i is 0;
var integer: curr is 0;
var integer: prev is 0;
begin
for i range 1 to length(s) do
curr := s[i];
if i > 1 and curr = prev then
writeln(i);
end if;
prev := curr;
end for;
end func;</syntaxhighlight>
{{out}}
<pre>
Line 355 ⟶ 723:
=={{header|Visual Basic .NET}}==
<
Option Explicit On
Line 374 ⟶ 742:
End Sub
End Module</
{{out}}
<pre>
2
5
</pre>
=={{header|V (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.
<syntaxhighlight lang="v (vlang)">fn main() {
s := [1, 2, 2, 3, 4, 4, 5]
// There is no output as 'prev' is created anew each time
// around the loop and set implicitly to zero.
for i := 0; i < s.len; i++ {
curr := s[i]
mut prev := 0
if i > 0 && curr == prev {
println(i)
}
prev = curr
}
// Now 'prev' is created only once and reassigned
// each time around the loop producing the desired output.
mut prev := 0
for i := 0; i < s.len; i++ {
curr := s[i]
if i > 0 && curr == prev {
println(i)
}
prev = curr
}
}</syntaxhighlight>
{{out}}
<pre>
Line 383 ⟶ 785:
=={{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 401 ⟶ 803:
if (i > 0 && curr == prev) System.print(i)
prev = curr
}</
{{out}}
| |||