|
|
DataMuseum.dkPresents historical artifacts from the history of: Rational R1000/400 |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about Rational R1000/400 Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - metrics - download
Length: 11264 (0x2c00)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package Xlbt_Graphics3, seg_004fc0
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─⟦5a81ac88f⟧ »Space Info Vol 1«
└─⟦this⟧
with Unchecked_Deallocation;
with Xlbt_Arithmetic;
use Xlbt_Arithmetic;
package Xlbt_Graphics3 is
------------------------------------------------------------------------------
-- X Library Graphics - Full Interface
--
-- Xlbt_Graphics3 - Draw various types of things on a window
------------------------------------------------------------------------------
-- Copyright 1989 - 1991 by Rational, Santa Clara, California.
-- Copyright 1985 - 1989 by the Massachusetts Institute of Technology
--
-- All Rights Reserved.
--
-- Permission to use, copy, modify, and distribute this software and its
-- documentation for any purpose and without fee is hereby granted,
-- provided that the above copyright notice(s) appear in all copies and that
-- both that copyright notice(s) and this permission notice appear in
-- supporting documentation, and that the names of MIT or Rational not be
-- used in advertising or publicity pertaining to distribution of the software
-- without specific, written prior permission.
--
-- MIT and Rational disclaim all warranties with regard to this software,
-- including all implied warranties of merchantability and fitness, in no
-- event shall MIT or Rational be liable for any special, indirect or
-- consequential damages or any damages whatsoever resulting from loss of use,
-- data or profits, whether in an action of contract, negligence or other
-- tortious action, arising out of or in connection with the use or performance
-- of this software.
------------------------------------------------------------------------------
--\x0c
------------------------------------------------------------------------------
-- X_Arc - Description of Arcs
------------------------------------------------------------------------------
type X_Arc is
record
X : S_Short;
Y : S_Short;
Width : U_Short;
Height : U_Short;
Angle1 : S_Short;
Angle2 : S_Short;
end record;
--/ if Length_Clauses then
for X_Arc'Size use 3 * 32;
--/ end if;
type X_Arc_Array is array (S_Natural range <>) of X_Arc;
type X_Arc_List is access X_Arc_Array;
--/ if Pack then
--// pragma Pack (X_Arc_Array);
--/ end if;
--/ if Enable_Deallocation then
pragma Enable_Deallocation (X_Arc_List);
--/ end if;
None_X_Arc : constant X_Arc := (0, 0, 0, 0, 0, 0);
None_X_Arc_List : constant X_Arc_List := null;
procedure Free_X_Arc_List is
new Unchecked_Deallocation (X_Arc_Array,
X_Arc_List);
------------------------------------------------------------------------------
-- X_Coordinate_Mode for drawing routines
------------------------------------------------------------------------------
type X_Coordinate_Mode is
(Coord_Mode_Origin, -- relative to the origin
Coord_Mode_Previous); -- relative to previous point
--/ if Length_Clauses then
for X_Coordinate_Mode'Size use 8;
--/ end if;
None_X_Coordinate_Mode : constant X_Coordinate_Mode :=
X_Coordinate_Mode'Val (0);
------------------------------------------------------------------------------
-- X_Point - Points in X
------------------------------------------------------------------------------
type X_Point is
record
X : S_Short;
Y : S_Short;
end record;
--/ if Length_Clauses then
for X_Point'Size use 32;
--/ end if;
type X_Point_Array is array (S_Natural range <>) of X_Point;
type X_Point_List is access X_Point_Array;
--/ if Pack then
--// pragma Pack (X_Point_Array);
--/ end if;
--/ if Enable_Deallocation then
pragma Enable_Deallocation (X_Point_List);
--/ end if;
None_X_Point : constant X_Point := (0, 0);
None_X_Point_List : constant X_Point_List := null;
procedure Free_X_Point_List is
new Unchecked_Deallocation (X_Point_Array,
X_Point_List);
------------------------------------------------------------------------------
-- X_Polygon_Shape
------------------------------------------------------------------------------
type X_Polygon_Shape is (Complex, -- paths may intersect
Nonconvex, -- no paths intersect, but not convex
Convex); -- wholly convex
--/ if Length_Clauses then
for X_Polygon_Shape'Size use 8;
--/ end if;
None_X_Polygon_Shape : constant X_Polygon_Shape := X_Polygon_Shape'Val (0);
------------------------------------------------------------------------------
-- X_Rectangle - Rectangle
------------------------------------------------------------------------------
type X_Rectangle is
record
X : S_Short;
Y : S_Short;
Width : U_Short;
Height : U_Short;
end record;
--/ if Length_Clauses then
for X_Rectangle'Size use 2 * 32;
--/ end if;
type X_Rectangle_Array is array (S_Natural range <>) of X_Rectangle;
type X_Rectangle_List is access X_Rectangle_Array;
--/ if Pack then
--// pragma Pack (X_Rectangle_Array);
--/ end if;
--/ if Enable_Deallocation then
pragma Enable_Deallocation (X_Rectangle_List);
--/ end if;
None_X_Rectangle : constant X_Rectangle := (0, 0, 0, 0);
None_X_Rectangle_List : constant X_Rectangle_List := null;
procedure Free_X_Rectangle_List is
new Unchecked_Deallocation (X_Rectangle_Array,
X_Rectangle_List);
------------------------------------------------------------------------------
-- X_Segment - Line Segment
------------------------------------------------------------------------------
type X_Segment is
record
X1 : S_Short;
Y1 : S_Short;
X2 : S_Short;
Y2 : S_Short;
end record;
--/ if Length_Clauses then
for X_Segment'Size use 2 * 32;
--/ end if;
type X_Segment_Array is array (S_Natural range <>) of X_Segment;
type X_Segment_List is access X_Segment_Array;
--/ if Pack then
--// pragma Pack (X_Segment_Array);
--/ end if;
--/ if Enable_Deallocation then
pragma Enable_Deallocation (X_Segment_List);
--/ end if;
None_X_Segment : constant X_Segment := (0, 0, 0, 0);
None_X_Segment_List : constant X_Segment_List := null;
procedure Free_X_Segment_List is
new Unchecked_Deallocation (X_Segment_Array,
X_Segment_List);
end Xlbt_Graphics3;
nblk1=a
nid=0
hdr6=14
[0x00] rec0=17 rec1=00 rec2=01 rec3=086
[0x01] rec0=16 rec1=00 rec2=02 rec3=038
[0x02] rec0=01 rec1=00 rec2=0a rec3=00a
[0x03] rec0=1e rec1=00 rec2=03 rec3=072
[0x04] rec0=01 rec1=00 rec2=09 rec3=010
[0x05] rec0=22 rec1=00 rec2=04 rec3=026
[0x06] rec0=1a rec1=00 rec2=08 rec3=032
[0x07] rec0=01 rec1=00 rec2=05 rec3=00e
[0x08] rec0=1c rec1=00 rec2=06 rec3=09c
[0x09] rec0=20 rec1=00 rec2=07 rec3=000
tail 0x2150096b481978437b11f 0x42a00088462063203