blob: 9701c402761a18c86e62494cd0fc907c4a24ea32 (
plain)
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
|
package body Bundles is
procedure Add
(To : in out Bundle;
Item : in Given_Prefs.Preference_Array)
is
use type Given_Prefs.Preference_Array;
begin
for P of To.Papers loop
if P.Prefs = Item then
P.How_Many := P.How_Many + 1;
return;
end if;
end loop;
To.Papers.Append ( (How_Many => 1, Prefs => Item) );
end Add;
procedure Transfer
(This : in out Bundle;
From, To : in Candidates.CandidateID;
Excluded : in Candidates.Containers.CandidateID_Set;
Value : in Rationals.Fraction;
Result : out Bundle)
is
use type Candidates.CandidateID;
Position : Positive;
begin
Result := Empty_Bundle;
Result.Worth := This.Worth * Value;
for P of This.Papers loop
Position := Given_Prefs.Preference_Range'First;
while Position <= Given_Prefs.Preference_Range'Last and then
P.Prefs (Position) /= From
loop
Position := Position + 1;
end loop;
Position := Position + 1;
while Position <= Given_Prefs.Preference_Range'Last and then
Excluded.Contains (P.Prefs (Position))
loop
Position := Position + 1;
end loop;
if Position <= Given_Prefs.Preference_Range'Last and then
P.Prefs (Position) = To
then
Result.Papers.Append (P);
end if;
end loop;
end Transfer;
function Count_Votes
(This : in Bundle)
return Natural is
begin
return Rationals.Floor (Count_Papers (This) * This.Worth);
end Count_Votes;
function Count_Papers
(This : in Bundle)
return Natural
is
Result : Natural := 0;
begin
for P of This.Papers loop
Result := Result + P.How_Many;
end loop;
return Result;
end Count_Papers;
function "<"
(Left, Right : in Bundle)
return Boolean is
begin
return Left.Worth < Right.Worth;
end "<";
end Bundles;
|
