One Paragraph of project description goes here
These instructions will get you a copy of the project up and running on your local machine for development and testing purposes. See deployment for notes on how to deploy the project on a live system.
/** | |
* Send a bulk update to Firebase from an array or an object literal. | |
* | |
* When .push() is called on a Firebase reference without a parameter passed no | |
* trip to the server is made. | |
* | |
* ex: | |
* var childRef = ref.push(); | |
* | |
* A reference is returned which has a push-id that can be returned by calling .name(). |
node_modules | |
*.swp |
rm -rf /Applications/Tuxera\ Disk\ Manager.app | |
rm -rf /Library/Application\ Support/Tuxera\ NTFS | |
rm -rf /Library/Filesystems/fusefs_txantfs.fs |
Sometimes you want to have a subdirectory on the master
branch be the root directory of a repository’s gh-pages
branch. This is useful for things like sites developed with Yeoman, or if you have a Jekyll site contained in the master
branch alongside the rest of your code.
For the sake of this example, let’s pretend the subfolder containing your site is named dist
.
Remove the dist
directory from the project’s .gitignore
file (it’s ignored by default by Yeoman).
// file: index.js | |
var _ = require("lodash"); | |
var express = require("express"); | |
var bodyParser = require("body-parser"); | |
var jwt = require('jsonwebtoken'); | |
var passport = require("passport"); | |
var passportJWT = require("passport-jwt"); |
[user] | |
name = Pavan Kumar Sunkara | |
email = pavan.sss1991@gmail.com | |
username = pksunkara | |
[core] | |
editor = vim | |
whitespace = fix,-indent-with-non-tab,trailing-space,cr-at-eol | |
excludesfile = ~/.gitignore | |
[sendemail] | |
smtpencryption = tls |
/** | |
* 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). | |
*/ |
/** | |
* Binary Tree | |
* (c) 2014 Ben Lesh <ben@benlesh.com> | |
* MIT license | |
*/ | |
/* | |
* A simple Binary Tree implementation in JavaScript | |
*/ |
[ci skip]
in the commit title