kccqzy

#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

#include <algorithm>
#include <iostream>
#include <map>
#include <sstream>
#include <string>

kccqzy

import sys
import itertools

def next_power_of_two(v):
    # From Stanford bit-twiddling hacks: https://graphics.stanford.edu/~seander/bithacks.html#RoundUpPowerOf2
    v -= 1
    v |= v >> 1
    v |= v >> 2
    v |= v >> 4
    v |= v >> 8

kccqzy

#include <algorithm>
#include <array>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>

static const size_t STACK_SIZE = 16777216;
static const size_t DEFAULT_THREADS = 4;
struct Runtime;

kccqzy

#include <stdlib.h>

unsigned pext_utf8_decode(unsigned char*& buf) {
    unsigned next4;
    __builtin_memcpy(&next4, buf, 4);
    next4 = __builtin_bswap32(next4);
    if (__builtin_expect(!!(next4 >> 31), 0)) {
        // multi-byte handling
        unsigned r;
        if (((next4 >> 16) & 0b11100000'11000000) == 0b11000000'10000000) {

kccqzy

module Cumulative
  ( makeCumulative
  , makeCumulativeReverse
  ) where

import Data.Traversable
import Data.Monoid

-- | Make a traversable data structure cumulative by performing a left-biased
-- partial sum (actually a monoidal append). Linear time.

kccqzy

#include <bitset>
#include <iomanip>
#include <iostream>
#include <string.h>

namespace {
template <typename Floating, typename Integral, int expBits>
void explain(Floating x) {
  static_assert(sizeof(Floating) == sizeof(Integral),
                "types not the same size");

kccqzy

{-# LANGUAGE BangPatterns        #-}
{-# LANGUAGE NoMonoLocalBinds    #-}
{-# LANGUAGE RankNTypes          #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE ViewPatterns        #-}
module FRM
       ( FastRangeMconcat
       , fromVector
       , toVector
       , (!), (!?)

kccqzy

#!/usr/bin/env osascript -l JavaScript
var numDaysToKeep = 20;
var now = $.NSDate.date;
console.log("Now:", now.description.js);
var deleteThreshold = now.dateByAddingTimeInterval(-86400 * numDaysToKeep);
console.log("Will delete items whose date added is earlier than", deleteThreshold.description.js);

var urlPath = $.NSURL.alloc.initFileURLWithPathIsDirectory($('~/.Trash').stringByExpandingTildeInPath, true);
var fm = $.NSFileManager.defaultManager;
var urlContents = fm.contentsOfDirectoryAtURLIncludingPropertiesForKeysOptionsError(urlPath, ["NSURLAddedToDirectoryDateKey"], $.NSDirectoryEnumerationSkipsHiddenFiles, null).js;

kccqzy

{-# LANGUAGE RecordWildCards #-}

module RNCryptor (Credentials(..), encrypt, decrypt) where

import Control.Applicative ((<$>), (<*>), pure)
import Control.Monad
import Control.Monad.Trans (liftIO)
import Control.Error (hoistEither, note, hush, runEitherT, EitherT)
import qualified Data.ByteString as B
import qualified Data.Attoparsec.ByteString as PB