Viewing profile — mzaks

Not a data structure, but a nice concept for very fast search on immutable pre sorted array, eytzinger order. I did some experiments, it is about 2-3x faster then binary search. ht…

True, I guess it all boils down to ease of use (convenience). You can build a system which accepts schema + data and build dash boards and data relevant relevant processing + optim…

If you need a language support for FlexBuffers please create an issue on GitHub repo. I ported it already to Swift, C#, Dart, Python, JS (is in review). If I am familiar with the l…

One use case where schema-less is the way to go, when you provide the infrastructure, but have no „ownership“ of data it will be used for. E.g. you build a logging or analytics too…

You forgot Python and C# :). Plus a Unity3D specific version, which is battle tested in a game with more than half a million downloads ;).

The good thing about any narrative, it resonates with different people on different levels. The blog post is in deed titled "10,000 times faster Swift". I though it will be a catch…

I was suspicious, I just could not put my finger on it :) for i in 0.. this results in around 42ms compared to C 25ms. I guess I should update my blog post :) Thanks for your help.…

This makes sense! Changed the iteration to: for i in 0.. now result is around 43ms Thanks for pointing it out. Have to check if there are so other things involved, but that might b…

Performance test run on Travis CI in a virtual machine https://travis-ci.org/mzaks/FlatBuffersSwift function called for decode+use+dealloc https://github.com/mzaks/FlatBuffersSwift…

I Updated the run bench function https://gist.github.com/mzaks/e3a2dc7ccdfc2397bc26c55eb6dc8a... the output is now: Eager run ================================= 1557 ms encode 264 m…