ArnonEilat

var docCookies = {
  getItem: function (sKey) {
    if (!sKey) { return null; }
    return decodeURIComponent(document.cookie.replace(new RegExp("(?:(?:^|.*;)\\s*" + encodeURIComponent(sKey).replace(/[\-\.\+\*]/g, "\\$&") + "\\s*\\=\\s*([^;]*).*$)|^.*$"), "$1")) || null;
  },
  setItem: function (sKey, sValue, vEnd, sPath, sDomain, bSecure) {
    if (!sKey || /^(?:expires|max\-age|path|domain|secure)$/i.test(sKey)) { return false; }
    var sExpires = "";
    if (vEnd) {

ArnonEilat

var pathToWatch = 'C:\\Users\\Arnon\\Downloads\\'; // Exploit!!
var copyTo = 'C:\\Users\\Arnon\\Desktop\\tst';


module.exports = function(grunt) {
  /**
   * Initialize grunt
   */
  grunt.initConfig({
    watch: {

ArnonEilat

#!/bin/bash

ex=''
ex=$ex" --exclude /media/userName/07174FCC5FED4B6F "
ex=$ex" --exclude .adobe "
ex=$ex" --exclude .cordova "
ex=$ex" --exclude .android "
ex=$ex" --exclude  android-sdk-linux "
ex=$ex" --exclude  tmp "
ex=$ex" --exclude .thumbnails "

ArnonEilat

Boolean.prototype.toggle = function() {
    return !this.valueOf();
  }
  /**
   * @description Parses mixed type values into booleans.
   * @param  {Mixed}        value 
   * @param  {Boolean}      nullOnFailure = false
   * @return {Boolean}
   */
Boolean.prototype.toBoolean: function(obj) {

ArnonEilat

Black="$(tput setaf 0)"
BlackBG="$(tput setab 0)"
DarkGrey="$(tput setaf 0)"
LightGrey="$(tput setaf 7)"
LightGreyBG="$(tput setab 7)"
White="$(tput setaf 7)"
Red="$(tput setaf 1)"
RedBG="$(tput setab 1)"
LightRed="$(tput setaf 1)"
Green="$(tput setaf 2)"

ArnonEilat

Business Models

Advertising

Models	Examples
Display ads	Yahoo!
Search ads	Google

ArnonEilat

!function() {
  var d3 = {
    version: "3.4.5"
  };
  if (!Date.now) Date.now = function() {
    return +new Date();
  };
  var d3_arraySlice = [].slice, d3_array = function(list) {
    return d3_arraySlice.call(list);
  };

ArnonEilat

Array.prototype.insert = function(index, item) {
  this.splice(index, 0, item);
};


/***
 * var swapTest=['a','b','c'];
 * swapTest.swap('a','c')
 * @param {type} first
 * @param {type} second

ArnonEilat

#include "BinarySearchTree.h"

/*! \fn Tree * add(Tree *nod , int number)
 *  \param *nod pointer to <tt>Tree</tt> struct.
 *  \param number a <tt>int</tt> to add.
 *  \return pointer to <tt>Tree</tt> struct.
 */
Tree * add(Tree* nod, int number) {
    if (nod == NULL) {
        nod = (Tree*) malloc(sizeof (Tree));

ArnonEilat

#include <stdlib.h>
#include <stdio.h>

#define TRUE  1
#define FALSE	0

/* a link in the queue, holds the info and point to the next Node*/
typedef struct {
    int info;
} DATA;