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
| # Enable Powerlevel10k instant prompt. Should stay close to the top of ~/.zshrc. | |
| # Initialization code that may require console input (password prompts, [y/n] | |
| # confirmations, etc.) must go above this block; everything else may go below. | |
| if [[ -r "${XDG_CACHE_HOME:-$HOME/.cache}/p10k-instant-prompt-${(%):-%n}.zsh" ]]; then | |
| source "${XDG_CACHE_HOME:-$HOME/.cache}/p10k-instant-prompt-${(%):-%n}.zsh" | |
| fi | |
| # ------- | |
| # Exports | |
| # ------- |
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 express = require('express'); | |
| const http = require('http'); | |
| const WebSocket = require('ws'); | |
| const cors = require('cors'); | |
| const dgram = require('dgram'); | |
| const os = require('os'); | |
| const crypto = require('crypto'); | |
| // Create Express app and HTTP server | |
| const app = express(); |
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
| /// Original C++ implementation found at http://www.wilmott.com/messageview.cfm?catid=10&threadid=38771 | |
| /// C# implementation found at http://weblogs.asp.net/esanchez/archive/2010/07/29/a-quick-and-dirty-implementation-of-excel-norminv-function-in-c.aspx | |
| /* | |
| * Compute the quantile function for the normal distribution. | |
| * | |
| * For small to moderate probabilities, algorithm referenced | |
| * below is used to obtain an initial approximation which is | |
| * polished with a final Newton step. | |
| * | |
| * For very large arguments, an algorithm of Wichura is used. |