| 1 |
281 |
jeremybenn |
------------------------------------------------------------------------------
|
| 2 |
|
|
-- --
|
| 3 |
|
|
-- GNAT LIBRARY COMPONENTS --
|
| 4 |
|
|
-- --
|
| 5 |
|
|
-- A D A . S T R I N G S . E Q U A L _ C A S E _ I N S E N S I T I V E --
|
| 6 |
|
|
-- --
|
| 7 |
|
|
-- B o d y --
|
| 8 |
|
|
-- --
|
| 9 |
|
|
-- Copyright (C) 2004-2009, Free Software Foundation, Inc. --
|
| 10 |
|
|
-- --
|
| 11 |
|
|
-- GNAT is free software; you can redistribute it and/or modify it under --
|
| 12 |
|
|
-- terms of the GNU General Public License as published by the Free Soft- --
|
| 13 |
|
|
-- ware Foundation; either version 3, or (at your option) any later ver- --
|
| 14 |
|
|
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
|
| 15 |
|
|
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
|
| 16 |
|
|
-- or FITNESS FOR A PARTICULAR PURPOSE. --
|
| 17 |
|
|
-- --
|
| 18 |
|
|
-- As a special exception under Section 7 of GPL version 3, you are granted --
|
| 19 |
|
|
-- additional permissions described in the GCC Runtime Library Exception, --
|
| 20 |
|
|
-- version 3.1, as published by the Free Software Foundation. --
|
| 21 |
|
|
-- --
|
| 22 |
|
|
-- You should have received a copy of the GNU General Public License and --
|
| 23 |
|
|
-- a copy of the GCC Runtime Library Exception along with this program; --
|
| 24 |
|
|
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
|
| 25 |
|
|
-- <http://www.gnu.org/licenses/>. --
|
| 26 |
|
|
-- --
|
| 27 |
|
|
-- This unit was originally developed by Matthew J Heaney. --
|
| 28 |
|
|
------------------------------------------------------------------------------
|
| 29 |
|
|
|
| 30 |
|
|
with Ada.Characters.Handling; use Ada.Characters.Handling;
|
| 31 |
|
|
|
| 32 |
|
|
function Ada.Strings.Equal_Case_Insensitive
|
| 33 |
|
|
(Left, Right : String) return Boolean
|
| 34 |
|
|
is
|
| 35 |
|
|
LI : Integer := Left'First;
|
| 36 |
|
|
RI : Integer := Right'First;
|
| 37 |
|
|
|
| 38 |
|
|
begin
|
| 39 |
|
|
if Left'Length /= Right'Length then
|
| 40 |
|
|
return False;
|
| 41 |
|
|
end if;
|
| 42 |
|
|
|
| 43 |
|
|
if Left'Length = 0 then
|
| 44 |
|
|
return True;
|
| 45 |
|
|
end if;
|
| 46 |
|
|
|
| 47 |
|
|
loop
|
| 48 |
|
|
if To_Lower (Left (LI)) /= To_Lower (Right (RI)) then
|
| 49 |
|
|
return False;
|
| 50 |
|
|
end if;
|
| 51 |
|
|
|
| 52 |
|
|
if LI = Left'Last then
|
| 53 |
|
|
return True;
|
| 54 |
|
|
end if;
|
| 55 |
|
|
|
| 56 |
|
|
LI := LI + 1;
|
| 57 |
|
|
RI := RI + 1;
|
| 58 |
|
|
end loop;
|
| 59 |
|
|
end Ada.Strings.Equal_Case_Insensitive;
|
