albulescu

require 'open-uri'
require 'nokogiri' #You need to install this gem
require 'net/http'
require 'pp'
require 'csv'

=begin

  @autor Albulescu Cosmin <[email protected]>

albulescu

(function(){

})();

albulescu

<?php

use Phalcon\Mvc\Micro,
    Phalcon\Events\Manager as EventsManager,
    Phalcon\Http\Response,
    Phalcon\Http\Request;

//Create a events manager
$eventManager = new EventsManager();

albulescu

/*

$scope.autoScrollEnabled = true;

$scope.onSendMessage = function() {
    // enable autoscrolling in case is disabled by user scroll up
    $scope.$emit('$enableAutoScroll');
};

albulescu

echo "cookbook_path [\"/opt/aws/opsworks/current/site-cookbooks\"]" > solo.rb && opsworks-agent-cli get_json > attributes.json && sudo /opt/aws/opsworks/current/bin/chef-solo -c ./solo.rb -j ./attributes.json -o 

albulescu

----- html

<div ng-class="ChatController">
    <chat>
        <div chat-messages class="messages">
            <div chat-message class="message-item">

            </div>
        </div>
        <div class="footer">

albulescu

/*
There are sets of node ids which contain partly-contiguous ranges of node ids.
The  rst part of the exercise is to (in a language of your choice) model the
ranges in a space ef cient manner.

An example set:
a/1, a/2, a/3, a/4, a/128, a/129, b/65, b/66, c/1, c/10, c/42
Secondly, given the model already developed, write an algorithm that
will add two sets, merging any overlapping ranges.

albulescu

package main

/**
 * @website http://albulescu.ro
 * @author Cosmin Albulescu <[email protected]>
 */

import (
	"bytes"
	"fmt"

albulescu

const flatten = arr => arr.reduce(
  (a, b) => a.concat(Array.isArray(b) ? flatten(b) : b), []
);

albulescu

# Angular 1.5
class Button {
  constructor( $http ) {
    this.http = $http;
  }
}
angular.module('x').component('xbutton', {
  ...,
  controller: Button
});