Jessica Claire Edwards jsscclr

## pngencode.cpp
// by alex evans, 2011.  released into the public domain.
// based on a first ever reading of the png spec, it occurs to me that a minimal png encoder should be quite simple.
// this is a first stab - may be buggy! the only external dependency is zlib and some basic typedefs (u32, u8)
//
// VERSION 0.02! now using zlib's crc rather than my own, and avoiding a memcpy and memory scribbler in the old one
// by passing the zero byte at the start of the scanline to zlib first, then the original scanline in place. WIN!
//
// more context at http://altdevblogaday.org/2011/04/06/a-smaller-jpg-encoder/.
//
// follow me on twitter @mmalex http://twitter.com/mmalex

## related-products.liquid
<!-- Solution brought to you by Caroline Schnapp -->
<!-- See this: https://docs.shopify.com/support/your-store/products/can-i-recommend-related-products#finding-a-relevant-collecitons -->

{% comment %}
  Number of related items per row,
  and number of rows.
{% endcomment %}

{% assign number_of_related_products_per_row = 4 %}
{% assign number_of_rows = 1 %}

## websockets-server.js
/*
 * node-ws - pure Javascript WebSockets server
 * Copyright Bradley Wright <brad@intranation.com>
 */

// Use strict compilation rules - we're not animals
'use strict';

var net = require('net'),
    crypto = require('crypto');

## easing.js
/*
 * This work is free. You can redistribute it and/or modify it under the
 * terms of the Do What The Fuck You Want To Public License, Version 2,
 * as published by Sam Hocevar. See the COPYING file for more details.
 */
/*
 * Easing Functions - inspired from http://gizma.com/easing/
 * only considering the t value for the range [0, 1] => [0, 1]
 */
EasingFunctions = {

## tmux_cheatsheet.markdown

      
              1 file
            
          
              1039 forks
            
          
              64 comments
            
          
              4766 stars
            
          
                henrik
                / tmux_cheatsheet.markdown
            
            
              Created
              March 3, 2012 19:47
            
              
                tmux cheatsheet
              
          
    tmux cheatsheet

As configured in my dotfiles.
start new:
tmux

start new with session name:

  
## 1_Tiny_Content_Framework.md

      
              8 files
            
          
              75 forks
            
          
              5 comments
            
          
              426 stars
            
          
                nicoleslaw
                / 1_Tiny_Content_Framework.md
            
            
              Last active
              January 23, 2024 02:28
            
              
                Tiny Content Framework
              
          
    Tiny Content Framework

About the project

This is a tiny content strategy framework focused on goals, messages, and branding. This is not a checklist. Use what you need and scrap the rest. Rewrite it or add to it. These topics should help you get to the bottom of things with clients and other people you work with.
Give me feedback on Twitter (@nicoleslaw) or by email (nicole@nicolefenton.com).
Contents


## index.html
<!doctype html>
<html>
  <head>
    <meta charset="utf-8">
  </head>
  <body>
    <script type="application/javascript;version=1.7">
      var worker = new Worker('worker.js');
      var g;

## .block
license: gpl-3.0

## index.html
<html>
<meta http-equiv="Content-type" content="text/html;charset=UTF-8">
<head>
<title>D3.js Dashboard Introduction</title>
<script src="http://d3js.org/d3.v2.js"></script>
<script type="text/javascript" src="https://ajax.googleapis.com/ajax/libs/jquery/1.7.2/jquery.min.js"></script>
<script type="text/javascript" src="https://ajax.googleapis.com/ajax/libs/jqueryui/1.8.21/jquery-ui.min.js"></script>
<script>

function getMaxObjectValue(this_array, element) {

## sort.rb
# Sample implementation of quicksort and mergesort in ruby
# Both algorithm sort in O(n * lg(n)) time
# Quicksort works inplace, where mergesort works in a new array

def quicksort(array, from=0, to=nil)
    if to == nil
        # Sort the whole array, by default
        to = array.count - 1
    end
	// by alex evans, 2011. released into the public domain.
	// based on a first ever reading of the png spec, it occurs to me that a minimal png encoder should be quite simple.
	// this is a first stab - may be buggy! the only external dependency is zlib and some basic typedefs (u32, u8)
	//
	// VERSION 0.02! now using zlib's crc rather than my own, and avoiding a memcpy and memory scribbler in the old one
	// by passing the zero byte at the start of the scanline to zlib first, then the original scanline in place. WIN!
	//
	// more context at http://altdevblogaday.org/2011/04/06/a-smaller-jpg-encoder/.
	//
	// follow me on twitter @mmalex http://twitter.com/mmalex
	<!-- Solution brought to you by Caroline Schnapp -->
	<!-- See this: https://docs.shopify.com/support/your-store/products/can-i-recommend-related-products#finding-a-relevant-collecitons -->

	{% comment %}
	Number of related items per row,
	and number of rows.
	{% endcomment %}

	{% assign number_of_related_products_per_row = 4 %}
	{% assign number_of_rows = 1 %}
	/*
	* node-ws - pure Javascript WebSockets server
	* Copyright Bradley Wright <brad@intranation.com>
	*/

	// Use strict compilation rules - we're not animals
	'use strict';

	var net = require('net'),
	crypto = require('crypto');
	/*
	* This work is free. You can redistribute it and/or modify it under the
	* terms of the Do What The Fuck You Want To Public License, Version 2,
	* as published by Sam Hocevar. See the COPYING file for more details.
	*/
	/*
	* Easing Functions - inspired from http://gizma.com/easing/
	* only considering the t value for the range [0, 1] => [0, 1]
	*/
	EasingFunctions = {
	<!doctype html>
	<html>
	<head>
	<meta charset="utf-8">
	</head>
	<body>
	<script type="application/javascript;version=1.7">
	var worker = new Worker('worker.js');
	var g;
	<html>
	<meta http-equiv="Content-type" content="text/html;charset=UTF-8">
	<head>
	<title>D3.js Dashboard Introduction</title>
	<script src="http://d3js.org/d3.v2.js"></script>
	<script type="text/javascript" src="https://ajax.googleapis.com/ajax/libs/jquery/1.7.2/jquery.min.js"></script>
	<script type="text/javascript" src="https://ajax.googleapis.com/ajax/libs/jqueryui/1.8.21/jquery-ui.min.js"></script>
	<script>

	function getMaxObjectValue(this_array, element) {
	# Sample implementation of quicksort and mergesort in ruby
	# Both algorithm sort in O(n * lg(n)) time
	# Quicksort works inplace, where mergesort works in a new array

	def quicksort(array, from=0, to=nil)
	if to == nil
	# Sort the whole array, by default
	to = array.count - 1
	end