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=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 10ad19,23963231b5359f74
X-Google-Attributes: gid10ad19,public
X-Google-Thread: 107a89,23963231b5359f74
X-Google-Attributes: gid107a89,public
X-Google-Thread: 1073c2,23963231b5359f74
X-Google-Attributes: gid1073c2,public
X-Google-Thread: 10a146,23963231b5359f74
X-Google-Attributes: gid10a146,public
X-Google-Thread: 101deb,23963231b5359f74
X-Google-Attributes: gid101deb,public
X-Google-Thread: 103376,23963231b5359f74
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2001-06-05 02:16:35 PST
Path: 
 archiver1.google.com!newsfeed.google.com!sn-xit-02!supernews.com!nntp-relay.ihug.net!ihug.co.nz!news.tig.com.au!not-for-mail
From: "Blaikie" <david_blaikie@hotmail.com>
Newsgroups: 
 comp.lang.ada,comp.lang.awk,comp.lang.clarion,comp.lang.java.programmer,comp.lang.pl1,comp.lang.vrml
Subject: Re: Long names are doom ?
Date: Tue, 5 Jun 2001 19:17:26 +1000
Organization: The Internet Group (Sydney)
Message-ID: <9fi81h$9bd$1@bugstomper.ihug.com.au>
References: <3B0DD011.88FCD00E@acm.org>
 <83WP6.3874$yc6.728572@news.xtra.co.nz>
 <3B1411D0.3AAF42E7@ftw.rsc.raytheon.com> <9f2nks$ibd$0@dosa.alt.net>
 <3B177EF7.2A2470F4@facilnet.es> <Xns90B35A5F54A70revbob@207.126.101.100>
 <9f8b7b$h0e$1@nh.pace.co.uk> <ttofhtk7j7ufbtot7l2o0svn71qq0j7420@4ax.com>
 <9f8r0i$lu3$1@nh.pace.co.uk> <aqvfhtk583och27tjjaagpt783kn21c6sp@4ax.com>
 <IsNS6.3800$v4.180713@www.newsranger.com> <9fgagu$6ae$1@nh.pace.co.uk>
 <Bh0r7ajFbl7x@eisner.encompasserve.org>
 <eseohtcf468ea4v1klabbm47k01uohdnt3@4ax.com>
NNTP-Posting-Host: p243-tnt3.syd.ihug.com.au
X-Trace: bugstomper.ihug.com.au 991732593 9581 203.173.132.243 (5 Jun 2001
 09:16:33 GMT)
X-Priority: 3
X-MSMail-Priority: Normal
X-Newsreader: Microsoft Outlook Express 5.00.2615.200
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2615.200
Xref: archiver1.google.com comp.lang.ada:8130 comp.lang.awk:2751
 comp.lang.clarion:21079 comp.lang.java.programmer:73593 comp.lang.pl1:744
 comp.lang.vrml:3474
Date: 2001-06-05T19:17:26+10:00
List-Id: <comp.lang.ada>

> I did not explain clearly.  I don't just mean making all {} some
> colour different from the rest of text, but to make them match
> pairwise in increasing size with nesting depth, possibly also using
> different shade with matching pairs the same shade.

only a finite number of possible shades, yet an infinite number of possibly
nested brakets, a quite usefull solution is used in Forte4Java, whenever the
text cursor passes over a braket, both the begin and matching end brackets
go bold for a short time.
db