khigia

class MyNumericUpDown : NumericUpDown
{
    protected override void OnMouseWheel (MouseEventArgs e)
    {
        // remove scrolllines scaling, taking care of case scrolllines is 0
        int delta = e.Delta / Math.Max (Math.Abs (SystemInformation.MouseWheelScrollLines), 1);
        base.OnMouseWheel (new MouseEventArgs (e.Button, e.Clicks, e.X, e.Y, delta));
    }
}

sindresorhus

@echo off

set dbUser=root
set dbPassword=password
set backupDir="C:\Documents and Settings\user\Desktop\backup\mysql"
set mysqldump="C:\Program Files\MySQL\MySQL Workbench 5.2 CE\mysqldump.exe"
set mysqlDataDir="C:\Documents and Settings\All Users\Application Data\MySQL\MySQL Server 5.1\data"
set zip="C:\Program Files\7-Zip\7z.exe"

:: get date

ShirtlessKirk

/**
 * Luhn algorithm in JavaScript: validate credit card number supplied as string of numbers
 * @author ShirtlessKirk. Copyright (c) 2012.
 * @license WTFPL (http://www.wtfpl.net/txt/copying)
 */
var luhnChk = (function (arr) {
    return function (ccNum) {
        var 
            len = ccNum.length,
            bit = 1,

conorbuck

var p1 = {
	x: 20,
	y: 20
};

var p2 = {
	x: 40,
	y: 40
};

balupton

// Create our server
var server;
server = http.createServer(function(req,res){
	// Set CORS headers
	res.setHeader('Access-Control-Allow-Origin', '*');
	res.setHeader('Access-Control-Request-Method', '*');
	res.setHeader('Access-Control-Allow-Methods', 'OPTIONS, GET');
	res.setHeader('Access-Control-Allow-Headers', '*');
	if ( req.method === 'OPTIONS' ) {
		res.writeHead(200);

x1nixmzeng

//--------------------------------------
//--- 010 Editor v5.0.0 Binary Template
//
// File:      prelen.bt
// Author:    x1nixmzeng/WRS
// Revision:  v1.03
// Purpose:   Reading strings of known length
// History
//  v1.03     Added optional STR_ENCODING macro to specify the charset
//            used to format the template results

DiegoSalazar

// Takes a credit card string value and returns true on valid number
function valid_credit_card(value) {
  // Accept only digits, dashes or spaces
	if (/[^0-9-\s]+/.test(value)) return false;

	// The Luhn Algorithm. It's so pretty.
	let nCheck = 0, bEven = false;
	value = value.replace(/\D/g, "");

	for (var n = value.length - 1; n >= 0; n--) {

jvsidler

for user in $(cut -f1 -d: /etc/passwd); do echo $user; crontab -u $user -l; done

unsetbit

/* Quadtree by Ozan Turgut (ozanturgut@gmail.com)

   A Quadtree is a structure for managing many nodes interacting in space by
   organizing them within a tree, where each node contains elements which may
   interact with other elements within the node. This is particularly useful in
   collision detection, in which a brute-force algorithm requires the checking of
   every element against every other element, regardless of their distance in space.

   This quadtree handles object in 2d space by their bounding boxes. It splits
   a node once it exceeds the object limit per-node. When a node is split, it's

DerMitch

#!/bin/sh
# auto-reload supervisor config on a config file change
# Licensed under Public Domain

# apt-get install inotify-tools

while true; do
    inotifywait --quiet --recursive --event create,close_write /etc/supervisor/
    supervisorctl reread
    supervisorctl update