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
|
with Interfaces; use Interfaces;
package body Natools.Static_Hash_Maps.S_Expressions.Command_Pkg is
P : constant array (0 .. 0) of Natural :=
(0 .. 0 => 2);
T1 : constant array (0 .. 0) of Unsigned_8 :=
(0 .. 0 => 4);
T2 : constant array (0 .. 0) of Unsigned_8 :=
(0 .. 0 => 3);
G : constant array (0 .. 4) of Unsigned_8 :=
(0, 0, 0, 1, 0);
function Hash (S : String) return Natural is
F : constant Natural := S'First - 1;
L : constant Natural := S'Length;
F1, F2 : Natural := 0;
J : Natural;
begin
for K in P'Range loop
exit when L < P (K);
J := Character'Pos (S (P (K) + F));
F1 := (F1 + Natural (T1 (K)) * J) mod 5;
F2 := (F2 + Natural (T2 (K)) * J) mod 5;
end loop;
return (Natural (G (F1)) + Natural (G (F2))) mod 2;
end Hash;
end Natools.Static_Hash_Maps.S_Expressions.Command_Pkg;
|
|
|
|
|
|
|
|
|
|
|
|
|
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
|
with Interfaces; use Interfaces;
package body Natools.Static_Hash_Maps.S_Expressions.Command_Pkg is
P : constant array (0 .. 1) of Natural :=
(2, 11);
T1 : constant array (0 .. 1) of Unsigned_8 :=
(8, 10);
T2 : constant array (0 .. 1) of Unsigned_8 :=
(5, 2);
G : constant array (0 .. 10) of Unsigned_8 :=
(2, 3, 0, 0, 0, 0, 1, 0, 0, 0, 2);
function Hash (S : String) return Natural is
F : constant Natural := S'First - 1;
L : constant Natural := S'Length;
F1, F2 : Natural := 0;
J : Natural;
begin
for K in P'Range loop
exit when L < P (K);
J := Character'Pos (S (P (K) + F));
F1 := (F1 + Natural (T1 (K)) * J) mod 11;
F2 := (F2 + Natural (T2 (K)) * J) mod 11;
end loop;
return (Natural (G (F1)) + Natural (G (F2))) mod 5;
end Hash;
end Natools.Static_Hash_Maps.S_Expressions.Command_Pkg;
|