Discover gists

Code is clean if it can be understood easily – by everyone on the team. Clean code can be read and enhanced by a developer other than its original author. With understandability comes readability, changeability, extensibility and maintainability.

General rules

Follow standard conventions.
Keep it simple stupid. Simpler is always better. Reduce complexity as much as possible.
Boy scout rule. Leave the campground cleaner than you found it.
Always find root cause. Always look for the root cause of a problem.

Design rules

Powerlevel10k can generate the same prompt as Pure.

Installation

git clone https://github.com/romkatv/powerlevel10k.git ~/powerlevel10k
echo 'source ~/powerlevel10k/powerlevel10k.zsh-theme' >>! ~/.zshrc

Docker Hub 镜像加速器

国内从 Docker Hub 拉取镜像有时会遇到困难，此时可以配置镜像加速器。Docker 官方和国内很多云服务商都提供了国内加速器服务。

Dockerized 实践 https://github.com/y0ngb1n/dockerized

配置加速地址

Ubuntu 16.04+、Debian 8+、CentOS 7+

	echo 'Copying attachment files into .attachments folder'
	cp attachments/* .attachments/
	echo 'Updating attachment links'
	find . -type f -name "*.md" -print0 \| xargs -0 sed -i 's/(attachments\//(\/\.attachments\//g'

	RUN apt update
	RUN apt upgrade -y
	RUN apt install -y apt-utils
	RUN a2enmod rewrite
	RUN apt install -y libmcrypt-dev
	RUN docker-php-ext-install mcrypt
	RUN apt install -y libicu-dev
	RUN docker-php-ext-install -j$(nproc) intl
	RUN apt-get install -y libfreetype6-dev libjpeg62-turbo-dev libpng12-dev
	RUN docker-php-ext-configure gd --with-freetype-dir=/usr/include/ --with-jpeg-dir=/usr/include/

	def is_safe(graph, colours, colour, current):
	neighbours = graph[current]
	for neighbour in neighbours:
	if colour == colours[neighbour - 1]:
	return False
	return True

	def graph_traversal(graph, colours, vertices, current):
	if current == vertices + 1:
	return True

	import heapq
	from typing import List


	def djikstra(graph_inner, starting, vertices) -> List:
	pq = []
	dist = [float('inf') for i in range(vertices)]
	dist[starting] = 0
	print(dist)
	heapq.heappush(pq, [0, starting])

	class Node:
	def __init__(self, data: list, level, f_val):
	self.data = data
	self.level = level
	self.f_val = f_val

	def generate_children(self):
	children = []
	values = [[0, 1], [1, 0], [-1, 0], [0, -1]]
	row, col = self.find()