estk

## main.go
package main

import (
	"fmt"
	"sync"
)

type Crawler struct {
	crawled map[string]bool
	mux     sync.Mutex

## .zpreztorc
#
# Sets Prezto options.
#
# Authors:
#   Sorin Ionescu <sorin.ionescu@gmail.com>
#

#
# General
#

## .gitignore
bower_components
*.swp
*.swo

## 2010-nums.csv

          
            CIP6
            name
            number
            percentage
            cumulativePercentage

            
              42.0101
              Psychology, General
              382
              0.1095183486238532
              0.1095183486238532

            
              52.0601
              Business/Managerial Economics
              356
              0.10206422018348624
              0.21158256880733944

            
              23.9999
              English Language and Literature/Letters, Other
              216
              0.06192660550458716
              0.2735091743119266

            
              03.0103
              Environmental Studies
              215
              0.06163990825688073
              0.3351490825688073

            
              45.0201
              Anthropology
              156
              0.04472477064220184
              0.3798738532110092

            
              54.0101
              History, General
              155
              0.04443807339449541
              0.4243119266055046

            
              45.1101
              Sociology
              145
              0.04157110091743119
              0.46588302752293576

            
              26.0406
              Cell/Cellular and Molecular Biology
              122
              0.034977064220183485
              0.5008600917431193

            
              50.0701
              Art/Art Studies, General
              121
              0.034690366972477064
              0.5355504587155964

## randomInterval.hs
import System.Random
import Data.List

import Graphics.EasyPlot
-- Testing Aparatus
--
repeatTimes = 1000
testInstanceNum = 1000
trainInstanceNums = [100,200..1000]

## RadarChart.js
//Practically all this code comes from https://github.com/alangrafu/radar-chart-d3
//I only made some additions and aesthetic adjustments to make the chart look better
//(of course, that is only my point of view)
//Such as a better placement of the titles at each line end,
//adding numbers that reflect what each circular level stands for
//Not placing the last level and slight differences in color
//
//For a bit of extra information check the blog about it:
//http://nbremer.blogspot.nl/2013/09/making-d3-radar-chart-look-bit-better.html
//

## index.html
<!DOCTYPE html>
<meta charset="utf-8">
<style>
.container {
  height: 400px;
  display: flex;
  justify-content:center;
  align-items: center
}

## RadarChart.js
//Practically all this code comes from https://github.com/alangrafu/radar-chart-d3
//I only made some additions and aesthetic adjustments to make the chart look better
//(of course, that is only my point of view)
//Such as a better placement of the titles at each line end,
//adding numbers that reflect what each circular level stands for
//Not placing the last level and slight differences in color
//
//For a bit of extra information check the blog about it:
//http://nbremer.blogspot.nl/2013/09/making-d3-radar-chart-look-bit-better.html
//

## bundler.js
@@ -527,7 +527,7 @@ _.extend(Bundle.prototype, {

     var combinedCode = codeParts.join('\n;\n');
     var finalCode = uglify.minify(
-      combinedCode, {fromString: true, compress: {drop_debugger: false}}).code;
+      combinedCode, {fromString: true, compress: {drop_debugger: false}, mangle: {except: ["$super"]}}).code;

     addFile('js', finalCode);

## graph02.c
128c128
<    for (int i=0; edges[i] != nilEdge; i++) {
---
>    for (int i=0; edges[i] != 0; i++) {
138c138
<       edge_ref *edges = malloc (maxN * sizeof (struct edge));
---
>       edge_ref *edges = calloc (maxN, sizeof (struct edge));
	package main

	import (
	"fmt"
	"sync"
	)

	type Crawler struct {
	crawled map[string]bool
	mux sync.Mutex
	#
	# Sets Prezto options.
	#
	# Authors:
	# Sorin Ionescu <sorin.ionescu@gmail.com>
	#

	#
	# General
	#
CIP6	name	number	percentage	cumulativePercentage
42.0101	Psychology, General	382	0.1095183486238532	0.1095183486238532
52.0601	Business/Managerial Economics	356	0.10206422018348624	0.21158256880733944
23.9999	English Language and Literature/Letters, Other	216	0.06192660550458716	0.2735091743119266
03.0103	Environmental Studies	215	0.06163990825688073	0.3351490825688073
45.0201	Anthropology	156	0.04472477064220184	0.3798738532110092
54.0101	History, General	155	0.04443807339449541	0.4243119266055046
45.1101	Sociology	145	0.04157110091743119	0.46588302752293576
26.0406	Cell/Cellular and Molecular Biology	122	0.034977064220183485	0.5008600917431193
50.0701	Art/Art Studies, General	121	0.034690366972477064	0.5355504587155964
	import System.Random
	import Data.List

	import Graphics.EasyPlot
	-- Testing Aparatus
	--
	repeatTimes = 1000
	testInstanceNum = 1000
	trainInstanceNums = [100,200..1000]
	//Practically all this code comes from https://github.com/alangrafu/radar-chart-d3
	//I only made some additions and aesthetic adjustments to make the chart look better
	//(of course, that is only my point of view)
	//Such as a better placement of the titles at each line end,
	//adding numbers that reflect what each circular level stands for
	//Not placing the last level and slight differences in color
	//
	//For a bit of extra information check the blog about it:
	//http://nbremer.blogspot.nl/2013/09/making-d3-radar-chart-look-bit-better.html
	//
	<!DOCTYPE html>
	<meta charset="utf-8">
	<style>
	.container {
	height: 400px;
	display: flex;
	justify-content:center;
	align-items: center
	}
	@@ -527,7 +527,7 @@ _.extend(Bundle.prototype, {

	var combinedCode = codeParts.join('\n;\n');
	var finalCode = uglify.minify(
	- combinedCode, {fromString: true, compress: {drop_debugger: false}}).code;
	+ combinedCode, {fromString: true, compress: {drop_debugger: false}, mangle: {except: ["$super"]}}).code;

	addFile('js', finalCode);
	128c128
	< for (int i=0; edges[i] != nilEdge; i++) {
	---
	> for (int i=0; edges[i] != 0; i++) {
	138c138
	< edge_ref edges = malloc (maxN sizeof (struct edge));
	---
	> edge_ref *edges = calloc (maxN, sizeof (struct edge));