This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import { promises as fs } from 'fs'; | |
import { resolve as resolvePath } from 'path'; | |
/** | |
* Recursively walk a directory asynchronously and yeild file names (with full path). | |
* | |
* @param path Directory path you want to recursively process | |
* @param filter Optional filter to specify which files to include | |
*/ | |
async function* walk(path: string, filter?: (file: string) => boolean) { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html> | |
<html class="no-js"> | |
<head> | |
<meta charset="utf-8"> | |
<meta http-equiv="X-UA-Compatible" content="IE=edge"> | |
<title>Twinkling Canvas</title> | |
<meta name="description" content=""> | |
<meta name="viewport" content="width=device-width, initial-scale=1"> | |
<link rel="stylesheet" href="main.css"> | |
<script src="modernizr-2.6.2.min.js"></script> |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include <limits.h> | |
#include <stdbool.h> | |
typedef struct Job { | |
unsigned int id; | |
unsigned int arrivalTime; | |
unsigned int priority; | |
unsigned int burstTime; | |
unsigned int remainingTime; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// | |
// main.cpp | |
// FloydGreedyTravel | |
// | |
// The program tries to find a path to visit all vertices of Graph. | |
// The rules are: | |
// * Nodes can be visited more than once. | |
// * Try to find shortest path | |
// | |
// First it find All-Pairs Shortest Paths using The Floyd-Warshall algorithm. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function checkString(str){ | |
try{str=JSON.parse(str);}catch(e){} | |
return str; | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!doctype html> | |
<html class="animations-on"> | |
<link href="main000.css" rel="stylesheet" type="text/css"/> | |
<div id="sky_background" class="sky_back"></div><div id="sky_midground" class="sky_back"></div><div id="sky_foreground" class="sky_back"></div> | |
</html> |