polymorphism
in [OOP]
|
From: Dmitry A. Kazakov on 8 Jul 2006 16:20 On 8 Jul 2006 12:46:09 -0700, Davor wrote: > topmind wrote: >> Besides my criticisms are about OO, not imperative. I thus don't >> understand your complaint. > > OK, maybe this will help, my feeling is that you are throwing at > comp.object community a challenge that follows following pattern: > > In *my* application area people write text. That text is data that > people constantly manipulate. I think OOP solution to this type of data > manipulation sucks. In particular in my application area, I use text > editor with advanced text processing capabilities, including regex, and > so on, that completely satisfies all my needs. If your OOP is so good, > show me a better way of doing what I do regularly using my VIM editor. > > Here is a concrete example that everyone who has went to a college has > accounted: > > In the following text replace all occurrences of "bla" with "alb": > > aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla > aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla > aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla > > My solution is > >:%s/bla/alb/g > > Let me see your OOP solution to this problem if OOP is so good! And if somebody pointed out that this solution won't work if bla shouldn't be replaced in quoted strings and comments, because standard regular expressions fundamentally cannot match nested things. He would answer that it is academic and out of biz. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de
From: topmind on 8 Jul 2006 21:06 Dmitry A. Kazakov wrote: > On 8 Jul 2006 12:46:09 -0700, Davor wrote: > > > topmind wrote: > >> Besides my criticisms are about OO, not imperative. I thus don't > >> understand your complaint. > > > > OK, maybe this will help, my feeling is that you are throwing at > > comp.object community a challenge that follows following pattern: > > > > In *my* application area people write text. That text is data that > > people constantly manipulate. I think OOP solution to this type of data > > manipulation sucks. In particular in my application area, I use text > > editor with advanced text processing capabilities, including regex, and > > so on, that completely satisfies all my needs. If your OOP is so good, > > show me a better way of doing what I do regularly using my VIM editor. > > > > Here is a concrete example that everyone who has went to a college has > > accounted: > > > > In the following text replace all occurrences of "bla" with "alb": > > > > aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla > > aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla > > aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla > > > > My solution is > > > >:%s/bla/alb/g > > > > Let me see your OOP solution to this problem if OOP is so good! In this twisted analogy, what is my counterpart to VIM and reg-ex? > > And if somebody pointed out that this solution won't work if bla shouldn't > be replaced in quoted strings and comments, because standard regular > expressions fundamentally cannot match nested things. He would answer that > it is academic and out of biz. Are you accusing me of intentionally misrepresenting what my domain requires? Where have I done such? Your analogies make no sense. > > -- > Regards, > Dmitry A. Kazakov -T-
From: Davor on 8 Jul 2006 21:29 topmind wrote: > In this twisted analogy, what is my counterpart to VIM and reg-ex? VIM = (let's say) Microsoft Access (both very complex systems) reg-ex = SQL (both very nice domain specific declarative languages based on solid mathematical theory) > > > > And if somebody pointed out that this solution won't work if bla shouldn't > > be replaced in quoted strings and comments, because standard regular > > expressions fundamentally cannot match nested things. He would answer that > > it is academic and out of biz. > > Are you accusing me of intentionally misrepresenting what my domain > requires? Where have I done such? Your analogies make no sense. (I did not write this comment so skipping reply to it.) Davor
From: topmind on 8 Jul 2006 23:32 Davor wrote: > topmind wrote: > > > In this twisted analogy, what is my counterpart to VIM and reg-ex? > > VIM = (let's say) Microsoft Access > > (both very complex systems) Perhaps unnecessarily so :-) > > reg-ex = SQL > > (both very nice domain specific declarative languages based on solid > mathematical theory) This implies that if you have relational tools, you don't need OO. Is this what you are implying or agreeing to? How many others would consider relational a "domain specific" tool? > > Davor -T-
From: Dmitry A. Kazakov on 9 Jul 2006 03:39
On 8 Jul 2006 18:06:05 -0700, topmind wrote: > Dmitry A. Kazakov wrote: >> On 8 Jul 2006 12:46:09 -0700, Davor wrote: >> >>> topmind wrote: >>>> Besides my criticisms are about OO, not imperative. I thus don't >>>> understand your complaint. >>> >>> OK, maybe this will help, my feeling is that you are throwing at >>> comp.object community a challenge that follows following pattern: >>> >>> In *my* application area people write text. That text is data that >>> people constantly manipulate. I think OOP solution to this type of data >>> manipulation sucks. In particular in my application area, I use text >>> editor with advanced text processing capabilities, including regex, and >>> so on, that completely satisfies all my needs. If your OOP is so good, >>> show me a better way of doing what I do regularly using my VIM editor. >>> >>> Here is a concrete example that everyone who has went to a college has >>> accounted: >>> >>> In the following text replace all occurrences of "bla" with "alb": >>> >>> aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla >>> aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla >>> aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla aaaa bla >>> >>> My solution is >>> >>>:%s/bla/alb/g >>> >>> Let me see your OOP solution to this problem if OOP is so good! > > In this twisted analogy, what is my counterpart to VIM and reg-ex? > >> And if somebody pointed out that this solution won't work if bla shouldn't >> be replaced in quoted strings and comments, because standard regular >> expressions fundamentally cannot match nested things. He would answer that >> it is academic and out of biz. > > Are you accusing me of intentionally misrepresenting what my domain > requires? Where have I done such? Your analogies make no sense. No, it is merely a refutation of your argumentation. You voluntarily vary the borders of what you call your domain to elude uncomfortable questions about applicability of the methods you propose. If you want to convince other people, show how your methods work in their domains! -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de |