evalparse

I should really have another go at getting things into SortingAlgorithms.jl. SortingLab.jl has string sort. I would say, another approach is to have a Radixsort.jl and clean up the radix...

I am using virtualize to show a long list of credit card transactions. So I am happy for it to be fixed width but want the height to vary. Also...

same issue here

Really need this to finally ditch SAS completely!

Maybe just sum it up in an array first. Cos it's already sorted. Then just add the array one by one into the `dict`. So no need to look up...

Yeah. Just count them and insert. Should be quick.

> Is there ever a measurable improvement? Try more than 10 elements. More like 1 million.

Yay. I made a faster `countmap`

NOt really sure what's happening, but `countmap` with either algorithm are slow ``` # 100 elements a=[(Int16(rand(1:5)), Int16(rand(1:7))) for i in 1:100] using BenchmarkTools using StatsBase @btime proportionmap(a) ; a3...

I prefer the 1.1 behaviour with an error message. Because sometimes ppl do have all missing in a column. Especially if they work with large datasets and want to read...