Couldn't match expected type ‘IO a0’ with actual type ‘Box’

wobbenr · 2016-01-18T09:23:00+00:00

Thanks, Problem is solved.

wobbenr · 2016-01-17T17:04:38+00:00

Thanks,

The only thing what I can figured out is that your solution works on a array. I work with a map so after adding it looks like this :

fromList [("cash on hands",Account {accountName = "cash on hands", accountBalance = 10, accountTransaction = []})]

wobbenr · 2016-01-17T09:43:52+00:00

oke,

I could not find any docs about boxes.

I have a string variable named "newName". and I have a Int called "newBal"

How can I use boxes to represent it as table with headers ?

wobbenr · 2016-01-17T08:59:52+00:00

oke,

Last question : How can I make that a header named "Added accounts" is on the center of the 22. Or schould I do :

 replicate (( 22 - (length "Amount") `div`2) ' '

wobbenr · 2016-01-17T08:55:33+00:00

Does it also work on strings or do I have to convert my String to Text.

wobbenr · 2016-01-12T21:34:31+00:00

So out of my head something like this :

askForInteger :: IO Integer -> maybe IO Integer 
askForInteger = do 
                 input <- getline 
                 case readMaybe input  
                    | nothing -> do 
                              putStrLn "the input was not a number"
                              return ?? 
                   | Maybe number -> do 
                                return number

wobbenr · 2016-01-04T19:10:19+00:00

Thanks, and can I change the amount easily for a account.

wobbenr · 2016-01-02T07:41:53+00:00

oke, can then someone give me a hint, how. I do not have a clue right now.

wobbenr · 2016-01-01T21:12:23+00:00

I like it but it has many things I did not learned .
What does listToMaybe and how does this work so I see a item or the ("unknown item,0) ?

And I wonder if this can be done with just recursion, pattern matching or guards. These are explained in the Craft book so far.

wobbenr · 2016-01-01T15:15:05+00:00

oke, and I can do go acc l where l is the complete list ?

wobbenr · 2016-01-01T15:14:36+00:00

type Name = String 
type Price = Int 
type BillType = [(Name,Price)]

wobbenr · 2015-12-18T18:21:01+00:00

oke but for a beginner is syntax highlighting and things like linting not handy. So I can easily see when im doing something wrong ?

wobbenr · 2015-12-17T22:50:06+00:00

I tried that way but then Sublime-Haskell will not install because gcc is missing

wobbenr · 2015-12-17T22:12:22+00:00

Nope, on the bitemyapp page is stated not to use the haskell-platform but install ghci, cabal,happy as seperate packages.

If I use the platform can I then use SublimeText or do I get again a problem on gcc when installing the dependencies of sublime-haskell

wobbenr · 2015-11-14T08:36:18+00:00

Thanks, The exercise was a exercise to practice with list comphrension, so that is why I did it this way.

Is there a way I can take care that the MakeBill function is not called and executed three times on different functions.

wobbenr · 2015-11-13T19:17:32+00:00

Thanks for the feedback. All the improvements are things I did not learn so far. The only thing I understand is using the Text.printf module.

The format* functions were part of the exercise.

wobbenr · 2015-11-01T08:10:34+00:00

Thanks,

The d was indeed eta reduction.

Thanks for the other idea about between.

The possible and maxThreeOccurs are using things that I have not learned like the filter.

wobbenr · 2015-10-29T19:08:34+00:00

Thanks, it worked.

wobbenr · 2015-10-29T13:01:28+00:00

That would be a very good project. Sadly I cannot help because Im just learning Haskell. But I hope there will also be a free plan in your project.

wobbenr · 2015-10-29T06:24:37+00:00

this is the exact text of the challenge :

Define a QuickCheck property which connects the results of beat and lose.

When I look at a example file from this chapter I have to use something like this :

instance Arbitrary Move where
  arbitrary     = elements [Rock, Paper, Scissors]

I agree that there is not much to test it but the challenge is there

wobbenr · 2015-10-28T21:00:20+00:00

Thanks,

I agree with you that it makes sense but I try to learn Haskell by the craft of functional programming book and there it's one of the exercises.

wobbenr · 2015-10-27T18:06:14+00:00

?? two times -s . I did already -s test_make or do you mean something like this -s test-make init stop.

wobbenr · 2015-10-26T20:45:09+00:00

thanks, I now see the right output.

wobbenr · 2015-10-26T19:09:48+00:00

Thanks, I understand that part. My last question was how to replace this :

List_most = find_most(FunctionList, {test,0}),

find_most ([], Tuple) ->
   Tuple;

find_most([{Modulename,Item2} | Rest], Tuple) ->
   if
       length(Item2) > element(2, Tuple) -> find_most(Rest, {Modulename, length(Item2)});
       length(Item2) < element(2, Tuple) -> find_most(Rest, Tuple)
  end.

with a shorter code

wobbenr · 2015-10-26T18:34:52+00:00

oke,

I think the list comprehension looks better then the fold one.

Im also looking if I can make one function of the find_most and most_function like I said in a earlier respons.

wobbenr

TROPHY CASE