Re: Booch's book feels too philosophical rather than practical?



On 2007-01-21 21:59:31 -0600, "topmind" <topmind@xxxxxxxxxxxxxxxx> said:

Using the overused "shape" examples, you have two "lists": lists of
shapes and lists of operations on those shapes. If you factor out the
duplication of one list you introduce duplication of another. OO'ers
don't bother to count the repeated method list as "duplication" because
they are brainwashed to ignore such duplication.

There are indeed two lists. OO does not deny this, it takes advantage of it.

Procedural programming allows you to add new functions without changing the existing data structures. OO allows you to add new data structures without changing the existing functions. You need both capabilities.

--
Robert C. Martin (Uncle Bob)  | email: unclebob@xxxxxxxxxxxxxxxx
Object Mentor Inc.            | blog:  www.butunclebob.com
The Agile Transition Experts  | web:   www.objectmentor.com
800-338-6716                  |



.



Relevant Pages

  • Re: Running Count/Sum in a form
    ... sub-query will pump all the tuples. ... you manually want to spot any difference between two ordered lists. ... >> You need an ordering field, or group of fields, without duplication, ... The subquery approach is ...
    (microsoft.public.access.formscoding)
  • Re: Boochs book feels too philosophical rather than practical?
    ... Robert Martin wrote: ... shapes and lists of operations on those shapes. ... duplication of one list you introduce duplication of another. ... There are indeed two lists. ...
    (comp.object)
  • Re: A Logical Model for Lists as Relations
    ... > with a rank per any explicit order, I am not even sure the ordinal ... If one has a numeric index that differs for each tuple, one never has duplication. ... In the end, though, I'm confident that the lists MS desires can be ...
    (comp.databases.theory)
  • Re: A Logical Model for Lists as Relations
    ... > with a rank per any explicit order, I am not even sure the ordinal ... If one has a numeric index that differs for each tuple, one never has duplication. ... lists provide nothing more than relations do ...
    (comp.databases.theory)