This formula ensures that each logo will occupy the same area, making them appear visually identical in size.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
type Cell = 0 | 1; | |
type Grid = Cell[][]; | |
// Utility to transpose a matrix (swap rows and columns) | |
const transpose = <T>(grid: T[][]): T[][] => | |
grid[0].map((_, i) => grid.map(row => row[i])); | |
// Create a function to get neighboring cells of a given coordinate | |
const neighbors = (grid: Grid) => ([x, y]: [number, number]): [number, number][] => | |
[-1, 0, 1] |
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Conway's Game of Life in functional TypeScript | |
// Game board size | |
const ROWS = 10; | |
const COLS = 10; | |
// Game board represented as 2D array | |
type Board = boolean[][]; | |
// Create empty board |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
const _ = require("lodash/fp") | |
const sample = Array.from({ length: 90000 }).map((_, i) => i) | |
var nativeStart | |
var nativeDuration | |
;(() => { | |
nativeStart = process.hrtime.bigint() | |
for (let x = 0; x <= 10000; x++) { | |
sample.map((n) => n * 2) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
'use strict'; | |
const MD5 = (str) => { | |
const currentNick = M(V(Y(X(str), 8 * str.length))); | |
return currentNick.toLowerCase(); | |
}; | |
/** | |
* @param {string} b | |
* @return {?} | |
*/ | |
function M(b) { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
query OrgTeams($org: String!) { | |
organization(login: $org) { | |
teams(first: 100) { | |
pageInfo { | |
endCursor | |
hasNextPage | |
} | |
nodes { | |
name | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function boardGet(arr, i, j) { | |
if (i < 0 || j < 0 || i >= arr.length || j >= arr[i].length) { | |
return 0 | |
} | |
return arr[i][j] | |
} | |
function countNeighbors(board, i, j) { | |
return ( |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function conwaysGameOfLife(board) { | |
var newBoard = [] | |
for (var i = 0; i < board.length; i++) { | |
newBoard.push([]) | |
for (var j = 0; j < board[i].length; j++) { | |
newBoard[i].push(0) | |
} | |
} | |
for (var i = 0; i < board.length; i++) { |
I hereby claim:
- I am viktorbezdek on github.
- I am viktorbezdek (https://keybase.io/viktorbezdek) on keybase.
- I have a public key ASBoMyVpjR-eujZHHR-cfIQlax-j1eTdmqA8Jq_BuKYr-Qo
To claim this, I am signing this object:
NewerOlder