DIRECTORY
EditSpan USING [Inherit, Merge, NodeOrder, Place, Split], 
EditSpanSupport USING [ApplyProc, Event, LastOfSlice, MaxLen, NeededNestingChange, NodeItself, Slice, SliceArray], 
TextEdit USING [Size], 
TextNode USING [FirstChild, Level, Location, NewTextNode, Next, nullLocation, nullSpan, Parent, Node, Root, Span, StepBackward, StepForward];

EditSpanSupportImpl: CEDAR MONITOR 
IMPORTS EditSpan, EditSpanSupport, TextEdit, TextNode
EXPORTS EditSpanSupport, EditSpan
= BEGIN OPEN EditSpanSupport;

Node: TYPE ~ TextNode.Node;
Location: TYPE ~ TextNode.Location;
Place: TYPE ~ EditSpan.Place;
NodeOrder: TYPE ~ EditSpan.NodeOrder;
Span: TYPE ~ TextNode.Span;
nullSpan: Span ~ TextNode.nullSpan;

freeSlice: Slice; -- free list of slices
numFreeSlices: NAT Ź 0;
maxFreeSlices: NAT = 15;
minSliceSize: NAT = 10;
GetSlice: PUBLIC ENTRY PROC [len: NAT] RETURNS [slice: Slice] = {
IF freeSlice # NIL THEN { -- look on free list
prev: Slice;
IF freeSlice.maxLength >= len THEN { -- take the first from list
slice Ź freeSlice; freeSlice Ź freeSlice.next;
slice.next Ź NIL;
numFreeSlices Ź numFreeSlices-1; RETURN 
};
prev Ź freeSlice;
FOR s: Slice Ź freeSlice.next, s.next UNTIL s=NIL DO
IF s.maxLength >= len THEN { -- take this one
prev.next Ź s.next; s.next Ź NIL;
numFreeSlices Ź numFreeSlices-1; RETURN [s] 
};
prev Ź s;
ENDLOOP 
};
RETURN [NEW[SliceArray[MAX[len,minSliceSize]]]] 
};

FreeSlice: PUBLIC ENTRY PROC [slice: Slice] = {
IF slice=NIL OR numFreeSlices >= maxFreeSlices OR slice.maxLength < minSliceSize
THEN RETURN;
FOR i:NAT IN [0..slice.length) DO slice[i] Ź NIL; ENDLOOP;
slice.next Ź freeSlice; freeSlice Ź slice;
numFreeSlices Ź numFreeSlices+1 
};

MakeSlices: PROC [node: Node] RETURNS [before, after: Slice] = {
last: NAT;
Slicer: PROC [node: Node, height: NAT] RETURNS [level: NAT] = {
height Ź height+1;
IF node=NIL THEN { -- have gone beyond root
before Ź GetSlice[height]; before.kind Ź before;
after Ź GetSlice[height+1]; after.kind Ź after;
RETURN [0] 
};
level Ź Slicer[TextNode.Parent[node],height];
before[level] Ź node;
after[level] Ź TextNode.Next[node];
RETURN [level+1] 
};
IF node=NIL THEN RETURN;
last Ź Slicer[node,0];
before.length Ź last;
IF node.child # NIL
THEN { after[last] Ź node.child; after.length Ź last+1 }
ELSE after.length Ź last;
FOR i: NAT Ź after.length, i-1 DO -- delete trailing NIL's from after
IF i=0 THEN { after.length Ź 0; EXIT };
IF after[i-1] # NIL THEN { after.length Ź i; EXIT };
ENDLOOP;
};

InsertPrefix: PROC [first, last: Slice, firstLen: NAT] RETURNS [new: Slice] = {
newLen: NAT;
IF first = NIL OR last = NIL OR first.kind # before OR last.kind # before 
OR first.length < firstLen THEN ERROR;
new Ź GetSlice[newLen Ź firstLen + last.length];
new.kind Ź before; new.length Ź newLen;
FOR i: NAT IN [0..firstLen) DO new[i] Ź first[i]; ENDLOOP;
FOR i: NAT IN [0..last.length) DO new[firstLen+i] Ź last[i]; ENDLOOP;
};

NeedNestingChange: PUBLIC PROC [before, after, top, bottom: Slice, 
nesting: INTEGER, depth: NAT] RETURNS [NeededNestingChange] = {
bandStart, afterOver: INTEGER;
topLen, botLen: NAT;
nesting Ź MIN[1,nesting];
topLen Ź top.length; botLen Ź bottom.length;
bandStart Ź before.length+nesting-(topLen-depth);
IF bandStart <= 0 THEN RETURN [needNest]; -- must be at least 1
afterOver Ź after.length-(botLen-depth+bandStart);
IF afterOver > 1 THEN RETURN [needUnNest];
RETURN [ok] 
};

AdoptChildren: PUBLIC PROC [node, child: Node] ~ {
node.child Ź child;
FOR c: Node Ź child, c.next UNTIL c=NIL DO c.parent Ź node ENDLOOP;
};

Splice: PUBLIC PROC [before, after: Slice, beforeStart, afterStart: NAT Ź 0] = {
beforeLen: NAT ~ before.length-beforeStart;
afterLen: NAT ~ after.length-afterStart;
IF before.kind#before OR after.kind#after THEN ERROR;
IF afterLen>beforeLen+1 THEN ERROR; -- cannot have gaps in tree
AdoptChildren[LastOfSlice[before], IF afterLen>beforeLen THEN LastOfSlice[after] ELSE NIL];
FOR i: NAT DECREASING IN[0..beforeLen) DO -- do successors
b: Node ~ before[beforeStart+i];
a: Node ~ IF i<afterLen THEN after[afterStart+i] ELSE NIL;
IF a=b THEN RETURN;
b.next Ź a;
FOR n: Node Ź a, n.next UNTIL n=NIL DO n.parent Ź b.parent ENDLOOP;
ENDLOOP;
};

ReplaceBand: PUBLIC PROC [before, after, top, bottom: Slice, 
nesting: INTEGER, event: Event] = {
depth: NAT;
fullBottom: Slice;
nesting Ź MIN[1,nesting];
IF top.length >= before.length+nesting THEN ERROR;
depth Ź MAX[1,before.length+nesting-top.length];
fullBottom Ź InsertPrefix[before,bottom,depth];
Splice[fullBottom,after];
Splice[before,top,depth];
FreeSlice[fullBottom];
};

BadBand: PUBLIC ERROR = CODE;
DescribeBand: PUBLIC PROC [first, last: Node] 
RETURNS [before, after, top, bottom: Slice, nesting: INTEGER, depth: NAT] = {
BadBandError: PROC = {
ERROR BadBand [! UNWIND => {
FreeSlice[before]; FreeSlice[after];
FreeSlice[top]; FreeSlice[bottom] 
} ] 
};
pred: Node Ź TextNode.StepBackward[first];
minDepth: NAT;
IF pred=NIL THEN ERROR BadBand; -- first is root node
IF pred=last THEN ERROR BadBand; -- this actually happened during testing!
[before,top] Ź MakeSlices[pred];
nesting Ź top.length-before.length;
[bottom,after] Ź MakeSlices[last];
minDepth Ź MIN[before.length,bottom.length];
FOR depth Ź 0, depth+1 UNTIL depth >= minDepth DO
IF before[depth] # bottom[depth] THEN { -- check for legality
bot: Node Ź bottom[depth];
FOR node: Node Ź before[depth],  TextNode.Next[node] DO
SELECT node FROM
bot => EXIT;
NIL => BadBandError[]; -- last must come before first
ENDCASE;
ENDLOOP;
EXIT 
};
ENDLOOP;
IF depth=0 THEN BadBandError[]; -- different root nodes for first and last
IF LastOfSlice[top] # first THEN ERROR;
IF before[before.length+nesting-2] # TextNode.Parent[first] THEN ERROR;
IF LastOfSlice[bottom] # last THEN ERROR 
};

DeletePrefix: PUBLIC PROC [slice: Slice, depth: NAT] = {
newLen: NAT;
IF slice.length < depth THEN ERROR;
newLen Ź slice.length-depth;
FOR i:NAT IN [0..newLen) DO slice[i] Ź slice[i+depth]; ENDLOOP;
FOR i:NAT IN [newLen..slice.length) DO slice[i] Ź NIL; ENDLOOP;
slice.length Ź newLen 
};

DestSlices: PUBLIC PROC [dest: Node, where: EditSpan.Place] 
RETURNS [before, after: Slice, nesting: INTEGER] = {
SELECT where FROM
after => { [before,after] Ź MakeSlices[dest]; nesting Ź 0 };
child => { [before,after] Ź MakeSlices[dest]; nesting Ź 1 };
before => {
pred: Node Ź TextNode.StepBackward[dest];
[before,after] Ź MakeSlices[pred];
nesting Ź after.length-before.length 
};
ENDCASE => ERROR 
};

CreateDest: PUBLIC PROC [depth: NAT] RETURNS [dest: Location] = {
node: Node Ź NIL;
WHILE depth>0 DO 
child: Node Ź TextNode.NewTextNode[];
IF node # NIL THEN { node.child Ź child; child.parent Ź node };
node Ź child; depth Ź depth-1;
ENDLOOP;
RETURN [[node, NodeItself]] 
};

CopySpan: PUBLIC PROC [span: Span] RETURNS [result: Span] = {
node, sourceFirst, sourceLast, child, new, prev, parent, first: Node;
firstLoc, lastLoc: INT;
sourceFirst Ź span.start.node; firstLoc Ź span.start.where;
sourceLast Ź span.end.node; lastLoc Ź span.end.where;
IF (node Ź sourceFirst)=NIL THEN RETURN [nullSpan];
parent Ź TextNode.NewTextNode[]; -- parent for the span
DO -- create new node each time through the loop
new Ź TextNode.NewTextNode[];
new.rope Ź node.rope;
new.runs Ź node.runs;
new.charSets Ź node.charSets;
new.charProps Ź node.charProps;
new.new Ź TRUE;
new.parent Ź parent;
IF prev#NIL THEN prev.next Ź new ELSE parent.child Ź new; -- insert new
prev Ź new;
EditSpan.Inherit[node,new,TRUE]; -- inherit properties from node
IF node=sourceFirst THEN first Ź new;
IF node=sourceLast THEN {
RETURN [[[first,firstLoc], [new,lastLoc]]] 
};
IF (child Ź node.child) # NIL THEN { -- descend in the tree
node Ź child; parent Ź new; prev Ź NIL 
}
ELSE DO -- move to next node, sibling or up* then sibling
IF node.next#NIL THEN { node Ź node.next; EXIT };
prev Ź parent;
IF (parent Ź prev.parent) = NIL THEN { -- need a new parent
parent Ź TextNode.NewTextNode[];
parent.child Ź prev;
prev.parent Ź parent;
};
IF (node Ź node.parent)=NIL THEN RETURN [nullSpan]; -- bad arg span
ENDLOOP;
ENDLOOP 
};

CompareSliceOrder: PUBLIC PROC [s1, s2: Slice] RETURNS [order: EditSpan.NodeOrder] = {
s1Len, s2Len: NAT;
IF s1=NIL OR s2=NIL OR (s1LenŹs1.length)=0 OR (s2LenŹs2.length)=0 OR s1[0] # s2[0]
THEN RETURN [disjoint];
IF s1.kind # before OR s2.kind # before THEN ERROR; -- only valid for parent slices
FOR i:NAT Ź 1, i+1 DO -- know that s1[j]=s2[j] for j<i
SELECT i FROM
s1Len => { 
IF i=s2Len THEN RETURN [same]; -- s1Last=s2Last
RETURN [before] 
}; -- s1Last is a parent of s2Last
s2Len => RETURN [after]; -- s2Last is a parent of s1Last
ENDCASE;
IF s1[i] # s2[i] THEN { -- they are siblings, so can check order by Next's
s2Node: Node Ź s2[i];
FOR n:Node Ź TextNode.Next[s1[i]],  TextNode.Next[n] DO -- search from s1 to s2
SELECT n FROM
s2Node => RETURN [before];
NIL => RETURN [after];
ENDCASE;
ENDLOOP 
};
ENDLOOP 
};

CompareNodeOrder: PUBLIC PROC [node1, node2: Node] RETURNS [NodeOrder] ~ {
IF node1=NIL OR node2=NIL THEN RETURN[disjoint];
IF node1=node2 THEN RETURN[same]
ELSE {
level1: INTEGER ~ TextNode.Level[node1];
level2: INTEGER ~ TextNode.Level[node2];
level: INTEGER ~ MIN[level1, level2];
n1: Node Ź node1;
n2: Node Ź node2;
THROUGH [level..level1) DO n1 Ź TextNode.Parent[n1] ENDLOOP;
THROUGH [level..level2) DO n2 Ź TextNode.Parent[n2] ENDLOOP;
IF n1=n2 THEN RETURN[IF level1<level2 THEN before ELSE after];
THROUGH [0..level) DO -- look for a common ancestor
p1: Node ~ TextNode.Parent[n1];
p2: Node ~ TextNode.Parent[n2];
IF p1=p2 THEN { -- n1 and n2 are siblings
FOR n: Node Ź TextNode.FirstChild[p1], TextNode.Next[n] UNTIL n=NIL DO
SELECT n FROM
n1 => RETURN[before]; -- n1 branch is before n2 branch
n2 => RETURN[after]; -- n2 branch is before n1 branch
ENDCASE;
ENDLOOP;
ERROR; -- malformed data structure: n1 and n2 not children of their parent!
}
ELSE { n1 Ź p1; n2 Ź p2 };
ENDLOOP;
RETURN[disjoint];
};
};


DoSplits: PUBLIC PROC [alpha, beta: Span, event: Event] RETURNS [Span, Span] = {

MakeSplit: PROC [node: Node, offset: INT] = {

FixLoc: PROC [old: Location] RETURNS [newLoc: Location] = {
where: INT;
IF old.node # node THEN RETURN [old];
SELECT where Ź old.where FROM
= NodeItself => ERROR;
< offset => RETURN [[node,where]];
ENDCASE => RETURN [[new,where-offset]] 
};
new: Node;
IF node = NIL THEN RETURN;
new Ź EditSpan.Split[TextNode.Root[node], [node,offset],event];
alpha.start Ź FixLoc[alpha.start];
alpha.end Ź FixLoc[alpha.end];
beta.start Ź FixLoc[beta.start];
beta.end Ź FixLoc[beta.end] 
};

IF alpha.start.where # NodeItself THEN MakeSplit[alpha.start.node,alpha.start.where];
IF beta.start.where # NodeItself THEN MakeSplit[beta.start.node,beta.start.where];
IF alpha.end.where # NodeItself THEN MakeSplit[alpha.end.node,alpha.end.where+1];
IF beta.end.where # NodeItself THEN MakeSplit[beta.end.node,beta.end.where+1];
RETURN [alpha,beta] 
};

DoSplits2: PUBLIC PROC [dest: Location, source: Span,
where: EditSpan.Place, nesting: INTEGER, event: Event]
RETURNS [Location, Span, EditSpan.Place, INTEGER] = {
destLoc: Location;
destSpan: Span Ź [dest,TextNode.nullLocation];
[destSpan,source] Ź DoSplits[destSpan,source,event];
destLoc Ź destSpan.start;
IF dest.where # NodeItself THEN { -- did a split
destLoc Ź BackLoc[destLoc]; where Ź after; nesting Ź 0 
};
RETURN [destLoc, source, where, nesting] 
};

ReMerge: PUBLIC PROC [alpha, beta: Span, merge: Node, event: Event, tail: BOOL Ź FALSE]
RETURNS [Span, Span] = {
loc: Location;
FixLoc: PROC [old: Location] RETURNS [Location] = {
where: INT;
IF old.node = merge THEN SELECT where Ź old.where FROM
= NodeItself => ERROR;
ENDCASE => RETURN [[loc.node,loc.where+where]];
RETURN [old] 
};
IF tail THEN merge Ź TextNode.StepForward[merge];
loc Ź EditSpan.Merge[TextNode.Root[merge],merge,event];
alpha.start Ź FixLoc[alpha.start];
alpha.end Ź FixLoc[alpha.end];
beta.start Ź FixLoc[beta.start];
beta.end Ź FixLoc[beta.end];
RETURN [alpha,beta] 
};

UndoSplits: PUBLIC PROC [alpha, beta: Span, event: Event] RETURNS [Span, Span] = {
IF alpha.start.where # NodeItself THEN
[alpha,beta] Ź ReMerge[alpha,beta,alpha.start.node,event];
IF beta.start.where # NodeItself THEN
[alpha,beta] Ź ReMerge[alpha,beta,beta.start.node,event];
IF alpha.end.where # NodeItself THEN
[alpha,beta] Ź ReMerge[alpha,beta,alpha.end.node,event,TRUE];
IF beta.end.where # NodeItself THEN
[alpha,beta] Ź ReMerge[alpha,beta,beta.end.node,event,TRUE];
RETURN [alpha,beta] 
};

UndoSplits2: PUBLIC PROC [dest: Location, source: Span, event: Event]
RETURNS [Location, Span] = {
destSpan: Span Ź [dest,TextNode.nullLocation];
[destSpan,source] Ź UndoSplits[destSpan,source,event];
RETURN [destSpan.end,source] 
};

SliceOrder: PUBLIC PROC [alpha, beta: Span, aBefore, aBottom, bBefore, bBottom: Slice]
RETURNS [overlap: BOOL, head, tail: Span, startOrder, endOrder: EditSpan.NodeOrder] = {
IF CompareSliceOrder[aBottom,bBefore]#after --alphaend before betastart
OR CompareSliceOrder[aBefore,bBottom]#before --alphastart after betaend
THEN { overlap Ź FALSE; startOrder Ź endOrder Ź disjoint; RETURN };
startOrder Ź CompareSliceOrder[aBefore,bBefore];
endOrder Ź CompareSliceOrder[aBottom,bBottom];
head Ź SELECT startOrder FROM
before => [alpha.start,BackLoc[beta.start]], 
same => nullSpan,
after => [beta.start,BackLoc[alpha.start]], 
ENDCASE => ERROR;
tail Ź SELECT endOrder FROM
before => [ForwardLoc[alpha.end],beta.end], 
same => nullSpan,
after => [ForwardLoc[beta.end],alpha.end], 
ENDCASE => ERROR;
overlap Ź TRUE;
};

Apply: PUBLIC PROC [span: Span, proc: ApplyProc] = {
node, last: Node;
start, lastLen: INT;
IF (node Ź span.start.node) = NIL THEN RETURN;
IF (last Ź span.end.node) = NIL THEN RETURN;
IF (start Ź span.start.where)=NodeItself THEN start Ź 0;
IF span.end.where=NodeItself THEN lastLen Ź MaxLen
ELSE IF span.end.where=MaxLen THEN lastLen Ź MaxLen
ELSE { lastLen Ź span.end.where+1; IF node=last THEN lastLen Ź lastLen-start };
DO
IF proc[node, start, IF node=last THEN lastLen ELSE MaxLen] THEN RETURN;
IF node=last OR (node Ź TextNode.StepForward[node])=NIL THEN RETURN;
start Ź 0;
ENDLOOP;
};

BackLoc: PUBLIC PROC [loc: Location] RETURNS [new: Location] = {
new.node Ź TextNode.StepBackward[loc.node];
new.where Ź IF loc.where=NodeItself THEN NodeItself ELSE
TextEdit.Size[new.node] 
};

ForwardLoc: PUBLIC PROC [loc: Location] RETURNS [new: Location] = {
new.node Ź TextNode.StepForward[loc.node];
new.where Ź IF loc.where=NodeItself THEN NodeItself ELSE 0 
};

END.
   
`  
EditSpanSupportImpl.mesa
Copyright Ó 1985, 1986, 1991, 1992 by Xerox Corporation.  All rights reserved.
written by Bill Paxton, June 1981
last edit by Bill Paxton, November 9, 1982 10:30 am
Last Edited by: Maxwell, January 5, 1983 12:47 pm
Michael Plass, March 29, 1985 4:01:21 pm PST
Willie-s, February 14, 1991 10:51 am PST
Doug Wyatt, June 30, 1992 2:40 pm PDT

***** Slice support routines

before[0]=root; before[i]=Parent[before[i+1]]; before[before.length-1]=node
after[i]=Next[before[i]]
if node.child # NIL then after[before.length]=node.child


new[i]=first[i] for i in [0..firstLen)
new[i+firstLen]=last[i] for i in [0..last.length)
new.length=last.length+firstLen


join slices
make after[afterStart+i] be successor of before[beforeStart+i]
if more after's than before's, adopt as children of last before


do Splices to insert (top-bottom) between (before-after)
nesting tells how to offset last of before vs. last of top
before[before.length-1+nesting] will be predecessor of top[top.length-1]


top[top.length-1] = first
before[before.length-1+nesting] = predecessor of first 
bottom[bottom.length-1] = last
raises BadBand error if last doesn't follow first in tree structure
or if first or last is root node


check assertions

remove entries from start of slice


where = after means insert starting as sibling after dest
where = child means insert starting as child of dest
where = before means insert starting as sibling before dest

create tree of parents
go to next node

determines relative order in tree of last nodes in the slices
returns "same" if slices are identical
returns "before" if last node of s1 comes before last node of s2
returns "after" if last node of s1 comes after last node of s2
returns "disjoint" if slices are not from the same tree

At this point, Level[n1]=Level[n2]=level AND n1#n2
CompareNodeOrder: PUBLIC PROC [node1, node2: Node] RETURNS [order: EditSpan.NodeOrder] = {
s1, s2: Slice;
IF node1=NIL OR node2=NIL THEN RETURN [disjoint];
IF node1=node2 THEN RETURN [same];
s1 Ź MakeParentSlice[node1];
s2 Ź MakeParentSlice[node2];
order Ź CompareSliceOrder[s1,s2];
FreeSlice[s1]; FreeSlice[s2] 
};

MakeParentSlice: PROC [node: Node] RETURNS [slice: Slice] = {
result is same as MakeSlices[node].before
Slicer: PROC [node: Node, height: NAT] RETURNS [level: NAT] = {
height Ź height+1;
IF node=NIL THEN { -- have gone beyond root
slice Ź GetSlice[height]; slice.kind Ź before;
RETURN [0] 
};
level Ź Slicer[TextNode.Parent[node],height];
slice[level] Ź node;
RETURN [level+1] 
};
IF node=NIL THEN RETURN;
slice.length Ź Slicer[node,0] 
};
split off head or tail sections of text 
***** Miscellaneous
Ęj  NewlineDelimiter
(cedarcode) style codeK
ĎeCNKĎy!!K33K11K,,K(K%K Ďk		K	,:K^sK		K	K Ďn#K.5K!K KK
#KK%KK#K KĎc(KKK AĄ.KĄ@K.KK!(KK#4Ą-K!K!,KK	KKK0KK  	/K PKK:K*K KK  
@J JKKJJ88J K

 	?KĄ+K0K/KKK-KK#KKKKKK48KĄ#EK'K4KKK   OJ J&&J11JJ KK	qK0K'K
:K
EKK  /	KKK
K,K1KĄ?K2K*KKK  2KK
CKK  1	PJ JJ>>J??J K+K
(K5KĄ?K	#[
Ą:K K	
:KKK
CKKK  /aJ J88J::JHHJ KKK
K%2K%0K/KKKKK  K  .	|J JJ77JJCCJ  J  K$K"KKK**K
K	
Ą5K
Ą)JK K#K"K,1Ą=K27KKĄ5KKKKKK	Ą*JJ JK'K:GK)KK  8J J""J KK#KK
?K?KKK 
 
%!qJ J99J44J;;J K<K<K))K"K%KKKK 
 
	AJK	K%%K-?KKKKK  =KEEKK;K5K3K!Ą7Ą-0KKKKKK
KK	ĄGKKĄ@K%K%+KJĄ;K#'KĄ19K1KĄ;K KKKK	ĄCKKKK   VJ J==J&&J@@J>>J77J KKRKK	ĄS
Ą 6KK		Ą/K
KĄ"K	
Ą8KĄ2JK2ĄOK

K	KKKKKK  JK0K K(K(K%KKK<K<K>K)2Ą3KKĄ)5FK	ĄĄ6KĄ 5KKJĄDKKKKKKKK ĐnyĐkyŁŁ ZKKŁŁŁŁŁŁ1KŁŁŁ"KKK!!KKK ˘ŁŁ=J))
˘ŁŁŁ	Ł?KŁŁŁĐcy+K..KŁKK--KKŁKKŁŁŁŁKKK  #PJ((K  	-K  ;KK%KK"K'KK

KK?K"KK KKK K /UK-RK-QK+NKKK  	5K 6"5KK.K4KĄ0K7KK#)KK 
 6WKK 3K6KK/KKK%1K7K"KK KKKK  
#RK &K:K%K9K$K7=K#K6<KKK K -EK.K6KKK K 
?VAWK*ĄGK+ĄGK$CK0K.K-KK,K
K,KK+KK
KK  "4KKK.K,K'82K3KOK		HK
%DK
KKK  @K+K8KKK  
CK*K;KK K     8  Uŕ  