runiq

What are these?

Functions that allow you to call a function not more than once in a given timeframe.

Throttling on the leading edge

This can be illustrated with timing diagrams. In the following diagrams, f designates call to the throttled function, t is the period where the timer is running, and x shows you the actual execution point of the throttled function.

f 1  2  3  4  5  6

hayeah

0x00      0 STOP
0x01      3 ADD
0x02      5 MUL
0x03      3 SUB
0x04      5 DIV
0x05      5 SDIV
0x06      5 MOD
0x07      5 SMOD
0x08      8 ADDMOD
0x09      8 MULMOD

fdietze

Jitpack

https://jitpack.io

For testing purposes, the easiest way to go is jitpack:

resolvers += "jitpack" at "https://jitpack.io"
libraryDependencies += "com.github.User" % "Repo" % "Tag"

mhevery

Zone Motivation

Make writing asynchronous code easier by having a consistent way of propagating "context" across related asynchronous operations. Have the "context" be responsible for async-local-storage, allowing the execution before and after hooks, and "context"-local error handling. Finally make sure that the "context"s are composable.

This feature needs to be part of the platform so that library and framework authors can relay on a common well know API, otherwise adoption will be limited.

maxtruxa

Antonym List

Note: The table headings (positive/negative) are not necessarily meaningful.

Positive	Negative
acquire	release
add	remove (e.g. an item), subtract (arithmetic)
advance	retreat
allocate	deallocate (correct), free (common)
allow	deny

ahammar

import Data.Generics
import Language.Haskell.Parser
import Language.Haskell.Pretty
import Language.Haskell.Syntax

main = do
    input <- getContents
    case parseModule input of
        ParseOk mod -> putStrLn $ prettyPrint $ everywhere (mkT desugarExp) mod
        ParseFailed loc msg -> failed loc msg