| 00:11:03 | * | Mister_Magister quit (Quit: bye) |
| 00:13:28 | * | Mister_Magister joined #nim |
| 01:02:13 | * | _________ quit (Ping timeout: 245 seconds) |
| 01:04:10 | * | _________ joined #nim |
| 03:06:43 | * | rockcavera quit (Remote host closed the connection) |
| 04:58:51 | * | sdothum quit (Ping timeout: 259 seconds) |
| 05:14:16 | * | sdothum joined #nim |
| 05:56:01 | * | SchweinDeBurg joined #nim |
| 06:56:08 | FromDiscord | <mratsim> In reply to @.bobbbob "You can make your": I found the final form of iterators, composable iterators and iterator fusion: https://github.com/mratsim/tattletale/pull/97 |
| 07:00:51 | FromDiscord | <.bobbbob> Kewl |
| 07:06:11 | FromDiscord | <_timurski> In reply to @mratsim "I found the final": this PR is kinda opaque as to the usecase, i would be interested in seeing its advantages. if its all in the PR then say so and ill read it properly later, its late right now |
| 07:17:16 | FromDiscord | <b0rsuk> In reply to @mratsim "I found the final": Bruce Eckel is now promoting some "Stateless" library for Python, made with composable iterators. You might want to check it out. <https://thinkinginpython.com/44_Effects--Effect_Management.html> |
| 07:43:44 | * | KawaiiSelbst quit (Remote host closed the connection) |
| 07:44:55 | * | KawaiiSelbst joined #nim |
| 09:17:01 | * | beholders_eye joined #nim |
| 09:33:21 | * | insanescholar_ joined #nim |
| 10:12:30 | * | KawaiiSelbst quit (Remote host closed the connection) |
| 10:13:16 | * | KawaiiSelbst joined #nim |
| 10:31:17 | * | KawaiiSelbst quit (Remote host closed the connection) |
| 10:31:59 | * | KawaiiSelbst joined #nim |
| 11:03:07 | * | acidsys quit (Ping timeout: 249 seconds) |
| 11:25:15 | * | acidsys joined #nim |
| 11:33:04 | * | SchweinDeBurg quit (Remote host closed the connection) |
| 12:32:42 | * | insanescholar_ quit (Ping timeout: 240 seconds) |
| 13:07:18 | * | insanescholar_ joined #nim |
| 13:36:02 | * | insanescholar_ quit (Ping timeout: 266 seconds) |
| 13:44:41 | * | insanescholar_ joined #nim |
| 14:24:02 | * | insanescholar_ quit (Ping timeout: 268 seconds) |
| 14:24:09 | * | insanescholar_ joined #nim |
| 14:24:09 | * | insanescholar_ quit (K-Lined) |
| 15:28:14 | * | NimBot joined #nim |
| 15:31:55 | * | acidsys quit (Ping timeout: 254 seconds) |
| 15:32:11 | * | cornfeedhobo quit (Ping timeout: 270 seconds) |
| 15:33:02 | * | acidsys joined #nim |
| 15:44:28 | * | Jjp137 quit (Ping timeout: 273 seconds) |
| 15:50:15 | * | cornfeedhobo joined #nim |
| 15:51:55 | * | ox is now known as oz |
| 16:05:11 | * | Jjp137 joined #nim |
| 16:11:21 | * | beholders_eye quit (Ping timeout: 277 seconds) |
| 16:25:40 | * | insanescholar joined #nim |
| 16:29:02 | * | insanescholar quit (Remote host closed the connection) |
| 16:43:50 | * | PMunch joined #nim |
| 16:56:01 | * | Jjp137 quit (Ping timeout: 250 seconds) |
| 17:40:36 | * | NimBot joined #nim |
| 17:42:31 | * | cornfeedhobo quit (Ping timeout: 246 seconds) |
| 17:46:34 | * | cornfeedhobo joined #nim |
| 17:50:57 | FromDiscord | <b0rsuk> sent a long message, see https://paste.rs/6QqX7 |
| 17:52:20 | FromDiscord | <b0rsuk> But I can't make it to work. On paper, it sounds like Nim should have an efficient way to make an array-based lookup table, where each element has a `char` index and `char` value. |
| 17:52:41 | FromDiscord | <b0rsuk> sent a code paste, see https://paste.rs/WXH1P |
| 17:53:11 | FromDiscord | <b0rsuk> `/home/b0rsuk/warsztat/cwiczenia/exercism/nim/rna-transcription/rna_transcription.nim(7, 30) Error: ordinal or float type expected, but got DNA` |
| 17:53:41 | FromDiscord | <b0rsuk> Well yes compiler, you got DNA, and DNA is an enum, so it's an ordinal type, right? |
| 17:54:58 | FromDiscord | <b0rsuk> I know it's possible to make an array indexed with `a`..`s`, or any other range of enums, but I want something very specific. I want a `char` to `char` mapping. |
| 17:57:16 | FromDiscord | <b0rsuk> I've already solved [the exercise](<https://exercism.org/tracks/nim/exercises/rna-transcription>) with a `case` statement. |
| 17:57:34 | FromDiscord | <b0rsuk> (edit) "I've already solved [the exercise](<https://exercism.org/tracks/nim/exercises/rna-transcription>) with a `case` statement. ... " added "Now I'm trying to be more efficient." |
| 18:07:11 | FromDiscord | <b0rsuk> sent a code paste, see https://paste.rs/NM6ZB |
| 18:10:48 | FromDiscord | <b0rsuk> Hmm, I think it's impossible. I mean I can have `char` indexes, but they must not be sparse. There must be no gap between `A` and `C` for example. |
| 18:34:42 | * | beholders_eye joined #nim |
| 19:09:10 | * | Jjp137 joined #nim |
| 20:01:49 | * | syl quit (Quit: C-x C-c) |
| 20:03:45 | * | syl joined #nim |
| 21:10:38 | * | Jjp137 quit (Ping timeout: 245 seconds) |
| 21:16:37 | * | PMunch quit (Ping timeout: 248 seconds) |
| 21:33:50 | * | Jjp137 joined #nim |
| 21:47:11 | FromDiscord | <mratsim> sent a long message, see https://paste.rs/7s6ja |
| 21:52:55 | FromDiscord | <mratsim> In reply to @b0rsuk "Hmm, I think it's": yes you can't do it with enum with holes |
| 22:13:21 | * | Mister_Magister_ joined #nim |
| 22:14:17 | * | Mister_Magister quit (Ping timeout: 255 seconds) |
| 22:16:46 | * | Mister_Magister_ is now known as Mister_Magister |
| 22:35:27 | * | rockcavera joined #nim |
| 22:54:41 | FromDiscord | <janakali> sent a code paste, see https://paste.rs/dsYpa |
| 22:56:33 | FromDiscord | <janakali> this way you can make an enum without holes and in any order |
| 22:59:54 | * | hygo joined #nim |
| 23:11:27 | * | Jjp137 quit (Ping timeout: 252 seconds) |
| 23:19:47 | FromDiscord | <janakali> @b0rsuk yeah, ordinal values MUST be contiguous, Enum with holes is no longer ordinal.↵You can make it work if you create an enum with all the letters. won't be pretty, though. |
| 23:25:42 | * | rockcavera quit (Remote host closed the connection) |
| 23:41:54 | * | hygo quit (Ping timeout: 250 seconds) |
| 23:44:07 | * | hygo joined #nim |