File: set_remove.py

package info (click to toggle)
giac 1.6.0.41%2Bdfsg1-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 64,540 kB
  • sloc: cpp: 351,842; ansic: 105,138; python: 30,545; javascript: 8,675; yacc: 2,690; lex: 2,449; makefile: 1,243; sh: 579; perl: 314; lisp: 216; asm: 62; java: 41; sed: 16; csh: 7; pascal: 6
file content (33 lines) | stat: -rw-r--r-- 767 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
# basic test
s = {1}
print(s.remove(1))
print(list(s))
try:
    print(s.remove(1), "!!!")
except KeyError as er:
    print('KeyError', er.args[0])
else:
    print("failed to raise KeyError")

# test sets of varying size
for n in range(20):
    print('testing set with {} items'.format(n))
    for i in range(n):
        # create set
        s = set()
        for j in range(n):
            s.add(str(j))
        print(len(s))

        # delete an item
        s.remove(str(i))
        print(len(s))

        # check items
        for j in range(n):
            if str(j) in s:
                if j == i:
                    print(j, 'in s, but it should not be')
            else:
                if j != i:
                    print(j, 'not in s, but it should be')