The F# Journal just published an article:
"The implementations of the Set and Map modules in both OCaml and F# happen to use AVL balanced binary search trees. There are many alternatives to choose from. Patricia trees are an alternative specialized to unsigned integer elements with the potential to outperform the more generic AVL tree, particularly when perfoming set-theoretic operations such as union, intersection and difference..."
If you subscribe to the F# Journal then can read this article here otherwise subscribe to the The F# Journal today to read this article and many more!
Benchmarking in the web age - The TechEmpower website contains some fascinating benchmarks of servers. The results on this benchmark of multiple requests to servers provide some insig...
3 months ago