robotlolita

You appear to be advocating a new:

• functional
• imperative
• object-oriented
• procedural
• stack-based
• "multi-paradigm"
• lazy
• eager
• statically-typed

coproduto

-- `Cont r a` é o tipo de uma computação que produz um `a` e, quando completa,
-- irá produzir um `r`. Você pode ver como uma linha de produção com uma parte
-- "faltando" - essa parte é a função `a -> r` que o `Cont` precisa para estar
-- "completo".

newtype Cont r a = Cont { runCont :: (a -> r) -> r }

-- pode não ser imediatamente óbvio por que uma função do tipo `(a -> r) -> r`
-- precisa, em geral, produzir um `a` internamente - por parametricidade, só existem 
-- duas formas de uma função polimórfica do tipo `(a -> r) -> r` existir:

sibelius

const useCaretPosition = () => {
  const [caret, setCaret] = useState({
    selectionStart: 0,
    selectionEnd: 0,
  });

  const onEvent = useCallback((e) => {
    const input = e.target;

    setCaret({

denispeplin

iex> So.Exclude.exclude1
Name                        ips        average  deviation         median
substract                9.18 M       0.109 μs   ±358.78%       0.100 μs
mapset_difference        4.00 M        0.25 μs ±17781.86%         0.0 μs
enum_filter              3.70 M        0.27 μs  ±1712.25%        0.20 μs
ordsets                  2.63 M        0.38 μs  ±1348.35%        0.30 μs

Comparison:
substract                9.18 M
mapset_difference        4.00 M - 2.30x slower

hjJunior

import 'dart:convert';

Map<String, dynamic> parseJwt(String token) {
  final parts = token.split('.');
  if (parts.length != 3) {
    throw Exception('invalid token');
  }

  final payload = _decodeBase64(parts[1]);
  final payloadMap = json.decode(payload);

EduardoRFS

Instantiation in O(n)

Most of the time instantiation is actually O(n log n), this mostly don't matter as types are always small. But for big types by having an additional memory cell on every type, an array / vector can be created.

Invariants

Doesn't matter how forall is encoded, instantiation needs to copy all sections of a type that may include an occurence of the free variable being instantiated.

Maybe an additional branching can be used to prevent allocation.

sinclairtarget

Simulation Begin
    ! We will use this as input to Normal() below ;
    Integer seed;

    ! Utility method for logging messages along with the current simulation
      time ;
    Procedure log(message); Text message; Begin
        OutFix(Time, 2, 0);
        OutText(": " & message);
        OutImage;

slashdotdash

Elixir tips

Editor

• Atom editor.
• atom-elixir package.

Style guide

• The Elixir style guide.

lhorie

So there were a few threads going around recently about a challenge to write the longest sequence of keywords in Javascript:

• https://twitter.com/bterlson/status/1093624668903268352
• https://news.ycombinator.com/item?id=19102367

There are, however, a few problems:

• These solutions use non-keyword tokens (null, true, false are actually Literals, not Keywords)
• One of the solutions isn't quite valid (new super)

dahngeek

I managed to achieve this by using Windows included Networking tool netsh.

As Mat points out : The hosts file is for host name resolution only, so a combination of the two did the trick for me.

Example

Overview

example.app:80
 |                           <--Link by Hosts File