billdozr

<div class="navbar-container">
  <div class="navbar-header">
      <button type="button" class="navbar-toggle" data-toggle="collapse" data-target=".navbar-ex1-collapse">
          <span class="sr-only">Toggle navigation</span>
          <i class="fa fa-bars"></i>
      </button>
      <a class="navbar-brand" href="/">
          ...
      </a>
  </div>

billdozr

/**Below are 2 implementations of the same function for checking whether a binary tree is sorted. isSortedA was made by myself as an answer to an exercise in FP in Scala. isSortedB was found on github as an answer to the same exercise. I assume isSortedB is better, but can anyone tell me why (other than the fact that I left out @annotation.tailrec).*/
def isSortedA[A](as: Array[A], gt: (A, A) => Boolean): Boolean = {
  def go(n: Int): Boolean = {
    if (n <= 0) true
    else if (!gt(as(n), as(n-1)))false
    else go(n-1)
  }
  go(as.length-1)
}

billdozr

In August 2007 a hacker found a way to expose the PHP source code on facebook.com. He retrieved two files and then emailed them to me, and I wrote about the issue:

http://techcrunch.com/2007/08/11/facebook-source-code-leaked/

It became a big deal:

http://www.techmeme.com/070812/p1#a070812p1

The two files are index.php (the homepage) and search.php (the search page)

billdozr

{-# LANGUAGE TemplateHaskell #-}
module Main where

import Control.Lens

data Arc = Arc
           { _degree :: Int
           , _minute :: Int
           , _second :: Int } deriving Show
                              

billdozr

package java8.func.abstraction;
/**
 * Nice post titled "List Out of Lambda" [1] written by Steve Losh,
 * implemented here in Java 8.
 *
 * Building blocks of lists:
 *  * Functions (lambdas)
 *  * `true` and `false` for empty lists
 *
 * [1] http://stevelosh.com/blog/2013/03/list-out-of-lambda/

billdozr

package java8.lisp;

import java.util.Collections;
import java.util.List;
import java.util.Optional;
import java.util.Stack;
import java.util.function.Function;

public class LispLikeLang {
    interface LExpression {

billdozr

// Compute product of even numbers
OptionalInt r = Streams.intRange(1, 11) // [1..10]
  .filter(n -> n % 2 == 0)
  .reduce((acc, n) -> acc * n);
out.println(r.isPresent() ? r.getAsInt() : 1);

billdozr

;; =============================================================================
;; Emacs Lisp Packages
;; =============================================================================
 
;(require 'package)
;(add-to-list 'package-archives
;             '("marmalade" . "http://marmalade-repo.org/packages/") t)
;(package-initialize)
(require 'package)
(add-to-list 'package-archives

billdozr

{-# LANGUAGE DeriveDataTypeable, GeneralizedNewtypeDeriving #-}
import System.Environment (getArgs, getProgName)
import Control.Monad (forM_, replicateM_)
import Data.Binary (Binary, encode, decode)
import Data.Typeable (Typeable)
import Data.ByteString.Lazy (ByteString)
import Control.Concurrent (threadDelay)
import Data.Rank1Dynamic (toDynamic)
import Control.Distributed.Static 
  ( Static

billdozr

import System.Environment (getArgs, getProgName)
import Control.Concurrent (forkIO)
import Network (Socket, PortID(PortNumber), withSocketsDo, 
                listenOn, accept)
import System.IO (hPutStrLn, hGetLine, hFlush)
import Control.Monad (forever)

main = withSocketsDo $ do
  args <- getArgs
  prog <- getProgName