Remy Sharp remy

## demo.html
<?xml version='1.0' encoding='utf-8' ?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html lang='en-US' xml:lang='en-US' xmlns='http://www.w3.org/1999/xhtml'>
  <head>
    <title>
      passwordComplexity jQuery plugin demo
    </title>
    <style type='text/css'>
      * {
        font-family: Helvetica, Arial, sans-serif;

## gist:360018
var x,y;

document.onmousemove = function(e){
    e = e || window.event;
    x = e.clientX;
    y = e.clientY;
};

function elementAtMousePosition() {
    return document.elementFromPoint(x,y);

## gist:333954
// pure JS
function shuffle(array) {
  return array.sort(function(){
    return .5 - Math.random();
  });
}

// with Prototype.js you can do
function shuffle(array){
  return array.sortBy(Math.random);

## noswear.js
var terms = ['shit', 'fuck'].map(s => ' ' + s + ' ');
var re = RegExp(terms.join('|'));
var hasBadWords = function (str) { return re.test(' ' + str + ' '); };

hasBadWords("hit me duck"); // false
hasBadWords("holy shit");   // true
hasBadWords("My assistant couldn't find shitake mushrooms."); // false

## html5-data.js
(function () {
  var forEach = [].forEach,
      regex = /^data-(.+)/,
      dashChar = /\-([a-z])/ig,
      el = document.createElement('div'),
      mutationSupported = false,
      match
  ;

  function detectMutation() {

## sampled.js
function sampled(arr, size) {
  var sampled = [], i, n, idx, l = arr.length;
  if (arr.length <= size){
    return arr
  } else {
    for (i = 0; i < size; i++) {
      n = (i / size) * l;
      // faster Math.ceil (because I'm doing this with large arrays inside raf)
      idx = (n << 0);
      idx = (idx == n)? idx: idx + 1;

## gist:3103659

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                remy
                / gist:3103659
            
            
              Created
              July 13, 2012 08:30
                — forked from paulirish/gist:3098860
            
              
                Open Conference Expectations
              
          
    Open Conference Expectations

Treat others as you'd expect to be treated. Don't be a dick. We're looking at both you the organiser and you the speaker.
Thanks,
- The Community.

  
## dabblet.css
/**
 * The first commented line is your dabblet’s title
 */

background: #f06;
background: linear-gradient(45deg, #f06, yellow);
min-height:100%;

## dabblet.css
/**
 * The first commented line is your dabblet’s title
 */

background: #f06;
background: linear-gradient(45deg, #f06, yellow);
min-height:100%;

## dabblet.css
/**
 * The first commented line is your dabblet’s title
 */

background: #f06;
background: linear-gradient(45deg, #f06, yellow);
min-height:100%;
	<?xml version='1.0' encoding='utf-8' ?>
	<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
	<html lang='en-US' xml:lang='en-US' xmlns='http://www.w3.org/1999/xhtml'>
	<head>
	<title>
	passwordComplexity jQuery plugin demo
	</title>
	<style type='text/css'>
	* {
	font-family: Helvetica, Arial, sans-serif;
	var x,y;

	document.onmousemove = function(e){
	e = e \|\| window.event;
	x = e.clientX;
	y = e.clientY;
	};

	function elementAtMousePosition() {
	return document.elementFromPoint(x,y);
	// pure JS
	function shuffle(array) {
	return array.sort(function(){
	return .5 - Math.random();
	});
	}

	// with Prototype.js you can do
	function shuffle(array){
	return array.sortBy(Math.random);
	var terms = ['shit', 'fuck'].map(s => ' ' + s + ' ');
	var re = RegExp(terms.join('\|'));
	var hasBadWords = function (str) { return re.test(' ' + str + ' '); };

	hasBadWords("hit me duck"); // false
	hasBadWords("holy shit"); // true
	hasBadWords("My assistant couldn't find shitake mushrooms."); // false
	(function () {
	var forEach = [].forEach,
	regex = /^data-(.+)/,
	dashChar = /\-([a-z])/ig,
	el = document.createElement('div'),
	mutationSupported = false,
	match
	;

	function detectMutation() {
	function sampled(arr, size) {
	var sampled = [], i, n, idx, l = arr.length;
	if (arr.length <= size){
	return arr
	} else {
	for (i = 0; i < size; i++) {
	n = (i / size) * l;
	// faster Math.ceil (because I'm doing this with large arrays inside raf)
	idx = (n << 0);
	idx = (idx == n)? idx: idx + 1;
	/**
	* The first commented line is your dabblet’s title
	*/

	background: #f06;
	background: linear-gradient(45deg, #f06, yellow);
	min-height:100%;