AonymousGuy wrote:

Alberknyis wrote:

if <> then ::cstart
    
elif <> then ::celse

else ::celse

end

Um, actually - that block is not very simple to workaround:

if <> then
else
if <> then
else
if <> then
else
if <> then
else
if <> then
else
if <> then
else
if <> then
else
if <> then
else
if <> then
else
if <> then
else
if <> then
else
if <> then
else
if <> then
else
if <> then

else
end
end
end
end
end
end
end
end
end
end
end
end
end
end

#editorlag

if <> then
    
else
if <> then
    
else
end

end

if <> then
    
elif <>::celse

elif <>::celse

elif <>::celse

elif <>::celse

elif <>::celse

else
end

define Forever move (number) steps
move (number) steps
Forever move (number) steps :: more blocks

ChocolatePi wrote:

guys it's called else if not elif.

ChocolatePi wrote:

guys it's called else if not elif.

Alberknyis wrote:

ChocolatePi wrote:

guys it's called else if not elif.

Welcome to Python. Here we have our own names for things.

if ...

else
    if ...

    else
        if...

ChocolatePi wrote:

Alberknyis wrote:

ChocolatePi wrote:

guys it's called else if not elif.

Welcome to Python. Here we have our own names for things.

in better programming languages, else if is treated like

if ...

else
    if ...

    else
        if...

Alberknyis wrote:

ChocolatePi wrote:

Alberknyis wrote:

ChocolatePi wrote:

guys it's called else if not elif.

Welcome to Python. Here we have our own names for things.

in better programming languages, else if is treated like

if ...

else
    if ...

    else
        if...

In Python, we still call it elif.

Wes64 wrote:

the number of blocks is not what determines the computing speed. it is actually the behind-the-scenes operations. just because you have abstracted a function as a single block does not mean it is magically going to be faster than its workaround.

a large number of blocks can take down FPS, but only if you have failed to use “run without screen refresh”.

polygon x:[list of x points v] y:[list of y points v]::pen

//would be much much faster than

define I didn't make this but it is a real script that has been used in many projects.
set [minHeight v] to (item (1 v) of [polyY v])
set [maxHeight v] to (item (1 v) of [polyY v])
pen up
set [i v] to [0]
repeat (vertices)
    change [i v] by (1)
    set [j v] to (item (i) of [polyY v])
    if <(j) < (minHeight)> then
        set [minHeight v] to (j)
    end
    if <(j) > (maxHeight)> then
        set [maxHeight v] to (j)
    end
end
set [pixelY v] to (minHeight)
repeat ((maxHeight) - (pixelY))
    delete (all v) of [nodeX v]
    set [i v] to [1]
    set [j v] to (vertices)
    repeat (vertices)
        if <<<(item (i) of [polyY v]) < (pixelY)> and <not <(item (j) of [polyY v]) < (pixelY)>>> or <<(item (j) of [polyY v]) < (pixelY)> and <not <(item (i) of [polyY v]) < (pixelY)>>>> then
            add (round ((item (i) of [polyX v]) + ((((pixelY) - (item (i) of [polyY v])) / ((item (j) of [polyY v]) - (item (i) of [polyY v]))) * ((item (j) of [polyX v]) - (item (i) of [polyX v]))))) to [nodeX v]
        end
        set [j v] to (i)
        change [i v] by (1)
    end
    set [i v] to [1]
    repeat until <not <(i) < (length of [nodeX v])>>
        if <(item (i) of [nodeX v]) > (item ((i) + (1)) of [nodeX v])> then
            set [swap v] to (item (i) of [nodeX v])
            replace item (i) of [nodeX v] with (item ((i) + (1)) of [nodeX v])
            replace item ((i) + (1)) of [nodeX v] with (swap)
            if <(i) > [1]> then
                change [i v] by (-1)
            end
        else
            change [i v] by (1)
        end
    end
    set [i v] to [1]
    set pen size to (pen size)
    repeat ((length of [nodeX v]) / (2))
        go to x:(item (i) of [nodeX v]) y:(pixelY)
        pen down
        go to x:(item ((i) + (1)) of [nodeX v]) y:(pixelY)
        pen up
        change [i v] by (2)
    end
    change [pixelY v] by (pen size)
end
set pen color to [#000008]
repeat ((vertices) + (1))
    change [i v] by (1)
    go to x:(item (((i) mod (vertices)) + (1)) of [polyX v]) y:(item (((i) mod (vertices)) + (1)) of [polyY v])
    pen down
end

CodeLegend wrote:

-snip-

ChocolatePi wrote:

Alberknyis wrote:

ChocolatePi wrote:

guys it's called else if not elif.

Welcome to Python. Here we have our own names for things.

in better programming languages, else if is treated like

if ...

else
    if ...

    else
        if...

Blank1234 wrote:

ChocolatePi wrote:

Alberknyis wrote:

ChocolatePi wrote:

guys it's called else if not elif.

Welcome to Python. Here we have our own names for things.

in better programming languages, else if is treated like

if ...

else
    if ...

    else
        if...

better progrqmming languages have no loops