04.06.2019 20:48:08,68
C:\Users\py\Desktop\try>chipmunk basic
Chipmunk BASIC v3.6.5(b6)
10 goto 30
20 for i = 1 to 3
30 print i
40 next i
50 print "done"
>run
0
 NEXT without FOR  in line 40
>save "intofor3.bas
>bye

04.06.2019 21:06:50,56
C:\Users\py\Desktop\try>fbc -lang qb intofor3.bas

04.06.2019 21:07:08,82
C:\Users\py\Desktop\try>intofor3
 0
 1
 2
 3
done

04.06.2019 21:07:16,19
C:\Users\py\Desktop\try>yabasic intofor3.bas
0
1
2
3
done

#include <stdio.h>
#define BITMASK(X) ((1 << (X)) - 1)
int sumdigit(int n, int shift)
{
    int mask = BITMASK(shift);
    while(n > mask)
        n = (n & mask) + (n >> shift);
    return n;
}

int subdigit(int n, int shift)
{
    int mask = BITMASK(shift);
    while(n > mask)
        n = -(n & mask) + (n >> shift);
    return n > 0 ? n : -n;
}

int candiv(int x, int y)
{
    if(x == 0) return 1;
    if(x < 0) x = -x;
    switch(y)
    {
        case 1: return 1;
        case 2: return (x & 1) == 0;
        case 3:
            //return(sumdigit(x, 2) == 3);
            return (subdigit(x, 1) == 0);
        case 4: return (x & 3) == 0;
        case 5:
            /*switch(sumdigit(x, 4))
            {
                case 5:
                case 10:
                case 15:
                    return 1;
            }
            return 0;*/
            return subdigit(x, 2) == 0;
        case 6: return candiv(x, 2) && candiv(x, 3);
        case 7:
            return (sumdigit(x, 3) == 7);
        case 8: return (x & 7) == 0;
        case 9:
            /*switch(sumdigit(x, 6))
            {
                case 9:
                case 18:
                case 27:
                case 36:
                case 45:
                case 54:
                case 63:
                    return 1;
            }
            return 0;*/
            return (subdigit(x, 3) == 0);
        case 10: return candiv(x, 2) && candiv(x, 5);
        case 11:
            switch(subdigit(x, 5))
            {
                case 0:
                case 11:
                case 22:
                    return 1;
            }
            return 0;
        case 12: return candiv(x, 3) && candiv(x, 4);
        case 13: 
            switch(subdigit(x, 6))
            {
                case 0:
                case 13:
                case 26:
                case 39:
                case 52:
                    return 1;
            }
            return 0;
        case 14: return candiv(x, 2) && candiv(x, 7);
        case 15: return (sumdigit(x, 4) == 15);
        case 16: return (x & 15) == 0;
        case 17: return (subdigit(x, 4) == 0);
        case 18: return candiv(x, 2) && candiv(x, 9);
        case 19:
            switch(subdigit(x, 9))
            {
                case 0:     case 19:    case 38:
                case 57:    case 76:    case 95:
                case 114:   case 133:   case 152:
                case 171:   case 190:   case 209:
                case 228:   case 247:   case 266:
                case 285:   case 304:   case 323:
                case 342:   case 361:   case 380:
                case 399:   case 418:   case 437:
                case 456:   case 475:   case 494:
                    return 1;
            }
            return 0;
        case 20: return candiv(x, 4) && candiv(x, 5);
        case 21: return candiv(x, 3) && candiv(x, 7);
        case 22: return candiv(x, 2) && candiv(x, 11);
    }
    exit(1);        
}

main()
{
    #define MIN 0
    #define MAX 0xFFFF
    #define MINDIV 2
    #define MAXDIV 22
    int i, j;
    printf("Checking candiv function on range %d to %d by %d to %d...\n", MIN, MAX, MINDIV, MAXDIV);
    for (i = MIN; i <= MAX; i++)
    {
        /*if (i%100 == 0) printf("%d...\r", i);*/
        for(j = MINDIV; j <= MAXDIV; j++)
            if((i % j == 0) != candiv(i, j))
                printf("%d %% %d = %d, but candiv returns %d\n", i, j, i % j, candiv(i, j));
            else printf("%d %% %d - OK \r", i, j);
    }
    printf ("\nComplete!\n");
}

def hexs(n):
    # 1 <=> '0x01'; -1 <=> '1xFF'
    if type(n)==str:
        n=n.upper()
        assert n[1]=='X' and n[0] in '01'
        res=0 if n[0]=='0' else -1
        for c in n[2:]:
            res=(res<<4)|'0123456789ABCDEF'.index(c)
        return res
    res=''
    even=False
    while res=='' or n not in (0, -1) or even or res[:1]<'8' and n<0:
        res='0123456789ABCDEF'[n&0xF]+res
        n=n>>4
        even=not even
    return '%cx%s'%('01'[n==-1],res)

>>> for i in range(-10, 10):print(i, hexs(i))
...
-10 1xF6
-9 1xF7
-8 1xF8
-7 1xF9
-6 1xFA
-5 1xFB
-4 1xFC
-3 1xFD
-2 1xFE
-1 1xFF
0 0x00
1 0x01
2 0x02
3 0x03
4 0x04
5 0x05
6 0x06
7 0x07
8 0x08
9 0x09

!is_array($this->$attribute)

<script>
    function nn(x) {
        return x<10 ? '0'+x : ''+x;
    }
    // ...
</script>

<script>
  function nn(x)
  {
    return x < 10
      ? '0' + x
      : '' + x
      ;
  }
  // ...
</script>