This gist assumes:
This is a simple way to backup your MySQL tables to Amazon S3 for a nightly backup - this is all to be done on your server :-)
Sister Document - Restore MySQL from Amazon S3 - read that next
this is for Centos 5.6, see http://s3tools.org/repositories for other systems like ubuntu etc
This is a hands-on way to pull down a set of MySQL dumps from Amazon S3 and restore your database with it
Sister Document - Backup MySQL to Amazon S3 - read that first
# Set our variables
export mysqlpass="ROOTPASSWORD"
I think I'd like to write (for fairly perverse reasons) a script that will setup something like this on a CentOS server:
| // Build a deep object of some sort | |
| var ob = { | |
| type: 'windar', | |
| title: 'Hello World', | |
| children: [ | |
| { | |
| type: 'BUTTUN', | |
| title: 'click me', | |
| }, | |
| { |
Assign this little shell script to a keyboard shortcut Xfce to open a shell -prompt, then have that file / directory opened by it's native program.
Pretty simple, excellent user-experience!
Thanks to Xfce forum member "ToC" who helped me solve a problem with the script
This is a simple way to Sync a folder with Amazon S3 for a nightly backup - this is all to be done on your server :-)
this is for Centos 5.6, see http://s3tools.org/repositories for other systems like ubuntu etc
# Install s3cmd
cd /etc/yum.repos.d/
Inspired by the police.uk crime maps, where they cleverly cluster data together depending on how far zoomed in you are, this MySQL snippet goes a long way to explaining the logic behind such an operation.
This snippet groups sites to a perfect grid while the police.uk algorithm has some sort of trickery that moves their points about somewhat, looking at their blogs and documentation I would conclude that they have a predefined set of points, each with a catchment area of postcodes. It looks like a whole lot of scraping and manual labour went into their database and quite frankly I don't have the time nor inclination do attempt such a task.
| /** | |
| * You can check if a number is a prime by looping the known primes to see if it divides. | |
| */ | |
| // Seed the primes array | |
| var primes = [2,3]; | |
| // Start counting up... | |
| myCounter : for(n=5; n<10000; n+=2){ | |
| // Loop the known primes | |
| for(p=0, l=primes.length; p<l; p++){ |
Found this little experiment in the depths of one of my projects; I've removed it and dumped it here in case I want it in the future
