Directory adjust & Format

Author: LeoAlex0

.clang-format

@@ -0,0 +1,22 @@
+BasedOnStyle: LLVM
+PointerAlignment: Right
+IndentWidth: 4
+MaxEmptyLinesToKeep: 1
+ObjCSpaceAfterProperty: true
+ObjCBlockIndentWidth: 4
+AllowShortFunctionsOnASingleLine: true
+AllowShortIfStatementsOnASingleLine: true
+AlignTrailingComments: true
+SpacesInSquareBrackets: true
+SpacesInParentheses : true
+AlignConsecutiveDeclarations: true
+AlignConsecutiveAssignments: true
+SpaceBeforeAssignmentOperators: true
+SpacesInContainerLiterals: true
+IndentWrappedFunctionNames: true
+KeepEmptyLinesAtTheStartOfBlocks: true
+BreakConstructorInitializersBeforeComma: true
+AllowAllParametersOfDeclarationOnNextLine: true
+SpaceAfterCStyleCast: true
+TabWidth: 4
+UseTab: Never

.gitignore

@@ -309,3 +309,6 @@ paket-files/
 # Python Tools for Visual Studio (PTVS)
 __pycache__/
 *.pyc
+
+# local build test
+*make

csharp/BfsTest/Algorithm.sln renamed to binding-examples/csharp/BfsTest/Algorithm.sln

@@ -0,0 +1 @@
+-Iinclude/

csharp/BfsTest/Algorithm/Algorithm.csproj renamed to binding-examples/csharp/BfsTest/Algorithm/Algorithm.csproj

@@ -1,137 +1,13 @@
-#pragma once
+//注意：本文件所有定义类型/函数以AM_做前缀
 
-#include <cmath>
-#include <cstdlib>
-#include <algorithm>
-#include <functional>
-#include <unordered_map>
-#include <list>
-#include <utility>
+#include "begin.h"
 
-#include "c_algorithm_module.h"
-
-#ifdef WIN32
-#define PUBLIC __declspec(dllexport) //dll输出函数，至于为什么要叫public.......
-#else
-#define PUBLIC
+#ifdef __cplusplus
+extern "C" {
 #endif
 
-namespace Algorithm {
-
-	/**不存在的编号,长度..*/
-	const int NIL = -1;
-
-	namespace Graph {
-
-		//适配器类型声明
-
-        /**
-         * @param idx_v:节点编号
-         * @return:节点idx_v相连的第一条边的编号,无边时返回NIL
-         */
-		typedef std::function<int(int idx_v)> FirstEdgeAdapter;
-
-        /**
-         * @param: idx_v:节点编号
-         * @param: idx_e:当前扫描到的边
-         * @return:返回下一条边的id,无边时返回NIL
-         */
-		typedef std::function<int(int idx_v, int idx_e)> NextEdgeAdapter;
-
-        /**
-         * @param: idx_v:节点编号
-         * @param: idx_e:当前扫描到的边
-         * @return:返回指向节点的id,无边时返回NIL
-         */
-		typedef std::function<int(int idx_v, int idx_e)> EdgeToAdapter;
-
-        /**
-         * @param idx_v:表示此边与v相连
-         * @param idx_e:表示此边编号
-         * @return:节点idx_v的编号为idx_e的边的长度
-         */
-		typedef std::function<double(int idx_v, int idx_e)> EdgeLengthAdapter;
-
-        /**
-         * @param idx_v:表示节点idx_v
-         * @param idx_e:表示与idx_v相连的编号为idx_e的边
-         * @return:节点idx_v的编号为idx_e的边的容量
-         */
-		typedef std::function <double(int idx_v, int idx_e)> EdgeContainAdapter;
+#include "graph.h"
 
-		/**
-		 * 如果无路径，则点的序列为空
-		 * @param first:表示点的序列
-		 * @param second:表示边的序列
-		 */
-		typedef std::pair<std::list<int>, std::list<int>> PathType;
-
-        /**空路径*/
-		const static PathType NIL_PATH = std::make_pair(std::list<int>(), std::list<int>());
-
-		struct GraphAdapter {
-			FirstEdgeAdapter firstOf;
-			NextEdgeAdapter nextOf;
-			EdgeToAdapter destOf;
-			EdgeLengthAdapter lengthOf;
-			EdgeContainAdapter containOf;
-		};
-
-        /**
-         * @param idx_start_v:最初的节点编号
-         * @param idx_dest_v:目标节点编号
-         * @param firstOf,nextOf,edgeTo:图的属性
-         * @return: 返回所走的路径
-         */
-		PUBLIC PathType
-			bfs(
-				int idx_start_v, int idx_dest_v,
-				const FirstEdgeAdapter & firstOf, const NextEdgeAdapter & nextOf,
-				const EdgeToAdapter & destOf);
-
-        /**
-         * 使用bfs算法求最少步骤的路径
-         * @param idx_start_v:最初的节点编号
-         * @param idx_dest_v:目标节点编号
-         * @param graph:图的属性
-         * @return: 返回所走的路径
-         */
-		inline PathType
-			bfs(
-				int idx_start_v, int idx_dest_v,
-				const GraphAdapter& graph) {
-			return bfs(idx_start_v, idx_dest_v,
-				graph.firstOf, graph.nextOf, graph.destOf);
-		}
-
-		/**
-		 * @param idx_start_v:最初的节点编号
-		 * @param idx_dest_v:目标节点编号
-		 * @param firstOf,nextOf,edgeTo:图的属性
-		 * @return: 返回所需的步数
-		 */
-		inline int
-			bfsStep(
-				int idx_start_v, int idx_dest_v,
-				const FirstEdgeAdapter & firstOf, const NextEdgeAdapter & nextOf,
-				const EdgeToAdapter & destOf) {
-
-			PathType tmp = bfs(idx_start_v, idx_dest_v, firstOf, nextOf, destOf);
-			return tmp.first.size() - 1;
-		};
-
-        /**
-         * @param idx_start_v:最初的节点编号
-         * @param idx_dest_v:目标节点编号
-         * @param graph:图的属性
-         * @return: 返回所需的步数
-         */
-		inline int
-			bfsStep(
-				int idx_start_v, int idx_dest_v,
-				const GraphAdapter & graph) {
-			return bfsStep(idx_start_v, idx_dest_v,
-				graph.firstOf, graph.nextOf, graph.destOf);
-		}
-	}
+#ifdef __cplusplus
 }
+#endif

csharp/BfsTest/Algorithm/Graph/Bfs.cs renamed to binding-examples/csharp/BfsTest/Algorithm/Graph/Bfs.cs

@@ -0,0 +1,19 @@
+#pragma once
+
+#include "algorithm_module.h"
+
+#ifdef WIN32
+#define PUBLIC                                                                 \
+    __declspec( dllexport ) // dll输出函数，至于为什么要叫public.......
+#else
+#define PUBLIC
+#endif
+
+#include "graph.hpp"
+
+namespace Algorithm {
+
+/**不存在的编号,长度..*/
+constexpr int NIL = -1;
+
+} // namespace Algorithm

csharp/BfsTest/Algorithm/Properties/AssemblyInfo.cs renamed to binding-examples/csharp/BfsTest/Algorithm/Properties/AssemblyInfo.cs

@@ -0,0 +1,9 @@
+#pragma once
+#include <stdlib.h>
+
+#ifdef WIN32
+#define PUBLIC __declspec( dllexport )
+#else
+#define PUBLIC
+#endif
+