aravindavk

#!/usr/bin/env python
"""
Consumer example to use the shared object created in Rust.
Ref: http://blog.skylight.io/bending-the-curve-writing-safe-fast-native-gems-with-rust/
Rust program: points.rs

    use std::num::pow;

    pub struct Point { x: int, y: int }
    struct Line  { p1: Point, p2: Point }

paf31

Introduction

At DICOM Grid, we recently made the decision to use Haskell for some of our newer projects, mostly small, independent web services. This isn't the first time I've had the opportunity to use Haskell at work - I had previously used Haskell to write tools to automate some processes like generation of documentation for TypeScript code - but this is the first time we will be deploying Haskell code into production.

Over the past few months, I have been working on two Haskell services:

• A reimplementation of an existing socket.io service, previously written for NodeJS using TypeScript.
• A new service, which would interact with third-party components using standard data formats from the medical industry.

I will write here mostly about the first project, since it is a self-contained project which provides a good example of the power of Haskell. Moreover, the proces

chrisdone

Typing Haskell in Haskell

MARK P. JONES

Pacific Software Research Center

Department of Computer Science and Engineering

Oregon Graduate Institute of Science and Technology

JohnMorales

This diff is a modified version of a diff written by Arnis Lapsa.

[ The original can be found here: https://gist.github.com/ArnisL/6156593 ]

This diff adds support to tmux for 24-bit color CSI SRG sequences. This
allows terminal based programs that take advantage of it (e.g., vim or
emacs with https://gist.github.com/choppsv1/73d51cedd3e8ec72e1c1 patch)
to display 16 million colors while running in tmux.

The primary change I made was to support ":" as a delimeter as well

oakes

Contents

• Why care about Rust?
• The Toolchain
• Creating a New Project
• Modules
• Crates
• Types
• References
• Mutability

mislav

# Get the shortest match (least distance between start and end index) for all
# the query characters in the given text.
#
# Returns an array in format [firstIndex, matchLength, [matchIndexes]]
shortestMatch = (text, queryChars) ->
  starts = allIndexesOf(text, queryChars[0])

  return if starts.length is 0
  return [starts[0], 1, []] if queryChars.length is 1

ryane

---
- hosts: all

  vars:
    UBUNTU_COMMON_ROOT_PASSWORD: 'xxxxx'
    UBUNTU_COMMON_DEPLOY_PASSWORD: 'xxxxx'
    UBUNTU_COMMON_LOGWATCH_EMAIL: user@example.com
    ubuntu_common_deploy_user_name: deploy
    ubuntu_common_deploy_public_keys:
      - ~/.ssh/id_rsa.pub

romainl

This gist is no longer maintained.

See https://github.com/romainl/vim-rnb for an up-to-date version.

---

My Vim-related gists.

thypon

#!/usr/bin/env ruby

require 'rubygems'
require 'gems'
require 'json'

class Package < Struct.new(:name, :language, :version, :hash, :source, :homepage, :depends)
end

class Dependencies < Struct.new(:hostmake, :make, :runtime)

DRMacIver

"""
This is an example of how to use Hypothesis to test a classic combinatorial
optimisation problem without having a reference implementation to compare
against.

The problem we're going to look at is the knapsack packing problem: Given a
set of objects with value and weight, how can maximize the total value while
keeping the total weight under a certain amount.

You can solve this exactly as an integer linear programming without too much