Data update
This commit is contained in:
parent
5150844a7d
commit
4bb20c9b71
7735 changed files with 38060 additions and 199180 deletions
|
|
@ -1,27 +0,0 @@
|
|||
generic
|
||||
type Element is (<>);
|
||||
with function Image(E: Element) return String;
|
||||
package Set_Cons is
|
||||
|
||||
type Set is private;
|
||||
|
||||
-- constructor and manipulation functions for type Set
|
||||
function "+"(E: Element) return Set;
|
||||
function "+"(Left, Right: Element) return Set;
|
||||
function "+"(Left: Set; Right: Element) return Set;
|
||||
function "-"(Left: Set; Right: Element) return Set;
|
||||
|
||||
-- compare, unite or output a Set
|
||||
function Nonempty_Intersection(Left, Right: Set) return Boolean;
|
||||
function Union(Left, Right: Set) return Set;
|
||||
function Image(S: Set) return String;
|
||||
|
||||
type Set_Vec is array(Positive range <>) of Set;
|
||||
|
||||
-- output a Set_Vec
|
||||
function Image(V: Set_Vec) return String;
|
||||
|
||||
private
|
||||
type Set is array(Element) of Boolean;
|
||||
|
||||
end Set_Cons;
|
||||
|
|
@ -1,77 +0,0 @@
|
|||
package body Set_Cons is
|
||||
|
||||
function "+"(E: Element) return Set is
|
||||
S: Set := (others => False);
|
||||
begin
|
||||
S(E) := True;
|
||||
return S;
|
||||
end "+";
|
||||
|
||||
function "+"(Left, Right: Element) return Set is
|
||||
begin
|
||||
return (+Left) + Right;
|
||||
end "+";
|
||||
|
||||
function "+"(Left: Set; Right: Element) return Set is
|
||||
S: Set := Left;
|
||||
begin
|
||||
S(Right) := True;
|
||||
return S;
|
||||
end "+";
|
||||
|
||||
function "-"(Left: Set; Right: Element) return Set is
|
||||
S: Set := Left;
|
||||
begin
|
||||
S(Right) := False;
|
||||
return S;
|
||||
end "-";
|
||||
|
||||
function Nonempty_Intersection(Left, Right: Set) return Boolean is
|
||||
begin
|
||||
for E in Element'Range loop
|
||||
if Left(E) and then Right(E) then return True;
|
||||
end if;
|
||||
end loop;
|
||||
return False;
|
||||
end Nonempty_Intersection;
|
||||
|
||||
function Union(Left, Right: Set) return Set is
|
||||
S: Set := Left;
|
||||
begin
|
||||
for E in Right'Range loop
|
||||
if Right(E) then S(E) := True;
|
||||
end if;
|
||||
end loop;
|
||||
return S;
|
||||
end Union;
|
||||
|
||||
function Image(S: Set) return String is
|
||||
|
||||
function Image(S: Set; Found: Natural) return String is
|
||||
begin
|
||||
for E in S'Range loop
|
||||
if S(E) then
|
||||
if Found = 0 then
|
||||
return Image(E) & Image((S-E), Found+1);
|
||||
else
|
||||
return "," & Image(E) & Image((S-E), Found+1);
|
||||
end if;
|
||||
end if;
|
||||
end loop;
|
||||
return "";
|
||||
end Image;
|
||||
|
||||
begin
|
||||
return "{" & Image(S, 0) & "}";
|
||||
end Image;
|
||||
|
||||
function Image(V: Set_Vec) return String is
|
||||
begin
|
||||
if V'Length = 0 then
|
||||
return "";
|
||||
else
|
||||
return Image(V(V'First)) & Image(V(V'First+1 .. V'Last));
|
||||
end if;
|
||||
end Image;
|
||||
|
||||
end Set_Cons;
|
||||
|
|
@ -1,40 +0,0 @@
|
|||
with Ada.Text_IO, Set_Cons;
|
||||
|
||||
procedure Set_Consolidation is
|
||||
|
||||
type El_Type is (A, B, C, D, E, F, G, H, I, K);
|
||||
|
||||
function Image(El: El_Type) return String is
|
||||
begin
|
||||
return El_Type'Image(El);
|
||||
end Image;
|
||||
|
||||
package Helper is new Set_Cons(Element => El_Type, Image => Image);
|
||||
use Helper;
|
||||
|
||||
function Consolidate(List: Set_Vec) return Set_Vec is
|
||||
begin
|
||||
for I in List'First .. List'Last - 1 loop
|
||||
for J in I+1 .. List'Last loop
|
||||
-- if List(I) and List(J) share an element
|
||||
-- then recursively consolidate
|
||||
-- (List(I) union List(J)) followed by List(K), K not in {I, J}
|
||||
if Nonempty_Intersection(List(I), List(J)) then
|
||||
return Consolidate
|
||||
(Union(List(I), List(J))
|
||||
& List(List'First .. I-1)
|
||||
& List(I+1 .. J-1)
|
||||
& List(J+1 .. List'Last));
|
||||
end if;
|
||||
end loop;
|
||||
end loop;
|
||||
return List;
|
||||
end Consolidate;
|
||||
|
||||
begin
|
||||
Ada.Text_IO.Put_Line(Image(Consolidate((A+B) & (C+D))));
|
||||
Ada.Text_IO.Put_Line(Image(Consolidate((A+B) & (B+D))));
|
||||
Ada.Text_IO.Put_Line(Image(Consolidate((A+B) & (C+D) & (D+B))));
|
||||
Ada.Text_IO.Put_Line
|
||||
(Image(Consolidate((H+I+K) & (A+B) & (C+D) & (D+B) & (F+G+H))));
|
||||
end Set_Consolidation;
|
||||
|
|
@ -1,33 +0,0 @@
|
|||
Function consolidate(s)
|
||||
sets = Split(s,",")
|
||||
n = UBound(sets)
|
||||
For i = 1 To n
|
||||
p = i
|
||||
ts = ""
|
||||
For j = i To 1 Step -1
|
||||
If ts = "" Then
|
||||
p = j
|
||||
End If
|
||||
ts = ""
|
||||
For k = 1 To Len(sets(p))
|
||||
If InStr(1,sets(j-1),Mid(sets(p),k,1)) = 0 Then
|
||||
ts = ts & Mid(sets(p),k,1)
|
||||
End If
|
||||
Next
|
||||
If Len(ts) < Len(sets(p)) Then
|
||||
sets(j-1) = sets(j-1) & ts
|
||||
sets(p) = "-"
|
||||
ts = ""
|
||||
Else
|
||||
p = i
|
||||
End If
|
||||
Next
|
||||
Next
|
||||
consolidate = s & " = " & Join(sets," , ")
|
||||
End Function
|
||||
|
||||
'testing
|
||||
test = Array("AB","AB,CD","AB,CD,DB","HIK,AB,CD,DB,FGH")
|
||||
For Each t In test
|
||||
WScript.StdOut.WriteLine consolidate(t)
|
||||
Next
|
||||
Loading…
Add table
Add a link
Reference in a new issue