hsavit1

import { buildSchema, graphql } from "graphql";

// Construct a schema, using GraphQL schema language
let graphqlSchema = buildSchema(`
  type Query {
    recipes: [Recipe]
    recipes_by_pk(id: Int!): Recipe
  }
  type Recipe {
    id: ID!

hsavit1

defmodule SqlParser do
  def run() do
    input = "select col1 from (
      select col2, col3 from (
        select col4, col5, col6 from some_table
      )
    )
    "
    IO.puts("input: #{inspect(input)}\n")
    IO.inspect(parse(input))

hsavit1

// connect() is a function that injects Redux-related props into your component.
// You can inject data and callbacks that change that data by dispatching actions.
function connect(mapStateToProps, mapDispatchToProps) {
  // It lets us inject component as the last step so people can use it as a decorator.
  // Generally you don't need to worry about it.
  return function (WrappedComponent) {
    // It returns a component
    return class extends React.Component {
      render() {
        return (

hsavit1

If you want a run-down of the 1.3 changes and the design decisions behidn those changes, check out the LonestarElixir Phoenix 1.3 keynote: https://www.youtube.com/watch?v=tMO28ar0lW8

To use the new phx.new project generator, you can install the archive with the following command:

$ mix archive.install https://github.com/phoenixframework/archives/raw/master/phx_new.ez

Bump your phoenix dep

Phoenix v1.3.0 is a backwards compatible release with v1.2.x. To upgrade your existing 1.2.x project, simply bump your phoenix dependency in mix.exs:

hsavit1

A composable pattern for pure state machines with effects

State machines are everywhere in interactive systems, but they're rarely defined clearly and explicitly. Given some big blob of code including implicit state machines, which transitions are possible and under what conditions? What effects take place on what transitions?

There are existing design patterns for state machines, but all the patterns I've seen conflate side effects with the structure of the state machine itself. Instances of these patterns are difficult to test without mocking, and they end up with more dependencies. Worse, the classic patterns compose poorly: hierarchical state machines are typically not straightforward extensions. The functional programming world has solutions, but they don't transpose neatly enough to be broadly usable in mainstream languages.

Here I present a composable pattern for pure state machiness with effects,

hsavit1

defprotocol Functor do
  def fmap(data, func)
end

defprotocol Applicative do
  def pure(data)
  def run(wrapped_func, data)
end

defprotocol Monad do

hsavit1

//
//  Created by Nick Vance on 12/4/15.
//  Copyright © 2015 ToWatchList. All rights reserved.
//

import AVKit
import XCDYouTubeKit
import TVMLKit

class YTPlayerViewController: AVPlayerViewController, AVPlayerViewControllerDelegate {

hsavit1

#!/usr/bin/env python2.7

import random
import subprocess


class Node(object):
    def __init__(self, key, value):
        self.key = key
        self.value = value

hsavit1

extension Selector {
    static let coffeeMadeNotification = #selector(Customer.drink(_:))
}

class Customer {
    @objc func drink(notification: NSNotification) {
        print("Mmm... Coffee")
    }
}

hsavit1

# Hello, and welcome to makefile basics.
#
# You will learn why `make` is so great, and why, despite its "weird" syntax,
# it is actually a highly expressive, efficient, and powerful way to build
# programs.
#
# Once you're done here, go to
# http://www.gnu.org/software/make/manual/make.html
# to learn SOOOO much more.