Re: [boost] Re: Standard Matrix interfaces

From: John Max Skaller (skaller_at_[hidden])
Date: 2001-08-21 18:07:17

Dietmar Kuehl wrote:
>
> BTW: In STL there are "algorithms" which are actually not algorithms
> at all! For example, "sort()" is called an "algorithm" but it is
> actually more a "solver" for a particular problem (bring a sequence
> into a certain order). A specific approach to implement this solver
> is an algorithm, eg. "quick sort", "bubble sort", "merge sort" etc.
> are "algorithms". 

        Interesting! What is the relationshup between
a 'solver' and the 'interface' of an algorithm?
[No, I should say 'a collection of algorithms' which solve
the same problem]

        In particular: using the notion of specialisation,
an STL algorithm interface still only admits ONE algorithm
as a solver: you can't have two ways to 'sort' iterators
of the same _type_, because specialisation is type based.

        That constraint doesn't apply to class based
(virtual function based) polymorphism.

-- 
John (Max) Skaller, mailto:skaller_at_[hidden] 
10/1 Toxteth Rd Glebe NSW 2037 Australia voice: 61-2-9660-0850
New generation programming language Felix  http://felix.sourceforge.net
Literate Programming tool Interscript     
http://Interscript.sourceforge.net