Digests » 254

sponsor

GitLab 10.1 released with Image Discussions and Rejection of Unsigned Commits

Manage your visual assets like you manage your code. Collaborate on design socially with resolvable image discussions. You can easily target a specific coordinate of an image and start a discussion around it. Image discussions are available in merge requests and commit detail views.

programming

When is a senior engineer not a senior engineer?

What “senior” really means depends on what your organization needs and how it operates. Much of my experience has been in small organizations, so this list may be tilted more toward jack of all trades, but I’ve seen some of these patterns at larger companies as well. Here are a number of attributes that all seem to get wrapped up in the word “senior”.

Deconstructing the water effect in Super Mario Sunshine

One of my hobbies is writing model viewers and graphics toys for games. It’s a good mix of my interests in graphics and rendering, in reverse engineering complex engines, and nostalgia for old video games.

The RedMonk Programming Language Rankings 2018

Given that we’re into March, it seems like a reasonable time to publish our Q1 Programming Language Rankings. As always, these are a continuation of the work originally performed by Drew Conway and John Myles White late in 2010. While the means of collection has changed, the basic process remains the same: we extract language rankings from GitHub and Stack Overflow, and combine them for a ranking that attempts to reflect both code (GitHub) and discussion (Stack Overflow) traction.

How GDPR Will Change The Way You Develop

Europe’s imminent privacy overhaul means that we all have to become more diligent about what data we collect, how we collect it, and what we do with it. In our turbulent times, these privacy obligations are about ethics as well as law.

Cache-tries: concurrent lock-free hash tries with constant time operations

Concurrent non-blocking hash tries have good cache locality, and horizontally scalable operations. However, operations on most existing concurrent hash tries run in O(log n) time. In this paper, we show that the concurrent hash trie operations can run in expected constant time. We present a novel lock-free concurrent hash trie design that exerts less pressure on the memory allocator.