From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=0.6 required=5.0 tests=BAYES_40,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,ba92fa04d48e3ba0,start
X-Google-Attributes: gid103376,public
From: dperez <dperez@newtimes.com>
Subject: "<" operator
Date: 1997/10/07
Message-ID: <343A7434.36AD@newtimes.com>#1/1
X-Deja-AN: 279147518
Newsgroups: comp.lang.ada
Date: 1997-10-07T00:00:00+00:00
List-Id: <comp.lang.ada>


how can I write a recursive Ada Function "<" that does the less-than
comparison on linked lists of characters to do the obvious thing?


Thanks