#Haskell基础
- 语法、语义
- 常用函数实现
- 函数参考
- 语法拾遗
- Codeforces
- 99 Problem
- Euler
- Queue
| /*************** | |
| * pointers.js * | |
| *************** | |
| * | |
| * You! How are you still alive? | |
| * | |
| * Well, no matter. Good luck getting through this | |
| * maze of rooms - you'll never see me or the Algorithm again! | |
| */ |
| /* | |
| * robotMaze.js | |
| * | |
| * The blue key is inside a labyrinth, and extracting | |
| * it will not be easy. | |
| * | |
| * It's a good thing that you're a AI expert, or | |
| * we would have to leave empty-handed. | |
| */ |
#Haskell基础
Open Computing Language (OpenCL) is a language and framework for writing computationally intensive kernels that run accross heterogenious platforms, including GPUs, CPUs, and perhaps other more esoteric devices.
Intel provides an OpenCL implementation for Intel CPUs, but there's not a lot of instructions on how to get it set up. Here's what I did.
intel_sdk_for_ocl_applications_2013_xe_sdk_3.0.67279_x64.tgzOops! I accidentally deleted a local git branch, and I haven't pushed it to a remote server yet. The branch has several important commits, and it hasn't been merged with any other branches yet. How do I find the missing branch?
$ git fsck --full --no-reflogs --unreachable --lost-found
unreachable tree 4a407b1b09e0d8a16be70aa1547332432a698e18
unreachable tree 5040d8cf08c78119e66b9a3f8c4b61a240229259
unreachable tree 60c0ce61b040f5e604850f747f525e88043dae12
unreachable tree f080522d06b9853a2f18eeeb898724da4af7aed9| import sys | |
| import re | |
| class mysql_to_mssql_converter: | |
| """ | |
| Python script for converting MySQL dump into MSSQL compatible scripts | |
| Based on my project, I know the following points need to be converted | |
| 1. ` need to be removed | |
| 2. ENGINE=InnoDB etc need to be removed | |
| 3. int(size), (size) is not supported for int, need to be removed. | |
| 4. AUTO_INCREMENT need to be changed to IDENTITY(1,1) |
The count of contributions (summary of Pull Requests, opened issues and commits) to public repos at GitHub.com from Sun, 16 Dec 2012 07:15:00 GMT till Mon, 16 Dec 2013 07:15:00 GMT.
Only first 1000 GitHub users according to the count of followers are taken. This is because of limitations of GitHub search. Sorting algo in pseudocode:
githubUsers
.filter((user) -> user.followers > 228)| #!/bin/bash | |
| echo "Cleaning up..." | |
| #rm 00-index.tar.gz | |
| mkdir -p package | |
| echo "Downloading index..." | |
| wget -c http://hackage.haskell.org/packages/archive/00-index.tar.gz | |
| for splitpk in `tar tf 00-index.tar.gz | cut -d/ -f 1,2`; do | |
| pk=`echo $splitpk | sed 's|/|-|'` | |
| name=$pk.tar.gz |
| Fibonacci sequence | |
| > fibonacciList = 1:1:zipWith (+) (tail fibonacciList) fibonacciList | |
| Prime number sequence | |
| > primeList = 2 : let oddList = [3,5..] in filter (\n-> and $ map (\x-> rem n x /= 0) $ takeWhile (\x -> x <= floor (fromIntegral n**(0.5))) primeList) oddList | |
| Binomial coefficients for each order, called Pascal's Triangle | |
| > pascalTriangleList = let fetch2 = (\(m,list) -> let ls = 1:map (\n->sum $ (take 2.drop n) list) [0..floor $ fromIntegral (m-1)/2] in ls ++ (if odd m then drop 1 else id) (reverse ls)) in [1]:[1,1]: (map fetch2 $ zip [1..] $ tail pascalTriangleList) |