Easy as { 1 2 3 }? (when { 1 2 3 } ≠ { 1 2 3 })

[pier4r]

Thanks for the answer! And no I increment the list with get and put. No ListExt involved there if I am not mistaken. So I use the 2.15 RPL library.

I did a workaround knowing the amount of steps to do and making a loop instead of a comparison.

And thanks for the title change.

here is the code to increase the list (to get the position of the actual roll of X dice)

Code:


gpIncrDicePos
  \<<
    gvFalse "lvIsIncreased" DROP
    
    0 "lvPosToIncrease"   DROP
    
    \->
    lvIsIncreased
    lvPosToIncrease
    
    \<<
      gvDicePosActual SIZE 'lvPosToIncrease' STO
      
      WHILE
        lvIsIncreased NOT
        lvPosToIncrease 0 >
        AND
      REPEAT
        gvDicePosActual lvPosToIncrease GET
        IF
          @if the position to increase can be increased
          DUP
          gvDicePosMax lvPosToIncrease GET
          <
        THEN
          @then increase it
          1 + @increased value
          @prepare to put it in
          gvDicePosActual
          lvPosToIncrease
          ROT PUT 
          'gvDicePosActual' STO
          
          @said it is increased
          gvTrue 'lvIsIncreased' STO
        ELSE
          @delete the value on the stack
          DROP
          
          @put a 1 in the position as reset
          gvDicePosActual
          lvPosToIncrease
          1 PUT 'gvDicePosActual' STO
          
          @diminish the position to increase
          'lvPosToIncrease' 1 STO-
        END
      END
      
      IF
        lvPosToIncrease 0 \<=
      THEN
        @increased all the way through!
        @put to max
        gvDicePosMax 'gvDicePosActual' STO
      END
    \>>
  \>>