prehistoricpenguin

prehistoricpenguin / sendmail.py

Last active August 29, 2015 14:03

	import win32com.client as win32
	import time
	import sys
	import os
	import shutil


	def sendonemail(addr = "", attach = "", subject = ""):
	outlook = win32.Dispatch('outlook.application')
	mail = outlook.CreateItem(0)

prehistoricpenguin / stringtohexarray.cpp

Created March 27, 2014 08:22

"0123456789abcdef" - > 0x12 0x34 0x56 0x78 ...

prehistoricpenguin / latency.md

Created March 26, 2014 09:03 — forked from jboner/latency.txt

Rename

Latency Comparison Numbers

Type	time	comment
L1 cache reference	0.5 ns
Branch mispredict	5 ns
L2 cache reference	7 ns	14x L1 cache
Mutex lock/unlock	25 ns
Main memory reference	300 ns	20x L2 cache, 200x L1 cache

prehistoricpenguin / cpp-learning.md

Last active August 29, 2015 13:57

for (const auto x : { 1, 2, 3}}) cout << x <<  endl;

class A {

prehistoricpenguin / find unique num.cpp

Last active August 29, 2015 13:57

	#include <vector>
	#include <iostream>
	#include <cstdio>
	using namespace std;

	pair<int, int> findNumber(const vector<int>& vec) {
	int xsum = 0;
	int sz = vec.size();

	// calc for total arrary

prehistoricpenguin / key_gen.cpp

Last active August 29, 2015 13:56

	string generate_code() {
	const int kcodelength = 25;
	char res[kcodelength + 10];
	string buffer = "1234567890abcdefghijklmnopqrstuvwzyz"
	"ABCDEFGHIJKLMNOPQRSTUVWXYZ";
	int len = buffer.length();

	int idx = 0;
	for (int i = 0; i < kcodelength; ++i) {
	char tmp = buffer[rand() % len];

prehistoricpenguin / container_perf.cpp

Created February 19, 2014 08:59

	// A simple demo aimed to test the time efficiency for the find operation
	// in C++ STL containers, used in vector,map and unordered_map, respectively.

	#include <vector>
	#include <map>
	#include <algorithm>
	#include <unordered_map>

	#include <cstdio>
	#include <ctime>

prehistoricpenguin / bsearch.c

Created February 17, 2014 03:09 — forked from cloudwu/bsearch.c

	int
	binary_search_first_position(int *A, int n, int target) {
	int end[2] = { -1, n };
	while (end[0] + 1 < end[1]) {
	int mid = (end[0] + end[1]) / 2;
	int sign = (unsigned)(A[mid] - target) >> 31;
	end[1-sign] = mid;
	}
	int high = end[1];
	if (high >= n \|\| A[high] != target)

prehistoricpenguin / uva10986.cpp

Created January 10, 2014 14:41

prehistoricpenguin / bfs.cpp

Created January 8, 2014 12:18