jimmyhu Jimmy-Hu

Jane Liao's Thesis

https://github.com/Jimmy-Hu/janeliao_thesis/compare/main...janeliao0105:main

Please notice that making sure the given git commit messages match the exact changes you modified.

In the commit 96f56405ddd8f466713339858d1f43670b251814, your commit message is Update gym_future. However, the things you actually done is adding files to dists folder.

Day 8: Dictionaries and Maps

Install Octave Software

%  Reference: https://blog.eldernode.com/install-gnu-octave-on-ubuntu-20-04/
sudo apt install -y octave
sudo apt-get install -y octave-parallel

Install Apache server

Test Part 2: Large Multi-dimensional Array Test

var largeArray = Array.CreateInstance(typeof(int), 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12);
MDArrayHelpers.Fill(largeArray, 1);

Predicate<int> isOne = delegate (int number) { return number == 1; };
Predicate<int> isFour = delegate (int number) { return number == 4; };

System.Diagnostics.Stopwatch sw = new System.Diagnostics.Stopwatch();

Update: Add test cases of large two dimensional array (int[*,*])

int size = 10000;
var largeArray = new int[size, size];
MDArrayHelpers.Fill(largeArray, 1);

Predicate<int> isOne = delegate (int number) { return number == 1; };
Predicate<int> isFour = delegate (int number) { return number == 4; };

N = 16

0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0

	// A Ones Function for Boost.MultiArray

	#include <algorithm>
	#include <array>
	#include <cassert>
	#include <chrono>
	#include <complex>
	#include <concepts>
	#include <deque>
	#include <exception>

	#include <algorithm>
	#include <array>
	#include <cassert>
	#include <chrono>
	#include <complex>
	#include <concepts>
	#include <deque>
	#include <exception>
	#include <functional>
	#include <iostream>

	#include <algorithm>
	#include <array>
	#include <cassert>
	#include <chrono>
	#include <complex>
	#include <concepts>
	#include <deque>
	#include <exception>
	#include <functional>
	#include <iostream>

	public class PlaneV2<T>
	{
	public int Width { get; } = 0;
	public int Height { get; } = 0;
	private T[,] Grid = null;
	public int Length => Width * Height;

	public PlaneV2() : this(1, 1) { }

	public PlaneV2(int width, int height)