Johnny Chan Atlas7

kolodny / actions.js

Last active May 17, 2018 18:42

testing redux thunk middleware

	export const doTheThing = () => (dispatch, getState) => {
	const users = getState();
	dispatch({
	type: 'THE_THING',
	users,
	});
	};

koistya / React-Directory-Layout.md

Last active July 30, 2025 05:53

File and folder naming convention for React.js components

File and folder naming convention for React.js components

/actions/...
/components/common/Link.js
/components/common/...
/components/forms/TextBox.js
/components/forms/TextBox.res/style.css

kazad / fourier.html

Created June 25, 2014 19:00

BetterExplained Fourier Example

	<html>
	<head>
	<script src="//cdnjs.cloudflare.com/ajax/libs/underscore.js/1.4.2/underscore-min.js"></script>
	<script src="//ajax.googleapis.com/ajax/libs/jquery/1.8.2/jquery.min.js"></script>
	<script src="//cdnjs.cloudflare.com/ajax/libs/modernizr/2.6.2/modernizr.min.js"></script>
	<script src="//ajax.cdnjs.com/ajax/libs/json2/20110223/json2.js"></script>

	<!--
	TODO:

mycodeschool / FindMergePointOfLinkedList.cpp

Last active February 22, 2025 13:38

saintedlama / monokai.css

Created May 24, 2014 08:55

	/* Based on Sublime Text's Monokai theme */

	.cm-s-monokai.CodeMirror {background: #272822; color: #f8f8f2;}
	.cm-s-monokai div.CodeMirror-selected {background: #49483E !important;}
	.cm-s-monokai .CodeMirror-gutters {background: #272822; border-right: 0px;}
	.cm-s-monokai .CodeMirror-linenumber {color: #d0d0d0;}
	.cm-s-monokai .CodeMirror-cursor {border-left: 1px solid #f8f8f0 !important;}

	.cm-s-monokai span.cm-comment {color: #75715e;}
	.cm-s-monokai span.cm-atom {color: #ae81ff;}

mycodeschool / BSTDeletion_CPP.cpp

Last active September 25, 2025 20:04

	/* Deleting a node from Binary search tree */
	#include<iostream>
	using namespace std;
	struct Node {
	int data;
	struct Node *left;
	struct Node *right;
	};
	//Function to find minimum in a tree.
	Node* FindMin(Node* root)

mycodeschool / PreorderInorderPostorder_CPP.cpp

Last active May 3, 2025 17:50

Binary tree traversal: Preorder, Inorder, Postorder

	/* Binary Tree Traversal - Preorder, Inorder, Postorder */
	#include<iostream>
	using namespace std;

	struct Node {
	char data;
	struct Node *left;
	struct Node *right;
	};

mycodeschool / MergeSort_C.C

Last active February 22, 2025 18:07

	/* Merge sort in C */
	#include<stdio.h>
	#include<stdlib.h>

	// Function to Merge Arrays L and R into A.
	// lefCount = number of elements in L
	// rightCount = number of elements in R.
	void Merge(int A,int L,int leftCount,int *R,int rightCount) {
	int i,j,k;

mycodeschool / LevelOrder_CPP.cpp

Last active May 19, 2024 03:09

	/* Binary tree - Level Order Traversal */
	#include<iostream>
	#include<queue>
	using namespace std;

	struct Node {
	char data;
	Node *left;
	Node *right;
	};

octocat / .gitignore

Created February 27, 2014 19:38

Some common .gitignore configurations