I didn't even know it was possible, now I want to learn what a linked list looks like without using unsafe
-
-
Replying to @andy_kelley @RichFelker and
use Rc and Weak Presumably y'all are talking about doubly linked lists, singly linked lists are possible to do efficiently in safe code
4 replies 0 retweets 6 likes -
Replying to @ManishEarth @andy_kelley and
There's also the possibility of using non-pointer references to represent the graph, such as indices into an array or some other pool data structure that holds the nodes
4 replies 0 retweets 8 likes -
Replying to @jckarter @ManishEarth and
now we trade safety for efficiency? I like this game, bring it on!
2 replies 0 retweets 0 likes -
Replying to @krzyzanowskim @jckarter and
There's no trade here. You just get more efficiency.
1 reply 0 retweets 0 likes -
Replying to @Brittain_Ben @jckarter and
of... the memory use? does it comes with garbage collector in package maybe?
1 reply 0 retweets 0 likes -
Replying to @krzyzanowskim @Brittain_Ben and
Computing a [base + index] address is rarely any more expensive than using a pointer. Remember that forming a pointer in PIC code has to do [pc + offset] or double-indirection anyway
1 reply 4 retweets 10 likes -
Replying to @jckarter @Brittain_Ben and
I'm thinking about gaps after deletion.
1 reply 0 retweets 0 likes -
Replying to @krzyzanowskim @Brittain_Ben and
Well you'd probably use a freelist instead of eagerly compacting your pool
2 replies 0 retweets 0 likes -
Replying to @jckarter @krzyzanowskim and
Congrats you reinvented UAF. :-)
3 replies 0 retweets 0 likes
Well, it’s typically less exploitable UAF.
-
-
In the same sense that double-close() is "less exploitable UAF"... which isn't very reassuring.
0 replies 0 retweets 0 likesThanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.