Frank Hassanabad FrankHassanabad

## medium_non_optimal_ui_3.sh
http://localhost:8500/v1/kv/?recurse&pretty=true

...
{
    "LockIndex": 0,
    "Key": "application/configs/",
    "Flags": 0,
    "Value": null, <-- Wait, what's this null?
    "CreateIndex": 73975,
    "ModifyIndex": 73975

## medium_non_optimal_ui_2.sh
...
018-07-26T10:08:14.055-06:00 [INFO] [test_application] The parameter is incorrect
(application crashes)
...

## medium_non_optimal_ui.sh
...
2018-07-25T09:55:09.851-06:00 [INFO] [test_application] setting  to
...

## bathroom-correction-at-work.py
import math

# This as written will fail saying 1 and 4 are prime.
# Those two numbers are not prime.
# Also, checking up to square root is more efficient.
def IsPrime(n):
        if (n == 1 or n == 4):
                return False
        for divisor in range(2, int(math.ceil(math.sqrt(n)))):
                if n % divisor == 0:

## mdn_crypto.js
/* assuming that window.crypto.getRandomValues is available */

var array = new Uint32Array(10);
window.crypto.getRandomValues(array);

console.log("Your lucky numbers:");
for (var i = 0; i < array.length; i++) {
    console.log(array[i]);
}

## openssl_example.sh
openssl genrsa -aes128 -out private.key 2048

Generating RSA private key, 2048 bit long modulus
....+++ ....… +++
e is 65537 (0x10001)
Enter pass phrase for private.key: ****************
Verifying - Enter pass phrase for fd.key: ****************

## crib-phone-example-2.js
  encryptedPhoneNumbers.forEach((encryptedPhoneNumber) => {
    const xor = xorStrings(encryptedPhoneNumber, exactMatch);
    const output = xorPlainTextWithCrib(xor, inputPhoneNum);
    printPlain(output);
  });

## crib-phone-example.js
for (let i = 0; i < encryptedPhoneNumbers.length - 1; ++i) {
  const encryptedPhoneNum1 = encryptedPhoneNumbers[i];
  const encryptedPhoneNum2 = encryptedPhoneNumbers[i + 1];
  const xor = xorStrings(encryptedPhoneNum1, encryptedPhoneNum2);
  const output = xorPlainTextWithCrib(xor, inputPhoneNum);
  if (asciiMatch(output, '^[0-9]+\-[0-9]+\-[0-9]+$')) {
    matches = matches.concat([[encryptedPhoneNum1, encryptedPhoneNum2]]);
  }
}

## gist:9e935d4e518ddc69f9c5
* Download Atom Editor and install it
* Go to packages to install a package and install
  - git-plus
  - last-cursor-position
  - line-diff-details
  - linter
  - linter-eslint
  - merge-conflicts
  - preview

## gist:f5f1a822c0a205f8b060
/ )( \
) __ (
\_)(_/
  __
 / _\
/    \
\_/\_/
 ____
(  _ \
 ) __/
	http://localhost:8500/v1/kv/?recurse&pretty=true

	...
	{
	"LockIndex": 0,
	"Key": "application/configs/",
	"Flags": 0,
	"Value": null, <-- Wait, what's this null?
	"CreateIndex": 73975,
	"ModifyIndex": 73975
	...
	018-07-26T10:08:14.055-06:00 [INFO] [test_application] The parameter is incorrect
	(application crashes)
	...
	...
	2018-07-25T09:55:09.851-06:00 [INFO] [test_application] setting to
	...
	import math

	# This as written will fail saying 1 and 4 are prime.
	# Those two numbers are not prime.
	# Also, checking up to square root is more efficient.
	def IsPrime(n):
	if (n == 1 or n == 4):
	return False
	for divisor in range(2, int(math.ceil(math.sqrt(n)))):
	if n % divisor == 0:
	/* assuming that window.crypto.getRandomValues is available */

	var array = new Uint32Array(10);
	window.crypto.getRandomValues(array);

	console.log("Your lucky numbers:");
	for (var i = 0; i < array.length; i++) {
	console.log(array[i]);
	}
	openssl genrsa -aes128 -out private.key 2048

	Generating RSA private key, 2048 bit long modulus
	....+++ ....… +++
	e is 65537 (0x10001)
	Enter pass phrase for private.key: ****************
	Verifying - Enter pass phrase for fd.key: ****************
	encryptedPhoneNumbers.forEach((encryptedPhoneNumber) => {
	const xor = xorStrings(encryptedPhoneNumber, exactMatch);
	const output = xorPlainTextWithCrib(xor, inputPhoneNum);
	printPlain(output);
	});
	for (let i = 0; i < encryptedPhoneNumbers.length - 1; ++i) {
	const encryptedPhoneNum1 = encryptedPhoneNumbers[i];
	const encryptedPhoneNum2 = encryptedPhoneNumbers[i + 1];
	const xor = xorStrings(encryptedPhoneNum1, encryptedPhoneNum2);
	const output = xorPlainTextWithCrib(xor, inputPhoneNum);
	if (asciiMatch(output, '^[0-9]+\-[0-9]+\-[0-9]+$')) {
	matches = matches.concat([[encryptedPhoneNum1, encryptedPhoneNum2]]);
	}
	}
	* Download Atom Editor and install it
	* Go to packages to install a package and install
	- git-plus
	- last-cursor-position
	- line-diff-details
	- linter
	- linter-eslint
	- merge-conflicts
	- preview