OrderedCollections.jl

OrderedCollections.jl copied to clipboard

Benchmarking the performance of dictionaries

4

Benchmarking code for the dictionaries is not present at the moment. I'll be happy to write a benchmark for the dictionaries. A sign of approval/necessity is all that I am...

eulerkochy

[WIP] OrderedGeneralDict

2

This is a modified version of #39 . Work remaining -- I have to fix the `OrderedSet` tests, which broke because of this change

eulerkochy

Remerging into DataStructures

10

I have been thinking that at some point we should merge OrderedCollections back into DataStructures.jl The reason to seperate it out was to decrease size of the dependencies that Revise.jl...

oxinabox

Feature request: reverse method for OrderedDicts

2

bramtayl

LittleDict / OrderedDict pop! consistency

1

@iamed2 pointed this out in #59, [here](https://github.com/JuliaCollections/OrderedCollections.jl/pull/59#issuecomment-704010121). We do not have consistency between the `pop!` function for `LittleDict` and `OrderedDict`. ### LittleDict Will return `nothing` if the key is not...

mattBrzezinski

I assumed it worked, when I but it in Base, I get error: https://github.com/JuliaLang/julia/pull/37804#issuecomment-701427549 do you know if the code is correct and even better, either way how to fix...

PallHaraldsson

Special Ordered Dict that automtically swaps from LittleDict to another type when too full

2

_Originally posted by @PallHaraldsson in https://github.com/JuliaCollections/OrderedCollections.jl/pull/54#issuecomment-699246441_ Since LittleDict is faster, is it a reasonable default? "It is reasonable to expect it to outperform an `OrderedDict`, with up to around 30...

oxinabox

Feature request: range selection

1

I'm not exactly sure of the best syntax here, but if there's not already a way to do it, it might be nice to be able to use indexing to...

bramtayl

Feature Request: `sort!(::UnfrozenLittleDict{K,V})`

1

`sort!(::UnfrozenLittleDict{K,V})` would be nice to have. Are there any problems with: ```julia function sort!(d::UnfrozenLittleDict; byvalue::Bool=false, args...) if byvalue p = sortperm(d.vals; args...) else p = sortperm(d.keys; args...) end permute!(d.keys, p)...

iamed2

I haven't looked at how OrderedSet is implemented but it would be nice to be able to have `pushfirst!` and `append!`.

kleinschmidt