I guess those functions aren't exceptionally complicated so I could just tweak them.
don't know if it will help you, but this is how I manage to get netrepl + loop to work together: https://github.com/Saikyun/text-experiment/blob/main/src/main.janet#L217-L235
the
ev/sleep call makes it so that the netrepl gets a chance to do its thing :)
when thinking about it, a generator might have been cleaner, haha. anyway :)
I'm running the netrepl server in a separate process so it's OK for
recv to block, just not indefinitely :)
I was trying to get Conjure to work with it but I am not having much luck and am trying to see if something's broken in the implementation (I don't think it is but wanted to double check).
dogfooding
More like bearpoking :P
no danger I would say
not from Janet codes, they are helpful only
why it was funny for me: I finished Chidi, very proud father. Then I put it to work in the good-place website and found a lot of the rough edges
some parts got total overhaul
Which is a bit weird because it runs OK when testing.
was pretty easy. idk what's the most efficient but I found dict of key to index + array of keys + array of values the easiest to implement
4 replies
im on my laptop and pretty printing is working here
maybe a different version of janet...
hmmm
e.g.
(= @[1 2] @[1 2]) #=> false
because it compares the pointers
with
= there's deep= which works with those. not sure if there's something similar for compare>
2 replies
i dont even want to compare tuples with arrays
No, simple comparison does not compare by internal values for all of them same reasons that equality doesn't
it'll be nice to add more things like
put-in, swap-remove, index-based put/get/remove, and more
I think I will publish as standalone module since it's pretty easy to implement this all :)
I was doing it as part of another project at first since I didn't want to get carried away with a rabbit hole of libraries just to implement one program, but the way I'm implementing the ordered table is basically decoupled from rest of project anyway
Regarding testing for equality, I really like Janet's consistency here: that all immutables compare by value, and all mutables compare by pointer (or id):
# All of these (immutables) evaluate to `true`:
(= nil nil)
(= false false)
(= 1 1)
(= :a :a)
(= 'a 'a)
(= "a" "a") # string
(= [1 2] [1 2]) # tuple
(= {:a 1} {:a 1}) # struct
# ...and all of these (mutables) evaluate to `false`:
(= @"a" @"a") # buffer
(= @[1 2] @[1 2]) # array
(= @{:a 1} @{:a 1}) # table(please let me know if I have any of that terminology wrong)