🚀 go-pugleaf

Dr John Stockton wrote:
> 
> Copy to AAO & TS by E-mail; news:c.l.p.b,c.l.p.m,b.p.t.
> 
> As a result of E-mails (on different subjects) exchanged with TS and
> with AAO, I have given a little thought to the Delete routine (for
> string-handling).
> 
> It seems to me that Delete is sometimes implemented as Copy(Start),
> Copy(Tail), Concat(Start, Tail); and that there should be a better way
> just involving Move(Tail).

[...]

> The present routine is :
>   procedure JDelete(var S: String; Index: Integer; Count:Integer);
>   var Tmp : integer ;
>   begin
>     if (Count<=0) or (Index<=0) or (Index>Length(S)) then EXIT ;
>     if Index+Count-1>Length(S) then Count := Length(S)-Index+1 ;
>     Tmp := Length(S)-Index-Count+1 ;
>     if Tmp>0 then Move(S[Index+Count], S[Index], Tmp) ;
>     Dec(S[0], Count) end {JDelete} ;

[...]

Here's mine!

procedure DelSt
  (
  var st : string;
  ix     : byte;
  count  : byte
  );

var
  gv    : word;		{got to handle strings of 255 char}
  StLen : byte absolute st;

  begin
    gv := ix + count;

    if (StLen >= gv) then
    begin
      move(st[gv], st[ix], StLen + 1 - gv);
      dec(StLen, count);
    end
    else
    StLen := ix - 1;
  end;

Best Regards,

Mike
CEO, Analog & Digital Design
Automated Production Test
  http://www.csolve.net/~add/home.htm

Hosting Jonathan Ramsey's Pascal TCP/IP for DOS:
  http://www.csolve.net/~add/zips/tcp.htm