top | item 41281544 (no title) icholy | 1 year ago Yeah, who needs O(1) deletes anyway? /s discuss order hn newest lifthrasiir|1 year ago In case you haven't realized yet, a hash table that maintains the insertion order can be still do O(1) deletes as long as the key order doesn't change arbitrarily after the initial insertion. icholy|1 year ago I'm commenting on the proposed implementation of using an array to keep track of insertion order. load replies (1)
lifthrasiir|1 year ago In case you haven't realized yet, a hash table that maintains the insertion order can be still do O(1) deletes as long as the key order doesn't change arbitrarily after the initial insertion. icholy|1 year ago I'm commenting on the proposed implementation of using an array to keep track of insertion order. load replies (1)
icholy|1 year ago I'm commenting on the proposed implementation of using an array to keep track of insertion order. load replies (1)
lifthrasiir|1 year ago
icholy|1 year ago