Search:

Type: Posts; User: Trinithis; Keyword(s):

Page 1 of 18 1 2 3 4

Search: Search took 0.02 seconds.

  1. Replies
    5
    Views
    25,202

    onchange="function() { ChangeProduct(this.value);...

    onchange="function() { ChangeProduct(this.value); SelectionInformation(this, ProductOne); };"
  2. Replies
    23
    Views
    40,881

    Whoa, totally forgot about this generics (Twey's)...

    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
  3. Replies
    1
    Views
    4,020

    http://www.dynamicdrive.com/forums/showthread.php?...

    http://www.dynamicdrive.com/forums/showthread.php?t=37934&highlight=haskell+count
  4. setTimeout (function () { ... }, 500 * i);

    setTimeout (function () { ... }, 500 * i);
  5. Replies
    12
    Views
    3,331

    I wouldn't worry about efficiency for a function...

    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...
  6. Replies
    1
    Views
    10,101

    Some useful library stuff you can import:...

    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...
  7. Replies
    232
    Views
    247,792

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

    http://g.imagehost.org/t/0684/Screenshot.jpg
  8. Thread: Text Editors

    by Trinithis
    Replies
    5
    Views
    4,927

    vim emacs

    vim
    emacs
  9. Replies
    1
    Views
    4,747

    Haven't tested it, but perhaps: positions =...

    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()
  10. Replies
    11
    Views
    27,841

    The math behind these generators is very precise:...

    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...
  11. Replies
    7
    Views
    8,344

    If you want, here's the source code for...

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

    by Trinithis
    Replies
    43
    Views
    48,332

    If only my school (Berkeley) taught functional...

    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...
  13. Thread: Haskell Help

    by Trinithis
    Replies
    43
    Views
    48,332

    I jazzed up my simplification code. Perhaps it's...

    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...
  14. Thread: Haskell Help

    by Trinithis
    Replies
    43
    Views
    48,332

    Heh, forgot about the Num class. I'm too tired to...

    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
  15. Replies
    12
    Views
    3,813

    Sure you can. For example toLower from Data.Char...

    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...
  16. Replies
    12
    Views
    3,813

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

    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
    ...
  17. Replies
    132
    Views
    26,170

    UI = User Interface. About the hanging...

    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.
  18. Replies
    6
    Views
    30,606

    Well, it would have to be with a limitation that...

    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...
  19. Replies
    6
    Views
    30,606

    Here's my latest curry code. It allows for...

    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...
  20. Replies
    232
    Views
    247,792

    Here's my current desktop:...

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

    (Yes, the screen is vertical @ 1050x1680 res.)
  21. Replies
    8
    Views
    3,506

    In your other thread, I mentioned that you should...

    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),...
  22. Replies
    1
    Views
    1,673

    Note: All the tests do the same thing. test1...

    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...
  23. Thread: Haskel help

    by Trinithis
    Replies
    6
    Views
    3,966

    Types (and data constructors) have to be...

    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:...
  24. Here's some Haskell code that does the job. I...

    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,...
  25. Define "first" and "last". You could try using...

    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]);
    }
Results 1 to 25 of 449
Page 1 of 18 1 2 3 4