crespi.albert:
>
> I'm trying to write in Haskell a function that in Java would be something
> like this:
>
> char find_match (char[] l1, char[] l2, char e){
> //l1 and l2 are not empty
> int i = 0;
> while (l2){
> char aux = l2[i];
> char[n] laux = l
On Wed, Sep 20, 2006 at 01:31:22AM -0700, Carajillu wrote:
>
> I'm trying to write in Haskell a function that in Java would be something
> like this:
>
> char find_match (char[] l1, char[] l2, char e){
> //l1 and l2 are not empty
> int i = 0;
> while (l2){
> char a
dons:
> crespi.albert:
> >
> > I'm trying to write in Haskell a function that in Java would be something
> > like this:
> >
> > char find_match (char[] l1, char[] l2, char e){
> > //l1 and l2 are not empty
> > int i = 0;
> > while (l2){
> > char aux = l2[i];
> >
On Wed, Sep 20, 2006 at 01:31:22AM -0700, Carajillu wrote:
> compare function just compares the two lists and return true if they are
> equal, or false if they are not.
> it is really a simple function, but I've been thinking about it a lot of
> time and I can't get the goal.
I forgot, obviously,
Carajillu <[EMAIL PROTECTED]> writes:
> compare function just compares the two lists and return true if they are
> equal, or false if they are not.
> find_match "4*h&a" "4*5&a" 'h' > returns '5' (5 matches with the h)
> find_match "4*n&s" "4dhnn" "k" > returns '' (no match at all - lists
wow, the simpliest ever!
Andrea Rossato wrote:
>
> On Wed, Sep 20, 2006 at 01:31:22AM -0700, Carajillu wrote:
>> compare function just compares the two lists and return true if they are
>> equal, or false if they are not.
>> it is really a simple function, but I've been thinking about it a lot
mailing_list:
> On Wed, Sep 20, 2006 at 01:31:22AM -0700, Carajillu wrote:
> > compare function just compares the two lists and return true if they are
> > equal, or false if they are not.
> > it is really a simple function, but I've been thinking about it a lot of
> > time and I can't get the goal
That works good, but I have a problem with the return type, I forgot to
mention... can it be a [char]??
Donald Bruce Stewart wrote:
>
> crespi.albert:
>>
>> I'm trying to write in Haskell a function that in Java would be something
>> like this:
>>
>> char find_match (char[] l1, char[] l2, char
Yes, they must be equal the whole way, I like this recursive solution :)
Ketil Malde-3 wrote:
>
> Carajillu <[EMAIL PROTECTED]> writes:
>
>> compare function just compares the two lists and return true if they are
>> equal, or false if they are not.
>
>> find_match "4*h&a" "4*5&a" 'h' > re
Andrea Rossato <[EMAIL PROTECTED]> writes:
> I forgot, obviously, that lists are an instance of the Eq class...
> so, this is enough:
> comp l1 l2 = if l1 == l2 then True else False
Or why not:
> comp l1 l2 = l1 == l2
Or simply:
> comp = (==)
:-)
-k
--
If I haven't seen further, it is by s
On Wed, Sep 20, 2006 at 07:20:23PM +1000, Donald Bruce Stewart wrote:
> > comp l1 l2 = if l1 == l2 then True else False
> >
> > You never stop learning!
> > andrea
>
> which you would just write as:
> comp = (==)
>
> and then you'd just use == anyway :)
this is why I came to love haskell: i
From: Carajillu <[EMAIL PROTECTED]>
> Date: Wed, 20 Sep 2006 02:22:29 -0700 (PDT)
> Subject: Re: [Haskell-cafe] Java or C to Haskell
>
>
> Yes, they must be equal the whole way, I like this recursive solution :)
>
> Ketil Malde-3 wrote:
> >
> > Carajillu &
askell.org
> From: Carajillu <[EMAIL PROTECTED]>
> Date: Wed, 20 Sep 2006 02:22:29 -0700 (PDT)
> Subject: Re: [Haskell-cafe] Java or C to Haskell
>
>
> Yes, they must be equal the whole way, I like this recursive solution :)
>
> Ketil Malde-3 wrote:
> >
> > C
13 matches
Mail list logo
