My hack is this:
using DataFrames
using DataStructures
using Gadfly
# test data
list = ["E", "E", "E", "E", "E",
"B", "B", "B", "B",
"C", "C", "C",
"D", "D", "D",
"A"]
# I am making a dict-of-counts to turn into a df
# empty string->int dict
countsDict = Dict{String,Integer}()
# a function to count occurences of a given string in an array
function countStrInArray(str::String, arr::Array{String,1})::Integer
findall(x -> x == str, arr) |> length
end
# for every item in the list
for item in list
# if we don't have it in the dict, add, with count as value
if !haskey(countsDict, item)
countsDict[item] = countStrInArray(item, list)
end
end
# this gives me the structure I want but I lose 'lookup' functionality
sortedTuples = sort(collect(zip(values(countsDict),
keys(countsDict))), rev = true)
# ...so I creaated an order-preserving dict
sortedCountsDict = OrderedDict{String,Integer}()
# map our tuples to it
for item in sortedTuples
sortedCountsDict[item[2]] = item[1]
end
# make it into a dataframe
df = DataFrame(group = [i for i in keys(sortedCountsDict)],
count = [i for i in values(sortedCountsDict)])
# plot it!
plot(df, x = :group, y = :count, Geom.bar) |> SVG("HackyButWorks.svg")
Does anyone know a cleaner way to do this?