John maxwillzq

## javascript_resources.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                maxwillzq
                / javascript_resources.md
            
            
              Created
              August 16, 2014 05:40
                — forked from jookyboi/javascript_resources.md
            
              
                Here are a set of libraries, plugins and guides which may be useful to your Javascript coding.
              
          
    Libraries


jQuery - The de-facto library for the modern age. It makes things like HTML document traversal and manipulation, event handling, animation, and Ajax much simpler with an easy-to-use API that works across a multitude of browsers.
Backbone - Backbone.js gives structure to web applications by providing models with key-value binding and custom events, collections with a rich API of enumerable functions, views with declarative event handling, and connects it all to your existing API over a RESTful JSON interface.
AngularJS - Conventions based MVC framework for HTML5 apps.
Underscore - Underscore is a utility-belt library for JavaScript that provides a lot of the functional programming support that you would expect in Prototype.js (or Ruby), but without extending any of the built-in JavaScript objects.
lawnchair - Key/value store adapter for indexdb, localStorage


## css_resources.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                maxwillzq
                / css_resources.md
            
            
              Created
              August 16, 2014 05:40
                — forked from jookyboi/css_resources.md
            
              
                CSS libraries and guides to bring some order to the chaos.
              
          
    Libraries


960 Grid System - An effort to streamline web development workflow by providing commonly used dimensions, based on a width of 960 pixels. There are two variants: 12 and 16 columns, which can be used separately or in tandem.
Compass - Open source CSS Authoring Framework.
Bootstrap - Sleek, intuitive, and powerful mobile first front-end framework for faster and easier web development.
Font Awesome - The iconic font designed for Bootstrap.
Zurb Foundation - Framework for writing responsive web sites.
SASS - CSS extension language which allows variables, mixins and rules nesting.
Skeleton - Boilerplate for responsive, mobile-friendly development.

Guides


## Perfect_FFT.py
# For remembering the little details.

# To get the FFT bins to line up perfectly, without any "skirts",
# you need to make a perfect cycle, where the next sample *after*
# this chunk lines up with the first.

from __future__ import division

# Sampling rate
fs = 128 # Hz

## test.pl
print "hello,world";
my $aa = 100;
my $bb = 200;
my $cc = 3000;
print "\n";
print $aa+$bb+$cc;

## local
$var = 4;
print $var, "\n";
&hello;
print $var, "\n";

# subroutines
sub hello {
     local $var = 10;
     print $var, "\n";
     &gogo; # calling subroutine gogo

## spliceExample
#splice function
my @X = (0..10);
print join("  ",@X);
my @Y = splice(@X,10,1);
print "\nafter splice:";
print join("  ",@X);
print "\nthe splice result:";
print join("  ",@Y);

## functionAsArugment.pl
#use function as arugment of other function
sub add
{
	my $x =shift;
	my $y = shift;
	return $x + $y;
}

sub minus
{

## linkedlist.py
class Node:
    def __init__(self,value,next=None):
        self.value = value
        self.next = next

## carrercup14942235.py
# -*- coding: utf-8 -*-
"""
Created on Tue Nov 27 13:02:53 2012

@author: qzhang
"""
import re

#brute force solution 1 and 2
#algorithm solution 3

## carrercup14960662.py
# -*- coding: utf-8 -*-
"""
Created on Tue Nov 27 14:26:17 2012

@author: qzhang
Given a array of integers , find 3 indexes i,j,k such that,
i<j<k and a[i] < a[j] < a[k]. Best possible is a O(n) algorithm.
"""

#brute force answer
	# For remembering the little details.

	# To get the FFT bins to line up perfectly, without any "skirts",
	# you need to make a perfect cycle, where the next sample after
	# this chunk lines up with the first.

	from __future__ import division

	# Sampling rate
	fs = 128 # Hz
	print "hello,world";
	my $aa = 100;
	my $bb = 200;
	my $cc = 3000;
	print "\n";
	print $aa+$bb+$cc;
	$var = 4;
	print $var, "\n";
	&hello;
	print $var, "\n";

	# subroutines
	sub hello {
	local $var = 10;
	print $var, "\n";
	&gogo; # calling subroutine gogo
	#splice function
	my @X = (0..10);
	print join(" ",@X);
	my @Y = splice(@X,10,1);
	print "\nafter splice:";
	print join(" ",@X);
	print "\nthe splice result:";
	print join(" ",@Y);
	#use function as arugment of other function
	sub add
	{
	my $x =shift;
	my $y = shift;
	return $x + $y;
	}

	sub minus
	{
	class Node:
	def __init__(self,value,next=None):
	self.value = value
	self.next = next
	# -- coding: utf-8 --
	"""
	Created on Tue Nov 27 13:02:53 2012

	@author: qzhang
	"""
	import re

	#brute force solution 1 and 2
	#algorithm solution 3
	# -- coding: utf-8 --
	"""
	Created on Tue Nov 27 14:26:17 2012

	@author: qzhang
	Given a array of integers , find 3 indexes i,j,k such that,
	i<j<k and a[i] < a[j] < a[k]. Best possible is a O(n) algorithm.
	"""

	#brute force answer