You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I'd like to have a function compareStringBytes: (String, String) => Ordering for #561.
See #561's changes in effekt.effekt for the kind of function we need, then figure out a way to support it on the LLVM backend. :)
Should it be native (somewhere in C)? Should it be written in Effekt itself? No clue.
I think it should be possible and reasonably easy to write this function directly in Effekt, at least if the comparison is byte-wise.
The text was updated successfully, but these errors were encountered:
At the Effekt Working Group Meeting ™️, we talked about this: perhaps having a comparison returning -1, 0, 1 on native byte strings would make sense, then we can just set compareString to use s1.toByteString.compare(s2.toByteString)
I've been sitting on this code for almost ~~9~~ _13_ months now (started
on Xmas 2023), it's about time we finalise it.
This PR adds immutable ordered maps and sets based on weight balanced
trees into the standard library.
The `map` and `set` now work on all main backends: JS, LLVM, Chez.
Progress ~~is **blocked**~~ was blocked on:
1. ~~very annoying inliner bug(s?) [#733]~~ _resolved_ 🥳
2. ~~missing comparisons on strings on LLVM [#748]~~ _resolved_ 🎉
I'd like to have a function
compareStringBytes: (String, String) => Ordering
for #561.See #561's changes in
effekt.effekt
for the kind of function we need, then figure out a way to support it on the LLVM backend. :)Should it be native (somewhere in C)? Should it be written in Effekt itself? No clue.I think it should be possible and reasonably easy to write this function directly in Effekt, at least if the comparison is byte-wise.
The text was updated successfully, but these errors were encountered: