Skip to content

Instantly share code, notes, and snippets.

tam17aki /
Last active Apr 2, 2021
A TensorFlow implementation of Simple Recurrent Unit (SRU).
# -*- coding: utf-8 -*-
# Copyright (C) 2017 by Akira TAMAMORI
# This program is free software; you can redistribute it and/or modify it under
# the terms of the GNU General Public License as published by the Free Software
# Foundation, either version 3 of the License, or (at your option) any later
# version.
# This program is distributed in the hope that it will be useful, but WITHOUT
jkbradley / LDA_SparkDocs
Created Mar 24, 2015
LDA Example: Modeling topics in the Spark documentation
View LDA_SparkDocs
This example uses Scala. Please see the MLlib documentation for a Java example.
Try running this code in the Spark shell. It may produce different topics each time (since LDA includes some randomization), but it should give topics similar to those listed above.
This example is paired with a blog post on LDA in Spark:
import scala.collection.mutable
listochkin / callbacks-promises-generators.js
Created Dec 13, 2014
Async ccode with Callbacks, Promises and Generators
View callbacks-promises-generators.js
/* jshint node:true, mocha:true, eqnull:true, esnext:true */
'use strict';
var chai = require('chai'),
assert = chai.assert,
expect = chai.expect;
var request = require('request');
var jsdom = require("jsdom");
View DomainWithConstraints.cs
class CreateTheme
public int Id;
public int AccountId;
public string Name;
public Optional<string> Description;
static void Handle(IUnitOfWork uow, CreateTheme cmd)
raindev / game-of-life.hs
Created Nov 15, 2014
Game of life produced on the last coding session of Kyiv Global Day of Coderetreat 2014
View game-of-life.hs
import Data.List
-- Transform cells into next iteration
nextTurn :: (Integral a) => [(a,a)] -> [(a,a)]
nextTurn space = [(x, y) | (x,y,_) <- [head xs | xs <- cells space, length xs == 3 || (length xs == 4 && True `elem` ([x | (_,_,x) <- xs]))]]
-- Cells grouped by their coordinates
cells :: (Integral a) => [(a,a)] -> [[(a,a,Bool)]]
cells space = groupBy (\(x1,y1,_) (x2,y2,_) -> x1 == x2 && y1 == y2) (sort (neighbourhood space))
vbfox / Dapper.fs
Last active Feb 26, 2020
Minimal dapper in F#
View Dapper.fs
module DapperFSharp =
open System.Data.SqlClient
open System.Dynamic
open System.Collections.Generic
open Dapper
let dapperQuery<'Result> (query:string) (connection:SqlConnection) =
let dapperParametrizedQuery<'Result> (query:string) (param:obj) (connection:SqlConnection) : 'Result seq =
View gist:f9b1eeb99cb0ee6b3ad2
Do you like interesting problems? Do you keep a notepad/laptop next to your bed because you tend to solve problems while sleeping? We might be a good fit.
We are a totally distributed team. Everyone works from home (even if home tends to be in airplanes). Most of the code we write is Open Source and is available on github if you want to look through it. The team completely owns the project.
Perhaps we could be a good fit for you, we are seeking developers who are:
1) Always improving
2) Highly Technical
3) Capable of working in a remote environment
4) Independent
staltz /
Last active May 7, 2021
The introduction to Reactive Programming you've been missing