You would think it would be easy to find this information, but none of the Github or Gandi documentation is clear so I have recorded the required steps here.
Create the following A records:
@ 1800 IN A 185.199.108.153
@ 1800 IN A 185.199.109.153
@ 1800 IN A 185.199.110.153
Follow these steps to remove all archives from an AWS vault. After this is finished, you will be able to delete the vault itself through the browser console.
This will create a job that collects required information about the vault.
$ aws glacier initiate-job --job-parameters '{"Type": "inventory-retrieval"}' --account-id YOUR_ACCOUNT_ID --region YOUR_REGION --vault-name YOUR_VAULT_NAME
| <!DOCTYPE NETSCAPE-Bookmark-file-1> | |
| <!-- This is an automatically generated file. | |
| It will be read and overwritten. | |
| DO NOT EDIT! --> | |
| <META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=UTF-8"> | |
| <TITLE>Bookmarks</TITLE> | |
| <H1>Bookmarks</H1> | |
| <DL><p> | |
| <DT><A ADD_DATE="1452301889" HREF="http://netflix.com/browse/genre/1365">Action & Adventure</A> | |
| <DT><A ADD_DATE="1452301889" HREF="http://netflix.com/browse/genre/43040">Action Comedies</A> |
| #!/bin/sh | |
| VERSION="7u67" | |
| BUILD="betable1" | |
| set -e -x | |
| # Keep track of the original working directory. | |
| OLDESTPWD="$PWD" |
| VERSION="0.9.9" | |
| BUILD="betable1" | |
| set -e -x | |
| # Keep track of the original working directory. | |
| OLDESTPWD="$PWD" | |
| # Work in a temporary directory. | |
| cd "$(mktemp -d)" |
github.com/twotwotwo/sorts is a Go package with parallel radix- and quicksorts. It can run up to 5x faster than stdlib sort on the right sort of large sort task, so it could be useful for analysis and indexing/database-y work in which you have to sort millions of items. (To be clear, I don't recommend most folks drop stdlib sort, which is great, and which sorts depends on.)
While the process of writing it's fresh on my mind, here are some technical details, some things that didn't make the cut, and some thoughts about the process:
Concretely, what this looks like inside:
Both number and string versions are in-place MSD radix sorts that look at a byte at a time and, once the range being sorted gets down to 128 items, call (essentially) the stdlib's quicksort.
The [parallelization code
I like Learn You a Haskell as a reference and cheat-sheet but I found it a little slow for learning Haskell.
Here's my recommended order for just learning Haskell:
http://yannesposito.com/Scratch/en/blog/Haskell-the-Hard-Way/ 80% completion here is fine if you feel your attention waning, the next thing will address hammering in things like functors and monads via typeclasses.
https://github.com/NICTA/course/ this will hammer in the lessons in a very direct form by forcing you to confront the challenges and lessons learned by the creators and community of Haskell itself. Doing the exercises here is critical for being fluent.
Real World Haskell is available online. (Thanks bos!)
| * How do I release this? | |
| * I must be able to perform a 'rolling' release of this in a live system w/o | |
| causing a service interruption | |
| * does it break backward compatability with existing users of the api/system/etc | |
| * do we need to cut a new XSD? A new version (URI prefix) of our API? | |
| * did we make updates to checkouts/SNAPSHOT deps? Do we need to cut new versions of project deps? | |
| * how do I support existing users? | |
| * in what order do the affected systems need to be released? | |
| * are there system or service configuration changes that are required? | |
| * What are the Security implications of my change? |