AlanTai

function functionReplacer(key, value) {
    if (typeof(value) === 'function') {
        return value.toString();
    }
    return value;
}

function functionReviver(key, value) {
    if (key === "") return value;
    

AlanTai

/*
 * File: bst.js
 *
 * A pure JavaScript implementation of a binary search tree.
 *
 */

/*
 * Class: BST
 *

AlanTai

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

So you're curious in learning this new thing called (Functional) Reactive Programming (FRP).

Learning it is hard, even harder by the lack of good material. When I started, I tried looking for tutorials. I found only a handful of practical guides, but they just scratched the surface and never tackled the challenge of building the whole architecture around it. Library documentations often don't help when you're trying to understand some function. I mean, honestly, look at this:

Rx.Observable.prototype.flatMapLatest(selector, [thisArg])

Projects each element of an observable sequence into a new sequence of observable sequences by incorporating the element's index and then transforms an observable sequence of observable sequences into an observable sequence producing values only from the most recent observable sequence.

AlanTai

Project

Description: What does this project do and who does it serve?

Project Setup

How do I, as a developer, start working on the project?

1. What dependencies does it have (where are they expressed) and how do I install them?
2. How can I see the project working before I change anything?

AlanTai

// based on http://msdn.microsoft.com/en-us/magazine/hh335067.aspx
// usage example at bottom

function pso (number_of_dimensions, function_to_optimize, number_of_particles, number_of_iterations, fitness_threshold, inertia_weight, cognitive_weight, social_weight) {
	var particles           = [];
	var swarm_best_position = [];
	var swarm_best_fitness  = null;
	for (var p = 0; p < number_of_particles; p++) {
		particles.push({
			particle_position:      [],