Today, I am going to try a bold experiment.
Optimize for what metric? Performance of code execution (eg. how long does it take to calculate the n-th prime number).
Today we are releasing Cheerp 2.6, the latest major release of Cheerp, with plenty of new optimizations and features, and full backwards compatibility.
This post introduces Cheerp, its features, and the problems that can be solved thanks to this tool.
Today we are proud to announce that we are close to finalizing the release of Cheerp 2.6.
Many improvements have been added to Cheerp in the last 8 months (compared to the previous release) by our team, and now it’s all packaged to be used on the C/C++ codebases you have at hand.
In this post, I will go through the new features of Cheerp 2.6, how to use it, and present some benchmarks and live examples.
Recently, I have been working on one of Cheerp’s unique features,
This week I had the chance to attend Mozilla’s conference, where many stakeholders (from big companies to individuals) with an interest in shaping the future of the web met.
I thought of doing a brief recap of what I got from the event. How fortunate you are.
Different approaches by the major browser vendors about how to goes around tracking of users by third parties (from “no tracking for all” to “the consumers really want targeted ads, so what should we do, subtract something from the beautiful experience they are having?”).
Plus a powerful warning from Selena Deckelmann that while…
During the last few weeks, I had a few occasions in which I had to explain what I do at work.
Explaining how lucky I feel like and how rewarding it is to work on interesting problems is easy.
Telling that I spend most of the time at the coffee machine waiting either for recompilations of our codebase or for test results is somehow accurate but a bit too micro. I do also some work on optimizing our compiler results, data-structures, working on the testing infrastructure, or writing documentation.
But what do we do as a company?
var one = BigInt("1");
var A = BigInt("1");
var B = BigInt("1");for (var i=1; i<=1000; i++)
A = BigInt.multiply(A, B);
B = BigInt.add(B, one);
}console.log("factorial(1000) is " + A);
at Leaning Technologies