Search:

onchange="function() { ChangeProduct(this.value); SelectionInformation(this, ProductOne); };"

Whoa, totally forgot about this generics (Twey's) code. I happened to write something similar a few months ago for the interested:
http://codingforums.com/showthread.php?t=172313

http://www.dynamicdrive.com/forums/showthread.php?t=37934&highlight=haskell+count

setTimeout (function () { ... }, 500 * i);

I wouldn't worry about efficiency for a function that (more than likely) runs in linear or constant time. That aside, the built-in browser version should be faster.

To convert into an array, you...

Some useful library stuff you can import:
http://haskell.org/ghc/docs/latest/html/libraries/base/Data-Ratio.html
http://haskell.org/ghc/docs/latest/html/libraries/base/Data-List.html#10

How to...

http://g.imagehost.org/t/0684/Screenshot.jpg

vim
emacs

Haven't tested it, but perhaps:


positions = new Rectangle[]{...};
What is the error you are getting?

or perhaps swap the <K, V> and swap the args in put()

The math behind these generators is very precise:
http://en.wikipedia.org/wiki/Pseudorandomness
http://en.wikipedia.org/wiki/Pseudorandom_number_generator

For truely random numbers, one would...

If you want, here's the source code for java.util.LinkedList:
http://www.docjar.com/html/api/java/util/LinkedList.java.html

If only my school (Berkeley) taught functional programming with Haskell instead of Scheme, I would be soo happy.

As a side note, I think I have a better idea for simplification. Instead of...

I jazzed up my simplification code. Perhaps it's just me (as I've never done it before), but I highly suspect that there is a much better way of coding simplifications.

-- code removed by request...

Heh, forgot about the Num class. I'm too tired to make simplify be 'good', so I have some filler in it for the time being. Here's what I did:

-- code removed by request

Sure you can. For example toLower from Data.Char is a funtion with the type Char -> Char

Fire up ghci and try this out:


Prelude> map Data.Char.toLower "He yelled 'HELLO!!!'"
"he yelled...

First off, you don't need Ord. All you need is Eq.



search :: Eq a => a -> (Tree a b) -> Bool
search y = search'
where
search' Empty = False
search' (Leaf x _) = x == y
...

UI = User Interface.

About the hanging issue... it has nothing to do with the user's computer being slow. It has to do with an infinite loop and the fact that javascript is single-threaded.

Well, it would have to be with a limitation that only the last function down the apply chain (hmm I like that name more than curryApply) can have varargs.

Basically you would continually apply n...

Here's my latest curry code. It allows for non-sequential partial application and point-free code (extraneous arguments are propagated to result).

It will not work properly with varargs because...

Here's my current desktop:
http://d.imagehost.org/t/0726/Screenshot.jpg

(Yes, the screen is vertical @ 1050x1680 res.)

In your other thread, I mentioned that you should put spaces on either side of (.) (composition). The main reason is that Haskell uses the same character for qualifying a function (eg: Map.empty),...

Note: All the tests do the same thing.


test1 (x, y) = filter $ \(w, z) -> x == w || x == z || y == w || y == z

test2 (x, y) = filter $ \(w, z) -> x `elem` [w, z] || y `elem` [w, z]

test3...

Types (and data constructors) have to be capitalized. Also, there were some other proplems which I fixed.

type Domino = (Int, Int)

domino :: Int -> Int -> Domino
domino x y = (x, y)
-- or:...

Here's some Haskell code that does the job. I won't claim that it will parse any HTML, but it should be adequate. Also, my code does not check for legal HTML. That's your job. I did a little testing,...

Define "first" and "last".

You could try using a for-in loop:



for(var x in obj) {
if(obj.hasOwnProperty(x))
alert(x + ":" + obj[x]);
}