home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky comp.object:3037 comp.lang.eiffel:1003
- Path: sparky!uunet!gatech!news.byu.edu!yvax.byu.edu!cunyvm!psuvm!mkk2
- Newsgroups: comp.object,comp.lang.eiffel
- Subject: Re: Class methods (was: Re: How to design a data structure library)
- Message-ID: <92210.125846MKK2@psuvm.psu.edu>
- From: <MKK2@psuvm.psu.edu>
- Date: Tue, 28 Jul 1992 12:58:46 EDT
- References: <1992Jul23.123609.11699@bony1.bony.com><5618@vexpert.dbai.tuwien.ac.at><GEOFF.
- 92Jul27100601@wodehouse.flash.bellcore.com> <graham.712278529@galois>
- Organization: Penn State University
- Lines: 26
-
- In article <graham.712278529@galois>, graham@maths.su.oz.au (Graham Matthews)
- says:
-
- >Personally I think this is just awful. I want to write
-
- > c := a + b; OR
- > c := a union b;
-
- >Any other notation is completely non-suggestive.
-
- If you are saying that the OOPL language must support operator overloading
- to be useful then I guess you'll just have to use C++ or some such.
-
- In principle, I agree. c := a + b translates into English for me
- as something like "start with a, perform the union operation on it with
- b as an argument, return the union as a result, and assign it to c."
-
- While your crystal clear traditional syntax is nice, I feel fine with
-
- c = [a union:b];
-
- As for using Class methods, I wouldn't mind if there was also a
-
- c = [Set union:a :b];
-
- method.
-