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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
#@local MAPvals,a,b,c,p,x,i,y,keyresult,valresult
gap> START_TEST("objmap.tst");
gap> OBJ_MAP([]);
OBJ_MAP([ ])
gap> OBJ_MAP([1]);
Error, OBJ_MAP: Argument must be a list with even length
gap> OBJ_MAP([1,2]);
OBJ_MAP([ 1, 2 ])
gap> a := OBJ_MAP([(1,2), (3,4)]);
OBJ_MAP([ (1,2), (3,4) ])
gap> b := OBJ_MAP([(1,2),(1,2),(1,2),(1,2)]);
OBJ_MAP([ (1,2), (1,2), (1,2), (1,2) ])
gap> c := OBJ_MAP([1,2,1,3,1,4,1,5]);
OBJ_MAP([ 1, 5 ])
gap> OBJ_MAP_KEYS(a);
[ (1,2) ]
gap> OBJ_MAP_VALUES(a);
[ (3,4) ]
gap> OBJ_MAP_KEYS(b);
[ (1,2), (1,2) ]
gap> OBJ_MAP_VALUES(b);
[ (1,2), (1,2) ]
gap> OBJ_MAP_KEYS(c);
[ 1 ]
gap> OBJ_MAP_VALUES(c);
[ 5 ]
gap> p := (1,2);;
gap> FIND_OBJ_MAP(b, p, "cheese");
"cheese"
gap> CONTAINS_OBJ_MAP(b, p);
false
gap> ADD_OBJ_MAP(b, p, (1,2));
gap> b;
OBJ_MAP([ (1,2), (1,2), (1,2), (1,2), (1,2), (1,2) ])
gap> FIND_OBJ_MAP(b, p, "cheese");
(1,2)
gap> CONTAINS_OBJ_MAP(b, p);
true
gap> REMOVE_OBJ_MAP(b, p);
gap> b;
OBJ_MAP([ (1,2), (1,2), (1,2), (1,2) ])
gap> FIND_OBJ_MAP(b, p, "cheese");
"cheese"
gap> CONTAINS_OBJ_MAP(b, p);
false
gap> ADD_OBJ_MAP(b, p, (1,2));
gap> b;
OBJ_MAP([ (1,2), (1,2), (1,2), (1,2), (1,2), (1,2) ])
gap> FIND_OBJ_MAP(b, p, "cheese");
(1,2)
gap> CONTAINS_OBJ_MAP(b, p);
true
gap> CLEAR_OBJ_MAP(b);
gap> b;
OBJ_MAP([ ])
gap> FIND_OBJ_MAP(b, p, "cheese");
"cheese"
gap> CONTAINS_OBJ_MAP(b, p);
false
gap> x := OBJ_MAP();
OBJ_MAP([ ])
gap> MAPvals := 5000;;
gap> for i in [1..MAPvals] do
> ADD_OBJ_MAP(x, i, i*10);
> if List([1..i], z -> FIND_OBJ_MAP(x,z,-1)) <> [1..i]*10 then
> Print("Missing Value");
> fi;
> if ForAny([i+1..MAPvals], z -> FIND_OBJ_MAP(x, z, -1) <> -1) then
> Print("Extra value");
> fi;
> if SortedList(OBJ_MAP_KEYS(x)) <> [1..i] then
> Print("Invalid OBJ_MAP_KEYS");
> fi;
> if SortedList(OBJ_MAP_VALUES(x)) <> [10,20..i*10] then
> Print("Invalid OBJ_MAP_VALUES");
> fi;
> od;
#
gap> for i in [1..MAPvals] do
> REMOVE_OBJ_MAP(x, i);
> if ForAny([1..i], z -> FIND_OBJ_MAP(x, z, -1) <> -1) then
> Print("Extra Value");
> fi;
> if List([i+1..MAPvals], z -> FIND_OBJ_MAP(x, z,-1)) <> [i+1..MAPvals]*10 then
> Print("Missing value");
> fi;
> if SortedList(OBJ_MAP_KEYS(x)) <> [i+1..MAPvals] then
> Print("Invalid OBJ_MAP_KEYS");
> fi;
> if SortedList(OBJ_MAP_VALUES(x)) <> [i+1..MAPvals]*10 then
> Print("Invalid OBJ_MAP_VALUES");
> fi;
> od;
#
gap> y := OBJ_MAP([]);
OBJ_MAP([ ])
gap> for i in [1..MAPvals] do
> ADD_OBJ_MAP(y, [i,[i]], [i,[i,i]]);
> od;
gap> GASMAN("collect");
gap> keyresult := List([1..MAPvals], x -> [x,[x]]);;
gap> valresult := List([1..MAPvals], x -> [x,[x,x]]);;
gap> SortedList(OBJ_MAP_KEYS(y)) = keyresult;
true
gap> SortedList(OBJ_MAP_VALUES(y)) = valresult;
true
#
gap> ADD_OBJ_MAP(fail, fail, fail);
Error, ADD_OBJ_MAP: <map> must be a mutable object map (not the value 'fail')
gap> FIND_OBJ_MAP(fail, fail, fail);
Error, FIND_OBJ_MAP: <map> must be an object map (not the value 'fail')
gap> CONTAINS_OBJ_MAP(fail, fail);
Error, CONTAINS_OBJ_MAP: <map> must be an object map (not the value 'fail')
gap> REMOVE_OBJ_MAP(fail, fail);
Error, REMOVE_OBJ_MAP: <map> must be a mutable object map (not the value 'fail\
')
gap> CLEAR_OBJ_MAP(fail);
Error, CLEAR_OBJ_MAP: <map> must be a mutable object map (not the value 'fail'\
)
gap> OBJ_MAP_VALUES(fail);
Error, OBJ_MAP_VALUES: <map> must be an object map (not the value 'fail')
gap> OBJ_MAP_KEYS(fail);
Error, OBJ_MAP_KEYS: <map> must be an object map (not the value 'fail')
#
gap> STOP_TEST("objmap.tst");
|
