<d_bot_>
<danchro> Hi, I'm trying to write code that would return a list of lists containing a powerset of the original list. Does anyone have an idea for the thought process/algorithm behind such a function ?
<d_bot_>
<nave01314> hint: recursion
<d_bot_>
<nave01314> Also #beginners
rgrinberg has joined #ocaml
rgrinberg has quit [Ping timeout: 252 seconds]
hackinghorn has quit [Ping timeout: 256 seconds]
hackinghorn has joined #ocaml
Haudegen has quit [Ping timeout: 260 seconds]
hackhorn has joined #ocaml
hackinghorn has quit [Ping timeout: 240 seconds]
motherfsck has quit [Ping timeout: 256 seconds]
hackhorn has quit [Ping timeout: 240 seconds]
hackinghorn has joined #ocaml
tizoc has quit [Quit: Coyote finally caught me]
gravicappa has joined #ocaml
tizoc has joined #ocaml
dmbaturin has quit [Ping timeout: 245 seconds]
dmbaturin has joined #ocaml
waleee has quit [Ping timeout: 260 seconds]
dmbaturin has quit [Ping timeout: 256 seconds]
dmbaturin has joined #ocaml
rgrinberg has joined #ocaml
berberman_ is now known as berberman
<d_bot_>
<danchro> What about defining a binary tree with operators as the internal nodes and leaves as numbers?
hackinghorn has quit [Ping timeout: 240 seconds]
hackinghorn has joined #ocaml
motherfsck has joined #ocaml
motherfsck has quit [Quit: quit]
benthumb2000 has joined #ocaml
zebrag has quit [Quit: Konversation terminated!]
mbuf has joined #ocaml
zebrag has joined #ocaml
zebrag has quit [Quit: Konversation terminated!]
hackhorn has joined #ocaml
hackinghorn has quit [Read error: Connection reset by peer]
hackhorn is now known as hackinghorn
rgrinberg has quit [Quit: My MacBook has gone to sleep. ZZZzzz…]
hackhorn has joined #ocaml
hackinghorn has quit [Ping timeout: 256 seconds]
hackinghorn has joined #ocaml
hackhorn has quit [Read error: Connection reset by peer]
rgrinberg has joined #ocaml
vicfred has joined #ocaml
benthumb2000 has quit [Quit: WeeChat 3.3]
rgrinberg has quit [Quit: My MacBook has gone to sleep. ZZZzzz…]
mbuf has quit [Quit: Leaving]
wyrd has quit [Ping timeout: 240 seconds]
hackinghorn has quit [Ping timeout: 272 seconds]
wyrd has joined #ocaml
luna2021 has joined #ocaml
Haudegen has joined #ocaml
luna2021 has quit [Client Quit]
Serpent7776 has joined #ocaml
kaph_ has joined #ocaml
kaph has quit [Ping timeout: 256 seconds]
kakadu has joined #ocaml
bobo has joined #ocaml
spip has quit [Ping timeout: 272 seconds]
dextaa_ has quit [Remote host closed the connection]
Enjolras has quit [Remote host closed the connection]
dextaa_ has joined #ocaml
bartholin has joined #ocaml
bartholin has quit [Ping timeout: 272 seconds]
bartholin has joined #ocaml
salkin has joined #ocaml
gjvc has joined #ocaml
Tuplanolla has joined #ocaml
salkin has quit [Quit: salkin]
Everything has joined #ocaml
bartholin has quit [Ping timeout: 240 seconds]
bartholin has joined #ocaml
<companion_cube>
@danchro: you can recurse on the list, and for each element, consider the subset of the powerset that contains it; and the subset that doesn't
kaph_ has quit [Ping timeout: 272 seconds]
kaph has joined #ocaml
lobo has quit [Quit: lobo]
<d_bot_>
<Kakadu> Folks, do you know any libraries to parse unified diffs?
lobo has joined #ocaml
hackinghorn has joined #ocaml
Everything has quit [Quit: leaving]
bartholin has quit [Ping timeout: 240 seconds]
bartholin has joined #ocaml
mro has joined #ocaml
kakadu has quit [Remote host closed the connection]