2015-03-04T00:06:44Z mrowe_away is now known as mrowe 2015-03-04T00:19:53Z weinholt joined #scheme 2015-03-04T00:23:45Z kongtomorrow quit 2015-03-04T00:24:14Z mrowe is now known as mrowe_away 2015-03-04T00:27:03Z kongtomorrow joined #scheme 2015-03-04T00:38:38Z adu joined #scheme 2015-03-04T00:47:47Z echo-area quit (Remote host closed the connection) 2015-03-04T00:48:37Z mrowe_away is now known as mrowe 2015-03-04T00:50:13Z jlongster quit (Ping timeout: 264 seconds) 2015-03-04T00:50:53Z mumptai quit (Ping timeout: 240 seconds) 2015-03-04T00:52:09Z xyh joined #scheme 2015-03-04T00:55:14Z pnkfelix quit (Quit: rcirc on GNU Emacs 24.3.92.1) 2015-03-04T01:03:36Z mumptai joined #scheme 2015-03-04T01:06:04Z mrowe is now known as mrowe_away 2015-03-04T01:07:46Z mrowe_away is now known as mrowe 2015-03-04T01:08:20Z Riastradh joined #scheme 2015-03-04T01:12:23Z Soft quit (Ping timeout: 240 seconds) 2015-03-04T01:20:09Z bb010g quit (Quit: Connection closed for inactivity) 2015-03-04T01:20:23Z Niac_ joined #scheme 2015-03-04T01:20:47Z Niac_ left #scheme 2015-03-04T01:25:53Z alexei___ quit (Ping timeout: 240 seconds) 2015-03-04T01:26:15Z mrowe is now known as mrowe_away 2015-03-04T01:27:34Z mrowe_away is now known as mrowe 2015-03-04T01:27:43Z Soft joined #scheme 2015-03-04T01:37:26Z oleo_ quit (Quit: Leaving) 2015-03-04T01:38:57Z oleo joined #scheme 2015-03-04T01:38:58Z oleo quit (Changing host) 2015-03-04T01:38:58Z oleo joined #scheme 2015-03-04T01:46:03Z mrowe is now known as mrowe_away 2015-03-04T01:47:26Z mrowe_away is now known as mrowe 2015-03-04T01:59:21Z bb010g joined #scheme 2015-03-04T02:05:49Z twem2 quit (Ping timeout: 252 seconds) 2015-03-04T02:05:53Z mrowe is now known as mrowe_away 2015-03-04T02:06:16Z frkout joined #scheme 2015-03-04T02:07:15Z mrowe_away is now known as mrowe 2015-03-04T02:07:49Z frkout_ joined #scheme 2015-03-04T02:11:30Z frkout quit (Ping timeout: 256 seconds) 2015-03-04T02:12:48Z twem2 joined #scheme 2015-03-04T02:14:00Z mercwithamouth joined #scheme 2015-03-04T02:15:04Z jlongster joined #scheme 2015-03-04T02:23:10Z mercwithamouth quit (Ping timeout: 272 seconds) 2015-03-04T02:25:43Z mrowe is now known as mrowe_away 2015-03-04T02:27:05Z mrowe_away is now known as mrowe 2015-03-04T02:30:41Z _Eris_ joined #scheme 2015-03-04T02:36:30Z xyh quit (Remote host closed the connection) 2015-03-04T02:39:36Z sethalves1 quit (Quit: Leaving.) 2015-03-04T02:40:26Z ASau quit (Remote host closed the connection) 2015-03-04T02:44:52Z ASau joined #scheme 2015-03-04T02:45:31Z mrowe is now known as mrowe_away 2015-03-04T02:46:54Z mrowe_away is now known as mrowe 2015-03-04T02:47:50Z jawny joined #scheme 2015-03-04T02:50:04Z jawny: So right now I keep on getting an error for my scheme function that lists off the leaves of a tree. It keeps on saying "the expected number of arguments does not match the given number expected: 1 given: 3 arguments...: #f #t 'c" for a part in my method in a cond that first check to see if the left and right subtree are not null, then redo the function but only on the left subtree 2015-03-04T02:50:28Z excelsior joined #scheme 2015-03-04T02:50:52Z jawny: Could I possibly have a parantheses in the wrong place? I'm not sure what is expecting the number of arguments: cond, and, not, null, or could it be my function itself? 2015-03-04T02:56:48Z frkout_ quit (Read error: Connection reset by peer) 2015-03-04T03:01:11Z daviid joined #scheme 2015-03-04T03:03:36Z ArneBab_ joined #scheme 2015-03-04T03:05:21Z FracV quit (Remote host closed the connection) 2015-03-04T03:05:21Z mrowe is now known as mrowe_away 2015-03-04T03:06:41Z ArneBab quit (Ping timeout: 252 seconds) 2015-03-04T03:06:45Z mrowe_away is now known as mrowe 2015-03-04T03:08:44Z turtleman_ quit (Ping timeout: 256 seconds) 2015-03-04T03:09:18Z davexunit quit (Ping timeout: 256 seconds) 2015-03-04T03:13:34Z daviid quit (Ping timeout: 245 seconds) 2015-03-04T03:19:38Z daviid joined #scheme 2015-03-04T03:25:13Z mrowe is now known as mrowe_away 2015-03-04T03:25:13Z kongtomorrow quit (Read error: Connection reset by peer) 2015-03-04T03:25:31Z kongtomorrow joined #scheme 2015-03-04T03:25:37Z aeth quit (Quit: rebooting) 2015-03-04T03:26:34Z mrowe_away is now known as mrowe 2015-03-04T03:30:29Z kongtomorrow quit 2015-03-04T03:36:15Z aeth joined #scheme 2015-03-04T03:44:08Z kongtomorrow joined #scheme 2015-03-04T03:49:01Z taylanub quit (Disconnected by services) 2015-03-04T03:49:27Z taylanub joined #scheme 2015-03-04T03:50:02Z acarrico joined #scheme 2015-03-04T03:51:26Z frkout joined #scheme 2015-03-04T03:55:02Z uber_hulk joined #scheme 2015-03-04T03:58:15Z narendraj9 joined #scheme 2015-03-04T04:02:06Z narendraj9 quit (Client Quit) 2015-03-04T04:04:44Z mrowe is now known as mrowe_away 2015-03-04T04:06:18Z mrowe_away is now known as mrowe 2015-03-04T04:10:19Z jawny quit (Ping timeout: 265 seconds) 2015-03-04T04:11:58Z kongtomorrow quit 2015-03-04T04:13:16Z aeth quit (Quit: reboot) 2015-03-04T04:14:38Z zaon quit (Ping timeout: 272 seconds) 2015-03-04T04:18:53Z aeth joined #scheme 2015-03-04T04:19:39Z aeth quit (Client Quit) 2015-03-04T04:20:35Z aeth joined #scheme 2015-03-04T04:24:46Z mrowe is now known as mrowe_away 2015-03-04T04:25:09Z badkins quit 2015-03-04T04:26:06Z mrowe_away is now known as mrowe 2015-03-04T04:26:56Z frkout quit (Remote host closed the connection) 2015-03-04T04:38:36Z {0}grant quit (Ping timeout: 246 seconds) 2015-03-04T04:42:02Z petercommand joined #scheme 2015-03-04T04:44:33Z mrowe is now known as mrowe_away 2015-03-04T04:45:56Z mrowe_away is now known as mrowe 2015-03-04T04:52:30Z ASau quit (Remote host closed the connection) 2015-03-04T04:53:16Z ASau joined #scheme 2015-03-04T04:56:44Z kongtomorrow joined #scheme 2015-03-04T04:59:28Z PinealGlandOptic joined #scheme 2015-03-04T05:01:19Z jlongster quit (Ping timeout: 244 seconds) 2015-03-04T05:04:22Z mrowe is now known as mrowe_away 2015-03-04T05:05:47Z mrowe_away is now known as mrowe 2015-03-04T05:27:09Z sethalves1 joined #scheme 2015-03-04T05:30:56Z karswell` quit (Read error: Connection reset by peer) 2015-03-04T05:31:11Z karswell` joined #scheme 2015-03-04T05:33:58Z {0}grant joined #scheme 2015-03-04T05:34:52Z mrowe is now known as mrowe_away 2015-03-04T05:37:31Z frkout joined #scheme 2015-03-04T05:41:53Z frkout quit (Ping timeout: 246 seconds) 2015-03-04T05:43:03Z frkout joined #scheme 2015-03-04T05:44:55Z kongtomorrow quit 2015-03-04T05:47:30Z frkout quit (Remote host closed the connection) 2015-03-04T05:54:29Z oleo quit (Ping timeout: 246 seconds) 2015-03-04T05:56:51Z Bahman joined #scheme 2015-03-04T05:59:08Z zadock quit (Quit: Leaving) 2015-03-04T06:00:35Z zbigniew quit (Remote host closed the connection) 2015-03-04T06:00:39Z sethalves1 quit (Quit: Leaving.) 2015-03-04T06:01:22Z mrowe_away is now known as mrowe 2015-03-04T06:03:15Z uber_hulk quit (Quit: Connection closed for inactivity) 2015-03-04T06:10:15Z Bahman quit (Ping timeout: 250 seconds) 2015-03-04T06:13:50Z mrowe is now known as mrowe_away 2015-03-04T06:15:17Z mrowe_away is now known as mrowe 2015-03-04T06:15:33Z Bahman joined #scheme 2015-03-04T06:22:16Z daviid quit (Ping timeout: 265 seconds) 2015-03-04T06:23:45Z kongtomorrow joined #scheme 2015-03-04T06:29:00Z mercwithamouth joined #scheme 2015-03-04T06:29:16Z mtakkman joined #scheme 2015-03-04T06:33:43Z mrowe is now known as mrowe_away 2015-03-04T06:35:07Z mrowe_away is now known as mrowe 2015-03-04T06:36:18Z bjz joined #scheme 2015-03-04T06:43:05Z bjz quit (Ping timeout: 256 seconds) 2015-03-04T06:45:36Z przl joined #scheme 2015-03-04T06:57:22Z mtakkman quit (Ping timeout: 245 seconds) 2015-03-04T06:58:04Z frkout joined #scheme 2015-03-04T07:02:19Z frkout quit (Ping timeout: 245 seconds) 2015-03-04T07:03:27Z mrowe is now known as mrowe_away 2015-03-04T07:04:54Z mrowe_away is now known as mrowe 2015-03-04T07:07:27Z przl quit (Ping timeout: 256 seconds) 2015-03-04T07:07:54Z emma quit (Ping timeout: 244 seconds) 2015-03-04T07:09:15Z ecthiender joined #scheme 2015-03-04T07:09:27Z wingo joined #scheme 2015-03-04T07:15:17Z zadock joined #scheme 2015-03-04T07:25:02Z hiroakip joined #scheme 2015-03-04T07:27:26Z adu quit (Quit: adu) 2015-03-04T07:30:39Z bjz joined #scheme 2015-03-04T07:32:22Z hiroakip quit (Ping timeout: 255 seconds) 2015-03-04T07:37:34Z emma joined #scheme 2015-03-04T07:39:01Z edgar-rft quit (Quit: edgar-rft) 2015-03-04T07:54:06Z mrowe is now known as mrowe_away 2015-03-04T07:59:49Z cdidd quit (Ping timeout: 255 seconds) 2015-03-04T08:07:01Z larion quit (Ping timeout: 264 seconds) 2015-03-04T08:08:34Z mrowe_away is now known as mrowe 2015-03-04T08:13:44Z przl joined #scheme 2015-03-04T08:17:17Z msgodf joined #scheme 2015-03-04T08:23:50Z mrowe is now known as mrowe_away 2015-03-04T08:24:40Z mrowe_away is now known as mrowe 2015-03-04T08:33:06Z King_Hual joined #scheme 2015-03-04T08:37:15Z stepnem joined #scheme 2015-03-04T08:38:35Z nuy_19031046 joined #scheme 2015-03-04T08:39:40Z przl quit (Ping timeout: 256 seconds) 2015-03-04T08:41:26Z nuy_19031046 quit (Remote host closed the connection) 2015-03-04T08:42:13Z nuy_19031046 joined #scheme 2015-03-04T08:42:37Z alexei___ joined #scheme 2015-03-04T08:45:14Z przl joined #scheme 2015-03-04T08:45:20Z nuy_19031046 quit (Client Quit) 2015-03-04T08:46:42Z nuy_19031046 joined #scheme 2015-03-04T08:51:56Z {0}grant quit (Read error: Connection reset by peer) 2015-03-04T08:58:05Z cdidd joined #scheme 2015-03-04T09:00:05Z nee joined #scheme 2015-03-04T09:03:12Z mrowe is now known as mrowe_away 2015-03-04T09:04:23Z mrowe_away is now known as mrowe 2015-03-04T09:04:32Z civodul joined #scheme 2015-03-04T09:06:46Z edgar-rft joined #scheme 2015-03-04T09:07:19Z FracV joined #scheme 2015-03-04T09:08:37Z FracV quit (Changing host) 2015-03-04T09:08:37Z FracV joined #scheme 2015-03-04T09:14:49Z alezost joined #scheme 2015-03-04T09:15:22Z przl quit (Ping timeout: 256 seconds) 2015-03-04T09:15:41Z deMoivre quit 2015-03-04T09:22:50Z mrowe is now known as mrowe_away 2015-03-04T09:22:58Z przl joined #scheme 2015-03-04T09:23:52Z larion joined #scheme 2015-03-04T09:24:20Z mrowe_away is now known as mrowe 2015-03-04T09:44:35Z robot-beethoven quit (Quit: ERC Version 5.3 (IRC client for Emacs)) 2015-03-04T09:46:11Z alexei___ quit (Ping timeout: 246 seconds) 2015-03-04T09:50:19Z mtakkman joined #scheme 2015-03-04T09:50:44Z przl quit (Ping timeout: 246 seconds) 2015-03-04T09:53:19Z mrowe is now known as mrowe_away 2015-03-04T09:54:30Z mrowe_away is now known as mrowe 2015-03-04T10:05:05Z mercwithamouth quit (Ping timeout: 265 seconds) 2015-03-04T10:08:15Z przl joined #scheme 2015-03-04T10:12:56Z mrowe is now known as mrowe_away 2015-03-04T10:13:23Z mtakkman quit (Ping timeout: 244 seconds) 2015-03-04T10:14:17Z mrowe_away is now known as mrowe 2015-03-04T10:15:33Z rszeno joined #scheme 2015-03-04T10:18:16Z kongtomorrow quit 2015-03-04T10:23:49Z asumu quit (Ping timeout: 255 seconds) 2015-03-04T10:32:14Z nuy_19031046 quit (Quit: Leaving) 2015-03-04T10:32:20Z rszeno quit (Ping timeout: 252 seconds) 2015-03-04T10:33:45Z mrowe is now known as mrowe_away 2015-03-04T10:40:41Z rszeno joined #scheme 2015-03-04T10:44:17Z gravicappa joined #scheme 2015-03-04T10:44:57Z mrowe_away is now known as mrowe 2015-03-04T11:12:39Z mrowe is now known as mrowe_away 2015-03-04T11:25:25Z rszeno quit (Quit: Leaving.) 2015-03-04T11:35:39Z mrowe_away is now known as mrowe 2015-03-04T11:43:37Z dmiles_akf quit (Ping timeout: 264 seconds) 2015-03-04T11:59:17Z dmiles_afk joined #scheme 2015-03-04T12:04:01Z przl quit (Ping timeout: 264 seconds) 2015-03-04T12:13:05Z mrowe is now known as mrowe_away 2015-03-04T12:14:35Z mrowe_away is now known as mrowe 2015-03-04T12:30:03Z przl joined #scheme 2015-03-04T12:33:12Z mrowe is now known as mrowe_away 2015-03-04T12:34:40Z mrowe_away is now known as mrowe 2015-03-04T12:34:59Z przl quit (Ping timeout: 256 seconds) 2015-03-04T12:35:51Z narendraj9 joined #scheme 2015-03-04T12:37:49Z edgar-rft quit (Quit: edgar-rft) 2015-03-04T12:48:32Z przl joined #scheme 2015-03-04T12:50:12Z b4283 joined #scheme 2015-03-04T12:53:07Z mrowe is now known as mrowe_away 2015-03-04T13:03:11Z davexunit joined #scheme 2015-03-04T13:14:27Z Bahman quit (Quit: Ave atque vale) 2015-03-04T13:20:15Z pnkfelix joined #scheme 2015-03-04T13:30:10Z mtakkman joined #scheme 2015-03-04T13:35:38Z turtleman_ joined #scheme 2015-03-04T13:38:02Z BossKonaSegwaY quit (Read error: Connection reset by peer) 2015-03-04T13:43:09Z mtakkman quit (Ping timeout: 244 seconds) 2015-03-04T13:49:00Z pnkfelix quit (Quit: rcirc on GNU Emacs 24.3.92.1) 2015-03-04T13:49:24Z pnkfelix joined #scheme 2015-03-04T13:59:33Z karswell` quit (Remote host closed the connection) 2015-03-04T14:04:59Z gravicappa quit (Remote host closed the connection) 2015-03-04T14:05:52Z xyh joined #scheme 2015-03-04T14:07:18Z ruuns joined #scheme 2015-03-04T14:09:00Z Ruchran joined #scheme 2015-03-04T14:09:40Z turtleman_ quit (Remote host closed the connection) 2015-03-04T14:11:04Z turtleman_ joined #scheme 2015-03-04T14:20:30Z badkins joined #scheme 2015-03-04T14:20:40Z jlongster joined #scheme 2015-03-04T14:31:26Z daviid joined #scheme 2015-03-04T14:33:21Z girrig quit (Ping timeout: 250 seconds) 2015-03-04T14:35:47Z mtakkman joined #scheme 2015-03-04T14:38:59Z narendraj9 quit (Ping timeout: 250 seconds) 2015-03-04T14:39:52Z wasamasa is now known as vms 2015-03-04T14:45:56Z oleo joined #scheme 2015-03-04T14:45:56Z oleo quit (Changing host) 2015-03-04T14:45:56Z oleo joined #scheme 2015-03-04T14:48:09Z mtakkman quit (Ping timeout: 256 seconds) 2015-03-04T14:48:43Z adu joined #scheme 2015-03-04T14:51:22Z zaon joined #scheme 2015-03-04T14:51:46Z przl quit (Ping timeout: 272 seconds) 2015-03-04T14:55:27Z przl joined #scheme 2015-03-04T15:01:01Z narendraj9 joined #scheme 2015-03-04T15:02:58Z ecthiender quit (Quit: gotta go) 2015-03-04T15:03:34Z cmatei joined #scheme 2015-03-04T15:06:58Z hellofunk joined #scheme 2015-03-04T15:15:37Z excelsior quit (Quit: Lost terminal) 2015-03-04T15:17:28Z yosafbridge quit (Ping timeout: 245 seconds) 2015-03-04T15:22:21Z przl quit (Ping timeout: 244 seconds) 2015-03-04T15:27:13Z yosafbridge joined #scheme 2015-03-04T15:30:05Z joneshf-laptop quit (Ping timeout: 252 seconds) 2015-03-04T15:30:23Z wingo quit (Ping timeout: 240 seconds) 2015-03-04T15:31:17Z vms is now known as {{{ 2015-03-04T15:31:31Z {{{ is now known as }}} 2015-03-04T15:31:44Z }}} is now known as wasamasa 2015-03-04T15:32:17Z jawny joined #scheme 2015-03-04T15:43:37Z daviid quit (Ping timeout: 264 seconds) 2015-03-04T15:44:36Z ASau` joined #scheme 2015-03-04T15:48:02Z ASau quit (Ping timeout: 252 seconds) 2015-03-04T15:48:40Z przl joined #scheme 2015-03-04T15:51:07Z leppie quit 2015-03-04T15:52:29Z narendraj9 quit (Read error: Connection reset by peer) 2015-03-04T15:53:03Z przl quit (Ping timeout: 246 seconds) 2015-03-04T15:57:01Z leppie joined #scheme 2015-03-04T16:15:23Z sbwhitecap joined #scheme 2015-03-04T16:16:16Z larion quit (Ping timeout: 252 seconds) 2015-03-04T16:19:41Z adu quit (Quit: adu) 2015-03-04T16:21:22Z mrowe_away is now known as mrowe 2015-03-04T16:21:46Z Ruchran quit (Quit: Connection closed for inactivity) 2015-03-04T16:24:42Z narendraj9 joined #scheme 2015-03-04T16:29:37Z nee quit (Read error: Connection reset by peer) 2015-03-04T16:31:14Z mrowe is now known as mrowe_away 2015-03-04T16:42:03Z jawny quit (Ping timeout: 256 seconds) 2015-03-04T16:42:41Z sethalves1 joined #scheme 2015-03-04T16:42:52Z turtleman_ quit (Ping timeout: 265 seconds) 2015-03-04T16:44:08Z theseb joined #scheme 2015-03-04T16:47:40Z msgodf quit (Ping timeout: 272 seconds) 2015-03-04T16:49:16Z przl joined #scheme 2015-03-04T16:49:43Z gravicappa joined #scheme 2015-03-04T16:50:15Z mtakkman joined #scheme 2015-03-04T16:54:02Z przl quit (Ping timeout: 245 seconds) 2015-03-04T16:57:04Z przl joined #scheme 2015-03-04T16:58:20Z cdidd quit (Ping timeout: 256 seconds) 2015-03-04T16:59:23Z mtakkman quit (Ping timeout: 240 seconds) 2015-03-04T17:03:04Z adu joined #scheme 2015-03-04T17:03:33Z zadock quit (Quit: Leaving) 2015-03-04T17:03:34Z ecthiender joined #scheme 2015-03-04T17:03:36Z ecthiender quit (Changing host) 2015-03-04T17:03:36Z ecthiender joined #scheme 2015-03-04T17:04:39Z badkins quit (Ping timeout: 244 seconds) 2015-03-04T17:07:00Z przl_ joined #scheme 2015-03-04T17:07:41Z pnkfelix quit (Quit: rcirc on GNU Emacs 24.3.92.1) 2015-03-04T17:08:15Z shardz quit (Read error: Connection reset by peer) 2015-03-04T17:10:07Z bb010g quit (Quit: Connection closed for inactivity) 2015-03-04T17:10:28Z przl quit (Ping timeout: 272 seconds) 2015-03-04T17:11:19Z shardz joined #scheme 2015-03-04T17:11:31Z przl_ quit (Ping timeout: 256 seconds) 2015-03-04T17:13:19Z turtleman_ joined #scheme 2015-03-04T17:21:29Z narendraj9 quit (Ping timeout: 250 seconds) 2015-03-04T17:22:17Z xyh quit (Remote host closed the connection) 2015-03-04T17:24:12Z mtakkman joined #scheme 2015-03-04T17:30:11Z gf3 is now known as gf3a 2015-03-04T17:31:03Z mtakkman quit (Ping timeout: 246 seconds) 2015-03-04T17:31:57Z psy_ joined #scheme 2015-03-04T17:32:33Z turtleman_ quit (Ping timeout: 244 seconds) 2015-03-04T17:34:23Z alexei___ joined #scheme 2015-03-04T17:35:30Z Ruchran joined #scheme 2015-03-04T17:40:05Z ecthiender quit (Ping timeout: 246 seconds) 2015-03-04T17:43:42Z gf3a is now known as gf3 2015-03-04T17:46:05Z pecg joined #scheme 2015-03-04T17:51:59Z badkins joined #scheme 2015-03-04T17:54:52Z Vutral quit (Ping timeout: 245 seconds) 2015-03-04T17:55:35Z jawny joined #scheme 2015-03-04T18:02:16Z theseb quit (Quit: Leaving) 2015-03-04T18:02:54Z oleo_ joined #scheme 2015-03-04T18:05:52Z jawny quit (Quit: Leaving) 2015-03-04T18:06:02Z oleo quit (Ping timeout: 264 seconds) 2015-03-04T18:09:01Z b4283 quit (Quit: Konversation terminated!) 2015-03-04T18:09:03Z Vutral joined #scheme 2015-03-04T18:18:18Z Vutral quit (Ping timeout: 246 seconds) 2015-03-04T18:25:36Z zaon quit (Ping timeout: 256 seconds) 2015-03-04T18:30:25Z Riastradh quit (Ping timeout: 244 seconds) 2015-03-04T18:32:11Z fantazo joined #scheme 2015-03-04T18:39:20Z hiroakip joined #scheme 2015-03-04T18:43:09Z Vutral joined #scheme 2015-03-04T18:48:12Z daviid joined #scheme 2015-03-04T18:48:39Z hellofunk quit (Ping timeout: 252 seconds) 2015-03-04T18:51:13Z mtakkman joined #scheme 2015-03-04T18:56:28Z zadock joined #scheme 2015-03-04T18:56:36Z jawny joined #scheme 2015-03-04T18:56:55Z jawny: Could anyone help me out with a scheme question? 2015-03-04T18:59:26Z mtakkman quit (Ping timeout: 252 seconds) 2015-03-04T19:00:12Z flebron joined #scheme 2015-03-04T19:00:15Z flebron left #scheme 2015-03-04T19:04:02Z girrig joined #scheme 2015-03-04T19:05:38Z pjdelport: jawny: You don't have to ask to ask, just ask. :) 2015-03-04T19:07:13Z turtleman_ joined #scheme 2015-03-04T19:08:28Z zaon joined #scheme 2015-03-04T19:08:29Z jawny: So right now (in scheme) I'm trying to create a recursive function to list the leaves in a tree. I have a conditional statement set up that first checks to see if the current node is a leaf, then if the current node has both trees, then if the current node just has a left tree, and then if the current node just has a right tree. The issue that I'm running into is that my code keeps on returning just one leaf. I'm guessing this means that it travels down the t 2015-03-04T19:08:29Z jawny: ree, finds a leaf, and then stops without going back up the tree. I think I might have to re-order my statements in cond, or change what it does when a node has 2 subtrees, but I'm not sure what to do. 2015-03-04T19:08:54Z gravicappa quit (Ping timeout: 272 seconds) 2015-03-04T19:14:24Z vraid: jawny: do you want it to traverse the tree linearly, or in a branching way? 2015-03-04T19:14:30Z vraid: i'll assume linearly 2015-03-04T19:15:14Z oleo_ quit (Quit: Leaving) 2015-03-04T19:17:34Z oleo joined #scheme 2015-03-04T19:17:34Z oleo quit (Changing host) 2015-03-04T19:17:34Z oleo joined #scheme 2015-03-04T19:18:13Z ecthiender joined #scheme 2015-03-04T19:18:26Z jawny: http://pastebin.com/vy3gRyKV 2015-03-04T19:18:28Z githogori quit (Ping timeout: 244 seconds) 2015-03-04T19:18:30Z ecthiender quit (Changing host) 2015-03-04T19:18:30Z ecthiender joined #scheme 2015-03-04T19:19:53Z alexei___ quit (Ping timeout: 240 seconds) 2015-03-04T19:23:16Z larion joined #scheme 2015-03-04T19:27:10Z kongtomorrow joined #scheme 2015-03-04T19:29:17Z fantazo quit (Ping timeout: 246 seconds) 2015-03-04T19:30:17Z fantazo joined #scheme 2015-03-04T19:35:24Z Riastradh joined #scheme 2015-03-04T19:41:04Z jlongster quit (Remote host closed the connection) 2015-03-04T19:41:04Z jlongste` joined #scheme 2015-03-04T19:41:07Z jlongste` quit (Remote host closed the connection) 2015-03-04T19:41:39Z jawny left #scheme 2015-03-04T19:41:44Z jlongster joined #scheme 2015-03-04T19:43:43Z edgar-rft joined #scheme 2015-03-04T19:44:48Z ovenpasta joined #scheme 2015-03-04T19:59:02Z mrowe_away is now known as mrowe 2015-03-04T20:04:38Z turtleman_ quit (Ping timeout: 246 seconds) 2015-03-04T20:06:00Z vraid quit (Ping timeout: 244 seconds) 2015-03-04T20:07:39Z ovenpasta quit (Quit: Sto andando via) 2015-03-04T20:08:44Z mrowe is now known as mrowe_away 2015-03-04T20:13:46Z ecthiender quit (Ping timeout: 255 seconds) 2015-03-04T20:15:52Z pecg quit (Quit: WeeChat 1.1.1) 2015-03-04T20:16:07Z hiroakip quit (Ping timeout: 250 seconds) 2015-03-04T20:21:47Z Ruchran quit (Quit: Connection closed for inactivity) 2015-03-04T20:22:59Z joneshf-laptop joined #scheme 2015-03-04T20:26:59Z z0d: I realized that you can embed procedure definitions to arbitrary depths 2015-03-04T20:27:57Z LeoNerd: Mmhm :) 2015-03-04T20:28:10Z z0d: never knew that 2015-03-04T20:39:17Z mtakkman joined #scheme 2015-03-04T20:40:39Z poucet quit (Remote host closed the connection) 2015-03-04T20:46:33Z alezost quit (Quit: I use GNU Guix ) 2015-03-04T20:47:27Z mtakkman quit (Ping timeout: 252 seconds) 2015-03-04T20:49:05Z mrowe_away is now known as mrowe 2015-03-04T20:52:34Z juanfra quit (Quit: juanfra) 2015-03-04T21:00:23Z alexei___ joined #scheme 2015-03-04T21:01:18Z ijp joined #scheme 2015-03-04T21:01:25Z fantazo quit (Quit: Verlassend) 2015-03-04T21:01:55Z juanfra joined #scheme 2015-03-04T21:02:18Z bjz quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…) 2015-03-04T21:04:35Z davexunit quit (Quit: Later) 2015-03-04T21:09:44Z Riastradh quit (Ping timeout: 246 seconds) 2015-03-04T21:13:33Z mrowe is now known as mrowe_away 2015-03-04T21:14:06Z juanfra quit (Quit: juanfra) 2015-03-04T21:16:48Z juanfra joined #scheme 2015-03-04T21:16:56Z ASau` is now known as ASau 2015-03-04T21:19:32Z Isp-sec joined #scheme 2015-03-04T21:22:53Z vraid joined #scheme 2015-03-04T21:41:10Z badkins quit 2015-03-04T21:48:59Z taylanub: z0d: if you mean (define (foo) (define (bar) ...) ...), then that's just a shortcut for (define (foo) (letrec* ((bar (lambda () ...))) ...)) 2015-03-04T21:49:26Z taylanub: `define' forms at the top-level are magic, all others are just sugar for letrec* 2015-03-04T21:50:24Z taylanub: (though the top-level ones also behave like letrec*. it's just that you can have expressions that don't bind anything between them.) 2015-03-04T21:51:22Z kongtomorrow quit 2015-03-04T22:00:50Z z0d: taylanub: yeah, but you can also do (define (foo) (define (bar) (define (baz).....) 2015-03-04T22:00:58Z z0d: I thought you can only go 1 level deep 2015-03-04T22:00:59Z badkins joined #scheme 2015-03-04T22:01:44Z taylanub: yeah, it's just a letrec* in a letrec* :) 2015-03-04T22:07:51Z davexunit joined #scheme 2015-03-04T22:09:35Z adu quit (Ping timeout: 252 seconds) 2015-03-04T22:09:59Z jawny joined #scheme 2015-03-04T22:14:11Z ski: jawny : (a) did you mean to include `(list (car bt))' as a condition in the `and' in the first clause of `cond' ? (b) you haven't defined your notion of "tree" (c) i see no use of `cons' or `append' or similar 2015-03-04T22:16:31Z jawny: ski: (a) I did not mean to include (list (car bt) as a condition in and in the first clause. What I want is that if the node has no subtrees (and (null? (cadr bt)) (null? (caddr bt)) then car the bt (value of node) and put it into a list 2015-03-04T22:16:38Z yukko quit (Quit: leaving) 2015-03-04T22:17:13Z jawny: ski: (b) how do I define the notion of tree? Should I make a new function tree and define it as something having two subtrees? 2015-03-04T22:17:20Z ski: (a) so you're missing a pair of brackets 2015-03-04T22:17:49Z jawny: ski: (c) I had cons or append earlier, I might have taken them out 2015-03-04T22:18:02Z ski: define as in either describe what counts as a tree in words. you could use some formal notation like BNF, if you prefer 2015-03-04T22:19:13Z jawny: ski: so describe it as a context free grammar in bnf form? 2015-03-04T22:19:23Z ski: (you could do this with or without `append'. if you do it without, the simplest would be to use `cons' with an accumulator) 2015-03-04T22:19:31Z ski: that's one possibility 2015-03-04T22:19:49Z ski: since atm, it's not clear what counts as the possible shape(s) of a tree 2015-03-04T22:20:08Z ski: (perhaps it's clear to you. but it's not clear to us, at least not to me) 2015-03-04T22:20:18Z jawny: ski: cool, the assignment calls for the output to be (if c f e were leaves) then the ans: (c f e) 2015-03-04T22:21:23Z jawny: ski: this is for a binary tree, '(a (b (c () ()) (d () (f () ()))) (e () ()))) for example 2015-03-04T22:21:48Z ijp errors 2015-03-04T22:21:54Z jawny: ski: so each node in the tree has at most 2 children 2015-03-04T22:22:34Z jawny: ski: how do I fix the brackets for the first argument in cond? 2015-03-04T22:22:40Z vraid: ijp: you need a more argumentative if 2015-03-04T22:23:30Z ski: jawny : make `(list (car bt))' not a parameter to `and' 2015-03-04T22:24:21Z ski: (oh, sorry. not missing a pair of brackets. you just need to move one) 2015-03-04T22:24:35Z jawny: ski: I'm dong this in dr.racket, and I believe in dr.racket it highlights what the brackets are a part of 2015-03-04T22:24:56Z ski: jawny : anyway, what should the answer to the following expression be : (listleaves '()) 2015-03-04T22:24:59Z ski: jawny : yes 2015-03-04T22:26:03Z mrowe_away is now known as mrowe 2015-03-04T22:26:04Z jawny: ski: i get an error for (listleaves '() ) error: cadr: contract violation expected: (cons/c any/c pair?) give: '() 2015-03-04T22:26:22Z ski: yes 2015-03-04T22:26:38Z ski: did you intend to handle this or not ? 2015-03-04T22:26:54Z ski: (i can't tell since you haven't told us the full definition of what a tree is) 2015-03-04T22:28:22Z jawny: ski: oh whoops, I forgot about handling empty sets, i read the assignment wrong and thought that our prof said we didn't have to 2015-03-04T22:28:51Z jawny: ski: and would defining a tree as "a binary tree, where each node can have at most two children, with there at least being one root node" works as a definition? 2015-03-04T22:29:02Z jawny: ski: *their 2015-03-04T22:29:16Z jawny: ski: lol whoops sorry still the wrong there 2015-03-04T22:31:01Z ski: jawny : it's not clear how "tree" differs from "node" here (does it differ ?) 2015-03-04T22:32:27Z jawny: ski: I'm gonna go ahead and say no, a single node can just be seen as a tree with two empty subtrees 2015-03-04T22:32:30Z ski: (also, it's not clear from that definition what it means for the tree to have one child. if there is a list of children, then presumably there's only one way for this to happen. but your example suggested otherwise) 2015-03-04T22:32:50Z ski: jawny : so an empty subtree is a node ? 2015-03-04T22:33:19Z jawny: ski: no 2015-03-04T22:33:37Z adu joined #scheme 2015-03-04T22:33:47Z ski: i thought an empty subtree had to be a tree. .. and you said there was no difference between trees and nodes 2015-03-04T22:33:57Z jawny: ski: I'm not really sure how to define a tree in good technical writing. The input just has to be a binary tree. 2015-03-04T22:35:04Z jawny: ski: Ah, ok. An empty subtree doesn't have to be a tree, and what I meant was that a single node can be seen as a tree that has no subtrees, ex: (c () ()), c is the root node and it has two empty subtrees () () 2015-03-04T22:35:13Z ski: you could try something like this : list each basic case/shape of a tree. for each such, detail how it is structured, including describing what kinds of things its parts are required to be (and perhaps how they're required to relate to each other, if necessary) 2015-03-04T22:36:45Z ski thinks it would be weird terminology to not include "empty subtrees" amongst the trees 2015-03-04T22:36:56Z jawny: ski: I'm so sorry for the confusion, I've never really been asked to formally define a common data structure, like a bt, for my program. Is this something that's required outside of school? 2015-03-04T22:37:44Z paroneayea joined #scheme 2015-03-04T22:38:22Z jawny: ski: Also, I found a definition: Each node is a 3 element list (symbol, lefttree, right tree). The empty tree is simply the empty list (). 2015-03-04T22:39:03Z ski: you don't *need* to *formally* define it (we've not attempted to do this here). but you need to know what counts as a tree and what doesn't. you need to delineate the concept clearly enough, even if only in your mind (though i hear this kind of stuff is good to put in your documentation) 2015-03-04T22:39:50Z ski: jawny : if you complete that with "a tree is either a node or an empty tree", then it suffices here i think 2015-03-04T22:40:43Z jawny: ski: so would the definition: Each node is a 3 elt list (symbol, leftsubt, rightsubt). The empty tree is simply the empty list (), and a tree can either be a singular node or an empty tree. 2015-03-04T22:41:17Z jawny: ski: Even though this isn't needed for my assignment at all, I really appreciate doing this I feel like doing this kind of stuff is useful for future code and coming up with better documentation. 2015-03-04T22:41:25Z jawny: ski: so thanks! 2015-03-04T22:42:14Z ski: (i would skip the commas in the list, btw) 2015-03-04T22:43:03Z kongtomorrow joined #scheme 2015-03-04T22:43:07Z jawny: ski: (i dont have commas in the actual lists, I just have them for the def) Now for my program, is it possible to do what I want all recursively in a single function? Or would I need a helper function to keep track of the nodes that were already visited? 2015-03-04T22:43:08Z ski: jawny : anyway, since now apparently the empty tree is a tree, perhaps you should fix `listleaves' to operate correctly on it ? 2015-03-04T22:43:26Z jawny: ski: sweet, thanks I'll do that! 2015-03-04T22:43:43Z ski: (btw, if you do this properly. you should be able to simplify the rest of `listleaves' so that it looks much simpler and clearer) 2015-03-04T22:45:20Z ski: (yeah, i gathered you didn't have commas in your actual lists. it's just that it looks confusing to use them in the definition, and then not use them in the actual code that is supposed to adher to the definition. .. of course, now that i think of it, it could be that you didn't intend that as a Scheme list) 2015-03-04T22:47:04Z ski: jawny : trees are per definition acyclic, and have no shared parts, so i don't see why we would need to keep track of already visited nodes (unless you were planning to move/jump around in the tree more or less at random, while enumerating the leaves) 2015-03-04T22:48:40Z ski: jawny : you can do it all recursively in a single function. it's also possible to do it with a helper (and doing it that way is nothing to be ashamed of). in this case (depending on how you do it exactly, obviously), the one with the helper would probably be more efficient (like, a lot, for large trees) 2015-03-04T22:48:46Z jawny: ski: ok, cool that tells me then i could do all of it in a single function 2015-03-04T22:49:26Z jawny: ski: nice, i might try to do it with a helper function later on but for now I really want to try to do it recursively 2015-03-04T22:49:37Z ski: (but it's ok to start with the most immediate solution (that works correctly), and then perhaps consider how it could possibly be made more efficient, if need be) 2015-03-04T22:49:54Z jawny: ski: so that I could get a better feel for recursion, or as my prof says ,"to put my recursive thinking cap on" 2015-03-04T22:50:03Z ski: (btw, both solutions i were thinking about would be recursive) 2015-03-04T22:50:11Z jawny: ski: ah ok 2015-03-04T22:50:40Z ski: (you should not need to use mutation anywhere for this) 2015-03-04T22:50:40Z jawny: ski: so I know that if both subtrees are null, then i should add the contents of the node to the list 2015-03-04T22:50:50Z jawny: ski: but im not sure what to do when both subtrees exist 2015-03-04T22:51:04Z ski: recursion ? 2015-03-04T22:51:09Z ski: btw, another thing : 2015-03-04T22:51:11Z jawny: ski: before i had it so that it would call listleaves on the left subtree 2015-03-04T22:51:17Z jawny: but in the end i would only get the leftmost leaf 2015-03-04T22:52:04Z ski: instead of writing `car',`cadr',`caddr' (and `null?') all over the place, i suggest you define custom renamed versions of those, that better express the *intent* you use those for in here 2015-03-04T22:52:42Z ski: e.g., instead of `car' here, you could name it `node->element' 2015-03-04T22:52:55Z jawny: make sense, i find that typing cadr caddr over and over makes me mess up my parantheses 2015-03-04T22:53:25Z ski: it's harder to recall all the time what `cadr' meant 2015-03-04T22:54:48Z ski: also, if you ever refactor your data-structure, perhaps adding some extra thing like a count of nodes in the tree, or the maximum depth, &c., then perhaps `cadr' will mean the element -- if you use a new name `node->element' that expresses the intent, then you only have to change the definition of that (and the other operations which are aware of the actual representation) 2015-03-04T22:55:43Z ski: therefore, when you construct a node (or empty tree), it's probably also better to use a custom operation for this, rather than using `list' or `cons' or whatever direct construction you're using 2015-03-04T22:57:09Z jawny: ah ok 2015-03-04T22:57:14Z ski: (and you should pay attention to the bracket highlighting in your editor, to make sure that things are bracketed correctly. also don't be afraid of splitting complex expressions over multiple lines (indented correctly, of course). e.g. for the complex clauses in your `cond', i'd write the condition and the body on separate lines) 2015-03-04T22:57:26Z jawny: I'm gonna save all of your advice for future reference, again thanks so much 2015-03-04T22:57:32Z mrowe is now known as mrowe_away 2015-03-04T22:58:03Z ski: (if had done that, you'd noticed the error in the first clause immediately, assuming your editor auto-indented to the correct level when you broke the line) 2015-03-04T22:58:34Z ski: ski: before i had it so that it would call listleaves on the left subtree 2015-03-04T22:58:43Z ski: you need to handle the right subtree as well, yes 2015-03-04T22:59:24Z vdamewood joined #scheme 2015-03-04T23:00:25Z jawny: ski: would it be possible to call list leaves on both the right and left subtree in the body? 2015-03-04T23:01:02Z ski: why not ? 2015-03-04T23:02:10Z jawny: ski: ah ok, so it is totally possible. Now would I do it by saying (listleaves (and (...))) or should I call listleaves twice? 2015-03-04T23:02:53Z jawny: ski: as in listleaves() listleaves() 2015-03-04T23:02:53Z cdidd joined #scheme 2015-03-04T23:04:04Z ski: what would `(and (...))' be exactly ? 2015-03-04T23:04:30Z jawny: (listleaves (and (leftsubt bt) (rightsubt bt))) 2015-03-04T23:05:17Z ski: most commonly, `and' is used to combine booleans (aka truth values) 2015-03-04T23:05:23Z jawny: ah ok 2015-03-04T23:05:30Z jawny: as in if both are true? 2015-03-04T23:05:41Z ski: in Scheme, anything that is not the false value `#f' is considered *a* true value 2015-03-04T23:06:00Z LeoNerd: Even the number zero, the empty string, and the empty list 2015-03-04T23:06:14Z jawny: Dang you guys are the most helpful 2015-03-04T23:06:22Z jawny: I'm swearing by irc all the time now 2015-03-04T23:06:54Z jawny: ski: also ski thank you so much, my program works now 2015-03-04T23:07:10Z jawny: ski: and I have gained a better understanding of scheme, I am forever grateful 2015-03-04T23:07:18Z fds: #scheme is exceptionally good. Don't expect all channels to be like this. ;-) 2015-03-04T23:07:27Z jawny: you guys are great 2015-03-04T23:07:59Z ski: this means that in `(and a b)', if `a' is `#f', the expression will compute to that. otherwise it will compute `b', and result in the same value as that (which may be the false value `#f', or it may be a true value like `#t' or `0' or `(2 (3 () ()) ())', &c.) 2015-03-04T23:08:07Z civodul quit (Quit: ERC Version 5.3 (IRC client for Emacs)) 2015-03-04T23:08:09Z jawny: i'll now keep in mind to pay more attention to my parantheses too, since i was actually very close to solving the answer, i just had parantheses in the wrong spots but didnt realize it because i didnt break up my cond in separate lines and etc 2015-03-04T23:08:21Z jawny: ahh ok! 2015-03-04T23:08:31Z Isp-sec quit (Ping timeout: 256 seconds) 2015-03-04T23:09:08Z ski: in your case, `(leftsubt bt)' and `(rightsubt bt)' return the left and right subtrees of a node `bt', and since according to your definition a tree can't be the false value `#f', they'd always be considered "true" values 2015-03-04T23:09:38Z jawny: ski: the only issue i have now is that my program returns '(c () f e) and I should have the extra (), but i feel like thats a small fix 2015-03-04T23:09:42Z jawny: ski: ah ok, thanks! 2015-03-04T23:09:48Z ski: so `(and (leftsubt bt) (rightsubt bt))' would always result in the same value as `(rightsubt bt)' (ignoring nontermation, and possible side-effects of evaluating `(leftsubt bt)') 2015-03-04T23:10:07Z githogori joined #scheme 2015-03-04T23:10:09Z ski: .. iow, probably not what you want 2015-03-04T23:10:18Z ski: (right ?) 2015-03-04T23:10:27Z badkins quit 2015-03-04T23:10:39Z jawny: right! 2015-03-04T23:11:08Z jawny: I solved my issue by instead of using and, I used append instead 2015-03-04T23:11:20Z ski: every bracket in Scheme (and Lisps in general) is (are) meaningful. there is no "bracket for grouping" here 2015-03-04T23:12:04Z ski: (also, saying `listleaves()' is a habit from $OTHER_LANGUAGES, that looks strange in a Lispy context, like here) 2015-03-04T23:12:32Z Riastradh joined #scheme 2015-03-04T23:13:19Z ski: (the correct way in Scheme would be `(listleaves) (listleaves)' (assuming no parameters), or `(listleaves ...) (listleaves ...)' if you don't want to detail the actual arguments here) 2015-03-04T23:13:52Z jawny: Ah, ok. So don't do listleaves() (a habit from java), but instead '(listleaves...) 2015-03-04T23:14:51Z ski: jawny : perhaps you could paste your most recent version, possibly at the nice paste site mentioned in the topic ? 2015-03-04T23:15:10Z ski: (i'm curious about how you used `append' instead of `and') 2015-03-04T23:17:02Z jawny: ski: sure! 2015-03-04T23:17:04Z ski: (hm, actually it looks like the page at link in the topic doesn't work correct atm (at least here). you could try instead) 2015-03-04T23:18:07Z ski: (.. probably related to the fact that the lisppaste bot hasn't been working for some while, and therefore the automatic channel announcement doesn't work ? .. still, it's a nice paste site) 2015-03-04T23:19:39Z jawny: ski: http://paste.lisp.org/display/146069 2015-03-04T23:21:56Z jawny: ski: the only issue is that for the example list I have (which I should have included into the paste, sorry), (a (b (c () () ) (d () (f () () ) ) ) (e () () ) ) ), entered into the program returns '(c () f e), I dont want () in the answer, just '(c f e), but I'm sure i can figure it out 2015-03-04T23:25:20Z ski: the bodies of the last two clauses are incorrectly indented 2015-03-04T23:26:50Z ski: (btw, you might be interested in taking a look at ) 2015-03-04T23:27:25Z jawny: for my cond? and thanks! 2015-03-04T23:29:04Z ski: i don't see why you have `rightsubt',`leftsubt',`contents' for the empty tree. just make it handle nodes ? (that way, if you mistakenly pass an empty tree, you'll get an error message that is closer to the logical error, as opposed to these operations silently returning some more or less silly results, which might get propagated in several steps before it is detected that something is amiss) 2015-03-04T23:30:25Z ski: (also, i'd replace your uses of `null?' with something like `empty-tree?' or `tree-node?' (or both). for the same reason(s) as avoiding `car',`cadr',`caddr' above) 2015-03-04T23:30:37Z jawny: ah ok 2015-03-04T23:30:58Z jawny: and yeah ill change that i feel like those were the culprits for my ans being '(c () f e) instead of '(c f e) 2015-03-04T23:31:07Z ski: (your uses in the derived operation `listleaves', that is supposed to not know anything about the actual representations of empty trees and tree nodes, i.e.) 2015-03-04T23:32:58Z ski: last but not least, one problem in your code might be that your second clause guard covers all cases that the first doesn't cover (assuming no intermediate mutation by intermediate calls or other threads), and so your last two clauses are never reached 2015-03-04T23:33:50Z ski: (that's actually the first potential problem i spotted, a while ago) 2015-03-04T23:35:07Z ski: (btw, if you want to provide an updated version of your paste, instead of making a new paste, just *Annotate* the existing one. the update will appear on the same page) 2015-03-04T23:36:30Z mrowe_away is now known as mrowe 2015-03-04T23:40:25Z jlongster quit (Ping timeout: 244 seconds) 2015-03-04T23:46:12Z mrowe is now known as mrowe_away