Simn

class Main {
	static function main() {
		trace(process(12)); // 24
		trace(process("Hello world")); // HELLO WORLD
	}
	
	@:generic static function process<T>(t:T):T {
		return throw "unknown type: " + t;
	}
	

deltaluca

abstract Fixed16(Int) {
    inline function new(x:Int) this = x;
    inline function raw() return this;
    inline static function RAW(x:Int) return new Fixed16(x);

    public static var MAX_VALUE:Fixed16 = RAW(0x7fffffff);
    public static var MIN_VALUE:Fixed16 = RAW(1);

    @:from public static inline function fromf(x:Float) {
        #if debug

jasononeil

import haxe.macro.Expr;
import haxe.macro.Context;

class ClassicSwitch
{
	macro static public function from(inExpr:Expr):Expr
	{
		var retExpr:Expr = null;

		switch (inExpr.expr)

jasononeil

import haxe.ds.StringMap;
import haxe.web.Dispatch;
import haxe.web.Dispatch.DispatchError;

#if sys
import Sys.println;
import Sys.print;
#else 
import haxe.Log.trace in println;
import haxe.Log.trace in print;

dpeek

import haxe.macro.Expr;

class FTW
{
	public static function build()
	{
		return haxe.macro.Context.getBuildFields().map(transformField);
	}

	static function transformField(field:Field)

debasishg

General Background and Overview

1. Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
2. Models and Issues in Data Stream Systems
3. Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
4. Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
5. [Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep=rep1&t

gagern

import sys
import subprocess
import io

class PacketReader(object):

    packetTagNames = {
        0: 'Reserved - a packet tag MUST NOT have this value',
        1: 'Public-Key Encrypted Session Key Packet',
        2: 'Signature Packet',

nadako

/**
 * Simple wrapper for anonymous structures that are meant to be used as a
 * keyed collection of objects of the same type (i.e. json object).
 *
 * Wraps Reflect calls with nice syntax and static typing without any
 * runtime overhead.
 */
abstract DynamicMap<V>(Dynamic<V>) from Dynamic<V>
{
    /**

seboudry

Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns                     on recent CPU
L2 cache reference ........................... 7 ns                     14x L1 cache
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns                     20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy ............. 3,000 ns  =   3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns  =  20 µs
SSD random read ........................ 150,000 ns  = 150 µs

Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs 4X memory

nadako

import haxe.macro.Context;
import haxe.macro.Expr;

using haxe.macro.ExprTools;

class Main
{
    inline static var QUOTED_FIELD_PREFIX = "@$__hx__";

    static function main()