Tom De Leu tdl

## gist:3892056
wget --no-check-certificate --user=xyz --password=abc <URL>

## gist:3879068
System.getProperties().list(System.out);

## gist:3558107
ifconfig en0 | grep ether | awk '{print $2}' | sed 's/://g'

## gist:3235729
history | cut -c8- | sort | uniq -c | sort -rn | head

## gist:3130382
curl -d @<inputfile> <URL> > <outputfile>

## gist:3090303
xmllint --noout --schema http://ns.hr-xml.org/2_4/HR-XML-2_4/StandAlone/Resume.xsd <filename>

## gist:2953090
require 'nokogiri'

doc = Nokogiri::XML(File.read(ARGV[0]))

puts doc.xpath("/xmlns:Resume/xmlns:StructuredXMLResume/xmlns:EmploymentHistory/xmlns:EmployerOrg/xmlns:PositionHistory/xmlns:Title/text()")

## gist:2788196
for f in *.xml; do grep "<in1>" $f | cut -d">" -f2- | cut -d"<" -f1 | base64 -d | iconv -f UTF-16LE -t UTF-8 > decoded-$f ; done

## gist:1574471
# general solution for finding the longest palindrome in a string,
# which runs in O(n) time.
# converted from the Python code here: http://www.akalin.cx/longest-palindrome-linear-time
def find_longest_palindrome(string)
  l = [] ; i=0 ; pal_len=0
  while i<string.length
    if i > pal_len and string[i-pal_len-1] == string[i]
      pal_len += 2 ; i += 1
      next
    end

## gist:1221504
grep -v "^$" inputfile
	require 'nokogiri'

	doc = Nokogiri::XML(File.read(ARGV[0]))

	puts doc.xpath("/xmlns:Resume/xmlns:StructuredXMLResume/xmlns:EmploymentHistory/xmlns:EmployerOrg/xmlns:PositionHistory/xmlns:Title/text()")
	# general solution for finding the longest palindrome in a string,
	# which runs in O(n) time.
	# converted from the Python code here: http://www.akalin.cx/longest-palindrome-linear-time
	def find_longest_palindrome(string)
	l = [] ; i=0 ; pal_len=0
	while i<string.length
	if i > pal_len and string[i-pal_len-1] == string[i]
	pal_len += 2 ; i += 1
	next
	end