JohNan

import android.content.Context;
import android.os.Build;
import android.support.v7.widget.RecyclerView;
import android.util.AttributeSet;
import android.view.Gravity;
import android.view.View;
import android.view.ViewGroup;
import android.view.animation.TranslateAnimation;
import android.widget.FrameLayout;

gabrielemariotti

You can use this class to realize a simple sectioned RecyclerView.Adapter without changing your code.

The RecyclerView should use a LinearLayoutManager. You can use this code also with the TwoWayView with the ListLayoutManager (https://github.com/lucasr/twoway-view)

This is a porting of the class SimpleSectionedListAdapter provided by Google

Example:

CodaFi

/// Playground - noun: a place where people can play
/// Church-Turing clan ain’t nothing to func with.

/// Church encoding is a means of representing data and operators in the lambda
/// calculus.  In Swift, this means restricting functions to their fully curried
/// forms; returning blocks wherever possible.  Church Encoding of the natural
/// numbers is the most well-known form of encoding, but the lambda calculus is
/// expressive enough to represent booleans, conditionals, pairs, and lists as
/// well.  This file is an exploration of all 4 representations mentioned.

staltz

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

---

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.

---

kristopherjohnson

// F#'s "pipe-forward" |> operator
//
// Also "Optional-chaining" operators |>! and |>&
//
// And adapters for standard library map/filter/sorted

infix operator |>   { precedence 50 associativity left }
infix operator |>!  { precedence 50 associativity left }
infix operator |>&  { precedence 50 associativity left }
infix operator |>*  { precedence 50 associativity left }

puffnfresh

Inductive bool : Type :=
  | true : bool
  | false : bool.

Class Monoid (A : Type) :=
  {
    empty : A ;
    append : A -> A -> A ;

    left_neutrality : forall x, append empty x = x ;

kseo

#! /usr/bin/env ocamlscript
Ocaml.ocamlflags := ["-thread"];
Ocaml.packs := [ "core" ]
--
open Core.Std

type term =
  | Ident of string
  | Lambda of string * term
  | Apply of term * term

melanke

public class MLRoundedImageView extends ImageView {

	public MLRoundedImageView(Context context) {
		super(context);
	}

	public MLRoundedImageView(Context context, AttributeSet attrs) {
		super(context, attrs);
	}

aras-p

// Just before switching jobs:
// Add one of these.
// Preferably into the same commit where you do a large merge.
//
// This started as a tweet with a joke of "C++ pro-tip: #define private public",
// and then it quickly escalated into more and more evil suggestions.
// I've tried to capture interesting suggestions here.
//
// Contributors: @r2d2rigo, @joeldevahl, @msinilo, @_Humus_,
// @YuriyODonnell, @rygorous, @cmuratori, @mike_acton, @grumpygiant,

bishboria

-- This was an exercise: to encode _×_≡_ using _+_≡_
module Multiplication where

open import Data.Nat using (ℕ; suc; zero)

-- Addition encoded as a type
data _+_≡_ : ℕ → ℕ → ℕ → Set where
  zp : ∀ {n}                   →  zero  + n ≡ n
  sp : ∀ {m n k} →  m + n ≡ k  →  suc m + n ≡ suc k