Skip to content

Commit 7fe5bfe

Browse files
ShadowMitialeios
ShadowMitia
and
leios
authored
Standardise code directory names (#920)
* Rename c++ directories to cpp * Rename golang folders to go * Change paths to code in chapter files Co-authored-by: James Schloss <[email protected]>
1 parent a3825b2 commit 7fe5bfe

File tree

42 files changed

+61
-61
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

42 files changed

+61
-61
lines changed

‎contents/IFS/IFS.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -135,7 +135,7 @@ Here, instead of tracking children of children, we track a single individual tha
135135
{% sample lang="hs" %}
136136
[import:7-13, lang:"haskell"](code/haskell/IFS.hs)
137137
{% sample lang="cpp" %}
138-
[import:39-52, lang:"cpp"](code/c++/IFS.cpp)
138+
[import:39-52, lang:"cpp"](code/cpp/IFS.cpp)
139139
{% sample lang="py" %}
140140
[import:5-12, lang:"python"](code/python/IFS.py)
141141
{% sample lang="c" %}
@@ -221,7 +221,7 @@ In addition, we have written the chaos game code to take in a set of points so t
221221
{% sample lang="hs" %}
222222
[import, lang:"haskell"](code/haskell/IFS.hs)
223223
{% sample lang="cpp" %}
224-
[import, lang:"cpp"](code/c++/IFS.cpp)
224+
[import, lang:"cpp"](code/cpp/IFS.cpp)
225225
{% sample lang="py" %}
226226
[import, lang:"python"](code/python/IFS.py)
227227
{% sample lang="c" %}

‎contents/IFS/code/c++/IFS.cpp ‎contents/IFS/code/cpp/IFS.cpp

File renamed without changes.

‎contents/approximate_counting/approximate_counting.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -363,7 +363,7 @@ As we do not have any objects to count, we will instead simulate the counting wi
363363
{% sample lang="c" %}
364364
[import, lang:"c"](code/c/approximate_counting.c)
365365
{% sample lang="cpp" %}
366-
[import, lang:"cpp"](code/c++/approximate_counting.cpp)
366+
[import, lang:"cpp"](code/cpp/approximate_counting.cpp)
367367
{% sample lang="python" %}
368368
[import, lang:"python"](code/python/approximate_counting.py)
369369
{% endmethod %}

‎contents/approximate_counting/code/c++/approximate_counting.cpp ‎contents/approximate_counting/code/cpp/approximate_counting.cpp

File renamed without changes.

‎contents/barnsley/barnsley.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -128,7 +128,7 @@ The biggest differences between the two code implementations is that the Barnsle
128128
{% sample lang="rs" %}
129129
[import, lang:"rust"](code/rust/src/main.rs)
130130
{% sample lang="cpp" %}
131-
[import, lang:"cpp"](code/c++/barnsley.cpp)
131+
[import, lang:"cpp"](code/cpp/barnsley.cpp)
132132
{% sample lang="c" %}
133133
[import, lang:"c"](code/c/barnsley.c)
134134
{% sample lang="java" %}

‎contents/barnsley/code/c++/barnsley.cpp ‎contents/barnsley/code/cpp/barnsley.cpp

File renamed without changes.

‎contents/computus/code/c++/gauss_easter.cpp ‎contents/computus/code/cpp/gauss_easter.cpp

File renamed without changes.

‎contents/computus/computus.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -315,7 +315,7 @@ For now, we have the code outputting a tuple of $$d$$ and $$e$$, so users can us
315315
{% sample lang="c" %}
316316
[import, lang:"c"](code/c/gauss_easter.c)
317317
{% sample lang="cpp" %}
318-
[import, lang:"cpp"](code/c++/gauss_easter.cpp)
318+
[import, lang:"cpp"](code/cpp/gauss_easter.cpp)
319319
{% sample lang="lisp" %}
320320
[import, lang:"lisp"](code/clisp/gauss-easter.lisp)
321321
{% sample lang="nim" %}

‎contents/cooley_tukey/code/c++/fft.cpp ‎contents/cooley_tukey/code/cpp/fft.cpp

File renamed without changes.

‎contents/cooley_tukey/cooley_tukey.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -76,7 +76,7 @@ For some reason, though, putting code to this transformation really helped me fi
7676
{% sample lang="clj" %}
7777
[import:15-30, lang:"clojure"](code/clojure/fft.clj)
7878
{% sample lang="cpp" %}
79-
[import:23-33, lang:"cpp"](code/c++/fft.cpp)
79+
[import:23-33, lang:"cpp"](code/cpp/fft.cpp)
8080
{% sample lang="hs" %}
8181
[import:7-13, lang:"haskell"](code/haskell/fft.hs)
8282
{% sample lang="py" %}
@@ -129,7 +129,7 @@ In the end, the code looks like:
129129
{% sample lang="clj" %}
130130
[import:31-58, lang:"clojure"](code/clojure/fft.clj)
131131
{% sample lang="cpp" %}
132-
[import:36-66, lang:"cpp"](code/c++/fft.cpp)
132+
[import:36-66, lang:"cpp"](code/cpp/fft.cpp)
133133
{% sample lang="hs" %}
134134
[import:15-28, lang:"haskell"](code/haskell/fft.hs)
135135
{% sample lang="py" %}
@@ -242,7 +242,7 @@ Note: I implemented this in Julia because the code seems more straightforward in
242242
{% sample lang="clj" %}
243243
[import, lang:"clojure"](code/clojure/fft.clj)
244244
{% sample lang="cpp" %}
245-
[import, lang:"cpp"](code/c++/fft.cpp)
245+
[import, lang:"cpp"](code/cpp/fft.cpp)
246246
{% sample lang="hs" %}
247247
[import, lang:"haskell"](code/haskell/fft.hs)
248248
{% sample lang="py" %}

‎contents/euclidean_algorithm/code/c++/euclidean.cpp ‎contents/euclidean_algorithm/code/cpp/euclidean.cpp

File renamed without changes.

‎contents/euclidean_algorithm/euclidean_algorithm.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,7 @@ The algorithm is a simple way to find the *greatest common divisor* (GCD) of two
1414
{% sample lang="clj" %}
1515
[import:2-8, lang="clojure"](code/clojure/euclidean_example.clj)
1616
{% sample lang="cpp" %}
17-
[import:18-31, lang="c_cpp"](code/c++/euclidean.cpp)
17+
[import:18-31, lang="c_cpp"](code/cpp/euclidean.cpp)
1818
{% sample lang="java" %}
1919
[import:3-16, lang="java"](code/java/EuclideanAlgo.java)
2020
{% sample lang="kotlin" %}
@@ -104,7 +104,7 @@ Modern implementations, though, often use the modulus operator (%) like so
104104
{% sample lang="clj" %}
105105
[import:9-13, lang="clojure"](code/clojure/euclidean_example.clj)
106106
{% sample lang="cpp" %}
107-
[import:5-15, lang="c_cpp"](code/c++/euclidean.cpp)
107+
[import:5-15, lang="c_cpp"](code/cpp/euclidean.cpp)
108108
{% sample lang="java" %}
109109
[import:18-26, lang="java"](code/java/EuclideanAlgo.java)
110110
{% sample lang="kotlin" %}
@@ -207,7 +207,7 @@ Here's a video on the Euclidean algorithm:
207207
{% sample lang="clj" %}
208208
[import, lang="clojure"](code/clojure/euclidean_example.clj)
209209
{% sample lang="cpp" %}
210-
[import, lang="c_cpp"](code/c++/euclidean.cpp)
210+
[import, lang="c_cpp"](code/cpp/euclidean.cpp)
211211
{% sample lang="java" %}
212212
[import, lang="java"](code/java/EuclideanAlgo.java)
213213
{% sample lang="kotlin" %}

‎contents/forward_euler_method/code/c++/euler.cpp ‎contents/forward_euler_method/code/cpp/euler.cpp

File renamed without changes.

‎contents/forward_euler_method/code/golang/euler.go ‎contents/forward_euler_method/code/go/euler.go

File renamed without changes.

‎contents/forward_euler_method/forward_euler_method.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -112,7 +112,7 @@ Note that in this case, the velocity is directly given by the ODE and the accele
112112
{% sample lang="c" %}
113113
[import, lang:"c"](code/c/euler.c)
114114
{% sample lang="cpp" %}
115-
[import, lang:"cpp"](code/c++/euler.cpp)
115+
[import, lang:"cpp"](code/cpp/euler.cpp)
116116
{% sample lang="rs" %}
117117
[import, lang:"rust"](code/rust/euler.rs)
118118
{% sample lang="elm" %}
@@ -135,7 +135,7 @@ Full code for the visualization follows:
135135
{% sample lang="f90" %}
136136
[import, lang:"fortran"](code/fortran/euler.f90)
137137
{% sample lang="go" %}
138-
[import, lang:"go"](code/golang/euler.go)
138+
[import, lang:"go"](code/go/euler.go)
139139
{% sample lang="v" %}
140140
[import, lang:"v"](code/v/euler.v)
141141
{% sample lang="asm-x64" %}

‎contents/gaussian_elimination/code/c++/gaussian_elimination.cpp ‎contents/gaussian_elimination/code/cpp/gaussian_elimination.cpp

File renamed without changes.

‎contents/gaussian_elimination/gaussian_elimination.md

+6-6
Original file line numberDiff line numberDiff line change
@@ -315,7 +315,7 @@ In code, this process might look like this:
315315
[import:5-13, lang:"c"](code/c/gaussian_elimination.c)
316316
[import:19-34, lang:"c"](code/c/gaussian_elimination.c)
317317
{% sample lang="cpp" %}
318-
[import:13-23, lang:"cpp"](code/c++/gaussian_elimination.cpp)
318+
[import:13-23, lang:"cpp"](code/cpp/gaussian_elimination.cpp)
319319
{% sample lang="hs" %}
320320
[import:10-17, lang:"haskell"](code/haskell/gaussianElimination.hs)
321321
[import:44-46, lang:"haskell"](code/haskell/gaussianElimination.hs)
@@ -389,7 +389,7 @@ Here is what it might look like in code:
389389
{% sample lang="c" %}
390390
[import:36-41, lang:"c"](code/c/gaussian_elimination.c)
391391
{% sample lang="cpp" %}
392-
[import:25-32, lang:"cpp"](code/c++/gaussian_elimination.cpp)
392+
[import:25-32, lang:"cpp"](code/cpp/gaussian_elimination.cpp)
393393
{% sample lang="hs" %}
394394
[import:19-33, lang:"haskell"](code/haskell/gaussianElimination.hs)
395395
[import:42-42, lang:"haskell"](code/haskell/gaussianElimination.hs)
@@ -412,7 +412,7 @@ When we put everything together, it looks like this:
412412
{% sample lang="c" %}
413413
[import:15-48, lang:"c"](code/c/gaussian_elimination.c)
414414
{% sample lang="cpp" %}
415-
[import:8-34, lang:"cpp"](code/c++/gaussian_elimination.cpp)
415+
[import:8-34, lang:"cpp"](code/cpp/gaussian_elimination.cpp)
416416
{% sample lang="hs" %}
417417
[import:10-36, lang:"haskell"](code/haskell/gaussianElimination.hs)
418418
{% sample lang="py" %}
@@ -453,7 +453,7 @@ Here it is in code:
453453
{% sample lang="c" %}
454454
[import:64-82, lang:"c"](code/c/gaussian_elimination.c)
455455
{% sample lang="cpp" %}
456-
[import:36-54, lang:"cpp"](code/c++/gaussian_elimination.cpp)
456+
[import:36-54, lang:"cpp"](code/cpp/gaussian_elimination.cpp)
457457
{% sample lang="hs" %}
458458
[import:38-46, lang:"haskell"](code/haskell/gaussianElimination.hs)
459459
{% sample lang="py" %}
@@ -497,7 +497,7 @@ In code, it looks like this:
497497
{% sample lang="c" %}
498498
[import:50-62, lang:"c"](code/c/gaussian_elimination.c)
499499
{% sample lang="cpp" %}
500-
[import:56-72, lang:"cpp"](code/c++/gaussian_elimination.cpp)
500+
[import:56-72, lang:"cpp"](code/cpp/gaussian_elimination.cpp)
501501
{% sample lang="rs" %}
502502
[import:98-112, lang:"rust"](code/rust/gaussian_elimination.rs)
503503
{% sample lang="hs" %}
@@ -567,7 +567,7 @@ Here's a video describing Gaussian elimination:
567567
{% sample lang="c" %}
568568
[import, lang:"c"](code/c/gaussian_elimination.c)
569569
{% sample lang="cpp" %}
570-
[import, lang:"cpp"](code/c++/gaussian_elimination.cpp)
570+
[import, lang:"cpp"](code/cpp/gaussian_elimination.cpp)
571571
{% sample lang="rs" %}
572572
[import, lang:"rust"](code/rust/gaussian_elimination.rs)
573573
{% sample lang="hs" %}

‎contents/graham_scan/code/c++/graham_scan.cpp ‎contents/graham_scan/code/cpp/graham_scan.cpp

File renamed without changes.

‎contents/graham_scan/code/golang/graham.go ‎contents/graham_scan/code/go/graham.go

File renamed without changes.

‎contents/graham_scan/graham_scan.md

+6-6
Original file line numberDiff line numberDiff line change
@@ -23,13 +23,13 @@ We can find whether a rotation is counter-clockwise with trigonometric functions
2323
{% sample lang="py" %}
2424
[import:4-6, lang:"python"](code/python/graham_scan.py)
2525
{% sample lang="go" %}
26-
[import:13-15, lang:"go"](code/golang/graham.go)
26+
[import:13-15, lang:"go"](code/go/graham.go)
2727
{% sample lang="java" %}
2828
[import:27-29, lang:"java"](code/java/GrahamScan.java)
2929
{% sample lang="lisp" %}
3030
[import:5-13, lang:"lisp"](code/clisp/graham-scan.lisp)
3131
{% sample lang="cpp" %}
32-
[import:18-20, lang="cpp"](code/c++/graham_scan.cpp)
32+
[import:18-20, lang="cpp"](code/cpp/graham_scan.cpp)
3333
{% sample lang="coco" %}
3434
[import:4-8, lang="coconut"](code/coconut/graham_scan.coco)
3535
{% endmethod %}
@@ -57,13 +57,13 @@ In the end, the code should look something like this:
5757
{% sample lang="py" %}
5858
[import:14-28, lang:"python"](code/python/graham_scan.py)
5959
{% sample lang="go" %}
60-
[import:21-42, lang:"go"](code/golang/graham.go)
60+
[import:21-42, lang:"go"](code/go/graham.go)
6161
{% sample lang="java" %}
6262
[import:35-70, lang:"java"](code/java/GrahamScan.java)
6363
{% sample lang="lisp" %}
6464
[import:15-58, lang:"lisp"](code/clisp/graham-scan.lisp)
6565
{% sample lang="cpp" %}
66-
[import:26-62, lang="cpp"](code/c++/graham_scan.cpp)
66+
[import:26-62, lang="cpp"](code/cpp/graham_scan.cpp)
6767
{% sample lang="coco" %}
6868
[import:17-30, lang="coconut"](code/coconut/graham_scan.coco)
6969
{% endmethod %}
@@ -86,13 +86,13 @@ In the end, the code should look something like this:
8686
{% sample lang="py" %}
8787
[import, lang:"python"](code/python/graham_scan.py)
8888
{% sample lang="go" %}
89-
[import, lang:"go"](code/golang/graham.go)
89+
[import, lang:"go"](code/go/graham.go)
9090
{% sample lang="java" %}
9191
[import, lang:"java"](code/java/GrahamScan.java)
9292
{% sample lang="lisp" %}
9393
[import, lang:"lisp"](code/clisp/graham-scan.lisp)
9494
{% sample lang="cpp" %}
95-
[import, lang="cpp"](code/c++/graham_scan.cpp)
95+
[import, lang="cpp"](code/cpp/graham_scan.cpp)
9696
{%sample lang="coco" %}
9797
[import, lang="coconut"](code/coconut/graham_scan.coco)
9898
{% endmethod %}

‎contents/huffman_encoding/code/c++/huffman.cpp ‎contents/huffman_encoding/code/cpp/huffman.cpp

File renamed without changes.

‎contents/huffman_encoding/code/golang/huffman.go ‎contents/huffman_encoding/code/go/huffman.go

File renamed without changes.

‎contents/huffman_encoding/huffman_encoding.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -78,7 +78,7 @@ Whether you use a stack or straight-up recursion also depends on the language, b
7878
{% sample lang="lua" %}
7979
[import, lang="lua"](code/lua/huffman.lua)
8080
{% sample lang="cpp" %}
81-
[import, lang:"cpp"](code/c++/huffman.cpp)
81+
[import, lang:"cpp"](code/cpp/huffman.cpp)
8282
{% sample lang="clj" %}
8383
[import, lang:"clojure"](code/clojure/huffman.clj)
8484
{% sample lang="py" %}
@@ -88,7 +88,7 @@ Whether you use a stack or straight-up recursion also depends on the language, b
8888
{% sample lang="java" %}
8989
[import, lang:"java"](code/java/huffman.java)
9090
{% sample lang="go" %}
91-
[import, lang:"go"](code/golang/huffman.go)
91+
[import, lang:"go"](code/go/huffman.go)
9292
{% sample lang="asm-x64" %}
9393
[import, lang:"asm-x64"](code/asm-x64/huffman.s)
9494
{% sample lang="scala" %}

‎contents/jarvis_march/code/c++/jarvis_march.cpp ‎contents/jarvis_march/code/cpp/jarvis_march.cpp

File renamed without changes.

‎contents/jarvis_march/code/golang/jarvis.go ‎contents/jarvis_march/code/go/jarvis.go

File renamed without changes.

‎contents/jarvis_march/jarvis_march.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -39,13 +39,13 @@ Since this algorithm, there have been many other algorithms that have advanced t
3939
{% sample lang="py" %}
4040
[import, lang:"python"](code/python/jarvis_march.py)
4141
{% sample lang="cpp" %}
42-
[import, lang:"cpp"](code/c++/jarvis_march.cpp)
42+
[import, lang:"cpp"](code/cpp/jarvis_march.cpp)
4343
{% sample lang="lisp" %}
4444
[import, lang:"lisp"](code/clisp/jarvis-march.lisp)
4545
{% sample lang="java" %}
4646
[import, lang:"java"](code/java/JarvisMarch.java)
4747
{% sample lang="go" %}
48-
[import, lang:"go"](code/golang/jarvis.go)
48+
[import, lang:"go"](code/go/jarvis.go)
4949
{% sample lang="v" %}
5050
[import, lang:"v"](code/v/jarvis.v)
5151
{% sample lang="rust" %}

‎contents/monte_carlo_integration/code/c++/monte_carlo.cpp ‎contents/monte_carlo_integration/code/cpp/monte_carlo.cpp

File renamed without changes.

‎contents/monte_carlo_integration/monte_carlo_integration.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -44,7 +44,7 @@ each point is tested to see whether it's in the circle or not:
4444
{% sample lang="c" %}
4545
[import:7-9, lang:"c"](code/c/monte_carlo.c)
4646
{% sample lang="cpp" %}
47-
[import:7-16, lang:"cpp"](code/c++/monte_carlo.cpp)
47+
[import:7-16, lang:"cpp"](code/cpp/monte_carlo.cpp)
4848
{% sample lang="js" %}
4949
[import:2-6, lang:"javascript"](code/javascript/monte_carlo.js)
5050
{% sample lang="hs" %}
@@ -147,7 +147,7 @@ Feel free to submit your version via pull request, and thanks for reading!
147147
{% sample lang="c" %}
148148
[import, lang:"c"](code/c/monte_carlo.c)
149149
{% sample lang="cpp" %}
150-
[import, lang:"cpp"](code/c++/monte_carlo.cpp)
150+
[import, lang:"cpp"](code/cpp/monte_carlo.cpp)
151151
{% sample lang="js" %}
152152
[import, lang:"javascript"](code/javascript/monte_carlo.js)
153153
{% sample lang="hs" %}

‎contents/quantum_systems/quantum_systems.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -232,7 +232,7 @@ This ultimately looks like this:
232232
{% sample lang="c" %}
233233
[import:150-184, lang:"c"](../split-operator_method/code/c/split_op.c)
234234
{% sample lang="cpp" %}
235-
[import:158-189, lang:"cpp"](../split-operator_method/code/c++/split_op.cpp)
235+
[import:158-189, lang:"cpp"](../split-operator_method/code/cpp/split_op.cpp)
236236
{% sample lang="py" %}
237237
[import:98-112, lang:"python"](../split-operator_method/code/python/split_op.py)
238238
{% endmethod %}

‎contents/split-operator_method/code/c++/split_op.cpp ‎contents/split-operator_method/code/cpp/split_op.cpp

File renamed without changes.

‎contents/split-operator_method/split-operator_method.md

+4-4
Original file line numberDiff line numberDiff line change
@@ -103,7 +103,7 @@ Regardless, we first need to set all the initial parameters, including the initi
103103
[import:11-21, lang:"c"](code/c/split_op.c)
104104
[import:52-73, lang:"c"](code/c/split_op.c)
105105
{% sample lang="cpp" %}
106-
[import:14-49, lang:"cpp"](code/c++/split_op.cpp)
106+
[import:14-49, lang:"cpp"](code/cpp/split_op.cpp)
107107
{% sample lang="py" %}
108108
[import:11-30, lang:"python"](code/python/split_op.py)
109109
{% sample lang="hs" %}
@@ -126,7 +126,7 @@ Afterwards, we turn them into operators:
126126
[import:23-29, lang:"c"](code/c/split_op.c)
127127
[import:75-96, lang:"c"](code/c/split_op.c)
128128
{% sample lang="cpp" %}
129-
[import:51-80, lang:"cpp"](code/c++/split_op.cpp)
129+
[import:51-80, lang:"cpp"](code/cpp/split_op.cpp)
130130
{% sample lang="py" %}
131131
[import:33-54, lang:"python"](code/python/split_op.py)
132132
{% sample lang="hs" %}
@@ -149,7 +149,7 @@ The final step is to do the iteration, itself.
149149
{% sample lang="c" %}
150150
[import:98-148, lang:"c"](code/c/split_op.c)
151151
{% sample lang="cpp" %}
152-
[import:99-156, lang:"cpp"](code/c++/split_op.cpp)
152+
[import:99-156, lang:"cpp"](code/cpp/split_op.cpp)
153153
{% sample lang="py" %}
154154
[import:57-95, lang:"python"](code/python/split_op.py)
155155
{% sample lang="hs" %}
@@ -186,7 +186,7 @@ Checking to make sure your code can output the correct energy for a harmonic tra
186186
{% sample lang="c" %}
187187
[import, lang:"c"](code/c/split_op.c)
188188
{% sample lang="cpp" %}
189-
[import, lang:"cpp"](code/c++/split_op.cpp)
189+
[import, lang:"cpp"](code/cpp/split_op.cpp)
190190
{% sample lang="py" %}
191191
[import:5-127, lang:"python"](code/python/split_op.py)
192192
{% sample lang="hs" %}

‎contents/stable_marriage_problem/code/c++/stable_marriage.cpp ‎contents/stable_marriage_problem/code/cpp/stable_marriage.cpp

File renamed without changes.

‎contents/stable_marriage_problem/stable_marriage_problem.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -40,7 +40,7 @@ Here is a video describing the stable marriage problem:
4040
{% sample lang="c" %}
4141
[import, lang:"c"](code/c/stable_marriage.c)
4242
{% sample lang="cpp" %}
43-
[import, lang:"cpp"](code/c++/stable_marriage.cpp)
43+
[import, lang:"cpp"](code/cpp/stable_marriage.cpp)
4444
{% sample lang="js" %}
4545
[import, lang:"javascript"](code/javascript/stable-marriage.js)
4646
{% sample lang="cs" %}

‎contents/thomas_algorithm/code/c++/thomas.cpp ‎contents/thomas_algorithm/code/cpp/thomas.cpp

File renamed without changes.

‎contents/thomas_algorithm/code/golang/thomas.go ‎contents/thomas_algorithm/code/go/thomas.go

File renamed without changes.

‎contents/thomas_algorithm/thomas_algorithm.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -112,7 +112,7 @@ You will find this algorithm implemented [in this project](https://scratch.mit.e
112112
{% sample lang="hs" %}
113113
[import, lang:"haskell"](code/haskell/thomas.hs)
114114
{% sample lang="go" %}
115-
[import, lang:"go"](code/golang/thomas.go)
115+
[import, lang:"go"](code/go/thomas.go)
116116
{% sample lang="v" %}
117117
[import, lang:"v"](code/v/thomas.v)
118118
{% sample lang="swift" %}
@@ -122,7 +122,7 @@ You will find this algorithm implemented [in this project](https://scratch.mit.e
122122
{% sample lang="nim" %}
123123
[import, lang:"nim"](code/nim/thomas_algorithm.nim)
124124
{% sample lang="cpp" %}
125-
[import, lang:"cpp"](code/c++/thomas.cpp)
125+
[import, lang:"cpp"](code/cpp/thomas.cpp)
126126
{% sample lang="lua" %}
127127
[import, lang:"lua"](code/lua/thomas.lua)
128128
{% sample lang="crystal" %}

‎contents/tree_traversal/code/c++/tree_example.cpp ‎contents/tree_traversal/code/cpp/tree_example.cpp

File renamed without changes.

‎contents/tree_traversal/code/golang/treetraversal.go ‎contents/tree_traversal/code/go/treetraversal.go

File renamed without changes.

0 commit comments

Comments
 (0)