taoalpha

{
  "last_update": 1593626766189,
  "entries": [
    {
      "country": "China",
      "city": "HeNan",
      "start_date": "1992",
      "end_date": "1993",
      "desc": "",
      "items": [

taoalpha

We couldn’t find that file to show.

taoalpha

Keybase proof

I hereby claim:

• I am taoalpha on github.
• I am taoalpha (https://keybase.io/taoalpha) on keybase.
• I have a public key whose fingerprint is D228 26EC DB47 884B A673 0720 8D87 084B 0EBF 2626

To claim this, I am signing this object:

taoalpha

#!/usr/bin/env bash

# Ask for the administrator password upfront
sudo -v

# Keep-alive: update existing `sudo` time stamp until `init.sh` has finished
while true; do sudo -n true; sleep 60; kill -0 "$$" || exit; done 2>/dev/null &

###############################################################################
# Step 1: Update the OS and Install Xcode Tools                               #

taoalpha

// bulk deletion for kindle items
function deleteKindleItems() {
  if ($('.contentListIcon_myx').length > 0) {
    // select first 10
    $('.contentListIcon_myx').map(function(i,v){ if (i < 10) {$(v).click()}else{return}});
    
    // delete
    $('#contentAction_delete_myx').click();
    
    // yes to delete

taoalpha

import requests
import re,os
import json
import xml.etree.ElementTree as ET
import string
import datetime
import zipfile

# name mapper for mapping pinyin with name
nameMap = {

taoalpha

" 1 tab == 4 spaces
set shiftwidth=4
set tabstop=4

" show ruler and number
set ruler
set nu

" modifiable
set modifiable

taoalpha

"use strict"
/*
 * Data Structure of Javascript
 * 1. List
 * 2. Stack
 * 3. Queue
 * 4. LinkedList
 * 5. Dictionary
 * 6. Hashing
 * 7. Set

taoalpha

"use strict"

// Popular sorting algorithm in javascript
// 1. insertionSort
// 2. selectionSort
// 3. bubbleSort
// 4. mergeSort
// 5. quickSort
// 6. bucketSort
// 7. radixSort

taoalpha

import static org.junit.Assert.*;

import java.util.ArrayList;
import java.util.Collections;

import org.junit.Test;

public class Tests {

	// add some nodes, see if it comes out right, delete one, see if it's right