Newest at the top
| 2026-03-03 17:47:49 +0100 | acidjnk_new3 | (~acidjnk@p200300d6e700e523af5c13a8fba9f168.dip0.t-ipconnect.de) (Ping timeout: 245 seconds) |
| 2026-03-03 17:47:15 +0100 | <gentauro> | durstloescher: I have provided `insert`. It's up to the reader to implement the `delete` logic for the `RB-Trees` (muahahaha) |
| 2026-03-03 17:46:29 +0100 | <gentauro> | durstloescher: here I use it (RB-Tree) for my `Set`. It can easily be used to create `Map` as well (just provide a tuple pair) -> https://paste.tomsmeding.com/K9QzYIJM |
| 2026-03-03 17:46:03 +0100 | akegalj | (~akegalj@78-1-128-213.adsl.net.t-com.hr) (Quit: leaving) |
| 2026-03-03 17:45:41 +0100 | <durstloescher> | thank you all i'll look into the book and try the provided code snippet <3 |
| 2026-03-03 17:43:58 +0100 | <gentauro> | I think ACM now is free to read iirc |
| 2026-03-03 17:43:38 +0100 | <gentauro> | durstloescher: I would highly recommend you to read Okasaki Functional Pearl "Red-Black Trees in a Functional Setting" |
| 2026-03-03 17:43:04 +0100 | tmu | (~tmu@71.227.230.155) |
| 2026-03-03 17:40:31 +0100 | jtnuttall | (~jeremy@user/jeremyn) (Ping timeout: 264 seconds) |
| 2026-03-03 17:39:30 +0100 | Googulator46 | (~Googulato@2a01-036d-0106-0119-2546-5dd3-b1b8-39cd.pool6.digikabel.hu) |
| 2026-03-03 17:39:06 +0100 | Googulator46 | (~Googulato@2a01-036d-0106-0119-2546-5dd3-b1b8-39cd.pool6.digikabel.hu) (Quit: Client closed) |
| 2026-03-03 17:37:14 +0100 | <EvanR> | the last k2 should be k1 of course, typo! not enough coffee |
| 2026-03-03 17:36:27 +0100 | <EvanR> | (for the case of an infinite tree with all branches) |
| 2026-03-03 17:35:32 +0100 | <EvanR> | durstloescher, search k1 (Branch k2 v l r) = case compare k1 k2 of {EQ -> v; LT -> search k1 l; GT -> search k2 r} |
| 2026-03-03 17:30:09 +0100 | humasect | (~humasect@dyn-192-249-132-90.nexicom.net) (Remote host closed the connection) |
| 2026-03-03 17:20:43 +0100 | tromp | (~textual@2001:1c00:3487:1b00:bca6:b25a:741d:ca28) |
| 2026-03-03 17:18:47 +0100 | humasect | (~humasect@dyn-192-249-132-90.nexicom.net) humasect |
| 2026-03-03 17:14:58 +0100 | pavonia | (~user@user/siracusa) (Quit: Bye!) |
| 2026-03-03 17:09:18 +0100 | chromoblob | (~chromoblo@user/chromob1ot1c) (Ping timeout: 255 seconds) |
| 2026-03-03 17:07:41 +0100 | durstloescher | (~textual@ip4d16b23b.dynamic.kabel-deutschland.de) |
| 2026-03-03 17:05:06 +0100 | chromoblob | (~chromoblo@user/chromob1ot1c) chromoblob\0 |
| 2026-03-03 17:01:45 +0100 | chexum | (~quassel@gateway/tor-sasl/chexum) chexum |
| 2026-03-03 17:01:17 +0100 | chexum | (~quassel@gateway/tor-sasl/chexum) (Remote host closed the connection) |
| 2026-03-03 16:58:09 +0100 | elainedastolat | (~m@2804:3d14:4b:de00:b20e:16f9:f4d1:21e4) (Quit: Leaving) |
| 2026-03-03 16:54:45 +0100 | chromoblob | (~chromoblo@user/chromob1ot1c) (Ping timeout: 245 seconds) |
| 2026-03-03 16:51:45 +0100 | misterfish | (~misterfis@31-161-39-137.biz.kpn.net) (Ping timeout: 246 seconds) |
| 2026-03-03 16:49:49 +0100 | durstloescher | (~textual@ip4d16b23b.dynamic.kabel-deutschland.de) (Quit: My Mac has gone to sleep. ZZZzzz…) |
| 2026-03-03 16:49:24 +0100 | tromp | (~textual@2001:1c00:3487:1b00:9536:a446:6cb6:b101) (Quit: My iMac has gone to sleep. ZZZzzz…) |
| 2026-03-03 16:48:55 +0100 | <haskellbridge> | ... long message truncated: https://kf8nh.com/_heisenbridge/media/kf8nh.com/myBmmoOKFntttTPQmkgsqoPc/QzDiwyVIkO4 (3 lines) |
| 2026-03-03 16:48:55 +0100 | <haskellbridge> | <ijouw> Yes, (:) is the constructor for lists. You need the one for trees. |
| 2026-03-03 16:48:30 +0100 | elainedastolat | (~m@2804:3d14:4b:de00:b20e:16f9:f4d1:21e4) |
| 2026-03-03 16:48:05 +0100 | <c_wraith> | Do you have a specific example to work with, or just exploring the idea more generally? |
| 2026-03-03 16:46:14 +0100 | <c_wraith> | So you should be starting with the data definition, and the constructors within |
| 2026-03-03 16:46:00 +0100 | <c_wraith> | Ah, true. Matching is done against the constructors for the data type. |
| 2026-03-03 16:45:28 +0100 | <durstloescher> | my intuition says i just use (x:xs) but trees are no lists |
| 2026-03-03 16:45:07 +0100 | <durstloescher> | i don't understand how i can "get" the value and how to proceed with the next node |
| 2026-03-03 16:44:39 +0100 | <durstloescher> | i know the concept but i'm not comfortable with the use of pattern matching in this topic |
| 2026-03-03 16:43:28 +0100 | <c_wraith> | (There's nothing particularly special about Haskell for binary trees, at least in the context of immutable data structures.) |
| 2026-03-03 16:42:24 +0100 | <c_wraith> | How comfortable are you with binary trees in general? |
| 2026-03-03 16:41:56 +0100 | <durstloescher> | hey can someone explain binary trees in haskell to me? |
| 2026-03-03 16:41:08 +0100 | durstloescher | (~textual@ip4d16b23b.dynamic.kabel-deutschland.de) |
| 2026-03-03 16:35:14 +0100 | jreicher | (~joelr@user/jreicher) jreicher |
| 2026-03-03 16:34:04 +0100 | jreicher | (~joelr@user/jreicher) (Read error: Connection reset by peer) |
| 2026-03-03 16:22:10 +0100 | machinedgod | (~machinedg@d172-219-48-230.abhsia.telus.net) machinedgod |
| 2026-03-03 16:16:11 +0100 | gentauro | however, I DO run my `ghci` with stack -> `stack ghci` |
| 2026-03-03 16:15:47 +0100 | <gentauro> | kind of strainge tbh |
| 2026-03-03 16:15:43 +0100 | <gentauro> | __monty__: Nope. That seem to work |
| 2026-03-03 16:14:49 +0100 | jtnuttall | (~jeremy@user/jeremyn) jeremyn |
| 2026-03-03 16:12:53 +0100 | misterfish | (~misterfis@31-161-39-137.biz.kpn.net) misterfish |
| 2026-03-03 16:12:08 +0100 | <__monty__> | Can you reproduce the same behavior in GHCi? |