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)
This is just a small post in response to [this tweet][tweet] by Julien Pauli (who by the way is the release manager for PHP 5.5). In the tweet he claims that objects use more memory than arrays in PHP. Even though it can be like that, it's not true in most cases. (Note: This only applies to PHP 5.4 or newer.)
The reason why it's easy to assume that objects are larger than arrays is because objects can be seen as an array of properties and a bit of additional information (like the class it belongs to). And as array + additional info > array it obviously follows that objects are larger. The thing is that in most cases PHP can optimize the array part of it away. So how does that work?
The key here is that objects usually have a predefined set of keys, whereas arrays don't:
| #!/bin/sh | |
| # Called by "git push" after it has checked the remote status, | |
| # but before anything has been pushed. | |
| # | |
| # If this script exits with a non-zero status nothing will be pushed. | |
| # | |
| # Steps to install, from the root directory of your repo... | |
| # 1. Copy the file into your repo at `.git/hooks/pre-push` | |
| # 2. Set executable permissions, run `chmod +x .git/hooks/pre-push` |
Original transcript: http://allisonrandal.com/2012/04/15/open-source-enlightenment/
這幾年來，我慢慢覺得，我們參與開源社群，就像是在一條道路上並肩而行：這不僅讓我們成為更好的程式設計者，也讓我們通過與人合作，而成為更好的人。
您可以將它想成一條修行之道，讓身而為人的我們能夠不斷成長。接下來，我想談談我對開源世界的個人觀點，希望能與您分享。
首先，人是一切開源專案的核心。程式碼是很重要，但最核心的永遠是人。
| #!/bin/bash | |
| # Generate a Markdown change log of pull requests from commits between two tags | |
| # Author: Russell Heimlich | |
| # URL: https://gist.github.com/kingkool68/09a201a35c83e43af08fcbacee5c315a | |
| # HOW TO USE | |
| # Copy this script to a directory under Git version control | |
| # Make the script executable i.e. chmod +x changelog.sh | |
| # Run it! ./changelog.sh | |
| # Check CHANGELOG.md to see your results |
| # API Key 可以在以下頁面建立: | |
| # https://max.maicoin.com/api_tokens/new | |
| # | |
| MAX_API_KEY= | |
| MAX_API_SECRET= |
先前在《開源應用程式架構》 一書中，我介紹了 SocialCalc 這個在瀏覽器中運行的試算表編輯器，以取代伺服器為中心的 WikiCalc 架構。SocialCalc 在瀏覽器中執行所有的運算，只有在載入和儲存試算表時才會使用伺服器。
追求效能是 Socialtext 團隊在 2006 年時設計 SocialCalc 的主要目的。重點在於：在 JavaScript 環境下執行客戶端運算，儘管在當年的速度僅有伺服器端 Perl 運算的十分之一，但仍然勝過 AJAX 來回傳輸資料造成的網路延遲：
| func (s Harmonic) SharkLong(highs, lows *types.Queue, p float64) float64 { | |
| score := 0. | |
| for x := 5; x < 300; x++ { | |
| X := lows.Index(x) | |
| for a := 4; a < x; a++ { | |
| if highs.Index(a-1) < highs.Index(a) && highs.Index(a) > highs.Index(a+1) { | |
| A := highs.Index(a) | |
| XA := math.Abs(X - A) | |
| hB := A - 0.382*XA | |
| lB := A - 0.618*XA |
| func (s Harmonic) SharkLong(highs, lows *types.Queue, p float64) float64 { | |
| score := 0. | |
| for x := 5; x < 300; x++ { | |
| X := lows.Index(x) | |
| for a := 4; a < x; a++ { | |
| if highs.Index(a-1) < highs.Index(a) && highs.Index(a) > highs.Index(a+1) { | |
| A := highs.Index(a) | |
| XA := math.Abs(X - A) | |
| hB := A - 0.382*XA | |
| lB := A - 0.618*XA |
