ibtaylor

Homebrew build logs for yaml-cpp on macOS 10.12.6
Build date: 2018-02-02 15:12:44

ibtaylor

// This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2008-2010 Gael Guennebaud <gael.guennebaud@inria.fr>
// Copyright (C) 2009 Benoit Jacob <jacob.benoit.1@gmail.com>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.

ibtaylor

#ifndef __C89P90P2001_H__
#define __C89P90P2001_H__

/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

 TODO:
  add C11 additions

 - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */

ibtaylor

#
# Warning, if you prepended macports paths to your PATH, you may have issues.
#
# which ar  => /usr/bin/ar
# which gcc => /usr/bin/gcc
# which ld  => /usr/bin/ld
#
# maybe others are important too..
#

ibtaylor

#!/bin/bash

[ $# != 1 ] && exit

url=$1

echo "$url"
curl -sLI "$url" | sed -n -e 's/^Location: //p' -e 's/\r//g'

ibtaylor

{-# LANGUAGE BangPatterns #-}
--module Data.Huffman where
module Main where

import Data.Char (intToDigit)
import Data.List (insertBy, foldl', sortBy)
import Data.Maybe (fromJust)
import Data.Ord (comparing)
import qualified Data.Binary.BitPut        as P
import qualified Data.Binary.Strict.BitGet as G

ibtaylor

ngrams :: Int -> Text -> [Text]
ngrams !n =
    foldr f [] . T.tails
  where
    f e a
        | len == n  = gram : a
        | otherwise = a
      where
        !len  = T.length gram
        !gram = T.take n e

ibtaylor

module Sound.OpenAL.Util
  ( withDevice
  , withDefaultDeviceAndContext
  , createBuffer
  , createBufferData
  , createBufferFromData
  , createBufferFromSample
  , whileSourceIsPlaying
  , sleep
  , getSamplingRate

ibtaylor

{-# LANGUAGE BangPatterns, MagicHash #-}
module Main where

import Criterion.Main
import GHC.Base
import GHC.Prim
import Criterion.Config
import Criterion.Main
import Data.Monoid
import qualified Criterion.MultiMap as M

ibtaylor

{-# LANGUAGE BangPatterns #-}

{-
Each new term in the Fibonacci sequence is generated by adding the previous two
terms. By starting with 1 and 2, the first 10 terms will be:

1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

Find the sum of all the even-valued terms in the sequence which do not exceed
four million.