du -sh * / du -sh <filename>
du -h –max-depth=1 <folder>
% ==== Document Class & Packages ===== | |
\documentclass[12pt,hidelinks]{article} | |
\usepackage[explicit]{titlesec} | |
\usepackage{titletoc} | |
\usepackage{tocloft} | |
\usepackage{charter} | |
\usepackage[many]{tcolorbox} | |
\usepackage{amsmath} | |
\usepackage{graphicx} | |
\usepackage{xcolor} |
https://zhuanlan.zhihu.com/p/51827233
tar -cvpzf /media/ubuntu_backup@`date +%Y-%m+%d`.tar.gz –exclude=/proc –exclude=/tmp –exclude=/home/yingdai/Workspace/Qunar/Gitlab/h_xsearch –exclude=/lost+found –exclude=/media –exclude=/mnt –exclude=/run /
tar -xvpzf /media/ubuntu_backup@2016-6-6.tar.gz -C /
# install emacs | |
sudo add-apt-repository ppa:ubuntu-elisp/ppa | |
sudo apt update | |
sudo apt install emacs-snapshot emacs-snapshot-el | |
# install gnome-tweak-tool | |
sudo apt-get install gnome-tweak-tool | |
# install pip3 | |
sudo apt install python3-pip |
// drop the duplicate values | |
Set<String> set = new HashSet<>(fullMatch); | |
fullMatch.clear(); | |
fullMatch.addAll(set); |
import org.apache.hadoop.hive.ql.exec.UDF; | |
public class CheckSwapCharsUDF extends UDF { | |
public Integer evaluate(String str1, String str2) throws Exception { | |
if (str1 == null || str2 == null) | |
return -1; | |
int s1_len = str1.length(); | |
int s2_len = str2.length(); | |
if (s1_len != s2_len) | |
return -1; |
#!/usr/bin/python3 | |
# By Steve Hanov, 2011. Released to the public domain. | |
# Please see http://stevehanov.ca/blog/index.php?id=115 for the accompanying article. | |
# | |
# Based on Daciuk, Jan, et al. "Incremental construction of minimal acyclic finite-state automata." | |
# Computational linguistics 26.1 (2000): 3-16. | |
# | |
# Updated 2014 to use DAWG as a mapping; see | |
# Kowaltowski, T.; CL. Lucchesi (1993), "Applications of finite automata representing large vocabularies", | |
# Software-Practice and Experience 1993 |