remino

function convertMS(ms) {
  var d, h, m, s;
  s = Math.floor(ms / 1000);
  m = Math.floor(s / 60);
  s = s % 60;
  h = Math.floor(m / 60);
  m = m % 60;
  d = Math.floor(h / 24);
  h = h % 24;
  return { d: d, h: h, m: m, s: s };

Dreyer

// @source: http://stackoverflow.com/questions/1349404/generate-a-string-of-5-random-characters-in-javascript

function randomStr(m) {
	var m = m || 9; s = '', r = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';
	for (var i=0; i < m; i++) { s += r.charAt(Math.floor(Math.random()*r.length)); }
	return s;
};

tanerdogan

DROP TABLE IF EXISTS `airports`;
CREATE TABLE IF NOT EXISTS `airports` (
  `code` varchar(50) COLLATE utf8_turkish_ci DEFAULT NULL,
  `name` varchar(200) COLLATE utf8_turkish_ci DEFAULT NULL,
  `cityCode` varchar(50) COLLATE utf8_turkish_ci DEFAULT NULL,
  `cityName` varchar(200) COLLATE utf8_turkish_ci DEFAULT NULL,
  `countryName` varchar(200) COLLATE utf8_turkish_ci DEFAULT NULL,
  `countryCode` varchar(200) COLLATE utf8_turkish_ci DEFAULT NULL,
  `timezone` varchar(8) COLLATE utf8_turkish_ci DEFAULT NULL,

colingourlay

var obj = {b: 3, c: 2, a: 1};

_.sortKeysBy(obj);
// {a: 1, b: 3, c: 2}

_.sortKeysBy(obj, function (value, key) {
    return value;
});
// {a: 1, c: 2, b: 3}

addyosmani

CSS Layout Debugger

A tweet-sized debugger for visualizing your CSS layouts. Outlines every DOM element on your page a random (valid) CSS hex color.

One-line version to paste in your DevTools

Use $$ if your browser aliases it:

~ 108 byte version

craigpalermo

<VirtualHost *:80>
    ServerName myserver.com
    ServerAlias www.myserver.com

    ProxyRequests off

    <Proxy *>
        Order deny,allow
        Allow from all
    </Proxy>

mikelehen

/**
 * Fancy ID generator that creates 20-character string identifiers with the following properties:
 *
 * 1. They're based on timestamp so that they sort *after* any existing ids.
 * 2. They contain 72-bits of random data after the timestamp so that IDs won't collide with other clients' IDs.
 * 3. They sort *lexicographically* (so the timestamp is converted to characters that will sort properly).
 * 4. They're monotonically increasing.  Even if you generate more than one in the same timestamp, the
 *    latter ones will sort after the former ones.  We do this by using the previous random bits
 *    but "incrementing" them by 1 (only in the case of a timestamp collision).
 */

odigity

    There is no way to store an empty object/array/null value.
    There are also no actual arrays.  Array values get stored as objects with integer keys.
        (If all keys are integers, it will be returned as an array.)

    Basically, it's one giant tree of hashes with string keys.
    Simply write a value to any location, and the intermediary locations will automatically come into existance.

 ── Classes ──

    DataSnapshot  : Container for a subtree of data at a particular location.

sergomet

<?php

namespace App\Providers;

use Illuminate\Support\ServiceProvider;

class GoogleDriveServiceProvider extends ServiceProvider
{
    /**
     * Bootstrap the application services.

tokland

function promiseMap(inputValues, mapper) {
  const reducer = (acc$, inputValue) =>
    acc$.then(acc => mapper(inputValue).then(result => acc.push(result) && acc));
  return inputValues.reduce(reducer, Promise.resolve([]));
}

/* Example */

const axios = require('axios');