From ba9c83855c198bc0b67df518110305d01b57ebc8 Mon Sep 17 00:00:00 2001 From: akcube Date: Sun, 2 Jun 2024 12:08:30 +0530 Subject: [PATCH] Make headings direct to heading permalinks --- static/linkmap | 78 ++++++++++++++++++------------------ themes/obsidian-hugo-texify3 | 2 +- 2 files changed, 40 insertions(+), 40 deletions(-) diff --git a/static/linkmap b/static/linkmap index 24f2565..9ee2b28 100644 --- a/static/linkmap +++ b/static/linkmap @@ -1,51 +1,51 @@ -/blog/randomization-primality-testing-algorithms/index.{html} /blog/randomization-primality-testing-algorithms/ +/blog/technical-analysis/index.{html} /blog/technical-analysis/ +/blog/de-novo-assembly-overlap-graphs/index.{html} /blog/de-novo-assembly-overlap-graphs/ +/blog/how-the-economic-machine-works-by-ray-dalio/index.{html} /blog/how-the-economic-machine-works-by-ray-dalio/ +/blog/how-to-analyze-algorithms-proving-a-lower-bound-for-comparison-based-sorting/index.{html} /blog/how-to-analyze-algorithms-proving-a-lower-bound-for-comparison-based-sorting/ +/blog/p-vs-np/index.{html} /blog/p-vs-np/ +/blog/introduction-to-complexity-theory/index.{html} /blog/introduction-to-complexity-theory/ +/blog/master-s-theorem-strassen-s-matrix-multiplication-kth-order-statistics/index.{html} /blog/master-s-theorem-strassen-s-matrix-multiplication-kth-order-statistics/ +/blog/chain-matrix-multiplication/index.{html} /blog/chain-matrix-multiplication/ +/blog/mega-project-kblas-writing-a-benchmark-library-in-c-optimizing-l1-l2-basic-linear-algebra-subprograms/index.{html} /blog/mega-project-kblas-writing-a-benchmark-library-in-c-optimizing-l1-l2-basic-linear-algebra-subprograms/ +/blog/shortest-reliable-path-floyd-warshall-max-independent-set-tree/index.{html} /blog/shortest-reliable-path-floyd-warshall-max-independent-set-tree/ /blog/what-is-the-stock-market/index.{html} /blog/what-is-the-stock-market/ -/blog/derivatives-options/index.{html} /blog/derivatives-options/ -/blog/dna-sequencing/index.{html} /blog/dna-sequencing/ +/blog/finite-and-infinite-sums/index.{html} /blog/finite-and-infinite-sums/ /blog/flynn-s-taxonomy/index.{html} /blog/flynn-s-taxonomy/ -/blog/master-s-theorem-strassen-s-matrix-multiplication-kth-order-statistics/index.{html} /blog/master-s-theorem-strassen-s-matrix-multiplication-kth-order-statistics/ -/blog/profiling-a-program/index.{html} /blog/profiling-a-program/ -/blog/public-key-cryptography-coming-up-with-rsa/index.{html} /blog/public-key-cryptography-coming-up-with-rsa/ -/blog/riemann-series-rearrangement/index.{html} /blog/riemann-series-rearrangement/ -/blog/the-black-scholes-merton-equation/index.{html} /blog/the-black-scholes-merton-equation/ -/blog/analyzing-fibonacci-karatsuba-multiplication/index.{html} /blog/analyzing-fibonacci-karatsuba-multiplication/ -/blog/dp-as-dags-shortest-path-on-dags-lis-in-o-nlogn/index.{html} /blog/dp-as-dags-shortest-path-on-dags-lis-in-o-nlogn/ +/blog/stock-multiples/index.{html} /blog/stock-multiples/ +/blog/the-economics-of-foreign-exchange-forex/index.{html} /blog/the-economics-of-foreign-exchange-forex/ +/blog/covered-calls-strategy/index.{html} /blog/covered-calls-strategy/ +/blog/dna-sequencing/index.{html} /blog/dna-sequencing/ /blog/knapsack-using-branch-and-bounding/index.{html} /blog/knapsack-using-branch-and-bounding/ -/blog/p-vs-np/index.{html} /blog/p-vs-np/ -/blog/shortest-common-superstring-de-brujin-graphs/index.{html} /blog/shortest-common-superstring-de-brujin-graphs/ -/blog/shortest-reliable-path-floyd-warshall-max-independent-set-tree/index.{html} /blog/shortest-reliable-path-floyd-warshall-max-independent-set-tree/ -/blog/the-fast-fourier-transform-fft/index.{html} /blog/the-fast-fourier-transform-fft/ -/blog/wilson-s-theorem-fermat-s-little-theorem-euler-s-totient-function/index.{html} /blog/wilson-s-theorem-fermat-s-little-theorem-euler-s-totient-function/ +/blog/levenshtein-edit-distance/index.{html} /blog/levenshtein-edit-distance/ /index.html / -/blog/introduction-to-complexity-theory/index.{html} /blog/introduction-to-complexity-theory/ +/blog/a-deep-dive-into-the-knapsack-problem/index.{html} /blog/a-deep-dive-into-the-knapsack-problem/ +/blog/amdahl-s-law-gustafson-s-law/index.{html} /blog/amdahl-s-law-gustafson-s-law/ +/blog/are-there-computational-problems-that-computers-cannot-solve/index.{html} /blog/are-there-computational-problems-that-computers-cannot-solve/ +/blog/vectorization-analyzing-loop-dependencies/index.{html} /blog/vectorization-analyzing-loop-dependencies/ +/blog/wilson-s-theorem-fermat-s-little-theorem-euler-s-totient-function/index.{html} /blog/wilson-s-theorem-fermat-s-little-theorem-euler-s-totient-function/ +/blog/parallelism-with-omp/index.{html} /blog/parallelism-with-omp/ +/blog/profiling-a-program/index.{html} /blog/profiling-a-program/ +/blog/riemann-series-rearrangement/index.{html} /blog/riemann-series-rearrangement/ +/blog/theoretical-metrics-for-benchmarking/index.{html} /blog/theoretical-metrics-for-benchmarking/ /interests/index.{html} /interests/ -/blog/defining-computational-problems/index.{html} /blog/defining-computational-problems/ +/blog/analyzing-fibonacci-karatsuba-multiplication/index.{html} /blog/analyzing-fibonacci-karatsuba-multiplication/ +/blog/derivatives-options/index.{html} /blog/derivatives-options/ /blog/extended-euclidean-algorithm/index.{html} /blog/extended-euclidean-algorithm/ +/blog/shortest-common-superstring-de-brujin-graphs/index.{html} /blog/shortest-common-superstring-de-brujin-graphs/ /blog/more-greedy-algorithms-kruskal-s-disjoint-set-union/index.{html} /blog/more-greedy-algorithms-kruskal-s-disjoint-set-union/ -/blog/stock-multiples/index.{html} /blog/stock-multiples/ -/blog/theoretical-metrics-for-benchmarking/index.{html} /blog/theoretical-metrics-for-benchmarking/ -/blog/vectorization-analyzing-loop-dependencies/index.{html} /blog/vectorization-analyzing-loop-dependencies/ +/blog/public-key-cryptography-coming-up-with-rsa/index.{html} /blog/public-key-cryptography-coming-up-with-rsa/ +/blog/randomization-primality-testing-algorithms/index.{html} /blog/randomization-primality-testing-algorithms/ +/blog/set-cover-approximation-algorithms/index.{html} /blog/set-cover-approximation-algorithms/ +/blog/algorithms-for-approximate-string-matching-alignment/index.{html} /blog/algorithms-for-approximate-string-matching-alignment/ /blog/booyer-moore-knuth-morris-pratt-for-exact-matching/index.{html} /blog/booyer-moore-knuth-morris-pratt-for-exact-matching/ -/blog/chain-matrix-multiplication/index.{html} /blog/chain-matrix-multiplication/ -/blog/how-to-analyze-algorithms-proving-a-lower-bound-for-comparison-based-sorting/index.{html} /blog/how-to-analyze-algorithms-proving-a-lower-bound-for-comparison-based-sorting/ -/blog/new-and-delete/index.{html} /blog/new-and-delete/ -/blog/a-deep-dive-into-the-knapsack-problem/index.{html} /blog/a-deep-dive-into-the-knapsack-problem/ -/blog/amdahl-s-law-gustafson-s-law/index.{html} /blog/amdahl-s-law-gustafson-s-law/ +/blog/brent-s-theorem-task-level-parallelism/index.{html} /blog/brent-s-theorem-task-level-parallelism/ /blog/complexity-theory-reductions/index.{html} /blog/complexity-theory-reductions/ -/blog/covered-calls-strategy/index.{html} /blog/covered-calls-strategy/ -/blog/finite-and-infinite-sums/index.{html} /blog/finite-and-infinite-sums/ -/blog/how-the-economic-machine-works-by-ray-dalio/index.{html} /blog/how-the-economic-machine-works-by-ray-dalio/ -/blog/levenshtein-edit-distance/index.{html} /blog/levenshtein-edit-distance/ +/blog/smart-pointers/index.{html} /blog/smart-pointers/ /blog/network-flow-algorithms-ford-fulkerson/index.{html} /blog/network-flow-algorithms-ford-fulkerson/ +/blog/new-and-delete/index.{html} /blog/new-and-delete/ +/blog/the-black-scholes-merton-equation/index.{html} /blog/the-black-scholes-merton-equation/ +/blog/the-fast-fourier-transform-fft/index.{html} /blog/the-fast-fourier-transform-fft/ /blog/activity-selection-huffman-encoding/index.{html} /blog/activity-selection-huffman-encoding/ -/blog/are-there-computational-problems-that-computers-cannot-solve/index.{html} /blog/are-there-computational-problems-that-computers-cannot-solve/ -/blog/technical-analysis/index.{html} /blog/technical-analysis/ /blog/church-turing-hypothesis/index.{html} /blog/church-turing-hypothesis/ -/blog/de-novo-assembly-overlap-graphs/index.{html} /blog/de-novo-assembly-overlap-graphs/ -/blog/mega-project-kblas-writing-a-benchmark-library-in-c-optimizing-l1-l2-basic-linear-algebra-subprograms/index.{html} /blog/mega-project-kblas-writing-a-benchmark-library-in-c-optimizing-l1-l2-basic-linear-algebra-subprograms/ -/blog/parallelism-with-omp/index.{html} /blog/parallelism-with-omp/ -/blog/set-cover-approximation-algorithms/index.{html} /blog/set-cover-approximation-algorithms/ -/blog/smart-pointers/index.{html} /blog/smart-pointers/ -/blog/algorithms-for-approximate-string-matching-alignment/index.{html} /blog/algorithms-for-approximate-string-matching-alignment/ -/blog/brent-s-theorem-task-level-parallelism/index.{html} /blog/brent-s-theorem-task-level-parallelism/ -/blog/the-economics-of-foreign-exchange-forex/index.{html} /blog/the-economics-of-foreign-exchange-forex/ +/blog/defining-computational-problems/index.{html} /blog/defining-computational-problems/ +/blog/dp-as-dags-shortest-path-on-dags-lis-in-o-nlogn/index.{html} /blog/dp-as-dags-shortest-path-on-dags-lis-in-o-nlogn/ diff --git a/themes/obsidian-hugo-texify3 b/themes/obsidian-hugo-texify3 index 2ab9de8..0e4bdef 160000 --- a/themes/obsidian-hugo-texify3 +++ b/themes/obsidian-hugo-texify3 @@ -1 +1 @@ -Subproject commit 2ab9de8d1d7a3e51ab9e940d69b40ee09d08fc35 +Subproject commit 0e4bdefd815cd3ed056ae28b09a15406ba754ece