@JakeGoulding is an insert of an existing member a no-op or does it shift the member to the end of the insertion list? (subtleties matter)
What’s the right data structure for a set that can still be accessed by index of insertion order? An array + set seems correct but unwieldy
-
-
-
@psylum a no-op would be what I want here, but interested to hear answers to both directions.
End of conversation
New conversation -
-
-
@JakeGoulding i think an array with added set logic makes more sense for a no-op version.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@JakeGoulding i was going to say something linked-list or hash based might be good for adjusting insertion order, but.. probably not.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@JakeGoulding does the native python set give you the data structure qualities you want? you could see what they use under the hood if so.Thanks. 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.