pnf

#define _GNU_SOURCE
#include <dlfcn.h>
#include <fcntl.h>
#include <stdarg.h>
#include <string.h>

// Target path of your FIFO
static const char *FIFO_PATH = NULL;

typedef int (*orig_openat_t)(int dirfd, const char *pathname, int flags, ...);

pnf

// fast_core_read.c
#define _GNU_SOURCE
#include <dlfcn.h>
#include <sys/mman.h>
#include <sys/stat.h>
#include <unistd.h>
#include <string.h>
#include <stdio.h>
#include <stdint.h>

pnf

# window renaming
set -g @tmux-git-window-git-symbol "" # Default Git icon
set -g @tmux-git-window-dirty ""      # Uncommitted changes
set -g @tmux-git-window-conflict ""   # Merge conflicts
set -g @tmux-git-window-stashed ""    # Stashed changes
set -g @tmux-git-window-ahead ""      # Ahead of remote
set -g @tmux-git-window-behind ""     # Behind remote

set -g @tmux-git-window-diverged "󰦒"   # Diverged changes
run-shell "tmux set-environment -g TMUX_GIT_SYMBOL '#{@tmux-git-window-git-symbol}'"

pnf

#!/bin/sh

git_symbol="#{TMUX_GIT_SYMBOL}"
dirty_symbol="#{TMUX_GIT_DIRTY}"
conflict_symbol="#{TMUX_GIT_CONFLICT}"
stashed_symbol="#{TMUX_GIT_STASHED}"
ahead_symbol="#{TMUX_GIT_AHEAD}"
behind_symbol="#{TMUX_GIT_BEHIND}"
diverged_symbol="#{TMUX_GIT_DIVERGED}"

pnf

import java.util.concurrent.ConcurrentLinkedQueue
import scala.annotation.tailrec
import scala.concurrent.{ExecutionContext, Future, Promise}
implicit val ec =  ExecutionContext.global

val data = Map(
  "getBff 1" -> 3,
  "getBff 2" -> 4,
  "getFN 1" -> "Harry",
  "getFN 2" -> "Biff",

pnf

; list of winning positions
(def wp 
  [2r111000000 2r000111000 2r000000111 2r100100100 2r010010010 2r001001001 2r100010001 2r001010100])
;; Is a particular bitmask winning?
(defn winner? [p] 
  (some (fn [c] (= (bit-and c p) c)) wp))
;; list of possible moves, filtering out ones already made
(defn moves [p] 
  (filter pos? (map #(bit-and (bit-not p) (bit-shift-left 1%)) (range 9))))
;; A board position comprises a bitarray for each player and an indicaiton of whose turn it is.

pnf

trait ViewTransformer[-A,+B] {
  def sequence(in: Iterable[A]) = transform(in.view).to(IterableFactory.toSpecific(in.iterableFactory))
  def transform(v: View[A]): View[B]
  def map[C](f: B => C): ViewTransformer[A,C] = new ViewTransformerImpl[A,C,B](this) {
    override def transform(v: View[A]): View[C] =  prev.transform(v).map(f)
  }
  def flatMap[C](f: B => IterableOnce[C]): ViewTransformer[A,C] = new ViewTransformerImpl[A,C,B](this) {
    override def transform(v: View[A]): View[C] =  prev.transform(v).flatMap(f)
  }
}

pnf

{-# LANGUAGE RankNTypes #-}
import Data.STRef
import Data.Vector (fromList, toList, freeze, thaw)
import Control.Monad
import Data.Vector.Mutable (MVector, STVector, read, write, swap)
import qualified Data.Vector as V (Vector, length)
import Data.List (sortOn)
import Prelude hiding (read)
import GHC.ST

pnf

(ns qaxl.core
  (:use clojure.walk clojure.pprint qaxl.cache)
  (:require [co.paralleluniverse.pulsar.async :as qa]
            [clojure.core.async :as a]
            [co.paralleluniverse.pulsar.core :as q]
            [clojure.test :refer [function?]]
            [co.paralleluniverse.fiber.httpkit.client :as hk]
            [co.paralleluniverse.pulsar.core :refer [fiber]]
            [clojure.core.match :refer [match]]))

pnf

;; La bella vita di quattro finestre
(global-set-key "\C-col" 'windmove-left)
(global-set-key "\C-cor" 'windmove-right)
(global-set-key "\C-cou" 'windmove-up)
(global-set-key "\C-cod" 'windmove-down)
(global-set-key "\C-cow" 'ido-jump-to-window)
(defun windmove-opposite () (interactive)
  (if (windmove-find-other-window 'up) (windmove-up) (windmove-down))
  (if (windmove-find-other-window 'right) (windmove-right)(windmove-left)))
(global-set-key "\C-coo" 'windmove-opposite)