backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 04:18:34 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 3f0409d7cc

Browse Source
This commit is contained in:
realstealthninja
2025-08-14 01:46:15 +00:00
parent b41207008f
commit 67d95bf85f
969 changed files with 1315 additions and 1356 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
d0/d04/qr__decompose_8h__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: numerical_methods/qr_decompose.h Pages: 1 -->
<svg width="448pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 7.1 KiB

After

Width:  |  Height:  |  Size: 7.1 KiB

2
d0/d04/qr__decompose_8h__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: numerical_methods/qr_decompose.h Pages: 1 -->
<svg width="448pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.3 KiB

After

Width:  |  Height:  |  Size: 6.3 KiB

2
d0/d15/fast__fourier__transform_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: numerical_methods/fast_fourier_transform.cpp Pages: 1 -->
<svg width="384pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.4 KiB

After

Width:  |  Height:  |  Size: 6.4 KiB

2
d0/d15/fast__fourier__transform_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: numerical_methods/fast_fourier_transform.cpp Pages: 1 -->
<svg width="384pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.7 KiB

After

Width:  |  Height:  |  Size: 5.7 KiB

2
d0/d1f/structnode__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: node Pages: 1 -->
<svg width="96pt" height="102pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.9 KiB

After

Width:  |  Height:  |  Size: 2.9 KiB

2
d0/d1f/structnode__coll__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: node Pages: 1 -->
<svg width="96pt" height="102pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.1 KiB

After

Width:  |  Height:  |  Size: 2.1 KiB

2
d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: graph::RootedTree Pages: 1 -->
<svg width="284pt" height="287pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.8 KiB

After

Width:  |  Height:  |  Size: 6.8 KiB

2
d0/d24/classgraph_1_1_rooted_tree__coll__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: graph::RootedTree Pages: 1 -->
<svg width="284pt" height="287pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.0 KiB

After

Width:  |  Height:  |  Size: 6.0 KiB

2
d0/d2c/class_r_btree__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: RBtree Pages: 1 -->
<svg width="101pt" height="189pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.0 KiB

After

Width:  |  Height:  |  Size: 4.0 KiB

2
d0/d2c/class_r_btree__coll__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: RBtree Pages: 1 -->
<svg width="101pt" height="189pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

2
d0/d2c/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__inherit__graph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: range_queries::heavy_light_decomposition::HLD&lt; X &gt; Pages: 1 -->
<svg width="262pt" height="110pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.4 KiB

After

Width:  |  Height:  |  Size: 4.4 KiB

2
d0/d2c/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__inherit__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: range_queries::heavy_light_decomposition::HLD&lt; X &gt; Pages: 1 -->
<svg width="262pt" height="110pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.6 KiB

After

Width:  |  Height:  |  Size: 3.6 KiB

2
d0/d2c/karatsuba__algorithm__for__fast__multiplication_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: divide_and_conquer/karatsuba_algorithm_for_fast_multiplication.cpp Pages: 1 -->
<svg width="191pt" height="105pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.3 KiB

After

Width:  |  Height:  |  Size: 4.3 KiB

2
d0/d2c/karatsuba__algorithm__for__fast__multiplication_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: divide_and_conquer/karatsuba_algorithm_for_fast_multiplication.cpp Pages: 1 -->
<svg width="191pt" height="105pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.6 KiB

After

Width:  |  Height:  |  Size: 3.6 KiB

2
d0/d30/classdata__structures_1_1linked__list_1_1_node__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures::linked_list::Node Pages: 1 -->
<svg width="166pt" height="39pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

2
d0/d30/classdata__structures_1_1linked__list_1_1_node__coll__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures::linked_list::Node Pages: 1 -->
<svg width="166pt" height="39pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.6 KiB

After

Width:  |  Height:  |  Size: 1.6 KiB

2
d0/d3c/classvector__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: vector&lt; T &gt; Pages: 1 -->
<svg width="87pt" height="100pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.5 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB

2
d0/d3c/classvector__coll__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: vector&lt; T &gt; Pages: 1 -->
<svg width="87pt" height="100pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.8 KiB

After

Width:  |  Height:  |  Size: 1.8 KiB

2
d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: others::iterative_tree_traversals::Node Pages: 1 -->
<svg width="156pt" height="41pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.6 KiB

After

Width:  |  Height:  |  Size: 2.6 KiB

2
d0/d4c/structothers_1_1iterative__tree__traversals_1_1_node__coll__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: others::iterative_tree_traversals::Node Pages: 1 -->
<svg width="156pt" height="41pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.8 KiB

After

Width:  |  Height:  |  Size: 1.8 KiB

2
d0/d52/duval_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: strings/duval.cpp Pages: 1 -->
<svg width="429pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.9 KiB

After

Width:  |  Height:  |  Size: 6.9 KiB

2
d0/d52/duval_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: strings/duval.cpp Pages: 1 -->
<svg width="429pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.1 KiB

After

Width:  |  Height:  |  Size: 6.1 KiB

2
d0/d59/uint256__t_8hpp__dep__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: ciphers/uint256_t.hpp Pages: 1 -->
<svg width="117pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.7 KiB

After

Width:  |  Height:  |  Size: 2.7 KiB

2
d0/d59/uint256__t_8hpp__dep__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: ciphers/uint256_t.hpp Pages: 1 -->
<svg width="117pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.9 KiB

After

Width:  |  Height:  |  Size: 1.9 KiB

2
d0/d5b/windowed__median_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: probability/windowed_median.cpp Pages: 1 -->
<svg width="331pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.4 KiB

After

Width:  |  Height:  |  Size: 6.4 KiB

2
d0/d5b/windowed__median_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: probability/windowed_median.cpp Pages: 1 -->
<svg width="331pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.6 KiB

After

Width:  |  Height:  |  Size: 5.6 KiB

2
d0/d5e/exponential__dist_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: probability/exponential_dist.cpp Pages: 1 -->
<svg width="323pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.6 KiB

After

Width:  |  Height:  |  Size: 5.6 KiB

2
d0/d5e/exponential__dist_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: probability/exponential_dist.cpp Pages: 1 -->
<svg width="323pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.8 KiB

After

Width:  |  Height:  |  Size: 4.8 KiB

2
d0/d61/quadratic__probing__hash__table_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: hashing/quadratic_probing_hash_table.cpp Pages: 1 -->
<svg width="183pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.1 KiB

After

Width:  |  Height:  |  Size: 4.1 KiB

2
d0/d61/quadratic__probing__hash__table_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: hashing/quadratic_probing_hash_table.cpp Pages: 1 -->
<svg width="183pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

2
d0/d76/binary__insertion__sort_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: sorting/binary_insertion_sort.cpp Pages: 1 -->
<svg width="262pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.8 KiB

After

Width:  |  Height:  |  Size: 4.8 KiB

2
d0/d76/binary__insertion__sort_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: sorting/binary_insertion_sort.cpp Pages: 1 -->
<svg width="262pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.1 KiB

After

Width:  |  Height:  |  Size: 4.1 KiB

2
d0/d77/linear__search_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: search/linear_search.cpp Pages: 1 -->
<svg width="133pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

2
d0/d77/linear__search_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: search/linear_search.cpp Pages: 1 -->
<svg width="133pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

2
d0/d83/n__queens_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: backtracking/n_queens.cpp Pages: 1 -->
<svg width="143pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.1 KiB

After

Width:  |  Height:  |  Size: 3.1 KiB

2
d0/d83/n__queens_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: backtracking/n_queens.cpp Pages: 1 -->
<svg width="143pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

2
d0/da1/string__fibonacci_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/string_fibonacci.cpp Pages: 1 -->
<svg width="187pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 3.9 KiB

2
d0/da1/string__fibonacci_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/string_fibonacci.cpp Pages: 1 -->
<svg width="187pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

2
d0/db1/check__factorial_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/check_factorial.cpp Pages: 1 -->
<svg width="191pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.0 KiB

After

Width:  |  Height:  |  Size: 4.0 KiB

2
d0/db1/check__factorial_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/check_factorial.cpp Pages: 1 -->
<svg width="191pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

2
d0/db5/trie__modern_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures/trie_modern.cpp Pages: 1 -->
<svg width="189pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.1 KiB

After

Width:  |  Height:  |  Size: 4.1 KiB

2
d0/db5/trie__modern_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures/trie_modern.cpp Pages: 1 -->
<svg width="189pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

2
d0/db7/smallest__circle_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: others/smallest_circle.cpp Pages: 1 -->
<svg width="183pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 3.9 KiB

2
d0/db7/smallest__circle_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: others/smallest_circle.cpp Pages: 1 -->
<svg width="183pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

2
d0/dc8/intersection__of__two__arrays_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: operations_on_datastructures/intersection_of_two_arrays.cpp Pages: 1 -->
<svg width="262pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.9 KiB

After

Width:  |  Height:  |  Size: 4.9 KiB

2
d0/dc8/intersection__of__two__arrays_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: operations_on_datastructures/intersection_of_two_arrays.cpp Pages: 1 -->
<svg width="262pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.2 KiB

After

Width:  |  Height:  |  Size: 4.2 KiB

2
d0/dcc/modular__division_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/modular_division.cpp Pages: 1 -->
<svg width="191pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 3.9 KiB

2
d0/dcc/modular__division_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/modular_division.cpp Pages: 1 -->
<svg width="191pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

2
d0/dcc/successive__approximation_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: numerical_methods/successive_approximation.cpp Pages: 1 -->
<svg width="161pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.4 KiB

After

Width:  |  Height:  |  Size: 3.4 KiB

2
d0/dcc/successive__approximation_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: numerical_methods/successive_approximation.cpp Pages: 1 -->
<svg width="161pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.6 KiB

After

Width:  |  Height:  |  Size: 2.6 KiB

2
d0/dd1/binaryheap_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures/binaryheap.cpp Pages: 1 -->
<svg width="181pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 3.9 KiB

2
d0/dd1/binaryheap_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures/binaryheap.cpp Pages: 1 -->
<svg width="181pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

2
d0/dd3/modular__exponentiation_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/modular_exponentiation.cpp Pages: 1 -->
<svg width="191pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 3.9 KiB

2
d0/dd3/modular__exponentiation_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/modular_exponentiation.cpp Pages: 1 -->
<svg width="191pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

2
d0/dd5/ode__midpoint__euler_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: numerical_methods/ode_midpoint_euler.cpp Pages: 1 -->
<svg width="317pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.6 KiB

After

Width:  |  Height:  |  Size: 5.6 KiB

2
d0/dd5/ode__midpoint__euler_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: numerical_methods/ode_midpoint_euler.cpp Pages: 1 -->
<svg width="317pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.9 KiB

After

Width:  |  Height:  |  Size: 4.9 KiB

2
d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures::stack_using_queue::Stack Pages: 1 -->
<svg width="122pt" height="126pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.0 KiB

After

Width:  |  Height:  |  Size: 3.0 KiB

2
d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures::stack_using_queue::Stack Pages: 1 -->
<svg width="122pt" height="126pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

2
d0/df1/z__function_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: strings/z_function.cpp Pages: 1 -->
<svg width="315pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.5 KiB

After

Width:  |  Height:  |  Size: 5.5 KiB

2
d0/df1/z__function_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: strings/z_function.cpp Pages: 1 -->
<svg width="315pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.7 KiB

After

Width:  |  Height:  |  Size: 4.7 KiB

2
d0/dfc/sqrt__double_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/sqrt_double.cpp Pages: 1 -->
<svg width="128pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

2
d0/dfc/sqrt__double_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/sqrt_double.cpp Pages: 1 -->
<svg width="128pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.5 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB

2
d0/dfe/depth__first__search__with__stack_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: graph/depth_first_search_with_stack.cpp Pages: 1 -->
<svg width="305pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.6 KiB

After

Width:  |  Height:  |  Size: 5.6 KiB

2
d0/dfe/depth__first__search__with__stack_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: graph/depth_first_search_with_stack.cpp Pages: 1 -->
<svg width="305pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.9 KiB

After

Width:  |  Height:  |  Size: 4.9 KiB

2
d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: machine_learning::aystar_search::EightPuzzle&lt; N &gt; Pages: 1 -->
<svg width="490pt" height="88pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.1 KiB

After

Width:  |  Height:  |  Size: 5.1 KiB

2
d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: machine_learning::aystar_search::EightPuzzle&lt; N &gt; Pages: 1 -->
<svg width="490pt" height="88pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.4 KiB

After

Width:  |  Height:  |  Size: 4.4 KiB

2
d1/d06/ternary__search_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: search/ternary_search.cpp Pages: 1 -->
<svg width="140pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

2
d1/d06/ternary__search_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: search/ternary_search.cpp Pages: 1 -->
<svg width="140pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

2
d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures::linked_list::list Pages: 1 -->
<svg width="306pt" height="157pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.8 KiB

After

Width:  |  Height:  |  Size: 6.8 KiB

2
d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures::linked_list::list Pages: 1 -->
<svg width="306pt" height="157pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.0 KiB

After

Width:  |  Height:  |  Size: 6.0 KiB

293
d1/d1c/base64__encoding_8cpp_source.html
View File

@@ -117,154 +117,153 @@ $(function(){initNavTree('d1/d1c/base64__encoding_8cpp_source.html','../../','')
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include &lt;array&gt;</span> </div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#include &lt;cassert&gt;</span> </div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include &lt;iostream&gt;</span> </div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d4e/namespaceciphers.html">ciphers</a> {</div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/dc9/namespacebase64__encoding.html">base64_encoding</a> {</div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="comment">// chars denoting the format for encoding and decoding array.</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="comment">// This array is already decided by</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="comment">// [RFC4648](https://tools.ietf.org/html/rfc4648#section-4) standard</span></div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="keyword">const</span> std::string chars =</div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/&quot;</span>;</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span>std::string base64_encode(<span class="keyword">const</span> std::string &amp;input) {</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> std::string base64_string; </div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// base64 deals with 6-bit chars encoded as per chars, so</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// we will always filter 6-bits from input.</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; input.size(); i += 3) {</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordtype">char</span> first_byte = input[i]; </div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// Take first six bits of first character.</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// Encode the first six bits with character defined in string `chars`</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> base64_string.push_back(chars[first_byte &gt;&gt; 2]);</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> </div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keywordflow">if</span> (i + 1 &lt; input.size()) {</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keywordtype">char</span> second_byte = input[i + 1]; </div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// Take remaining two bits of first character, and four first bits</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// from second character Combine two numbers as 6-bit digits and</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// encode by array chars (first two bits of first byte and next four</span></div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// of second byte)</span></div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> base64_string.push_back(</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> chars[(((first_byte &amp; 3) &lt;&lt; 4) | ((second_byte &amp; 0xF0) &gt;&gt; 4))]);</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> </div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordflow">if</span> (i + 2 &lt; input.size()) {</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keywordtype">char</span> third_byte = input[i + 2]; </div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// Take remaining four bits of second character, and first two</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// bits from third character Combine two numbers as 6-bit digits</span></div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="comment">// and encode by array chars (remaining four bits of second byte</span></div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="comment">// and first two of third byte)</span></div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> base64_string.push_back(chars[((third_byte &amp; 0xC0) &gt;&gt; 6) |</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> ((second_byte &amp; 0x0F) &lt;&lt; 2)]);</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// Encode remaining 6-bit of third byte by array chars</span></div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> base64_string.push_back(chars[(third_byte &amp; 0x3F)]);</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="comment">// Take remaining four bits of second character as 6-bit number</span></div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> base64_string.push_back(chars[((second_byte &amp; 0x0F) &lt;&lt; 2)]);</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> base64_string.push_back(<span class="charliteral">&#39;=&#39;</span>); <span class="comment">// padding characters</span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> }</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// Take remaining two bits of first character as 6-bit number</span></div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> base64_string.push_back(chars[((first_byte &amp; 3) &lt;&lt; 4)]);</div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include &lt;cassert&gt;</span> </div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include &lt;iostream&gt;</span> </div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d4e/namespaceciphers.html">ciphers</a> {</div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/dc9/namespacebase64__encoding.html">base64_encoding</a> {</div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="comment">// chars denoting the format for encoding and decoding array.</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="comment">// This array is already decided by</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="comment">// [RFC4648](https://tools.ietf.org/html/rfc4648#section-4) standard</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="keyword">const</span> std::string chars =</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/&quot;</span>;</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span>std::string base64_encode(<span class="keyword">const</span> std::string &amp;input) {</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> std::string base64_string; </div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// base64 deals with 6-bit chars encoded as per chars, so</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// we will always filter 6-bits from input.</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; input.size(); i += 3) {</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordtype">char</span> first_byte = input[i]; </div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// Take first six bits of first character.</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// Encode the first six bits with character defined in string `chars`</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> base64_string.push_back(chars[first_byte &gt;&gt; 2]);</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> </div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keywordflow">if</span> (i + 1 &lt; input.size()) {</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keywordtype">char</span> second_byte = input[i + 1]; </div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// Take remaining two bits of first character, and four first bits</span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// from second character Combine two numbers as 6-bit digits and</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// encode by array chars (first two bits of first byte and next four</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// of second byte)</span></div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> base64_string.push_back(</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> chars[(((first_byte &amp; 3) &lt;&lt; 4) | ((second_byte &amp; 0xF0) &gt;&gt; 4))]);</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> </div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordflow">if</span> (i + 2 &lt; input.size()) {</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordtype">char</span> third_byte = input[i + 2]; </div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// Take remaining four bits of second character, and first two</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// bits from third character Combine two numbers as 6-bit digits</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// and encode by array chars (remaining four bits of second byte</span></div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="comment">// and first two of third byte)</span></div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> base64_string.push_back(chars[((third_byte &amp; 0xC0) &gt;&gt; 6) |</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> ((second_byte &amp; 0x0F) &lt;&lt; 2)]);</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// Encode remaining 6-bit of third byte by array chars</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> base64_string.push_back(chars[(third_byte &amp; 0x3F)]);</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// Take remaining four bits of second character as 6-bit number</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> base64_string.push_back(chars[((second_byte &amp; 0x0F) &lt;&lt; 2)]);</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> base64_string.push_back(<span class="charliteral">&#39;=&#39;</span>); <span class="comment">// padding characters</span></div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> }</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="comment">// Take remaining two bits of first character as 6-bit number</span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> base64_string.push_back(chars[((first_byte &amp; 3) &lt;&lt; 4)]);</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> base64_string.push_back(<span class="charliteral">&#39;=&#39;</span>); <span class="comment">// padding characters</span></div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> base64_string.push_back(<span class="charliteral">&#39;=&#39;</span>); <span class="comment">// padding characters</span></div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> base64_string.push_back(<span class="charliteral">&#39;=&#39;</span>); <span class="comment">// padding characters</span></div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> }</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> }</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">return</span> base64_string;</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span>}</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span>uint8_t find_idx(<span class="keyword">const</span> <span class="keywordtype">char</span> c) {</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">if</span> (c &gt;= <span class="charliteral">&#39;A&#39;</span> &amp;&amp; c &lt;= <span class="charliteral">&#39;Z&#39;</span>) {</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keywordflow">return</span> c - <span class="charliteral">&#39;A&#39;</span>;</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c &gt;= <span class="charliteral">&#39;a&#39;</span> &amp;&amp; c &lt;= <span class="charliteral">&#39;z&#39;</span>) {</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordflow">return</span> c - <span class="charliteral">&#39;a&#39;</span> + 26;</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c &gt;= <span class="charliteral">&#39;0&#39;</span> &amp;&amp; c &lt;= <span class="charliteral">&#39;9&#39;</span>) {</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="keywordflow">return</span> c - <span class="charliteral">&#39;0&#39;</span> + 52;</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c == <span class="charliteral">&#39;+&#39;</span>) {</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordflow">return</span> 62;</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c == <span class="charliteral">&#39;/&#39;</span>) {</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keywordflow">return</span> 63;</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> }</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="keywordflow">return</span> -1;</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span>}</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span>std::string base64_decode(<span class="keyword">const</span> std::string &amp;base64_str) {</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> std::string</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> base64_decoded; </div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; base64_str.size(); i += 4) {</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="keywordtype">char</span> first_byte = base64_str[i];</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="keywordtype">char</span> second_byte = base64_str[i + 1];</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="comment">// Actual str characters are of 8 bits (or 1 byte):</span></div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="comment">// :: 8 bits are decode by taking 6 bits from 1st byte of base64 string</span></div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// and first 2 bits from 2nd byte of base64 string.</span></div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordtype">char</span> first_actual_byte = <span class="keyword">static_cast&lt;</span><span class="keywordtype">char</span><span class="keyword">&gt;</span>(</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> (find_idx(first_byte) &lt;&lt; 2) | ((find_idx(second_byte)) &gt;&gt; 4));</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> base64_decoded.push_back(first_actual_byte);</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">if</span> (i + 2 &lt; base64_str.size() &amp;&amp; base64_str[i + 2] != <span class="charliteral">&#39;=&#39;</span>) {</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keywordtype">char</span> third_byte = base64_str[i + 2];</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="comment">// :: Next 8 bits are decode by taking remaining 4 bits from 2nd</span></div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// byte of base64 string and first 4 bits from 3rd byte of base64</span></div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="comment">// string.</span></div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="keywordtype">char</span> second_actual_byte =</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">char</span><span class="keyword">&gt;</span>(((find_idx(second_byte) &amp; 0x0F) &lt;&lt; 4) |</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> (find_idx(third_byte) &gt;&gt; 2));</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> base64_decoded.push_back(second_actual_byte);</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> </div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keywordflow">if</span> (i + 3 &lt; base64_str.size() &amp;&amp; base64_str[i + 3] != <span class="charliteral">&#39;=&#39;</span>) {</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="keywordtype">char</span> fourth_byte = base64_str[i + 3];</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// :: Taking remaining 2 bits from 3rd byte of base64 string</span></div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// and all 6 bits from 4th byte of base64 string.</span></div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keywordtype">char</span> third_actual_byte =</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">char</span><span class="keyword">&gt;</span>(((find_idx(third_byte) &amp; 0x03) &lt;&lt; 6) |</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> find_idx(fourth_byte));</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> base64_decoded.push_back(third_actual_byte);</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> }</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> }</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> }</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="keywordflow">return</span> base64_decoded;</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span>}</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span>} <span class="comment">// namespace base64_encoding</span></div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span>} <span class="comment">// namespace ciphers</span></div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span></div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="comment">// 1st Test</span></div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> std::string str =</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="stringliteral">&quot;To err is human, but to really foul things up you need a computer.&quot;</span>;</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> std::string base64_str = ciphers::base64_encoding::base64_encode(str);</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> std::string verify =</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="stringliteral">&quot;VG8gZXJyIGlzIGh1bWFuLCBidXQgdG8gcmVhbGx5IGZvdWwgdGhpbmdzIHVwIHlvdSBuZW&quot;</span></div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="stringliteral">&quot;VkIGEgY29tcHV0ZXIu&quot;</span>;</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <span class="comment">// verify encoding</span></div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> assert(base64_str == verify);</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> std::string original_str =</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> ciphers::base64_encoding::base64_decode(base64_str);</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="comment">// verify decoding</span></div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> assert(original_str == str);</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> </div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="comment">// 2nd Test from [Wikipedia](https://en.wikipedia.org/wiki/Base64)</span></div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> str =</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="stringliteral">&quot;Man is distinguished, not only by his reason, but by this singular &quot;</span></div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="stringliteral">&quot;passion from other animals, which is a lust of the mind, that by a &quot;</span></div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="stringliteral">&quot;perseverance of delight in the continued and indefatigable generation &quot;</span></div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="stringliteral">&quot;of knowledge, exceeds the short vehemence of any carnal pleasure.&quot;</span>;</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> </div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> base64_str = ciphers::base64_encoding::base64_encode(str);</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> verify =</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="stringliteral">&quot;TWFuIGlzIGRpc3Rpbmd1aXNoZWQsIG5vdCBvbmx5IGJ5IGhpcyByZWFzb24sIGJ1dCBieS&quot;</span></div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="stringliteral">&quot;B0aGlzIHNpbmd1bGFyIHBhc3Npb24gZnJvbSBvdGhlciBhbmltYWxzLCB3aGljaCBpcyBh&quot;</span></div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="stringliteral">&quot;IGx1c3Qgb2YgdGhlIG1pbmQsIHRoYXQgYnkgYSBwZXJzZXZlcmFuY2Ugb2YgZGVsaWdodC&quot;</span></div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="stringliteral">&quot;BpbiB0aGUgY29udGludWVkIGFuZCBpbmRlZmF0aWdhYmxlIGdlbmVyYXRpb24gb2Yga25v&quot;</span></div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="stringliteral">&quot;d2xlZGdlLCBleGNlZWRzIHRoZSBzaG9ydCB2ZWhlbWVuY2Ugb2YgYW55IGNhcm5hbCBwbG&quot;</span></div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="stringliteral">&quot;Vhc3VyZS4=&quot;</span>;</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="comment">// verify encoding</span></div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> assert(base64_str == verify);</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> original_str = ciphers::base64_encoding::base64_decode(base64_str);</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="comment">// verify decoding</span></div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> assert(original_str == str);</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span>}</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span></div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span>}</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> }</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordflow">return</span> base64_string;</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span>}</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span>uint8_t find_idx(<span class="keyword">const</span> <span class="keywordtype">char</span> c) {</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">if</span> (c &gt;= <span class="charliteral">&#39;A&#39;</span> &amp;&amp; c &lt;= <span class="charliteral">&#39;Z&#39;</span>) {</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">return</span> c - <span class="charliteral">&#39;A&#39;</span>;</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c &gt;= <span class="charliteral">&#39;a&#39;</span> &amp;&amp; c &lt;= <span class="charliteral">&#39;z&#39;</span>) {</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keywordflow">return</span> c - <span class="charliteral">&#39;a&#39;</span> + 26;</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c &gt;= <span class="charliteral">&#39;0&#39;</span> &amp;&amp; c &lt;= <span class="charliteral">&#39;9&#39;</span>) {</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keywordflow">return</span> c - <span class="charliteral">&#39;0&#39;</span> + 52;</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c == <span class="charliteral">&#39;+&#39;</span>) {</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="keywordflow">return</span> 62;</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c == <span class="charliteral">&#39;/&#39;</span>) {</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keywordflow">return</span> 63;</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> }</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordflow">return</span> -1;</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span>}</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span>std::string base64_decode(<span class="keyword">const</span> std::string &amp;base64_str) {</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> std::string</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> base64_decoded; </div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; base64_str.size(); i += 4) {</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="keywordtype">char</span> first_byte = base64_str[i];</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordtype">char</span> second_byte = base64_str[i + 1];</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="comment">// Actual str characters are of 8 bits (or 1 byte):</span></div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="comment">// :: 8 bits are decode by taking 6 bits from 1st byte of base64 string</span></div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="comment">// and first 2 bits from 2nd byte of base64 string.</span></div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keywordtype">char</span> first_actual_byte = <span class="keyword">static_cast&lt;</span><span class="keywordtype">char</span><span class="keyword">&gt;</span>(</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> (find_idx(first_byte) &lt;&lt; 2) | ((find_idx(second_byte)) &gt;&gt; 4));</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> base64_decoded.push_back(first_actual_byte);</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordflow">if</span> (i + 2 &lt; base64_str.size() &amp;&amp; base64_str[i + 2] != <span class="charliteral">&#39;=&#39;</span>) {</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordtype">char</span> third_byte = base64_str[i + 2];</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="comment">// :: Next 8 bits are decode by taking remaining 4 bits from 2nd</span></div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="comment">// byte of base64 string and first 4 bits from 3rd byte of base64</span></div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// string.</span></div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="keywordtype">char</span> second_actual_byte =</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">char</span><span class="keyword">&gt;</span>(((find_idx(second_byte) &amp; 0x0F) &lt;&lt; 4) |</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> (find_idx(third_byte) &gt;&gt; 2));</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> base64_decoded.push_back(second_actual_byte);</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> </div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="keywordflow">if</span> (i + 3 &lt; base64_str.size() &amp;&amp; base64_str[i + 3] != <span class="charliteral">&#39;=&#39;</span>) {</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keywordtype">char</span> fourth_byte = base64_str[i + 3];</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="comment">// :: Taking remaining 2 bits from 3rd byte of base64 string</span></div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// and all 6 bits from 4th byte of base64 string.</span></div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keywordtype">char</span> third_actual_byte =</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">char</span><span class="keyword">&gt;</span>(((find_idx(third_byte) &amp; 0x03) &lt;&lt; 6) |</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> find_idx(fourth_byte));</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> base64_decoded.push_back(third_actual_byte);</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> }</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> }</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> }</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keywordflow">return</span> base64_decoded;</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span>}</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span>} <span class="comment">// namespace base64_encoding</span></div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span>} <span class="comment">// namespace ciphers</span></div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span></div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// 1st Test</span></div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> std::string str =</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="stringliteral">&quot;To err is human, but to really foul things up you need a computer.&quot;</span>;</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> std::string base64_str = ciphers::base64_encoding::base64_encode(str);</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> std::string verify =</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="stringliteral">&quot;VG8gZXJyIGlzIGh1bWFuLCBidXQgdG8gcmVhbGx5IGZvdWwgdGhpbmdzIHVwIHlvdSBuZW&quot;</span></div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="stringliteral">&quot;VkIGEgY29tcHV0ZXIu&quot;</span>;</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="comment">// verify encoding</span></div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> assert(base64_str == verify);</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> std::string original_str =</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> ciphers::base64_encoding::base64_decode(base64_str);</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="comment">// verify decoding</span></div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> assert(original_str == str);</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> </div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="comment">// 2nd Test from [Wikipedia](https://en.wikipedia.org/wiki/Base64)</span></div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> str =</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="stringliteral">&quot;Man is distinguished, not only by his reason, but by this singular &quot;</span></div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="stringliteral">&quot;passion from other animals, which is a lust of the mind, that by a &quot;</span></div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="stringliteral">&quot;perseverance of delight in the continued and indefatigable generation &quot;</span></div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="stringliteral">&quot;of knowledge, exceeds the short vehemence of any carnal pleasure.&quot;</span>;</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> </div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> base64_str = ciphers::base64_encoding::base64_encode(str);</div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> verify =</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="stringliteral">&quot;TWFuIGlzIGRpc3Rpbmd1aXNoZWQsIG5vdCBvbmx5IGJ5IGhpcyByZWFzb24sIGJ1dCBieS&quot;</span></div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="stringliteral">&quot;B0aGlzIHNpbmd1bGFyIHBhc3Npb24gZnJvbSBvdGhlciBhbmltYWxzLCB3aGljaCBpcyBh&quot;</span></div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="stringliteral">&quot;IGx1c3Qgb2YgdGhlIG1pbmQsIHRoYXQgYnkgYSBwZXJzZXZlcmFuY2Ugb2YgZGVsaWdodC&quot;</span></div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="stringliteral">&quot;BpbiB0aGUgY29udGludWVkIGFuZCBpbmRlZmF0aWdhYmxlIGdlbmVyYXRpb24gb2Yga25v&quot;</span></div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="stringliteral">&quot;d2xlZGdlLCBleGNlZWRzIHRoZSBzaG9ydCB2ZWhlbWVuY2Ugb2YgYW55IGNhcm5hbCBwbG&quot;</span></div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="stringliteral">&quot;Vhc3VyZS4=&quot;</span>;</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="comment">// verify encoding</span></div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> assert(base64_str == verify);</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> original_str = ciphers::base64_encoding::base64_decode(base64_str);</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="comment">// verify decoding</span></div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> assert(original_str == str);</div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span>}</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span></div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span>}</div>
<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
<div class="ttc" id="anamespacebase64__encoding_html"><div class="ttname"><a href="../../d9/dc9/namespacebase64__encoding.html">base64_encoding</a></div><div class="ttdoc">Functions for Base64 Encoding and Decoding implementation.</div></div>

2
d1/d1d/pascal__triangle_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: others/pascal_triangle.cpp Pages: 1 -->
<svg width="193pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 3.9 KiB

2
d1/d1d/pascal__triangle_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: others/pascal_triangle.cpp Pages: 1 -->
<svg width="193pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

2
d1/d33/caesar__cipher_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: ciphers/caesar_cipher.cpp Pages: 1 -->
<svg width="186pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 3.9 KiB

2
d1/d33/caesar__cipher_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: ciphers/caesar_cipher.cpp Pages: 1 -->
<svg width="186pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

2
d1/d3c/queue__using__two__stacks_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures/queue_using_two_stacks.cpp Pages: 1 -->
<svg width="186pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.1 KiB

After

Width:  |  Height:  |  Size: 4.1 KiB

2
d1/d3c/queue__using__two__stacks_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures/queue_using_two_stacks.cpp Pages: 1 -->
<svg width="186pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

2
d1/d40/longest__increasing__subsequence_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: dynamic_programming/longest_increasing_subsequence.cpp Pages: 1 -->
<svg width="314pt" height="105pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.8 KiB

After

Width:  |  Height:  |  Size: 5.8 KiB

2
d1/d40/longest__increasing__subsequence_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: dynamic_programming/longest_increasing_subsequence.cpp Pages: 1 -->
<svg width="314pt" height="105pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.0 KiB

After

Width:  |  Height:  |  Size: 5.0 KiB

2
d1/d4a/finding__number__of__digits__in__a__number_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/finding_number_of_digits_in_a_number.cpp Pages: 1 -->
<svg width="252pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.9 KiB

After

Width:  |  Height:  |  Size: 4.9 KiB

2
d1/d4a/finding__number__of__digits__in__a__number_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/finding_number_of_digits_in_a_number.cpp Pages: 1 -->
<svg width="252pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.2 KiB

After

Width:  |  Height:  |  Size: 4.2 KiB

2
d1/d4b/ordinary__least__squares__regressor_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: machine_learning/ordinary_least_squares_regressor.cpp Pages: 1 -->
<svg width="318pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.6 KiB

After

Width:  |  Height:  |  Size: 5.6 KiB

2
d1/d4b/ordinary__least__squares__regressor_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: machine_learning/ordinary_least_squares_regressor.cpp Pages: 1 -->
<svg width="318pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.9 KiB

After

Width:  |  Height:  |  Size: 4.9 KiB

2
d1/d52/lcm__sum_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/lcm_sum.cpp Pages: 1 -->
<svg width="252pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.7 KiB

After

Width:  |  Height:  |  Size: 4.7 KiB

2
d1/d52/lcm__sum_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/lcm_sum.cpp Pages: 1 -->
<svg width="252pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 3.9 KiB

2
d1/d57/classcll__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: cll Pages: 1 -->
<svg width="96pt" height="174pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.8 KiB

After

Width:  |  Height:  |  Size: 3.8 KiB

2
d1/d57/classcll__coll__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: cll Pages: 1 -->
<svg width="96pt" height="174pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.0 KiB

After

Width:  |  Height:  |  Size: 3.0 KiB

2
d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: std::is_arithmetic&lt; uint256_t &gt; Pages: 1 -->
<svg width="99pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.5 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB

2
d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: std::is_arithmetic&lt; uint256_t &gt; Pages: 1 -->
<svg width="99pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.8 KiB

After

Width:  |  Height:  |  Size: 1.8 KiB

2
d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: range_queries::heavy_light_decomposition::SG&lt; X &gt; Pages: 1 -->
<svg width="117pt" height="122pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.9 KiB

After

Width:  |  Height:  |  Size: 2.9 KiB

2
d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: range_queries::heavy_light_decomposition::SG&lt; X &gt; Pages: 1 -->
<svg width="117pt" height="122pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

2
d1/d6c/classstats__computer1__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: stats_computer1&lt; T &gt; Pages: 1 -->
<svg width="121pt" height="100pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.6 KiB

After

Width:  |  Height:  |  Size: 2.6 KiB

2
d1/d6c/classstats__computer1__coll__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: stats_computer1&lt; T &gt; Pages: 1 -->
<svg width="121pt" height="100pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.8 KiB

After

Width:  |  Height:  |  Size: 1.8 KiB

2
d1/d6d/lru__cache_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: others/lru_cache.cpp Pages: 1 -->
<svg width="339pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.5 KiB

After

Width:  |  Height:  |  Size: 5.5 KiB

2
d1/d6d/lru__cache_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: others/lru_cache.cpp Pages: 1 -->
<svg width="339pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.7 KiB

After

Width:  |  Height:  |  Size: 4.7 KiB

2
d1/d6d/queue__using__array_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures/queue_using_array.cpp Pages: 1 -->
<svg width="181pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.2 KiB

After

Width:  |  Height:  |  Size: 4.2 KiB

2
d1/d6d/queue__using__array_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures/queue_using_array.cpp Pages: 1 -->
<svg width="181pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.4 KiB

After

Width:  |  Height:  |  Size: 3.4 KiB

2
d1/d6f/vector__ops_8hpp__dep__incl.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: machine_learning/vector_ops.hpp Pages: 1 -->
<svg width="130pt" height="105pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.9 KiB

After

Width:  |  Height:  |  Size: 2.9 KiB

2
d1/d6f/vector__ops_8hpp__dep__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: machine_learning/vector_ops.hpp Pages: 1 -->
<svg width="130pt" height="105pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

2
d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 13.0.1 (20250615.1724)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: graph::LowestCommonAncestor Pages: 1 -->
<svg width="313pt" height="359pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 8.5 KiB

After

Width:  |  Height:  |  Size: 8.5 KiB

Some files were not shown because too many files have changed in this diff Show More