Skip to content

Instantly share code, notes, and snippets.

View pierceh89's full-sized avatar
🌊

H.An pierceh89

🌊
View GitHub Profile
@pierceh89
pierceh89 / fetch_nike_puls_all_activities.bash
Created November 1, 2019 00:43 — forked from niw/fetch_nike_puls_all_activities.bash
A simple NikePlus API description to fetch past run metrics
#!/usr/bin/env bash
# fetch_nike_puls_all_activities.bash
# A simple bash script to fetch all activities and metrics from NikePlus.
# See `nike_plus_api.md` for the API details.
readonly bearer_token="$1"
if [[ -z "$bearer_token" ]]; then
echo "Usage: $0 bearer_token"
exit
@pierceh89
pierceh89 / dynamic_dom.html
Created May 22, 2019 16:01
Dynamic DOM changes by ajax, element move by event
<!DOCTYPE html>
<html lang="ko">
<head>
<title>Dynamic DOM example</title>
<style type="text/css">
.content {
width: 100%;
margin-top: 15px;
overflow: auto;
}
@pierceh89
pierceh89 / gist:c3e1b55d624ebc819a905c81eafc8ede
Created February 18, 2017 01:53 — forked from evildmp/gist:3094281
Set up Django, nginx and uwsgi

This document has now been incorporated into the uWSGI documentation:

http://uwsgi-docs.readthedocs.org/en/latest/tutorials/Django_and_nginx.html

Set up Django, nginx and uwsgi

Steps with explanations to set up a server using:

@pierceh89
pierceh89 / Fibonacci.java
Created January 22, 2017 06:32
Fibonaci number DP
import java.util.Scanner;
public class Fibonacci {
int[] memoization;
int size;
public Fibonacci(int n) {
size = n;
memoization = new int[size];
computeFibonacci();
@pierceh89
pierceh89 / combination.cc
Created May 1, 2016 17:29
This prints out all possible combination of the given string.
// print all combinations of string
#include <iostream>
#include <vector>
using namespace std;
void combinations(const char str[]);
void combinations(const char str[], char buf[], bool used[], int bufpos, int cur, int len);
void combinations(const char str[], vector<char>& buf, int start, int len);
int main(int argc, char* argv[])
@pierceh89
pierceh89 / permutation.cc
Created May 1, 2016 13:01
This code prints out all combinations of given string.
#include <iostream>
using namespace std;
void printAll(const char str[], char buf[], bool used[], int start, int end);
void printAll(const char str[]);
int main(int argc, char* argv[])
{
if(argc != 2)
{
@pierceh89
pierceh89 / pcd_converter.cpp
Last active January 30, 2019 07:31
Very simple converter from Wavefront obj to Point Cloud Data(PCD) format
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <vector>
#include <Eigen/Core>
#include <Eigen/Dense>
using std::string;
using std::vector;
@pierceh89
pierceh89 / graph.h
Last active December 9, 2015 12:48
Integer weighted directed graph + Strongly Connected Components (SCC) implementation
#include <iostream>
#include <vector>
#include <map>
#include <string>
using namespace std;
extern unsigned int time;
// vertex data structure
// employs STL pair and vector to store adjacent list
@pierceh89
pierceh89 / VTK5.md
Last active November 19, 2015 04:47 — forked from UnaNancyOwen/VTK5.md
Building VTK with Visual Studio
@pierceh89
pierceh89 / QHull.md
Last active March 14, 2016 10:28 — forked from UnaNancyOwen/QHull.2012.1.md
Building QHull with Visual Studio

Building QHull with Visual Studio (비주얼 스투디오로 QHull 빌드하는 법)

Download

  1. QHull 2012.1 for Windows(qhull-2012.1.zip)를 다운로드하여 원하는 위치에 압축을 푼다. (예: C:\qhull-2012.1)
    http://www.qhull.org/download/

CMake