Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

Haskell Homework Project

Name: Anonymous 2008-11-08 13:21

I has it!

That is all.

Name: Anonymous 2008-11-08 14:35

No, you don't. Liar.

Name: Anonymous 2008-11-08 16:29

Cool story bro

Name: Anonymous 2008-11-08 17:49

HASKELL sucks, use SCHEME

Name: Anonymous 2008-11-08 18:04

http://twitter.com/hma_meme_fan

Please add me.

Name: Anonymous 2008-11-08 18:06

>>4
Use the Algorithmic Language Scheme to generate Haskell code.

Name: HMA FAN 2008-11-08 18:08

>>5
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░█░░░░░░░░░░░░░░░░░░░░░█░░░
░░░░░░░░░░░░█░░░░░░░░░░░░░░░░░░░░░█░░
░░██████████░░░░░░░░░░░░██████████░░░
░░░█░░░░░░█░░░░░░░░░░░░░░█░░░░░░█░░░░
░░█░░░██░░░█░░░░░░░░░░░░█░░░██░░░█░░░
░░█░░░██░░░█░░░░░░░░░░░░█░░░██░░░█░░░
░░░█░░░░░░█░░░░░░░░░░░░░░█░░░░░░█░░░░
░░░░██████░░░░░░░░░░░░░░░░██████░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░████████████░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░

Name: Anonymous 2008-11-08 18:48

>>7
HYBT?

Name: Anonymous 2008-11-08 19:20

Following Leah Culver
I giggled.

Name: Anonymous 2008-11-08 21:16

There's something telling about you following Leah Vulva on Twitter and not on Ponce.

Name: Anonymous 2008-11-08 22:58

I'd pounce her Vulva

Name: Anonymous 2008-11-08 23:41

>>11
I caught your drift, or more specifically your queef.

Name: Anonymous 2008-11-09 0:45

I'd twitter her Culva

Name: Anonymous 2008-11-09 1:06

I'd lick her Python

Name: Anonymous 2008-11-09 1:11

>>14
Dirty.

Name: Anonymous 2008-11-09 1:20

I'd eat her queefs.

Name: Anonymous 2008-11-09 13:04

OP, if you are good at Haskell, please help me with one problem.

I'm receiving a [String] and a Int and I want to divide it into [[String]], via a max number of Int characters for segment.
In example: ["hello","my","pig"] and 7 return [["hello","my"],["pig"]]

Can you help me with this recursion? Thank you so much, Anonymous!

Name: Anonymous 2008-11-09 14:46

GET TO FUCK

Name: Anonymous 2008-11-09 20:29

>>18
BERSERKER!

Name: Anonymous 2008-11-11 11:06

>>17

HALP

Name: Anonymous 2008-11-11 11:11

>>17,20
Use foldr.

Name: Anonymous 2008-11-11 11:40

Use the Algorithmic Language Scheme.

(define (exercise src maxl)
  (define (iter current dst src maxl orimaxl)
    (cond
      ((null? src)
        (cons current dst))
      ((> (string-length (car src)) maxl)
        (iter () (cons (reverse current) dst) src orimaxl orimaxl))
      (#t
        (iter (cons (car src) current) dst (cdr src) (- maxl (string-length (car src))) orimaxl))))
  (reverse (iter () () src maxl maxl)))

Name: Anonymous 2008-11-11 12:30

segment _ [] = []
segment max strs = seg : segment max rest where
    (seg,rest) = coll strs max
    coll [] _ = ([],[])
    coll (s:ss) left = let l = length s in
        if l <= left then let (a,b) = coll ss (left-l) in (s:a,b)
        else if left == max then ([s],ss)
        else ([],s:ss)

Name: Anonymous 2008-11-11 13:48

Use the Penis Language Penis.

penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis

Name: Anonymous 2008-11-11 15:42

Parse error on line 4: ``penis'', expected ``penis''

Name: Anonymous 2008-11-11 16:51

Parse error on line 4: ``penis'', expected ``vagina''

Name: Anonymous 2008-11-11 16:52

>>23
Please add brief comments. Thank you.

Name: Anonymous 2008-11-11 18:05

>>27
{- penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis penis -}

Name: Anonymous 2008-11-11 18:14

>>23
Holy fuck that looks ugly as shit

Name: Anonymous 2008-11-11 18:40

;Using SRFI 1 and SRFI 26

;Hangs if any of the strings is longer than max
(define (exercise/unsafe ss max)
  (define (p)
    (define m max)
    (lambda (s) (set! m (- m (string-length s))) (>= m 0)))
  (unfold null? (cut take-while (p) <>) (cut drop-while (p) <>) ss))

;Returns #f if any of the strings is longer than max
(define (exercise ss max)
  (define (breaker)
    (define m max)
    (lambda (s) (set! m (- m (string-length s))) (>= m 0)))
  (call-with-current-continuation
   (lambda (k)
     (unfold
      (lambda (l) (or (null? l) (and (> (string-length (car l)) max) (k #f))))
      (cut take-while (breaker) <>)
      (cut drop-while (breaker) <>)
      ss))))

>>22
() considered invoking undefined behaviour, the rest of your code considered buggy and unreadable.

Name: Anonymous 2008-11-11 19:19

>>30
rest of your code considered buggy and unreadable
Unlike yours which is beautiful

Name: Anonymous 2008-11-11 20:02

>>30
set!
ಠ_ಠ

;Hangs if any of the strings is longer than max
Duh, I know, but I wanted to keep it simple and use a minimal part of Scheme.

Name: Anonymous 2008-11-11 20:48

>>32
the sussman wouldn't've put set! in the report if he didn't think it acceptable to use in a jam.

Name: Anonymous 2008-11-11 21:40

set!
ಠ_ಠ
``viewing systems as collections of objects with local state is a powerful technique for maintaining a modular design''1

Duh, I know, but I wanted to keep it simple and use a minimal part of Scheme.
Because abstraction and building upon previous work are worthless concepts?
If you didn't have so much redundancy you wouldn't have the bug in (cons current dst).

Of course, checking if you're asked the impossible is just a nicety.

1 http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-20.html#%_sec_3.1.2
Don't change these.
Name: Email:
Entire Thread Thread List
All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode -