jFransham

Achieving warp speed with Rust

Contents:

• Number one optimization tip: don't
• Never optimize blindly
• Don't bother optimizing one-time costs
• Improve your algorithms
• CPU architecture primer
• Keep as much as possible in cache
• Keep as much as possible in registers

gre

/*
 * This work is free. You can redistribute it and/or modify it under the
 * terms of the Do What The Fuck You Want To Public License, Version 2,
 * as published by Sam Hocevar. See the COPYING file for more details.
 */
/*
 * Easing Functions - inspired from http://gizma.com/easing/
 * only considering the t value for the range [0, 1] => [0, 1]
 */
EasingFunctions = {

Rich-Harris

Please include a repro

You probably arrived here because of a curt message in response to an issue you filed on a repo that I contribute to. Sorry about that (particularly if you filed the issue long ago and have been waiting patiently for a response). Let me explain:

I work on a lot of different open source projects. I really do like building software that makes other people's lives easier, but it's crazy time-consuming. One of the most time-consuming parts is responding to issues. A lot of OSS maintainers will bend over backwards to try and understand your specific problem and diagnose it, to the point of setting up new test projects, fussing around with different Node versions, reading the documentation for build tools that we don't use, debugging problems in third party dependencies that appear to be involved in the problem... and so on. I've personally spent hundreds of hours of my free time doing these sorts of things to try and help people out, because I want to be a responsible maintainer and I

paulmillr

Most active GitHub users (git.io/top)

The count of contributions (summary of Pull Requests, opened issues and commits) to public repos at GitHub.com from Wed, 21 Sep 2022 till Thu, 21 Sep 2023.

Only first 1000 GitHub users according to the count of followers are taken. This is because of limitations of GitHub search. Sorting algo in pseudocode:

githubUsers
 .filter(user => user.followers > 1000)

IanColdwater

Mute these words in your settings here: https://twitter.com/settings/muted_keywords

ActivityTweet
generic_activity_highlights
generic_activity_momentsbreaking
RankedOrganicTweet
suggest_activity
suggest_activity_feed
suggest_activity_highlights
suggest_activity_tweet

sachinsmc

Top HN posts

1. Ask HN: What books changed the way you think about almost everything?

2. Ask HN: What are the best MOOCs you've taken?

3. Ask HN: How to self-learn electronics?

4. Ask HN: Successful one-person online businesses?

andrewharvey

Library	Static / Dynamic	Cartesian / Geographic	kNN	Index containing points	Index containing boxes	Within radius
rbush	dynamic	🗺️ cartesian	❌	✔️	✔️	❌
rbush-knn	dynamic	🗺️ cartesian	✔️	✔️	✔️	✔️
kdbush	static	🗺️ cartesian	❌	✔️	❌	✔️
geokdbush	static	🌏 geo	✔️	✔️	❌	✔️
flatbush	static	🗺️ cartesian	✔️	✔️	✔️	✔️
geoflatbush	static	🌏 geo	✔️	:heavy_che

pagameba

/* 
 * Portions of this code and logic copied from OpenLayers and
 * redistributed under the original Clear BSD license terms:
 * 
 * http://trac.osgeo.org/openlayers/browser/license.txt
 *
 * Copyright 2005-2010 OpenLayers Contributors, released under 
 * the Clear BSD license. See authors.txt for a list of contributors.
 * All rights reserved.
 *

haochi

            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
                    Version 2, December 2004

 Copyright (C) 2011 Haochi Chen <http://ihaochi.com>

 Everyone is permitted to copy and distribute verbatim or modified
 copies of this license document, and changing it is allowed as long
 as the name is changed.

            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE

mourner

const radixSort = require('./index.js');

const N = 10000000;
const arr = new Uint32Array(N);
for (let i = 0; i < N; i++) arr[i] = Math.floor(Math.random() * 4294967295);

console.log(`sorting ${N.toLocaleString()} uint32 numbers`);

 // warmup
radixSort(arr.slice());