People
 :bowtie: |
😄 :smile: |
😆 :laughing: |
|---|---|---|
😊 :blush: |
😃 :smiley: |
:relaxed: |
😏 :smirk: |
😍 :heart_eyes: |
😘 :kissing_heart: |
😚 :kissing_closed_eyes: |
😳 :flushed: |
😌 :relieved: |
😆 :satisfied: |
😁 :grin: |
😉 :wink: |
😜 :stuck_out_tongue_winking_eye: |
😝 :stuck_out_tongue_closed_eyes: |
😀 :grinning: |
😗 :kissing: |
😙 :kissing_smiling_eyes: |
😛 :stuck_out_tongue: |
| #include <stdio.h> | |
| #include <memory> | |
| int main() { | |
| std::unique_ptr<FILE, int(*)(FILE*)> fp(fopen("test.txt", "r"), fclose); | |
| if(fp) { | |
| char buf[4096]; | |
| while(fgets(buf, sizeof(buf), fp.get())) { | |
| printf("%s", buf); |
ror, scala, jetty, erlang, thrift, mongrel, comet server, my-sql, memchached, varnish, kestrel(mq), starling, gizzard, cassandra, hadoop, vertica, munin, nagios, awstats
| import Control.Monad (forever, forM_) | |
| import Control.Concurrent | |
| import Control.Concurrent.STM | |
| data Event = Timeout | |
| | Message Int | |
| deriving (Show) | |
| pusher :: TChan Event -> IO () | |
| pusher c = forM_ [0 ..] $ \i -> do |
| import Control.Proxy | |
| import Control.Proxy.TCP | |
| main :: IO () | |
| main = serve (Host "0.0.0.0") "8000" $ \(socket,_) -> | |
| runProxy $ socketReadS 4096 socket >-> socketWriteD socket |
| import Data.Maybe (isJust) | |
| data Tree a = Leaf | Node (Tree a) a (Tree a) | |
| replace :: a -> Tree a -> Tree a | |
| replace a Leaf = Node Leaf a Leaf | |
| replace a (Node l _ r) = Node l a r | |
| rotateR :: Tree a -> Tree a | |
| rotateR (Node (Node x a y) b z) = Node x a (Node y b z) |
| -- show running queries (pre 9.2) | |
| SELECT procpid, age(clock_timestamp(), query_start), usename, current_query | |
| FROM pg_stat_activity | |
| WHERE current_query != '<IDLE>' AND current_query NOT ILIKE '%pg_stat_activity%' | |
| ORDER BY query_start desc; | |
| -- show running queries (9.2) | |
| SELECT pid, age(clock_timestamp(), query_start), usename, query | |
| FROM pg_stat_activity | |
| WHERE query != '<IDLE>' AND query NOT ILIKE '%pg_stat_activity%' |
| package main | |
| /* | |
| Ping vs Pong: A Gladiatorial Match | |
| Two goroutines enter, only one leaves... | |
| */ | |
| /* | |
| #cgo LDFLAGS: -lprobes -L/usr/local/lib | |
| #include "probes.h" |
| /** | |
| * D Holbrook | |
| * | |
| * Code Club: PO1 | |
| * | |
| * (*) Define a binary tree data structure and related fundamental operations. | |
| * | |
| * Use whichever language features are the best fit (this will depend on the language you have selected). The following operations should be supported: | |
| * | |
| * Constructors |
| D [0-9] | |
| L [a-zA-Z_] | |
| H [a-fA-F0-9] | |
| E ([Ee][+-]?{D}+) | |
| P ([Pp][+-]?{D}+) | |
| FS (f|F|l|L) | |
| IS ((u|U)|(u|U)?(l|L|ll|LL)|(l|L|ll|LL)(u|U)) | |
| %{ | |
| #include <stdio.h> |
