File : charles-algorithms-generic_lexicographical_compare.adb
------------------------------------------------------------------------------
-- --
-- CHARLES CONTAINER LIBRARY --
-- --
-- Charles.Algorithms.Generic_Lexigographical_Compare (body) --
-- --
-- --
-- Copyright (C) 2001-2002 Matthew J Heaney --
-- --
-- The Charles Container Library ("Charles") is free software; you can --
-- redistribute it and/or modify it under terms of the GNU General Public --
-- License as published by the Free Software Foundation; either version --
-- 2, or (at your option) any later version. Charles is distributed in --
-- the hope that it will be useful, but WITHOUT ANY WARRANTY; without even --
-- the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR --
-- PURPOSE. See the GNU General Public License for more details. You --
-- should have received a copy of the GNU General Public License --
-- distributed with Charles; see file COPYING.TXT. If not, write to the --
-- Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA --
-- 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- Charles is maintained by Matthew J Heaney. --
-- --
-- http://home.earthlink.net/~matthewjheaney/ --
-- mailto:matthewjheaney@earthlink.net --
-- --
------------------------------------------------------------------------------
function Charles.Algorithms.Generic_Lexicographical_Compare
(Left_First, Left_Back : Iterator_Type;
Right_First, Right_Back : Iterator_Type) return Boolean is
LI : Iterator_Type := Left_First;
RI : Iterator_Type := Right_First;
begin
loop
if LI = Left_Back then
return RI /= Right_Back;
end if;
if RI = Right_Back then
return False;
end if;
if Is_Less (RI, LI) then --yes
return False;
end if;
LI := Succ (LI);
RI := Succ (RI);
end loop;
end Charles.Algorithms.Generic_Lexicographical_Compare;