Ilya Azin azinit

People

`:bowtie:`	😄 `:smile:`	😆 `:laughing:`
😊 `:blush:`	😃 `:smiley:`	☺️ `:relaxed:`
😏 `:smirk:`	😍 `:heart_eyes:`	😘 `:kissing_heart:`
😚 `:kissing_closed_eyes:`	😳 `:flushed:`	😌 `:relieved:`
😆 `:satisfied:`	😁 `:grin:`	😉 `:wink:`
😜 `:stuck_out_tongue_winking_eye:`	😝 `:stuck_out_tongue_closed_eyes:`	😀 `:grinning:`
😗 `:kissing:`	😙 `:kissing_smiling_eyes:`	😛 `:stuck_out_tongue:`

Click to toggle contents of `code`

CODE!

Semantic Commit Messages

See how a minor change to your commit message style can make you a better programmer.

Format: <type>(<scope>): <subject>

<scope> is optional

Example

Custom Badges

The Shields service (at shields.io) provides a way to create custom badges for your projects. These are badges are very common and are frequently used to show status information about the project, or demonstrate tools that were used for the development of your project.

Example badge:

Creating a badge

Генератор списка источников для Google Docs

Скрипт генерирует список источников в виде отдельного списка, который вставляется в конце документа. Работает с помощью комментариев Google Docs.

Установка

Открыть документ в Google Docs
В верхнем меню нажать Инструменты / Редактор скриптов
Вставить содержимое файла app_script.gs

Read https://docusaurus.io/docs/next/using-themes#swizzling-theme-components

Run npm run swizzle @docusaurus/theme-classic Foote

	{% if messages %}
	{% for message in messages %}
	<div class="alert {% if message.tags %} alert-{{ message.tags }}{% endif %}">{{ message\|safe }}</div>
	{% endfor %}
	{% endif %}

	{% if form.errors %}
	<div class="alert alert-error">
	<h4>Please fix the following errors</h4>
	<ul>

	from __future__ import (print_function, division, unicode_literals,
	absolute_import)

	import os
	import sys

	from PySide2.QtCore import Slot, QMetaObject
	from PySide2.QtUiTools import QUiLoader
	from PySide2.QtWidgets import QApplication, QMainWindow, QMessageBox

	/**
	* Returns a hash code for a string.
	* (Compatible to Java's String.hashCode())
	*
	* The hash code for a string object is computed as
	* s[0]31^(n-1) + s[1]31^(n-2) + ... + s[n-1]
	* using number arithmetic, where s[i] is the i th character
	* of the given string, n is the length of the string,
	* and ^ indicates exponentiation.
	* (The hash value of the empty string is zero.)