Create a minimal raw HTTP request file request.txt. End of line must be CLRF.
GET / HTTP/1.1Instructions for generating and managing cryptographic keys using OpenSSL. These keys are typically used for secure communication, signing, or encryption in various applications.
openssl genrsa -out test_private_key.pem 2048
openssl req -new -x509 -key test_private_key.pem -out test_public_key.pem -subj '/CN=test_key_name'| import { readFile, writeFile } from "fs-safe"; | |
| import { DomNode, LinkNode, parse } from "netscape-bookmark-tree"; | |
| const bookmarksDir = "data/bookmarks.html"; | |
| const outputDir = "data/bookmarks.json"; | |
| interface Link<Metadata = any> { | |
| name: string; | |
| url: string; | |
| folder?: string; |
| // Sources: | |
| // https://en.wikipedia.org/wiki/ID3_algorithm | |
| // https://towardsdatascience.com/decision-trees-for-classification-id3-algorithm-explained-89df76e72df1 | |
| // https://brilliant.org/wiki/entropy-information-theory/ | |
| // TODO: explicitly specify attribute classes and implement generalization | |
| import { countBy, groupBy, minBy, maxBy } from "lodash"; | |
| type Data = string[][]; |
| export interface Dictionary<T> { | |
| [key: string]: T; | |
| } | |
| interface DisjointSetElement { | |
| key: string; | |
| parent?: DisjointSetElement; | |
| children: DisjointSetElement[]; | |
| } |
| /** | |
| * Definition for a binary tree node. | |
| * class TreeNode { | |
| * val: number | |
| * left: TreeNode | null | |
| * right: TreeNode | null | |
| * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { | |
| * this.val = (val===undefined ? 0 : val) | |
| * this.left = (left===undefined ? null : left) | |
| * this.right = (right===undefined ? null : right) |
| # to know the right version use | |
| # cat /etc/os-release | |
| # node --version | |
| FROM node:14-buster as build | |
| WORKDIR /app | |
| COPY . ./ | |
| RUN npm i |
| function piStep(n) { | |
| return ( | |
| ( | |
| Math.pow(-1, n) | |
| / (2 * n + 1) | |
| ) | |
| * ( | |
| 4 / Math.pow(5, 2 * n + 1) | |
| - 1 / Math.pow(239, 2 * n + 1) | |
| ) |
####Assumptions
We will use the Electoral District and Polling Division shapefiles found on the Elections Ontario site: