Re: Neat and tidy solution to following problem?

["chris.danx" <spamoff.danx@ntlworld.com>]

"Preben Randhol" <randhol+abuse@pvv.org> wrote in message
news:slrnadga2g.c0c.randhol+abuse@kiuk0152.chembio.ntnu.no...
> On Tue, 7 May 2002 19:24:27 +0100, chris.danx wrote:
>
> I'm not sure I understand your question as I don't know Haskell and
> cannot understand the code. But if you have your whole text in a
> string why don't you find the beginning and end position of the words
> and then scan the document for them? But probably I'm talking about
> something different :-)

Yes it is something different.  In an FPL you can return a tuple of items
from a function just as easily as you can return a single item (I think that
FPLs regard them as a single item anyway, they're just easier to use).

In the example given previously, the function getWord is declared like this

getWord :: String -> (String, String)

This means it takes a string and returns a pair of strings as a tuple.  If
you want to add all the words in the String to a data structure in another
function, you can use recursion.  Somethings might just be neater if this
could be done without fussing with explicit* record types.


Chris

*explicit in the sense that is defined/declared(? I hate those two words!!!)
before it is used in the return area of function.