William Wolf throughnothing

## gmaps-gpx.html
<html>
    <head>
    </head>
    <body>
        <iframe width="700" height="350" frameborder="0" scrolling="no" marginheight="0" marginwidth="0" src="https://maps.google.com/maps?q=https:%2F%2Fraw.github.com%2Fthroughnothing%2Fgpx%2Fmaster%2F2012%2F20120629.kml&amp;t=h&amp;ie=UTF8&amp;output=embed"></iframe><br />
    </body>
</html>

## intelligent-tiering.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                throughnothing
                / intelligent-tiering.md
            
            
              Created
              August 25, 2023 18:41
                — forked from jflasher/intelligent-tiering.md
            
              
                Instructions for setting up a lifecycle policy for S3 Intelligent-Tiering
              
          
    Amazon S3 now supports a new storage class called Intelligent Tiering. This will be a very attractive option for many customers who have datasets that are accessed in unpredictable patterns. You can set this storage class when uploading any new data. However, the below instructions will allow you to set up a lifecycle policy that will change the storage class of data that already exists in your bucket.
To set up a lifecycle policy to change the storage class of the data currently stored in your Amazon S3 bucket, follow the below steps.


Visit the S3 console and go to your bucket of interest.


Click on the Management tab at the top and select + Add lifecycle rule.


Enter a rule name of your choice (e.g., Convert to Intelligent Tiering storage class). Unless you want to filter which data is converted to the new storage class, you can leave the prefix/tag filter field


## Aurora-Profiles
do shell script "open -n -a aurora --args -profilemanager"

## recommended-routine.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              1 star
            
          
                throughnothing
                / recommended-routine.md
            
            
              Created
              June 7, 2020 02:08
                — forked from sgup/recommended-routine.md
            
              
                Recommended Routine (Updated Dec 2019)
              
          
    Welcome to the Recommended Routine

Interactive Version | Android App | iPhone App | Cheat Sheet
This routine is for anyone with the following goals: Strength,  Muscle Gain, Fat Loss


Make sure your diet is in check.
Check What routine should I do? to make sure this routine is right for you.
See also: Learn how to make quality goals.


## purescript-gadt.purs
module GADT.Main where

import Prelude (class Category, class Semigroupoid, (<<<), flip, identity, ($), (+), (==))

import Unsafe.Coerce (unsafeCoerce)

newtype Leibniz a b = Leibniz (forall f. f a -> f b)
infix 4 type Leibniz as ~

instance semigroupoidLeibniz :: Semigroupoid Leibniz where

## MontyHall.purs
module MontyHall.Main where

import Prelude

import Data.Foldable (foldr)
import Data.List.Lazy (range)
import Data.Tuple (Tuple(..))
import Debug.Trace (class DebugWarning, spy)
import Effect (Effect)
import Effect.Random (randomInt)

## Promise.js
// Reduce Implementation
function promiseAllReduction(promises) {
  return promises.reduce(function(acc, i) {
    return acc.then(rs => i.then(r => [...rs, r]))
  }, Promise.resolve([]));
}

// Recursive Implementation
function promiseAllRecursive(promises) {
  if(promises.length === 0) {

## gdrive-pdf.js
(function() {
  let jspdf = document.createElement("script");

  jspdf.onload = function () {

      let pdf = new jsPDF();
      let elements = document.getElementsByTagName("img");
      for (let i in elements) {
          let img = elements[i];
          console.log("add img ", img);

## Either.ts

export interface Either<E, A> {
  map<B>(f: (a: A) => B): Either<E, B>;
  mapLeft<F>(f: (e: E) => F): Either<F, A>;
  flatMap<B>(f: (a: A) => Either<E, B>): Either<E, B>;
  flatMapLeft<F>(f: (e: E) => Either<F, A>): Either<F, A>;
  ap<B>(f: Either<E, (a: A) => B>): Either<E, B>;
  match<R>(result: (success: A) => R, error: (err: E) => R): R;
}

## TinyServant.hs
{-# LANGUAGE DataKinds, PolyKinds, TypeOperators #-}
{-# LANGUAGE TypeFamilies, FlexibleInstances, ScopedTypeVariables #-}
{-# LANGUAGE InstanceSigs #-}

module TinyServant where

import Control.Applicative
import GHC.TypeLits
import Text.Read
import Data.Time
	<html>
	<head>
	</head>
	<body>
	<iframe width="700" height="350" frameborder="0" scrolling="no" marginheight="0" marginwidth="0" src="https://maps.google.com/maps?q=https:%2F%2Fraw.github.com%2Fthroughnothing%2Fgpx%2Fmaster%2F2012%2F20120629.kml&t=h&ie=UTF8&output=embed"></iframe><br />
	</body>
	</html>
	module GADT.Main where

	import Prelude (class Category, class Semigroupoid, (<<<), flip, identity, ($), (+), (==))

	import Unsafe.Coerce (unsafeCoerce)

	newtype Leibniz a b = Leibniz (forall f. f a -> f b)
	infix 4 type Leibniz as ~

	instance semigroupoidLeibniz :: Semigroupoid Leibniz where
	module MontyHall.Main where

	import Prelude

	import Data.Foldable (foldr)
	import Data.List.Lazy (range)
	import Data.Tuple (Tuple(..))
	import Debug.Trace (class DebugWarning, spy)
	import Effect (Effect)
	import Effect.Random (randomInt)
	// Reduce Implementation
	function promiseAllReduction(promises) {
	return promises.reduce(function(acc, i) {
	return acc.then(rs => i.then(r => [...rs, r]))
	}, Promise.resolve([]));
	}

	// Recursive Implementation
	function promiseAllRecursive(promises) {
	if(promises.length === 0) {
	(function() {
	let jspdf = document.createElement("script");

	jspdf.onload = function () {

	let pdf = new jsPDF();
	let elements = document.getElementsByTagName("img");
	for (let i in elements) {
	let img = elements[i];
	console.log("add img ", img);

	export interface Either<E, A> {
	map<B>(f: (a: A) => B): Either<E, B>;
	mapLeft<F>(f: (e: E) => F): Either<F, A>;
	flatMap<B>(f: (a: A) => Either<E, B>): Either<E, B>;
	flatMapLeft<F>(f: (e: E) => Either<F, A>): Either<F, A>;
	ap<B>(f: Either<E, (a: A) => B>): Either<E, B>;
	match<R>(result: (success: A) => R, error: (err: E) => R): R;
	}
	{-# LANGUAGE DataKinds, PolyKinds, TypeOperators #-}
	{-# LANGUAGE TypeFamilies, FlexibleInstances, ScopedTypeVariables #-}
	{-# LANGUAGE InstanceSigs #-}

	module TinyServant where

	import Control.Applicative
	import GHC.TypeLits
	import Text.Read
	import Data.Time