🚀 go-pugleaf

In article <DBS2jCAmrdc0Ew4E@merlyn.demon.co.uk>, Dr John Stockton
<jrs@merlyn.demon.co.uk> writes
>In article <s2qpaAAJUIc0EwPB@merlyn.demon.co.uk> of Mon, 17 Nov 1997
>17:55:21 in comp.lang.pascal.borland, Dr John Stockton
><jrs@merlyn.demon.co.uk> wrote:
>>...   I have given a little thought to the Delete routine (for
>>string-handling).
>> ...
>
>Today's routine is nicer and a bit faster than yesterday's :-
>
>  procedure Remove(var S : string ; Index, Count : Integer) ;
>  { JRS's faster replacement for Sys.DELETE }
>  var Tmp : integer ;
>  begin
>    if (Count<=0) or (Index<=0) or (Index>Length(S)) then EXIT ;
>    Tmp := Length(S)-Index+1 { Maximum Removable } ;
>    if Count>=Tmp then Count := Tmp else
>      Move(S[Index+Count], S[Index], Tmp-Count) ;
>    Dec(S[0], Count) end {Remove} ;
>
How about:

PROCEDURE remove(VAR s : String; index, count : byte);
BEGIN
  if index > length(s) then exit else
  if index + count > succ(length(s)) then s[0]:= chr(index) else
  begin
       Move(s[Index + count],s[Index],succ(length(s)) - index - count);
       Dec(s[0], Count);
  end;
END;


-- 
Pedt Scragg <postmaster@pedt.demon.co.uk>

In principle,   is there uncertainty that
Heisenberg was working his best in chaos?