Add tags support, set tags for algebra articles

Oleksandr Kulkov · Oleksandr Kulkov · commit b3d750ab063f · 2022-06-08T04:14:26.000+02:00
diff --git a/.github/workflows/deploy-prod.yml b/.github/workflows/deploy-prod.yml
@@ -36,6 +36,7 @@ jobs:
       - name: Build pages
         env:
           MKDOCS_GIT_COMMITTERS_APIKEY: ${{ secrets.PAT_API_KEY }}
+          MKDOCS_ENABLE_GIT_REVISION_DATE: True
         run: |
           mkdocs build --strict
       - uses: FirebaseExtended/action-hosting-deploy@v0
diff --git a/.github/workflows/test.yml b/.github/workflows/test.yml
@@ -34,6 +34,7 @@ jobs:
       - name: Build pages
         env:
           MKDOCS_GIT_COMMITTERS_APIKEY: ${{ secrets.PAT_API_KEY }}
+          MKDOCS_ENABLE_GIT_REVISION_DATE: True
         run: |
           mkdocs build --strict
       - name: Run algorithm code tests
diff --git a/mkdocs.yml b/mkdocs.yml
@@ -46,21 +46,25 @@ markdown_extensions:
   - pymdownx.emoji:
       emoji_index: !!python/name:materialx.emoji.twemoji 
       emoji_generator: !!python/name:materialx.emoji.to_svg
+  - meta
 
 plugins:
   - mkdocs-simple-hooks:
       hooks:
           on_env: "hooks:on_env"
   - search
+  - tags:
+      tags_file: tags.md
   - literate-nav:
       nav_file: navigation.md
   - git-revision-date-localized:
       enable_creation_date: true
+      enabled: !ENV [MKDOCS_ENABLE_GIT_REVISION_DATE, False]
   - git-authors
   - git-committers:
       repository: e-maxx-eng/e-maxx-eng
       docs_path: src/
-      token: !!python/object/apply:os.getenv ["MKDOCS_GIT_COMMITTERS_APIKEY"]
+      token: !ENV MKDOCS_GIT_COMMITTERS_APIKEY
   - macros
 
 extra:
diff --git a/src/algebra/all-submasks.md b/src/algebra/all-submasks.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Submask Enumeration
 
 ## Enumerating all submasks of a given mask
diff --git a/src/algebra/balanced-ternary.md b/src/algebra/balanced-ternary.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Balanced Ternary
 
 !["Setun computer using Balanced Ternary system"](http://ternary.3neko.ru/photo/setun1_small.jpg)
diff --git a/src/algebra/big-integer.md b/src/algebra/big-integer.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Arbitrary-Precision Arithmetic
 
 Arbitrary-Precision arithmetic, also known as "bignum" or simply "long arithmetic" is a set of data structures and algorithms which allows to process much greater numbers than can be fit in standard data types. Here are several types of arbitrary-precision arithmetic.
diff --git a/src/algebra/binary-exp.md b/src/algebra/binary-exp.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Binary Exponentiation
 
 Binary exponentiation (also known as exponentiation by squaring) is a trick which allows to calculate $a^n$ using only $O(\log n)$ multiplications (instead of $O(n)$ multiplications required by the naive approach).
diff --git a/src/algebra/chinese-remainder-theorem.md b/src/algebra/chinese-remainder-theorem.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Chinese Remainder Theorem
 
 The Chinese Remainder Theorem (which will be referred to as CRT in the rest of this article) was discovered by Chinese mathematician Sun Zi.
diff --git a/src/algebra/continued-fractions.md b/src/algebra/continued-fractions.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Original
+  - "Author: adamant"
+---
+
 <!--?title Continued fractions -->
 # Continued fractions
 
diff --git a/src/algebra/discrete-log.md b/src/algebra/discrete-log.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Discrete Logarithm
 
 The discrete logarithm is an integer $x$ satisfying the equation
diff --git a/src/algebra/discrete-root.md b/src/algebra/discrete-root.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Discrete Root
 
 The problem of finding a discrete root is defined as follows. Given a prime $n$ and two integers $a$ and $k$, find all $x$ for which:
diff --git a/src/algebra/divisors.md b/src/algebra/divisors.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Original
+  - "Author: jakobkogler"
+---
+
 # Number of divisors / sum of divisors
 
 In this article we discuss how to compute the number of divisors $d(n)$ and the sum of divisors $\sigma(n)$ of a given number $n$.
diff --git a/src/algebra/euclid-algorithm.md b/src/algebra/euclid-algorithm.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Euclidean algorithm for computing the greatest common divisor
 
 Given two non-negative integers $a$ and $b$, we have to find their **GCD** (greatest common divisor), i.e. the largest number which is a divisor of both $a$ and $b$.
diff --git a/src/algebra/extended-euclid-algorithm.md b/src/algebra/extended-euclid-algorithm.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Extended Euclidean Algorithm
 
 While the [Euclidean algorithm](euclid-algorithm.md) calculates only the greatest common divisor (GCD) of two integers $a$ and $b$, the extended version also finds a way to represent GCD in terms of $a$ and $b$, i.e. coefficients $x$ and $y$ for which:
diff --git a/src/algebra/factorial-divisors.md b/src/algebra/factorial-divisors.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Finding Power of Factorial Divisor
 
 You are given two numbers $n$ and $k$. Find the largest power of $k$ $x$ such that $n!$ is divisible by $k^x$.
diff --git a/src/algebra/factorial-modulo.md b/src/algebra/factorial-modulo.md
@@ -1,3 +1,10 @@
+<!-- Original link: modular_factorial -->
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 ---
 title: Factorial modulo p 
 ---
diff --git a/src/algebra/factoring-exp.md b/src/algebra/factoring-exp.md
@@ -1,3 +1,10 @@
+---
+tags:
+  - Original
+  - "Author: hselasky"
+  - "Contributor: adamant"
+---
+
 # Binary Exponentiation by Factoring
 
 Consider a problem of computing $ax^y \pmod{2^d}$, given integers $a$, $x$, $y$ and $d \geq 3$, where $x$ is odd.
diff --git a/src/algebra/factorization.md b/src/algebra/factorization.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Integer factorization
 
 In this article we list several algorithms for factorizing integers, each of them can be both fast and also slow (some slower than others) depending on their input.
diff --git a/src/algebra/fft.md b/src/algebra/fft.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Fast Fourier transform
 
 In this article we will discuss an algorithm that allows us to multiply two polynomials of length $n$ in $O(n \log n)$ time, which is better than the trivial multiplication which takes $O(n^2)$ time.
diff --git a/src/algebra/fibonacci-numbers.md b/src/algebra/fibonacci-numbers.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Fibonacci Numbers
 
 The Fibonacci sequence is defined as follows:
diff --git a/src/algebra/gray-code.md b/src/algebra/gray-code.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Gray code
 
 Gray code is a binary numeral system where two successive values differ in only one bit. 
diff --git a/src/algebra/linear-diophantine-equation.md b/src/algebra/linear-diophantine-equation.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Linear Diophantine Equation
 
 A Linear Diophantine Equation (in two variables) is an equation of the general form:
diff --git a/src/algebra/module-inverse.md b/src/algebra/module-inverse.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Modular Multiplicative Inverse
 
 ## Definition
diff --git a/src/algebra/phi-function.md b/src/algebra/phi-function.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Euler's totient function
 
 Euler's totient function, also known as **phi-function** $\phi (n)$, counts the number of integers between 1 and $n$ inclusive, which are coprime to $n$. Two numbers are coprime if their greatest common divisor equals $1$ ($1$ is considered to be coprime to any number).
diff --git a/src/algebra/polynomial.md b/src/algebra/polynomial.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "Author: adamant"
+---
+
 # Operations on polynomials and series
 
 In this article we will cover common operations that you will probably have to do if you deal with polynomials.
diff --git a/src/algebra/prime-sieve-linear.md b/src/algebra/prime-sieve-linear.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Linear Sieve
 
 Given a number $n$, find all prime numbers in a segment $[2;n]$.
diff --git a/src/algebra/primitive-root.md b/src/algebra/primitive-root.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Primitive Root
 
 ## Definition
diff --git a/src/algebra/sieve-of-eratosthenes.md b/src/algebra/sieve-of-eratosthenes.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+  - "From: e-maxx.ru"
+---
+
 # Sieve of Eratosthenes
 
 Sieve of Eratosthenes is an algorithm for finding all the prime numbers in a segment $[1;n]$ using $O(n \log \log n)$ operations.
diff --git a/src/navigation.md b/src/navigation.md
@@ -1,6 +1,7 @@
 - Home
     - [Main Page](index.md)
     - [Navigation](navigation.md)
+    - [Tag index](tags.md)
     - [How to Contribute](contrib.md)
     - [Preview](preview.md)
 - Algebra
diff --git a/src/overrides/partials/content.html b/src/overrides/partials/content.html
@@ -57,6 +57,11 @@
   {{ page.meta.git_revision_date_localized }}
 </ul>
 
+<!-- Tags -->
+{% if "tags" in config.plugins %}
+  {% include "partials/tags.html" %}
+{% endif %}
+
 {% if not "\x3ch1" in page.content %}
   <h1>{{ page.title | d(config.site_name, true)}}</h1>
 {% endif %}
diff --git a/src/tags.md b/src/tags.md
@@ -0,0 +1,5 @@
+# Tags
+
+This file contains a global index of all tags used on the pages.
+
+[TAGS]
