| import urllib | |
| class AdflySkipper: | |
| def __init__(self, url): | |
| self.url = url | |
| def extract(self): | |
| source = urllib.urlopen(self.url).readlines() | |
| for line in source: |
| <?php /* Copyright(c) 2013 Robert Maupin. Released under the ZLIB License. */ | |
| if(count($_FILES) > 0) { | |
| extract($_FILES['file']); | |
| list($w,$h,$type)=getimagesize($tmp_name); | |
| /*see exif-imagetype() documentation :) */ | |
| if(!$type||$type>3||filesize($tmp_name)>1024*200) | |
| exit(); | |
| $ext=image_type_to_extension($type,false); | |
| $md5=md5_file($tmp_name); | |
| move_uploaded_file($tmp_name,$n="img/$md5.$ext"); |
| ''' | |
| Demonstration of using `splice` with non-blocking IO | |
| Lots of code is similar to 'splice.py', take a look at that module for more | |
| documentation. | |
| ''' | |
| import os | |
| import os.path | |
| import errno |
I was reading the gist @https://gist.github.com/2012250
I found the autovivification functionality of it pretty cool. If only I could have a parent reference...
Obviously this was not going to be a one-line tree. But that wasn't the goal
A simple variant:
from collections import defaultdict
| """This module sorts a list of results based on a query. | |
| If there is an intersection between words in the query and a result, it | |
| is placed near the beginning of the list (based on length of intersection). | |
| If there is no intersection, the position of the query (substring) in the | |
| result (string) is used for sorting. These results are placed toward the end | |
| of the list. | |
| """ |
| # -*- coding: utf-8 -*- | |
| # seq 5000 | xargs -P100 -I% python2 selfdb.py k% v% | |
| '''{prog} -- self-logging in-memory key-value storage | |
| Usage: | |
| Display Keys | |
| {prog} | |
| Get Value of Key | |
| {prog} some-key |
| #! /usr/bin/env python | |
| """{escher} -- one-file key-value storage. | |
| What? | |
| This is a toy application to manage persistent key-value string data. | |
| The file {escher} is *both* the application and its data. | |
| When you run any of the commands below, the file will be executed and, | |
| after data change, it will rewrite itself with updated data. | |
| You can copy the file with whatever name to create multiple datasets. |
| def log_gen(n): | |
| import math | |
| y = 1 | |
| while y < n: | |
| adder = max(1, math.pow(10, int(math.log10(y)))) | |
| yield int(y) | |
| y = y + adder |
| """ | |
| MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm | |
| Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All | |
| rights reserved. | |
| License to copy and use this software is granted provided that it | |
| is identified as the "RSA Data Security, Inc. MD5 Message-Digest | |
| Algorithm" in all material mentioning or referencing this software | |
| or this function. |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <assert.h> | |
| typedef unsigned int u32; | |
| typedef unsigned long long u64; | |
| //------------------------------------------------------------------------- | |
| // WorkArea | |
| //------------------------------------------------------------------------- |
