File: viper_binop_divmod.py

package info (click to toggle)
giac 1.9.0.93%2Bdfsg2-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 117,732 kB
  • sloc: cpp: 404,272; ansic: 205,462; python: 30,548; javascript: 28,788; makefile: 17,997; yacc: 2,690; lex: 2,464; sh: 705; perl: 314; lisp: 216; asm: 62; java: 41; xml: 36; sed: 16; csh: 7; pascal: 6
file content (18 lines) | stat: -rw-r--r-- 328 bytes parent folder | download | duplicates (3) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
 
# test floor-division and modulo operators

@micropython.viper
def div(x:int, y:int) -> int:
    return x // y

@micropython.viper
def mod(x:int, y:int) -> int:
    return x % y

def dm(x, y):
    print(div(x, y), mod(x, y))

for x in (-6, 6):
    for y in range(-7, 8):
        if y == 0:
            continue
        dm(x, y)