Deploying to gh-pages from @ 59c0b9d 🚀

algorithm-archivists · Aug 23, 2023 · ac0c737 · ac0c737
1 parent 1c2775f
commit ac0c737
Show file tree

Hide file tree

Showing 56 changed files with 243 additions and 184 deletions.
diff --git a/Dockerfile b/Dockerfile
@@ -109,4 +109,3 @@ RUN apt-get update && export DEBIAN_FRONTEND=noninteractive \
 RUN pip install wheel matplotlib numpy coconut scons
 
 RUN sudo sh -c 'npm install -g typescript'
-
diff --git a/SConstruct b/SConstruct
@@ -28,6 +28,7 @@ available_languages = {
     'bash',
     'c',
     'cpp',
+    'csharp',
     'fortran',
     'java',
     'julia',
@@ -43,6 +44,7 @@ available_languages = {
 
 languages_to_import = {
     'coconut': ['coconut'],
+    'csharp': ['mcs'],
     'go': ['go'],
     'rust': ['rustc', 'cargo'],
     'kotlin': ['kotlin'],
@@ -77,6 +79,7 @@ languages = {
     'c': 'c',
     'coconut': 'coco',
     'cpp': 'cpp',
+    'csharp': 'cs',
     'fortran': 'f90',
     'go': 'go',
     'java': 'java',

diff --git a/builders/mcs.py b/builders/mcs.py
@@ -0,0 +1,37 @@
+from SCons.Builder import Builder
+import SCons.Util
+
+class ToolMCSWarning(SCons.Warnings.SConsWarning):
+    pass
+
+class MCSNotFound(ToolMCSWarning):
+    pass
+
+SCons.Warnings.enableWarningClass(ToolMCSWarning)
+
+def _detect(env):
+    try:
+        return env['mcs']
+    except KeyError:
+        pass
+
+    mcs = env.WhereIs('mcs')
+    if mcs:
+        return mcs
+
+    SCons.Warnings.warn(MCSNotFound, 'Could not find mcs executable')
+
+def exists(env):
+    env.Detect('mcs')
+
+def generate(env):
+    env['MCS'] = _detect(env)
+    env['MCSFLAGS'] = []
+
+    mcs_builder = Builder(
+        action='"$MCS" -out:$TARGET $MCSFLAGS $SOURCES',
+        src_suffix='.cs',
+        suffix='$PROGSUFFIX',
+    )
+
+    env.Append(BUILDERS={'MCS': mcs_builder})
diff --git a/contents/IFS/IFS.html b/contents/IFS/IFS.html
diff --git a/contents/affine_transformations/affine_transformations.html b/contents/affine_transformations/affine_transformations.html
diff --git a/contents/approximate_counting/approximate_counting.html b/contents/approximate_counting/approximate_counting.html
diff --git a/contents/barnsley/barnsley.html b/contents/barnsley/barnsley.html
diff --git a/contents/bitlogic/bitlogic.html b/contents/bitlogic/bitlogic.html
diff --git a/contents/box_muller/box_muller.html b/contents/box_muller/box_muller.html
diff --git a/contents/box_muller/box_muller_rejection.html b/contents/box_muller/box_muller_rejection.html
diff --git a/contents/code_reviews/code_reviewers.html b/contents/code_reviews/code_reviewers.html
diff --git a/contents/computational_geometry/computational_geometry.html b/contents/computational_geometry/computational_geometry.html
diff --git a/contents/computer_graphics/computer_graphics.html b/contents/computer_graphics/computer_graphics.html
diff --git a/contents/computus/computus.html b/contents/computus/computus.html
diff --git a/contents/convolutions/1d/1d.html b/contents/convolutions/1d/1d.html
diff --git a/contents/convolutions/2d/2d.html b/contents/convolutions/2d/2d.html
diff --git a/contents/convolutions/convolutional_theorem/convolutional_theorem.html b/contents/convolutions/convolutional_theorem/convolutional_theorem.html
diff --git a/contents/convolutions/convolutions.html b/contents/convolutions/convolutions.html
diff --git a/contents/convolutions/multiplication/multiplication.html b/contents/convolutions/multiplication/multiplication.html
diff --git a/contents/cooley_tukey/cooley_tukey.html b/contents/cooley_tukey/cooley_tukey.html
diff --git a/contents/cryptography/cryptography.html b/contents/cryptography/cryptography.html
diff --git a/contents/data_compression/data_compression.html b/contents/data_compression/data_compression.html
diff --git a/contents/data_structures/data_structures.html b/contents/data_structures/data_structures.html
diff --git a/contents/decision_problems/decision_problems.html b/contents/decision_problems/decision_problems.html
diff --git a/contents/domain_coloring/domain_coloring.html b/contents/domain_coloring/domain_coloring.html
diff --git a/contents/euclidean_algorithm/euclidean_algorithm.html b/contents/euclidean_algorithm/euclidean_algorithm.html
diff --git a/contents/flood_fill/flood_fill.html b/contents/flood_fill/flood_fill.html
diff --git a/contents/gaussian_elimination/gaussian_elimination.html b/contents/gaussian_elimination/gaussian_elimination.html
diff --git a/contents/gift_wrapping/gift_wrapping.html b/contents/gift_wrapping/gift_wrapping.html
diff --git a/contents/graham_scan/graham_scan.html b/contents/graham_scan/graham_scan.html
diff --git a/contents/how_to_contribute/how_to_contribute.html b/contents/how_to_contribute/how_to_contribute.html
diff --git a/contents/huffman_encoding/code/csharp/HuffmanCoding.cs b/contents/huffman_encoding/code/csharp/HuffmanCoding.cs
@@ -133,25 +133,26 @@ private Node CreateTree(string input)
             return nodePriorityList.Pop();
         }
 
+
+        private void CreateDictionary(Node node, string bitString, Dictionary<char, string> localDictionary)
+        {
+            if (node.IsLeaf)
+                localDictionary.Add(node.Key[0], bitString);
+            else
+            {
+                if (node.LeftChild != null)
+                    CreateDictionary(node.LeftChild, bitString + '0', localDictionary);
+                if (node.RightChild != null)
+                    CreateDictionary(node.RightChild, bitString + '1', localDictionary);
+            }
+        }
+
         private Dictionary<char, string> CreateDictionary(Node root)
         {
             // We're using a string instead of a actual bits here, since it makes the code somewhat more readable and this is an educational example.
             var dictionary = new Dictionary<char, string>();
             CreateDictionary(root, "", dictionary);
             return dictionary;
-
-            void CreateDictionary(Node node, string bitString, Dictionary<char, string> localDictionary)
-            {
-                if (node.IsLeaf)
-                    localDictionary.Add(node.Key[0], bitString);
-                else
-                {
-                    if (node.LeftChild != null)
-                        CreateDictionary(node.LeftChild, bitString + '0', localDictionary);
-                    if (node.RightChild != null)
-                        CreateDictionary(node.RightChild, bitString + '1', localDictionary);
-                }
-            }
         }
 
 
@@ -165,4 +166,4 @@ private string CreateBitString(string input, Dictionary<char, string> dictionary
             return bitString;
         }
     }
-}
+}
diff --git a/contents/huffman_encoding/huffman_encoding.html b/contents/huffman_encoding/huffman_encoding.html
diff --git a/contents/introduction/introduction.html b/contents/introduction/introduction.html
diff --git a/contents/jarvis_march/jarvis_march.html b/contents/jarvis_march/jarvis_march.html
diff --git a/contents/mathematical_background/mathematical_background.html b/contents/mathematical_background/mathematical_background.html
diff --git a/contents/matrix_methods/matrix_methods.html b/contents/matrix_methods/matrix_methods.html
diff --git a/contents/metropolis/metropolis.html b/contents/metropolis/metropolis.html
diff --git a/contents/monte_carlo_integration/monte_carlo_integration.html b/contents/monte_carlo_integration/monte_carlo_integration.html
diff --git a/contents/notation/notation.html b/contents/notation/notation.html
diff --git a/contents/physics_solvers/physics_solvers.html b/contents/physics_solvers/physics_solvers.html
diff --git a/contents/plotting/plotting.html b/contents/plotting/plotting.html
diff --git a/contents/probability_distributions/distributions.html b/contents/probability_distributions/distributions.html
diff --git a/contents/quantum_information/quantum_information.html b/contents/quantum_information/quantum_information.html
diff --git a/contents/quantum_systems/quantum_systems.html b/contents/quantum_systems/quantum_systems.html
diff --git a/contents/split-operator_method/split-operator_method.html b/contents/split-operator_method/split-operator_method.html
diff --git a/contents/stable_marriage_problem/stable_marriage_problem.html b/contents/stable_marriage_problem/stable_marriage_problem.html
diff --git a/contents/stacks_and_queues/stacks_and_queues.html b/contents/stacks_and_queues/stacks_and_queues.html
diff --git a/contents/taylor_series_expansion/taylor_series_expansion.html b/contents/taylor_series_expansion/taylor_series_expansion.html
diff --git a/contents/thomas_algorithm/thomas_algorithm.html b/contents/thomas_algorithm/thomas_algorithm.html
diff --git a/contents/tree_traversal/code/csharp/Tree.cs b/contents/tree_traversal/code/csharp/Tree.cs
@@ -30,56 +30,58 @@ private Tree(int id, int depthCount, int childrenCount)
             }
         }
 
+        private void DFSRecursive(Tree tree) {
+            Console.Write(tree.Id + " ");
+
+            foreach (var c in tree._children)
+                DFSRecursive(c);
+        }
+
         public void DFSRecursive()
         {
             DFSRecursive(this);
 
-            void DFSRecursive(Tree tree)
-            {
-                Console.Write(tree.Id + " ");
+        }
 
-                foreach (var c in tree._children)
-                    DFSRecursive(c);
-            }
+        private void DFSRecursivePostorder(Tree tree)
+        {
+            foreach (var c in tree._children)
+                DFSRecursivePostorder(c);
+
+            Console.Write(tree.Id + " ");
         }
 
         public void DFSRecursivePostorder()
         {
             DFSRecursivePostorder(this);
 
-            void DFSRecursivePostorder(Tree tree)
-            {
-                foreach (var c in tree._children)
-                    DFSRecursivePostorder(c);
+        }
 
-                Console.Write(tree.Id + " ");
+        private void DFSRecursiveInorderBinary(Tree tree)
+        {
+            switch (tree._children.Count)
+            {
+                case 2:
+                    DFSRecursiveInorderBinary(tree._children[0]);
+                    Console.Write(tree.Id + " ");
+                    DFSRecursiveInorderBinary(tree._children[1]);
+                    break;
+                case 1:
+                    DFSRecursiveInorderBinary(tree._children[0]);
+                    Console.Write(tree.Id + " ");
+                    break;
+                case 0:
+                    Console.Write(tree.Id + " ");
+                    break;
+                default:
+                    throw new Exception("Not binary tree!");
             }
         }
 
         public void DFSRecursiveInorderBinary()
         {
             DFSRecursiveInorderBinary(this);
 
-            void DFSRecursiveInorderBinary(Tree tree)
-            {
-                switch (tree._children.Count)
-                {
-                    case 2:
-                        DFSRecursiveInorderBinary(tree._children[0]);
-                        Console.Write(tree.Id + " ");
-                        DFSRecursiveInorderBinary(tree._children[1]);
-                        break;
-                    case 1:
-                        DFSRecursiveInorderBinary(tree._children[0]);
-                        Console.Write(tree.Id + " ");
-                        break;
-                    case 0:
-                        Console.Write(tree.Id + " ");
-                        break;
-                    default:
-                        throw new Exception("Not binary tree!");
-                }
-            }
         }
 
         public void DFSStack()