Johnny Chan Atlas7

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

## React-Directory-Layout.md

      
              1 file
            
          
              26 forks
            
          
              20 comments
            
          
              126 stars
            
          
                koistya
                / React-Directory-Layout.md
            
            
              Last active
              April 7, 2024 19:01
            
              
                File and folder naming convention for React.js components
              
          
File and folder naming convention for React.js components

Directory Layout #1

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


## fourier.html
<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:

## FindMergePointOfLinkedList.cpp
#include<iostream>
#include<cstdlib>
#include<set>
using namespace std;

struct Node {
    int data;
    struct Node *next;
};
int length(struct Node *head) {

## monokai.css
/* 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;}

## BSTDeletion_CPP.cpp
/* 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)

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

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

## MergeSort_C.C
/* 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;

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

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

## .gitignore
# Compiled source #
###################
*.com
*.class
*.dll
*.exe
*.o
*.so

# Packages #
	export const doTheThing = () => (dispatch, getState) => {
	const users = getState();
	dispatch({
	type: 'THE_THING',
	users,
	});
	};
	<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:
	#include<iostream>
	#include<cstdlib>
	#include<set>
	using namespace std;

	struct Node {
	int data;
	struct Node *next;
	};
	int length(struct Node *head) {
	/* 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;}
	/* 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)
	/* Binary Tree Traversal - Preorder, Inorder, Postorder */
	#include<iostream>
	using namespace std;

	struct Node {
	char data;
	struct Node *left;
	struct Node *right;
	};
	/* 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;
	/* Binary tree - Level Order Traversal */
	#include<iostream>
	#include<queue>
	using namespace std;

	struct Node {
	char data;
	Node *left;
	Node *right;
	};
	# Compiled source #
	###################
	*.com
	*.class
	*.dll
	*.exe
	*.o
	*.so

	# Packages #