DmitrySoshnikov

/**
 * "Is connected?"
 *
 * Dynamic connectivity issue.
 *
 *    1  2:  not connected
 *    1--2:  connected
 * 1--2--3:  1 and 3 are connected through 2
 *
 * This implements quick union operation, but the find

DmitrySoshnikov

/**
 * "Is connected?"
 *
 * Dynamic connectivity issue.
 *
 *    1  2:  not connected
 *    1--2:  connected
 * 1--2--3:  1 and 3 are connected through 2
 *
 * by Dmitry Soshnikov <[email protected]>

DmitrySoshnikov

// by Dmitry Soshnikov <[email protected]>
// MIT Style License.

// Short URL for this example to run online is: http://cpp.sh/333

#include <iostream>
#include <vector>
#include <ctype.h>
#include <cstring>

DmitrySoshnikov

Map.prototype.map ( callbackfn [ , thisArg ] )

The map method calls MapTransform abstract operation passing this value as M, callbackfn, thisArg as is, and false as updateKey.

The length property of the map method is 1.

Map.prototype.mapEntries ( callbackfn [ , thisArg ] )

The mapEntries method calls MapTransform abstract operation passing this value as M, callbackfn, thisArg as is, and true as updateKey.

DmitrySoshnikov

Map.prototype.filter ( callbackfn [ , thisArg ] )

NOTE callbackfn should be a function that accepts three arguments. filter calls callbackfn once for each key/value pair present in the map object, in key insertion order, and returns a new filtered map. callbackfn is called only for keys of the map which actually exist; it is not called for keys that have been deleted from the map.

If a thisArg parameter is provided, it will be used as the this value for each invocation of callbackfn. If it is not provided, undefined is used instead.

callbackfn is called with three arguments: the value of the item, the key of the item, and the Map object being traversed.

filter does not directly mutate the object on which it is called but the object may be mutated by the calls to callbackfn.

DmitrySoshnikov

Pattern Matching

In this article we briefly describe the generic topic of pattern matching in programming languages. We'll see that this powerful technique is present in our every day programming, even if we may not notice it.

Matching

A matching is a process of checking whether one thing has the same or similar representation as another thing.

There are two basic matches:

DmitrySoshnikov

/**
 * Apply a function in needed environment.
 * Firefox only, educational purpose only.
 * by Dmitry Soshnikov <[email protected]>
 */

Function.prototype.setEnvironment = function(environment) {
  with (environment) {
    return eval(uneval(this));
  }

DmitrySoshnikov

-module(expr).

-export([
  parse/1,
  test/0
]).

% ------------------------------------------------------
%
%   Simple math-expressions parser

DmitrySoshnikov

/**
 * Sum of all elements including nested arrays.
 *
 * by Dmitry Soshnikov <[email protected]>
 * MIT Style License
 */

[1, 2, [3, 4], 5, [6, [7, 8]]].reduce(function collect(previous, current) {
  return (
    (Array.isArray(previous) ? previous.reduce(collect) : previous) +

DmitrySoshnikov

/**
 * "One second".
 *
 * Since 1967, the sample value of One Second is:
 *
 * "The duration of 9,192,631,770 periods of the radiation corresponding
 *  to the transition between the two hyperfine levels of the ground state
 *  of the caesium-133 atom."
 *
 * by Dmitry Soshnikov <[email protected]>